Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "# LUOGU_RID: 116460278\na,b,c,d,e = map(int,input().split())\r\na,b,c,d,e = (5*a+0.5)%60,(b+0.5)%60,(c+0.5)%60,5*d,5*e\r\nf,g = min(d,e),max(d,e)\r\nif (f<a<g or f<b<g or f<c<g) and ((0<a<f or g<a<60) or (0<b<f or g<b<60) or (0<c<f or g<c<60)):\r\n print('NO')\r\nelse:\r\n print('YES')", "h,m,s,t1,t2 = map(int,input().split())\nh %= 12\narr = []\narr.append(h*30 + m/2 + s/120)\narr.append(6*m + s/10)\narr.append(6*s)\narr.sort()\narr = arr + [(360 + arr[0])]\n\nt1 *= 30\nt2 *= 30\n\nx1 = -1\nx2 = -1\nfor i in range(3):\n\tif((arr[i] <= t1 and t1 <= arr[i+1]) or (arr[i] <= t1+360 and t1+360 <= arr[i+1])):\n\t\tx1 = i\n\tif((arr[i] <= t2 and t2 <= arr[i+1]) or (arr[i] <= t2+360 and t2+360 <= arr[i+1])):\n\t\tx2 = i\n\nprint('YES' if x1==x2 else 'NO')\n", "h, m, s, t1, t2 = map(int, input().split())\r\n\r\na = [(h * 30 + m / 2 + s / 120) % 360, (m * 6 + s / 10) % 360, s * 6, t1 * 30, t2 * 30]\r\n\r\ntime = sorted(a[:3])\r\nT = sorted(a[3:])\r\nprint('YES') if T[1] < time[0] or time[0] < T[0] < T[1] < time[1] or time[1] < T[0] < T[1] < time[2] \\\r\n or time[2] < T[0] or (T[0] < time[0] and T[1] > time[2]) else print('NO')\r\n", "def inside(a, b, c):\r\n return a > b and a < c\r\ndef outside(a, b, c):\r\n return a < b or a > c\r\nh, m, s, t1, t2 = list(map(int, input().split()))\r\na = h + m/60 + s/3600\r\nb = (m + s/60)/5\r\nc = s/5\r\nd = min(t1, t2); e = max(t1, t2)\r\nf1 = inside(a,d,e) and inside(b,d,e) and inside(c,d,e)\r\nf2 = outside(a,d,e) and outside(b,d,e) and outside(c,d,e)\r\nif f1 or f2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "h,m,s,t1,t2 = map(int,input().split())\r\nm += s/60\r\nh += m/60\r\nm/= 5\r\ns/=5\r\nh = h%12\r\nm = m%12\r\ns = s%12\r\nT1 = min(t1,t2)\r\nT2 = max(t1,t2)\r\nif(T1<h<T2 and T1<m<T2 and T1<s<T2):\r\n print(\"YES\")\r\nelif(not(T1<h<T2 or T1<m<T2 or T1<s<T2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "h, m, s, t1, t2 = map(int, input().split())\r\n\r\nh *= 5\r\nt1 *= 5\r\nt2 *= 5\r\n\r\nif h < t1:\r\n h += 60\r\nif m < t1:\r\n m += 60\r\nif s < t1:\r\n s += 60\r\nif t2 < t1:\r\n t2 += 60\r\nv = 0\r\nif t2 <= h:\r\n v += 1\r\nif t2 <= m:\r\n v += 1\r\nif t2 <= s:\r\n v += 1\r\nif v == 0 or v == 3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\nfrom collections import Counter\r\nfor _ in range(1):\r\n h,m,s,t1,t2 = na()\r\n if h == 12:\r\n h = 0\r\n if t1 == 12:\r\n t1 = 0\r\n if t2 == 12:\r\n t2 = 0\r\n H = 3600*h+60*m+s\r\n M = 12*60*m+12*s\r\n S = 12*60*s\r\n m = 12*3600\r\n z = [H,M,S,H+m,M+m,S+m]\r\n t1 *= 3600\r\n t2 *= 3600\r\n\r\n if t1 > t2:\r\n t2,t1 = t1,t2\r\n f = 1\r\n for i in z:\r\n if (t1-i)*(t2-i)<0:\r\n f = 0\r\n break\r\n g = 1\r\n for i in z:\r\n if (t1+m-i)*(t2-i)<0:\r\n g = 0\r\n break\r\n if f|g:\r\n YES()\r\n else:\r\n NO()\r\n", "[h,m,s,t1,t2] = [int(x) for x in input().split()]\r\nhh = h + m/60 + s/3600 \r\nmm = m/5\r\nss = s/5\r\n\r\nll = [hh,mm,ss,t1,t2]\r\nll = sorted(ll)\r\n\r\ndiff = abs(ll.index(t1)-ll.index(t2))\r\nif diff==1 or diff==4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "H, M, S, T1, T2 = map(int, input().split())\n\nh = (H % 12) * 30 + (M % 60) * 0.5 + (S%60) * (1/120)\nm = (M % 60) * 6 + (S % 60) * 0.1\ns = (S % 60) * 6 \nt1 = (T1 % 12) * 30\nt2 = (T2 % 12) * 30\n\nh,m,s = sorted([h,m,s])\nflag = False\n\nif h < t1 < m and h < t2 < m:\n flag = True\nelif m < t1 < s and m < t2 < s:\n flag = True\nelif (s < t1 <= 360 or 0 <= t1 < h) and (s < t2 <= 360 or 0 <= t2 < h):\n flag = True\n\nif flag:\n print('YES')\nelse:\n print('NO')\n \n", "h, m, s, t1, t2 = list(map(int, input().split()))\r\nm += s/60\r\nh %= 12\r\nh += m/60\r\n\r\nt1, t2 = min(t1, t2), max(t1, t2)\r\n\r\nif (t1 < s/5 < t2 and t1 < m/5 < t2 and t1 < h < t2) or \\\r\n (not t1 < s/5 < t2 and not t1 < m/5 < t2 and not t1 < h < t2):\r\n print('YES')\r\nelse:\r\n print('NO')", "def isBet(a, b, c):\r\n if (c>a and c<b):\r\n return True\r\n return False\r\nlst = input().split()\r\nh = float(int(lst[0]))\r\nm = (float(lst[1]))/5\r\ns = (float(lst[2]))/5\r\na = int(lst[3])\r\nb = int(lst[4])\r\nif (a>b):\r\n a, b = b, a\r\nm+=s/720\r\nh+=m/12\r\n#print(\"Output:\")\r\n#print(h, m, s, a, b, sep=\"\\n\")\r\ncount=0\r\nif (isBet(a, b, h)):\r\n count+=1\r\nif (isBet(a, b, m)):\r\n count+=1\r\nif (isBet(a, b, s)):\r\n count+=1\r\nif (count==0 or count==3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c,s,t = map(int,input().split())\nif a == 12:\n a = 0\nif s == 12:\n s = 0\nif t== 12:\n t = 0\na += b/120 + c/120\nb += c/60\nb /= 5\nc /= 5\nf = [a,b,c]\nf.sort()\nif f[0] < s and s < f[1]:\n x = 1\nelif f[1] < s and s < f[2]:\n x = 2\nelse:\n x = 3\nif f[0] < t and t < f[1]:\n y = 1\nelif f[1] < t and t < f[2]:\n y = 2\nelse:\n y = 3\nif x == y:\n print('YES')\nelse:\n print('NO')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nh, m, s, t1, t2 = map(int, input().split())\r\nx = h + 0.5\r\ny = m // 5 + 0.5\r\nz = s / 5\r\nif x > 12:\r\n x -= 12\r\nif y > 12:\r\n y -= 12\r\nif z > 12:\r\n z -= 12\r\nif t1 == 12:\r\n t1 = 0\r\nif t2 == 12:\r\n t2 = 0\r\nif t1 > t2:\r\n t1, t2 = t2, t1\r\nc = 0\r\nfor i in [x, y, z]:\r\n if t1 < i < t2:\r\n c += 1\r\nans = \"YES\" if not c % 3 else \"NO\"\r\nprint(ans)", "def zero_based(hour):\r\n return hour if hour < 12 else 0\r\n\r\nh, m, s, t1, t2 = map(int, input().split())\r\nt1, t2 = sorted([t1, t2])\r\n\r\nh *= 5\r\nt1 *= 5\r\nt2 *= 5\r\ncan_reach = False\r\n\r\nif s > 0:\r\n m += 0.5\r\nif m > 0:\r\n h += 0.5\r\n\r\nif t2 > h and h > t1:\r\n can_reach = t2 > m and m > t1 and t2 > s and s > t1\r\nelse:\r\n can_reach = not(t2 > m and m > t1) and not(t2 > s and s > t1)\r\n\r\nprint('YES' if can_reach else 'NO')", "from math import sqrt\r\nimport heapq\r\n\r\n\r\ndef main():\r\n h,m,s,t1,t2 = [int(x) for x in input().split(' ')]\r\n\r\n hdeg = (h*30 + (m/60)*30 + (s/3600)*30) % 360\r\n mdeg = (m*6 + (s/60)*6) % 360\r\n sdeg = (s*6) % 360\r\n\r\n start = (t1*30) % 360\r\n end = (t2*30) % 360\r\n\r\n if end < start:\r\n start, end = end, start\r\n\r\n if hdeg > end or mdeg > end or sdeg > end:\r\n pass\r\n elif hdeg < start or mdeg < start or sdeg < start:\r\n pass\r\n else:\r\n print('YES')\r\n return\r\n\r\n if start < hdeg < end or start < mdeg < end or start < sdeg < end:\r\n pass\r\n else:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "import sys\r\nread = sys.stdin.readline\r\n\r\ndef solve(h, m, s, t1, t2):\r\n h = (h % 12 + m/60 + s/3600) * 5\r\n m = m + s/60\r\n t1 = (t1 % 12) * 5\r\n t2 = (t2 % 12) * 5\r\n\r\n a = min(t1, t2)\r\n b = max(t1, t2)\r\n h_inner = a < h and h < b\r\n m_inner = a < m and m < b\r\n s_inner = a < s and s < b\r\n if h_inner and m_inner and s_inner:\r\n return \"YES\"\r\n if not h_inner and not m_inner and not s_inner:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ndef run():\r\n h, m, s, t1, t2 = list(map(int, read().replace(\"\\n\", \"\").split()))\r\n print(solve(h, m, s, t1, t2))\r\n\r\nrun()", "def mod_360(num):\n while num >= 360:\n num -= 360\n return num\n\nInput = input()\nInput = Input.split()\narcs = [0, 0, 0]\nfor i in range(len(Input)):\n Input[i] = int(Input[i])\n\n# hToblah = Input[0]*5 + Input[1]/12.0 + Input[2]/720.0\n# Min = min(Input[3], Input[4]) * 5\n# Max = max(Input[3], Input[4]) * 5\n# mod_360(hToblah)\n# mod_360(Min)\n# mod_360(Max)\n\nhToDegree = Input[0]*30 + Input[1]/2.0 + Input[2]/120.0\nmToDegree = Input[1]*6 + Input[2]/10.0\nsToDegree = Input[2]*6\nMin = min(Input[3], Input[4]) * 30\nMax = max(Input[3], Input[4]) * 30\nmod_360(hToDegree)\nmod_360(mToDegree)\nmod_360(sToDegree)\nmod_360(Min)\nmod_360(Max)\n\nif hToDegree >= Min and hToDegree <= Max:\n arcs[0] = 1\nif mToDegree >= Min and mToDegree <= Max:\n arcs[1] = 1\nif sToDegree >= Min and sToDegree <= Max:\n arcs[2] = 1\nif (arcs[0] == arcs[1] and arcs[1] == arcs[2]):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "h,m,s,x,y=map(int,input().split())\r\nh=h+m/60+s/3600\r\nm=m/5\r\ns=s/5\r\nl=[h,m,s,x,y]\r\nl.sort()\r\nz=abs(l.index(x)-l.index(y))\r\nif(z==1 or z==4):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "h,m,s,t1,t2=map(int,input().split())\r\nm=m/5\r\ns=s/5\r\nco=0\r\na=min(t1,t2)\r\nb=t1+t2\r\nt1=a\r\nt2=b-a\r\nif (t1<=h and h<t2) :\r\n co+=1\r\nif (t1<=m and m<t2):\r\n co+=1\r\nif(t1<=s and s<t2):\r\n co+=1\r\nif co==0 or co==3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "h, m, s, t1, t2 = map(int, input().split())\n\nh = (h + (m/60) + (s/3600)) % 12\nm = (m + (s/60)) % 60\nh *= 5 # To get same scale\nt1 *= 5\nt2 *= 5\n\nthings = sorted([h, m, s])\n\nfor i in range(3):\n if things[i] > t1:\n break\nif things[2] < t1: i = 0\n\nfor j in range(3):\n if things[j] > t2:\n break\nif things[2] < t2: j = 0\n\nif i == j:\n print(\"YES\")\nelse:\n print(\"NO\")", "def getListInt():\r\n\treturn [int(x) for x in input().split(\" \")]\r\n\r\ndef solution():\r\n\th,m,s,t1,t2 = getListInt()\r\n\tif t2 == min(t1,t2):\r\n\t\tt1,t2 = t2,t1\r\n\tm = float(m)/5\r\n\ts = float(s)/5\r\n\r\n\tnbrIn = 0\r\n\tif s>t1 and s<t2:\r\n\t\tnbrIn += 1\r\n\r\n\tif (m>t1 and m<t2) or (m == t1 and s!=0):\r\n\t\tnbrIn += 1\r\n\r\n\tif (h>t1 and h<t2) or (h == t1 and (m!=0 or s!=0)):\r\n\t\tnbrIn += 1\r\n\r\n\treturn nbrIn == 0 or nbrIn == 3 \r\n\r\n\r\nprint('YES' if solution() else 'NO')", "import math\r\ndef func(a):\r\n h,m,s,x,y=a\r\n m=m//5\r\n s=s//5\r\n b=[h,m,s]\r\n b.sort()\r\n r1,r2=0,0\r\n if x in range(b[0]+1,b[1]+1):\r\n r1=1\r\n elif x in range(b[1] + 1, b[2] + 1):\r\n r1 = 2\r\n else:\r\n r1=3\r\n\r\n if y in range(b[0]+1,b[1]+1):\r\n r2=1\r\n elif y in range(b[1] + 1, b[2] + 1):\r\n r2 = 2\r\n else:\r\n r2=3\r\n\r\n if r1==r2:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nfor _ in range(1):\r\n a=list(map(int,input().split()))\r\n print(func(a))", "def res(h: int, m: int, s: int, t1: int, t2: int) -> bool:\n def helper(x, sections) -> int:\n if x <= sections[0]:\n return -1\n elif x <= sections[1]:\n return 0\n elif x <= sections[2]:\n return 1\n else:\n return 2\n sections = [h/12, m/60, s/60]\n sections.sort()\n t1 = t1/12\n t2 = t2/12\n t1 = helper(t1, sections)\n t2 = helper(t2, sections)\n return t1 == t2 or (t1 == -1 and t2 == 2) or (t1 == 2 and t2 == -1)\n\n############################\nh, m, s, t1, t2 = map(lambda x: int(x), input().split(\" \"))\n\nif res(h,m,s,t1,t2):\n print(\"YES\")\nelse:\n print(\"NO\")", "used = [0] * 121\nh, m, s, t1, t2 = map(int, input().split())\nh %= 12\nt1 %= 12\nt2 %= 12\nt1 *= 5\nt2 *= 5\nused[h * 5] = 1\nused[h * 5 + 60] = 1\nused[m] = 1\nused[m + 60] = 1\nused[s] = 1\nused[s + 60] = 1\nif t1 > t2:\n t1, t2 = t2, t1\nt3 = t1 + 60\nif sum(used[t1:t2]) == 0 or sum(used[t2:t3]) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "def main():\r\n string = input()\r\n if is_contest_in_time(*map(int, string.split())):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\ndef is_contest_in_time(h, m, s, t1, t2):\r\n h = _hours_to_ticks(h, m, s)\r\n m = m + s / 60\r\n t1 = _hours_to_ticks(t1)\r\n t2 = _hours_to_ticks(t2)\r\n\r\n sorted_positions = sorted([h, m, s, t1, t2])\r\n current_position = sorted_positions.index(t1)\r\n contest_position = sorted_positions.index(t2)\r\n diff = abs(current_position - contest_position)\r\n return diff == 1 or diff == 4\r\n\r\n\r\ndef _hours_to_ticks(h, m=0, s=0):\r\n return h * 5 % 60 + m / 60 + s / 3600\r\n\r\n\r\nmain()\r\n", "h, m, s, t1, t2 = map(int, input().split())\r\nm //= 5\r\ns //= 5\r\na = [h, m, s, h + 12, m + 12, s + 12]\r\nup = 1\r\ndw = 1\r\nif t1 > t2:\r\n\tt1, t2 = t2, t1\r\nt1u = t1 + 12\r\nfor i in a:\r\n\tif t1 <= i and i < t2:\r\n\t\tup = 0\r\n\tif t2 <= i and i < t1u:\r\n\t\tdw = 0\r\nif dw + up == 0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES') ", "h, m, s, t1, t2 = map(int, input().split())\r\nls = s * 2\r\nlm = m * 2\r\nif ls != 0:\r\n lm += 1\r\nlh = h % 12 * 10\r\nif ls != 0 or lm != 0:\r\n lh += 1\r\nt1 = t1 % 12 * 10\r\nt2 = t2 % 12 * 10\r\nt1, t2 = min(t1, t2), max(t1, t2)\r\nans = False\r\nans1 = True\r\nans2 = True\r\nif t1 <= ls <= t2 or t1 <= lm <= t2 or t1 <= lh <= t2:\r\n ans1 = False\r\n#print(ans1)\r\nif 0 <= ls <= t1 or 0 <= lm <= t1 or 0 <= lh <= t1:\r\n ans2 = False\r\n#print(ans2)\r\nif t2 <= ls <= 118 or t2 <= lm <= 118 or t2 <= lh <= 118:\r\n ans2 = False\r\n#print(ans2)\r\nif ans1 or ans2:\r\n ans = True\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import ceil\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nh,m,s,t1,t2=map(int,input().split())\r\nh=h+m/60\r\nm=m/5\r\ns=s/5\r\nl=[h,m,s,t1,t2]\r\nl.sort()\r\nif abs(l.index(t1)-l.index(t2))==1 or abs(l.index(t1)-l.index(t2))==4:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "h,m,s,t1,t2=map(int,input().split())\r\na=s/60\r\nb=(m+a)/60\r\nc=(h+b)/12\r\nt1/=12\r\nt2/=12\r\nd=[a,b,c,t1,t2]\r\nd.sort()\r\nif (d.index(t1)==0 and (d.index(t2)==4 or d.index(t2)==1)) or (d.index(t1)==1 and (d.index(t2)==2 or d.index(t2)==0)) or (d.index(t1)==2 and (d.index(t2)==3 or d.index(t2)==1)) or (d.index(t1)==3 and (d.index(t2)==4 or d.index(t2)==2)) or (d.index(t1)==4 and (d.index(t2)==3 or d.index(t2)==0)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "h,m,s,t1,t2=map(int,input().split())\r\nh%=12\r\nt1%=12\r\nt2%=12\r\nangles = sorted([\r\n ((3600 * h + 60 * m + s), 0),\r\n ((60 * m + s) * 12, 0),\r\n (s * 12 * 60, 0),\r\n (3600 * t1, 1),\r\n (3600 * t2, 2)\r\n])\r\nx = [v[1] for v in angles]\r\ngood = False\r\nfor i in range(len(angles)):\r\n for j in range(i+1, len(angles)):\r\n if x[i] + x[j] == 3:\r\n good |= all(x[k] != 0 for k in range(i+1, j))\r\n good |= \\\r\n all(x[k] != 0 for k in range(j+1, len(angles))) and \\\r\n all(x[k] != 0 for k in range(0, i))\r\n\r\nprint(\"YES\" if good else \"NO\")\r\n", "def zero_based(hour):\n return hour if hour < 12 else 0\n\nh, m, s, t1, t2 = map(int, input().split())\nh = zero_based(h)\nt1 = zero_based(t1)\nt2 = zero_based(t2)\nt1, t2 = sorted([t1, t2])\n\nh *= 5\nt1 *= 5\nt2 *= 5\ncan_reach = False\n\nif s > 0:\n m += 0.5\nif m > 0:\n h += 0.5\n\nif t2 > h and h > t1:\n can_reach = t2 > m and m > t1 and t2 > s and s > t1\nelse:\n can_reach = not(t2 > m and m > t1) and not(t2 > s and s > t1)\n\nprint('YES' if can_reach else 'NO')\n", "# Main maut ko takiya, aur kaafan ko chaadar banakar audhta hoon!\r\n\r\nn=input().split()\r\n\r\nh=int(n[0])\r\nm=int(n[1])\r\ns=int(n[2])\r\nt1=int(n[3])\r\nt2=int(n[4])\r\n\r\nflag1=0\r\nflag2=0\r\n\r\nhour=h*30 + m*(1/2) + s* (1/720)\r\nminute=m*6 + s*(1/60)\r\nsecond=s*6\r\n\r\nif(hour>360):\r\n\thour-=360\r\n\t\r\nmaxi=max(t1,t2) * 30\r\nmini=min(t1,t2) * 30\r\n\r\nif(mini<hour<maxi or mini<minute<maxi or mini<second<maxi):\r\n\tflag1=1\r\n\t\r\nif((0<=hour<mini or 360>=hour>maxi) or (0<=minute<mini or minute>maxi) or (second<mini or second>maxi)):\r\n\tflag2=1\r\n\t\r\nif(flag1==1 and flag2==1):\r\n\tprint(\"NO\")\r\n\r\nelse:\r\n\tprint(\"YES\")", "h, m, s, t1, t2 = [int(x) for x in input().split()]\r\nh /= 12.\r\nm /= 60.\r\ns /= 60.\r\nt1 /= 12.\r\nt2 /= 12.\r\nclock = {'h':h, 'm':m, 's':s, 't1':t1, 't2':t2}\r\nfor k in clock.keys():\r\n if clock[k] == 1.0:\r\n clock[k] = 0.\r\nclock['m'] += s/60.\r\nclock['h'] += m/60. + s/3600\r\n#print(clock)\r\nlst = sorted(clock, key=lambda x: clock[x])\r\n#print(lst)\r\nt1_idx = lst.index('t1')\r\nt2_idx = lst.index('t2')\r\n\r\nma = max(t1_idx, t2_idx)\r\nmi = min(t1_idx, t2_idx)\r\nif ma - mi == 1 or (mi == 0 and ma == len(lst)-1):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nh, m, s, t1, t2 = map(int, input().split())\r\n\r\nh += (m + s/60)/60\r\nm += s/60\r\nh %= 12\r\nm /= 5\r\nm %= 12\r\ns /= 5\r\ns %= 12\r\n\r\nt1, t2 = sorted([t1, t2])\r\nif (t1 < h < t2 and t1 < m < t2 and t1 < s < t2) or ((not t1 < h < t2) and (not t1 < m < t2) and (not t1 < s < t2)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python3\n\nimport sys\n\n\nif __name__ == '__main__':\n h, m, s, t1, t2 = map(lambda x: int(x), sys.stdin.read().split())\n\n h = h if h != 12 else 0\n m == m if m != 60 else 0\n\n t1 = t1 if t1 != 12 else 0\n t2 = t2 if t2 != 12 else 0\n\n ha = 30 * h + 0.5 * m + s / 120;\n ma = 6 * m + 0.1 * s;\n sa = 6 * s;\n\n t1a = 30 * t1;\n t2a = 30 * t2;\n\n tmin = min(t1a, t2a)\n tmax = max(t1a, t2a)\n\n result = False\n\n if all(tmin < x < tmax for x in (ha, ma, sa)):\n result = True\n elif all(x < tmin or x > tmax for x in (ha, ma, sa)):\n result = True\n\n if result:\n print('YES')\n else:\n print('NO')\n", "h,m,s,t1,t2=map(int,input().split())\r\nhh=h+m/60+s/3600\r\nmm=m/5\r\nss=s/5\r\nll = [hh,mm,ss,t1,t2]\r\nll = sorted(ll)\r\n\r\ndiff = abs(ll.index(t1)-ll.index(t2))\r\nif diff==1 or diff==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n \r\n hour, minute, second, t1, t2 = [int(st) for st in input().split(\" \")]\r\n\r\n angle_hour = 360 * (hour + minute/60 + second/3600) / 12\r\n angle_minute = 360 * (minute + second/60) / 60\r\n angle_second = 360 * second / 60\r\n angle_t1 = 360 * t1 / 12\r\n angle_t2 = 360 * t2 / 12\r\n\r\n if angle_hour > 360:\r\n angle_hour -= 360\r\n if angle_minute > 360:\r\n angle_minute -= 360\r\n\r\n anglelist = [angle_hour, angle_minute, angle_second]\r\n\r\n if angle_t1 > angle_t2:\r\n angle_t1, angle_t2 = angle_t2, angle_t1\r\n\r\n #print(angle_hour, angle_minute, angle_second, angle_t1, angle_t2)\r\n\r\n statusT12, statusT21 = True, True\r\n for angle in anglelist:\r\n if angle_t1 < angle and angle < angle_t2:\r\n statusT12 = False\r\n if angle_t2 < angle or angle_t1 > angle:\r\n statusT21 = False\r\n\r\n ans = {True: \"YES\", False:\"NO\"}\r\n return ans[statusT12 or statusT21]\r\n\r\nprint(solve()) \r\n", "h, m, s, t1, t2 = map(int, input().split())\r\nh += m / 60 + s / 3600\r\nh %= 12\r\nm += s / 60\r\nm %= 60\r\nm /= 5\r\ns /= 5\r\nt1, t2 = min(t1, t2), max(t1, t2)\r\n##print(h, m, s, t1, t2)\r\nmark = 1\r\nif(t1 < h < t2):\r\n if(t1 < m < t2) and (t1 < s < t2):\r\n print(\"YES\")\r\n mark = 0\r\nelse:\r\n if((m < t1) or (m > t2)) and ((s < t1) or (s > t2)):\r\n print(\"YES\")\r\n mark = 0\r\nif mark:\r\n print(\"NO\")\r\n", "d=list(map(int, input().split()))\r\nd[0]*=5\r\nd[3]*=5 \r\nd[4]*=5\r\nt1=d[3]\r\nt2=d[4]\r\nd.sort()\r\nif abs(d.index(t1)-d.index(t2))==1 or abs(d.index(t1)-d.index(t2))==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\ndef prog():\r\n h,m,s,t1,t2 = map(int,input().split())\r\n marked = [0]*3600*12\r\n h = h % 12\r\n t1 = t1 % 12\r\n t2 = t2 % 12\r\n marked[3600*h + 60*m + s] = 1\r\n marked[720*m + 12*s] = 1\r\n marked[720*s] = 1\r\n t1, t2 = min(t1,t2), max(t1,t2)\r\n t1*=3600\r\n t2*=3600\r\n fail = False\r\n #print(t1,t2)\r\n for i in range(t1+1,t2):\r\n if marked[i]:\r\n fail = True\r\n if not fail:\r\n print('YES')\r\n else:\r\n fail = False\r\n for i in range(3600*12-1,t2,-1):\r\n if marked[i]:\r\n fail = True\r\n for i in range(t1):\r\n if marked[i]:\r\n fail = True\r\n if not fail:\r\n print('YES')\r\n else:\r\n print('NO')\r\nprog()\r\n", "a=[0]*3\r\na[0],a[1],a[2],t1,t2=map(int,input().split())\r\na[0]+=a[1]/60+a[2]/3600\r\na[1]=a[1]/5+a[2]/300\r\na[2]/=5\r\na[0]%=12\r\nt1%=12\r\nt2%=12\r\na=sorted(a)\r\nif t1>t2: t1,t2=t2,t1\r\nif a[0]<t1 and t2<a[1]:\r\n\tprint(\"YES\")\r\nelif a[1]<t1 and t2<a[2]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tif t1>a[2] and t2>a[2]:\r\n\t\tprint(\"YES\")\r\n\telif t2>a[2] and t1<a[0]:\r\n\t\tprint(\"YES\")\r\n\telif t1<a[0] and t2<a[0]:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "h,m,s,t1,t2 = map(int,input().split())\r\n\r\n\r\nh%=12\r\nt1%=12\r\nt2%=12\r\n\r\nt1 = 3600*t1\r\nt2 = 3600*t2\r\nh = 3600*h+60*m+s\r\nm = 720*m+12*s\r\ns = 720*s\r\nh%=43200\r\nm%=43200\r\ns%=43200\r\nobstacles = [h,m,s]\r\na = [t1,t2]\r\nt1,t2 = min(a),max(a)\r\ncanGoForward = True\r\ncanGoBack = True\r\nfor o in obstacles:\r\n if t1<o and o<t2:\r\n canGoForward = False\r\n else:\r\n canGoBack = False\r\n\r\ncan = canGoBack or canGoForward\r\nprint({True:\"Yes\",False:\"No\"}[can])\r\n\r\n", "h, m, s, t1, t2=map(int,input().split())\r\np=[0]*12\r\np[(h+1)%12]=1\r\np[(m//5+1)%12]=1\r\np[(s//5+1)%12]=1\r\nq=[0]*12\r\nif m==s==0:\r\n q[(h-1)%12]=1\r\nelse:\r\n q[h%12]=1\r\nif (m%5==0) and (s==0):\r\n q[(m//5-1)%12]=1\r\nelse:\r\n q[m//5%12]=1\r\nif s%5==0:\r\n q[(s//5-1)%12]=1\r\nelse:\r\n q[s//5%12]=1\r\n\r\ni=t1%12\r\nt2=t2%12\r\nd=True\r\n#print(p,q)\r\nwhile i!=t2:\r\n i=(i+1)%12\r\n if p[i]==1:\r\n i = t1 % 12\r\n while i!=t2:\r\n i = (i + 11)%12\r\n if q[i] == 1:\r\n d=False\r\n print('NO')\r\n break\r\n break\r\nif d:\r\n print('YES')\r\n", "from functools import reduce\r\nraws = [int(x) for x in input().split(\" \")]\r\nsecpos = raws[2]/5\r\nminpos = raws[1]/5+secpos/60\r\nhrpos = raws[0] % 12 + minpos/12\r\npositions = [secpos, minpos, hrpos]\r\n\r\nm = min(raws[3],raws[4])\r\nn = max(raws[3],raws[4])\r\ntestcases = list(map(lambda x:x>n or x<m,positions))\r\nout = reduce((lambda x, y: x and y),testcases) or reduce((lambda x,y:x and y),[not x for x in testcases])\r\n\r\nif out:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "from math import fabs as ag\r\nh,m,s,a,b=map(int,input().split(' '))\r\np=[0]*12\r\nw=[0]*12\r\nif h<12:\r\n p[h]=1\r\nelse:\r\n p[0]=1\r\np[m//5]=1\r\np[s//5]=1\r\na=a%12\r\nb=b%12\r\nw[a]=1\r\nw[b]=2\r\nch=0\r\n#print(p,w,a,b)\r\nfor i in range(1,12):\r\n #print(i, p[(a + i) % 12])\r\n if p[(a + i - 1) % 12] == 1:\r\n break\r\n elif (a+i)%12==b:\r\n print('YES')\r\n ch=1\r\n break\r\nif ch==0:\r\n for i in range(1,12):\r\n #print(i, p[a-i])\r\n if p[(a - i)] == 1:\r\n break\r\n elif w[a - i] == 2:\r\n print('YES')\r\n ch = 1\r\n break\r\nif ch==0:\r\n print('NO')", "h,m,s,t1,t2=map(int,input().split())\r\nc=[0]*3600*12\r\nh=h%12\r\nt1=t1%12\r\nt2=t2%12\r\nc[3600*h+60*m+s]=1\r\nc[720*m+12*s]=1\r\nc[720*s]=1\r\nt1,t2=min(t1,t2),max(t1,t2)\r\nt1*=3600\r\nt2*=3600\r\nflag=False\r\nfor i in range(t1+1,t2):\r\n if(c[i]):\r\n flag=True\r\n break\r\nif(not flag):\r\n print('YES')\r\nelse:\r\n flag=False\r\n for i in range(3600*12-1,t2,-1):\r\n if(c[i]):\r\n flag=True\r\n break\r\n for i in range(t1):\r\n if(c[i]):\r\n flag=True\r\n break\r\n if(not flag):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n \r\n", "from sys import stdin, stdout\n\nh, m, s, t1, t2 = map(int,stdin.readline().rstrip().split())\n\nh+=0.1\nm+=0.1\n\nif t1>t2:\n t1,t2 = t2,t1\n\nbetweenCount = 0\nif h<t2 and h>t1:\n betweenCount+=1\nif m<t2*5 and m>t1*5:\n betweenCount+=1\nif s<t2*5 and s>t1*5:\n betweenCount+=1\n\nif betweenCount==3 or betweenCount==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "h,m,s,a,b=map(int,input().split())\n\nm+=s/60\nh+=m/60\nm/=5\ns/=5\n\n\nc=[h,m,s,a,b]\nc=c+list(map(lambda x:x+12,c))\nc=sorted(c)\np=c.index(a)\nfor x in [p-1,p+1]:\n\tfor y in [b,b+12]:\n\t\tif c[x]==y:\n\t\t\tprint('YES')\n\t\t\texit(0)\n\nprint('NO')\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[h, m, s, t1, t2] = list(map(int, input().split()))\r\n\r\nif h == 12:\r\n h = 0\r\n\r\nif t1 == 12:\r\n t1 = 0\r\n\r\nif t2 == 12:\r\n t2 = 0\r\n\r\nif t1 > t2:\r\n t1, t2 = t2, t1\r\n\r\n#sa = s*360/60\r\n#ma = m*360/60+s*360/(60*60)\r\n#ha = h*360/12+m*360/(12*60)+s*360/(12*60*60)\r\nsa = s*360*12*60\r\nma = m*360*12*60 + s*360*12\r\nha = h*360*60*60 + m*360*60 + s*360\r\n\r\ndef check(x): \r\n if (t1*360/12)*12*60*60 < x and x < (t2*360/12)*12*60*60:\r\n return 1\r\n return -1\r\n\r\nif check(sa) == check(ma) and check(sa) == check(ha):\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n\r\n", "h,m,s,t1,t2 = [int(i) for i in input().split()]\r\nblockers = []\r\nif (m==0 and s==0):\r\n blockers.append(h)\r\nelse:\r\n blockers.append(h+0.1)\r\nif (s==0):\r\n if (m==0):\r\n blockers.append(12)\r\n else:\r\n if (m<5):\r\n blockers.append(12.1)\r\n else:\r\n blockers.append(m/5.0)\r\nelse:\r\n if (m==0):\r\n blockers.append(12.1)\r\n else:\r\n if (m<5):\r\n blockers.append(12.1)\r\n else:\r\n if (m%5==0):\r\n blockers.append((m/5.0) + 0.1)\r\n else:\r\n blockers.append(m/5.0)\r\nif (s==0):\r\n blockers.append(12)\r\nelse:\r\n if (s<5):\r\n blockers.append(12.1)\r\n else:\r\n blockers.append(s/5.0)\r\nmint = min(t1,t2)\r\nmaxt = max(t1,t2)\r\n#print (blockers)\r\nflag = 1\r\ncount = 0\r\nfor i in range(3):\r\n #print (i)\r\n if (blockers[i]>mint and blockers[i]<maxt):\r\n flag = 0\r\n count = count + 1\r\nif (flag == 1 or count == 3):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "if __name__ == \"__main__\":\n\th, m, s, t1, t2 = [int(x) for x in input().split()]\n\t\n\thand_angles = [s / 60 * 360,\n\t\t\t\t (m + s / 60) / 60 * 360,\n\t\t\t\t (h % 12 + m / 60 + s / 3600) / 12 * 360]\n\n\t\n\tt1_angle = (t1 % 12) / 12 * 360\n\tt2_angle = (t2 % 12) / 12 * 360\n\n\tif t1_angle > t2_angle:\n\t\tt1_angle, t2_angle = t2_angle, t1_angle\n\n\t# try going clockwise (from t1 to t2)\n\tcan_go_clockwise = True\t\n\tcan_go_counterclockwise = True\n\tfor angle in hand_angles:\n\t\tif angle > t1_angle and angle < t2_angle:\n\t\t\tcan_go_clockwise = False\n\t\t\n\t\tif not (angle >= t1_angle and angle <= t2_angle):\n\t\t\tcan_go_counterclockwise = False\n\n\tprint(\"YES\" if can_go_clockwise or can_go_counterclockwise else \"NO\")\n", "h,m,s,t1,t2=map(int,input().split())\r\nm+=s/60\r\nh+=m/60\r\nm/=5\r\ns/=5\r\nh=h%12\r\nm=m%12\r\ns=s%12\r\nT1=min(t1,t2)\r\nT2=max(t1,t2)\r\nif(T1<h<T2 and T1<m<T2 and T1<s<T2):\r\n print(\"YES\")\r\nelif(not(T1<h<T2 or T1<m<T2 or T1<s<T2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n ", "# IAWT\r\nh, m, s, t1, t2 = list(map(int, input().split()))\r\nif h == 12: h = 0\r\ndef cmp(ang1, ang2):\r\n pass \r\na1 = t1 * 30\r\na2 = t2 * 30\r\nasec = s * 6\r\nif asec >= min(a1, a2) and asec <= max(a1, a2):\r\n secsit = 'Mid'\r\nelse: secsit = 'notMid'\r\namin = m * 6 + (s / 10) # /60 * 6\r\nif amin >= min(a1, a2) and amin <= max(a1, a2):\r\n minsit = 'Mid'\r\nelse: minsit = 'notMid'\r\nahour = h * 30 + (m / 2) + (s / 120)\r\nif ahour >= min(a1, a2) and ahour <= max(a1, a2):\r\n hoursit = 'Mid'\r\nelse: hoursit = 'notMid'\r\nif hoursit == secsit == minsit:\r\n print('YES')\r\nelse:\r\n print('No')\r\n \r\n", "\r\nh,m,s,t1,t2=map(int,input().split())\r\nb=360*(s/60)\r\nc=360*(m/60)+(b/360)\r\nd=h*30+(c/360)*30\r\nb=b%360\r\nc=c%360\r\nd=d%360\r\nf=True\r\nt1=30*t1\r\nt2=t2*30\r\na=[t1,t2,c,d,b]\r\na.sort()\r\ni1=a.index(t1)\r\ni2=a.index(t2)\r\ni2,i1=max(i1,i2),min(i1,i2)\r\nif (i1==0 and i2==4) or (i2-i1==1):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "h, m, s, t1, t2 = list(map(int, input().split()))\r\nh %= 12\r\nt1 %= 12\r\nt2 %= 12\r\nt1, t2 = sorted([t1, t2])\r\nm += s/60\r\nh += m/60\r\ns = s/60*12\r\nm = m /60*12\r\nif (t1 < s < t2 and t1 < m < t2 and t1 < h < t2) or (not(t1 < s < t2) and not(t1 < m < t2) and not(t1 < h < t2)):\r\n print('YES')\r\nelse:\r\n print('NO')", "h, m, s, t1, t2 = map(int, input().split())\r\na = [0] * 43200\r\na[(h * 3600 + 60 * m + s) % 43200] = 1\r\na[(m * 720 + 12 * s) % 43200] = 1\r\na[(s * 720) % 43200] = 1\r\na[(t2 * 3600) % 43200] = 2\r\npossible = False\r\nfor i in range(t1 * 3600, t1 * 3600 + 43200):\r\n if a[i % 43200] == 1:\r\n break\r\n elif a[i % 43200] == 2:\r\n possible = True\r\n break\r\nfor i in range(t1 * 3600, t1 * 3600 - 43200, -1):\r\n if a[i % 43200] == 1:\r\n break\r\n elif a[i % 43200] == 2:\r\n possible = True\r\n break\r\nif possible:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "h, m, s, a, b = list(map(int, input().split()))\r\n\r\nmx = m + s/60\r\nhx = 5 * h + mx/60\r\nax = 5 * a\r\nbx = 5 * b\r\nt = [s, mx, hx]\r\nt.sort()\r\nif t[0] <= ax <= t[1] and t[0] <= bx <= t[1]:\r\n print('YES')\r\nelif t[1] <= ax <= t[2] and t[1] <= bx <= t[2]:\r\n print('YES')\r\nelif ax <= t[0] and bx <= t[0]:\r\n print('YES')\r\nelif ax >= t[2] and bx >= t[2]:\r\n print('YES')\r\nelif ax >= t[2] and bx <= t[0]:\r\n print('YES')\r\nelif ax <= t[0] and bx >= t[2]:\r\n print('YES') \r\nelse:\r\n print('NO') ", "h,m,s,t1,t2=map(int,input().split(' '))\r\nif h==12:\r\n h=0\r\nha=h+m/60+s/3600\r\nha*=30\r\nm+=s/60\r\nma=m*6\r\nsa=s*6\r\nif t1==12:\r\n t1=0\r\nif t2==12:\r\n t2=0\r\nt1a=t1*30\r\nt2a=t2*30\r\na=min(t1a,t2a)\r\nb=max(t1a,t2a)\r\nl=[ha,ma,sa]\r\nans=0\r\nfor i in range(0,3):\r\n if l[i]>a and l[i]<b:\r\n ans+=1\r\nif ans==0 or ans==3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def bet(x):\r\n return t1 <= x <= t2 or t2 <= x + 3600 * 12 <= t1 or t2 <= x <= t1\r\n\r\nread = lambda: map(int, input().split())\r\nh, m, s, t1, t2 = read()\r\nh %= 12\r\nt1 %= 12\r\nt2 %= 12\r\nN = 12 * 3600 + 10\r\nnt = [0] * N\r\nk1 = h * 3600 + 1\r\nk2 = m * 720 + 1\r\nk3 = s * 720\r\nt1 *= 3600\r\nt2 *= 3600\r\nif t1 > t2: t1, t2 = t2, t1\r\nans = 'NO'\r\nflag = 1\r\nif bet(k1) or bet(k2) or bet(k3):\r\n flag = 0\r\nif flag:\r\n ans = 'YES'\r\nflag = 1\r\nt1 += 12 * 3600\r\nif bet(k1) or bet(k2) or bet(k3):\r\n flag = 0\r\nif flag:\r\n ans = 'YES'\r\nprint(ans)", "h,m,s,t1,t2=map(int,input().split())\r\nh,t1,t2=h*5%60,t1*5%60,t2*5%60\r\nif s!=0:m+=s/60\r\nif m!=0:h+=m/60\r\nlst=[h,m,s,t1,t2]\r\nlst.sort()\r\nres='NO'\r\nif lst[0]==t1 and lst[1]==t2:res='YES'\r\nfor i in range(1,4):\r\n if lst[i]==t1:\r\n if lst[i-1]==t2:res='YES'\r\n if lst[i+1]==t2:res='YES'\r\nif lst[4]==t1 and lst[3]==t2:res='YES'\r\nif (lst[0]==t1 and lst[4]==t2) or (lst[0]==t2 and lst[4]==t1):\r\n res='YES'\r\nprint(res)", "h,m,s,t1,t2=map(int,input().split())\r\nh=(h*5)%60\r\nt1=(t1*5)%60\r\nt2=(t2*5)%60\r\nif h<=m<=s:\r\n if t1>s and t2>s:\r\n print('YES')\r\n elif t1<=h and t2<=h:\r\n print('YES')\r\n elif t1<=h and t2>s:\r\n print('YES')\r\n elif t1>s and t2<=h:\r\n print('YES')\r\n elif h<t1<=m and h<t2<=m:\r\n print('YES')\r\n elif m<t1<=s and m<t2<=s:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif h<=s<=m:\r\n if t1>m and t2>m:\r\n print('YES')\r\n elif t1<=h and t2<=h:\r\n print('YES')\r\n elif t1<=h and t2>m:\r\n print('YES')\r\n elif t1>m and t2<=h:\r\n print('YES')\r\n elif h<t1<=s and h<t2<=s:\r\n print('YES')\r\n elif s<t1<=m and s<t2<=m:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif m<=h<=s:\r\n if t1>s and t2>s:\r\n print('YES')\r\n elif t1<=m and t2<=m:\r\n print('YES')\r\n elif t1<=m and t2>s:\r\n print('YES')\r\n elif t1>s and t2<=m:\r\n print('YES')\r\n elif m<t1<=h and m<t2<=h:\r\n print('YES')\r\n elif h<t1<=s and h<t2<=s:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif m<=s<=h:\r\n if t1>h and t2>h:\r\n print('YES')\r\n elif t1<=m and t2<=m:\r\n print('YES')\r\n elif t1<=m and t2>h:\r\n print('YES')\r\n elif t1>h and t2<=m:\r\n print('YES')\r\n elif m<t1<=s and m<t2<=s:\r\n print('YES')\r\n elif s<t1<=h and s<t2<=h:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif s<=h<=m:\r\n if t1>m and t2>m:\r\n print('YES')\r\n elif t1<=s and t2<=s:\r\n print('YES')\r\n elif t1<=s and t2>m:\r\n print('YES')\r\n elif t1>m and t2<=s:\r\n print('YES')\r\n elif s<t1<=h and s<t2<=h:\r\n print('YES')\r\n elif h<t1<=m and h<t2<=m:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif s<=m<=h:\r\n if t1>h and t2>h:\r\n print('YES')\r\n elif t1<s and t2<s:\r\n print('YES')\r\n elif t1<=s and t2>h:\r\n print('YES')\r\n elif t1>h and t2<=s:\r\n print('YES')\r\n elif s<t1<=m and s<t2<=m:\r\n print('YES')\r\n elif m<t1<=h and m<t2<=h:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "#!/usr/bin/python3\n\ndef dstr(a, b):\n return (b - a) % (12 * 60 * 60)\n\nh, m, s, t1, t2 = map(int, input().split())\n\ncd = [(h * 60 * 60 + m * 60 + s) % (12 * 60 * 60), m * 12 * 60 + s, s * 12 * 60]\nif dstr(cd[0], cd[2]) < dstr(cd[0], cd[1]):\n cd = cd[::-1]\n \nt1 *= 60 * 60\nt2 *= 60 * 60\n\n\nans = False\n\nfor i in range(-1, 2):\n if dstr(cd[i], t1) <= dstr(cd[i], cd[i + 1]) \\\n and dstr(cd[i], t2) <= dstr(cd[i], cd[i + 1]):\n ans = True\n\nif len(set(cd)) == 1:\n ans = True\n \nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input().split()\ntimes=[int(n) for n in a]\nnumbers=[(times[0]*30+times[1]/2+times[2]/120)%360, (times[1]*6+times[2]/10)%360, (times[2]*6)%360]\nnumbers.sort(key=float)\nt1=times[3]*30\nt2=times[4]*30\ndef reg(x):\n\tif numbers[0]<x<numbers[1]:\n\t\treturn 1\n\tif numbers[1]<x<numbers[2]:\n\t\treturn 2\n\telse:\n\t\treturn 3\n\nif reg(t1)==reg(t2):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "def check1(h):\n\tglobal t1,t2\n\tif(h==t1 or h==t2):\n\t\treturn -1\n\tif(h>min(t1,t2) and h<max(t1,t2)):\n\t\treturn 1\n\telse:\n\t\treturn 0\n\ndef check2(m):\n\tif(m==5*t1 or m==5*t2):\n\t\treturn -1\n\tif(m>5*min(t1,t2) and m<5*max(t1,t2)):\n\t\treturn 1\n\telse:\n\t\treturn 0\n\nh,m,s,t1,t2 = list(map(int,input().split()))\nif(m!=0 or s!=0):\n\th+=0.5\nif(s!=0):\n\tm+=0.5\nif(h>12):\n\th-=12\n\n\nl=[check1(h),check2(m),check2(s)]\nfor i in range(len(l)-1,-1,-1):\n\tif(l[i] == -1):\n\t\tl.pop(i)\nflag=0\nfor val in l:\n\tif(val!=l[0]):\n\t\tflag=1\n\t\tbreak\nif(flag):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "def fun(s,e,m):\r\n return m>s and e>m\r\nh,m,s,t1,t2=[int(i) for i in input().split()]\r\nhp=h+(m*60+s)/3600\r\nmp=m/5+s/300\r\nsp=s/5\r\nif t1>t2:\r\n t1,t2=t2,t1\r\nif (fun(t1,t2,hp) and fun(t1,t2,mp) and fun(t1,t2,sp)) or not(fun(t1,t2,hp) or fun(t1,t2,mp) or fun(t1,t2,sp)):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "from sys import stdin\nh, m, s, t1, t2 = [int(i) for i in stdin.readline().split(' ')]\n\nborders = sorted([5*h, m, s])\nbool1a = (5*t1 <= borders[0]) or (borders[2] < 5*t1)\nbool1b = (5*t2 <= borders[0]) or (borders[2] < 5*t2)\nbool2a = (borders[0] < 5*t1) and (5*t1 <= borders[1])\nbool2b = (borders[0] < 5*t2) and (5*t2 <= borders[1])\nbool3a = (borders[1] < 5*t1) and (5*t1 <= borders[2])\nbool3b = (borders[1] < 5*t2) and (5*t2 <= borders[2])\n\nif (((bool1a and bool1b) or (bool2a and bool2b)) or (bool3a and bool3b)):\n print(\"YES\")\nelse:\n print(\"NO\")", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n h, m, s, t1, t2 = map(int, input().split())\r\n clock = [False for i in range(12*60*60)]\r\n \r\n if h == 12:\r\n h = 0\r\n if t1 == 12:\r\n t1 = 0\r\n if t2 == 12:\r\n t2 = 0\r\n\r\n\r\n clock[h*60*60+m*60+s] = True\r\n clock[m*12*60+s] = True\r\n clock[s*12*60] = True\r\n\r\n forward = True\r\n start = t1*60*60\r\n end = t2*60*60\r\n i = start\r\n while i != end:\r\n if clock[i]:\r\n forward = False\r\n break\r\n i = (i+1) % len(clock)\r\n backward = True\r\n i = start\r\n while i != end:\r\n if clock[i]:\r\n backward = False\r\n break\r\n i = (i-1) % len(clock)\r\n\r\n if forward or backward:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n" ]

[ "from fractions import gcd\nfrom functools import reduce\n\n\nLETTERS = 'abcdefghijklmnopqrstuvwxyz'\n\n\ndef necklace_odd(a):\n oi = next(i for i, ai in enumerate(a) if ai%2)\n o = a[oi]\n g = reduce(gcd, a)\n s = [LETTERS[i] * (a[i]//(2*g)) for i in range(len(a)) if i != oi]\n return g, (''.join(s) + (LETTERS[oi]*(o//g)) + ''.join(reversed(s))) * g\n\n\ndef necklace_even(a):\n g = reduce(gcd, a)//2\n s = [LETTERS[i]*(a[i]//(2*g)) for i in range(len(a))]\n return 2*g, (''.join(s) + ''.join(reversed(s))) * g\n\n\ndef necklace(a):\n if len(a) == 1:\n return a[0], LETTERS[0]*a[0]\n\n nodd = sum(ai%2 for ai in a)\n if nodd > 1:\n return 0, ''.join(LETTERS[i]*a[i] for i in range(len(a)))\n\n return (necklace_odd if nodd else necklace_even)(a)\n\n\nif __name__ == '__main__':\n n = int(input())\n a = list(map(int, input().split()))\n assert len(a) == n\n k, e = necklace(a)\n print(k)\n print(e)\n\n\n\n\n# Made By Mostafa_Khaled", "import math\n#import fractions\nfrom functools import reduce\n\nn = int(input())\nodd = -1\nbeads = [int(x) for x in input().split()]\nfor i in range(n):\n if beads[i]%2:\n if odd >= 0:\n print(0)\n print(''.join(chr(ord('a') + i)*beads[i] for i in range(n)))\n break\n else:\n odd = i\nelse:\n gcd = reduce(lambda x,y: math.gcd(x,y), beads)\n print(gcd)\n if odd >= 0:\n s = ''.join(chr(ord('a') + i)*(beads[i]//(2*gcd)) for i in range(n) if i != odd)\n p = s + chr(ord('a') + odd)*(beads[odd]//gcd) + s[::-1]\n print(p*gcd)\n else:\n s = ''.join(chr(ord('a') + i)*(beads[i]//gcd) for i in range(n))\n p = s + s[::-1]\n print(p*(gcd//2))\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nammod = 0\r\ninc = 0\r\nres = \"\"\r\ntemp = \"\"\r\nfor i in range(n):\r\n inc = math.gcd(inc, a[i])\r\n ammod += (a[i] & 1)\r\nif ammod > 1:\r\n print(\"0\")\r\n for i in range(n):\r\n while a[i] > 0:\r\n print(chr(ord('a') + i), end=\"\")\r\n a[i] -= 1\r\n exit(0)\r\nprint(inc)\r\nind = -1\r\nif ammod == 0:\r\n inc >>= 1\r\nfor i in range(n):\r\n while a[i] >= inc * 2:\r\n res += chr(ord('a') + i)\r\n a[i] -= inc * 2\r\n if a[i]:\r\n ind = i\r\ntemp = res[::-1]\r\nif ind >= 0:\r\n res += chr(ord('a') + ind)\r\nres += temp\r\nwhile inc > 0:\r\n print(res, end=\"\")\r\n inc -= 1# 1692537722.1797526" ]

[ "import io,os\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nri=lambda: int(input())\r\nrl=lambda: list(map(int,input().split()))\r\nrs=lambda: input().decode().rstrip('\\n\\r')\r\nfrom collections import deque as dq\r\ninf=float(\"inf\")\r\nmod=10**9 + 7\r\n\r\n\r\ndef DFS(gr,B,F):\r\n n=len(gr)\r\n vis=[False for i in range(n)]\r\n fin=[False for i in range(n)]\r\n dp=[None for i in range(n)]\r\n par=[-1 for i in range(n)]\r\n \r\n def dfs(node):\r\n stack=[node]\r\n while(stack):\r\n node=stack[-1]\r\n if not vis[node]:\r\n vis[node]=True \r\n for i in gr[node]:\r\n if not vis[i]:\r\n par[i]=node \r\n stack.append(i)\r\n else:\r\n stack.pop()\r\n dp[node]=1\r\n for i in gr[node]:\r\n if fin[i]:\r\n dp[node]+=dp[i]\r\n fin[node]=True\r\n dfs(B)\r\n ret=dp[F]\r\n while(par[F]!=B):\r\n F=par[F]\r\n ret*=dp[B]-dp[F]\r\n return ret\r\n\r\n\r\n\r\n\r\n\r\nCases=1#ri()\r\nfor Case in range(Cases):\r\n n,x,y=rl()\r\n gr=[[] for i in range(n)]\r\n for i in range(n-1):\r\n u,v=rl()\r\n u-=1;v-=1\r\n gr[v].append(u)\r\n gr[u].append(v)\r\n FtoB=DFS(gr,y-1,x-1)\r\n ans=n*(n-1)-FtoB\r\n print(max(0,ans))\r\n", "from collections import defaultdict\r\n\r\nn,x,y = list(map(int,input().split()))\r\ngraph = defaultdict(list)\r\nvis = [False for i in range(n+1)]\r\nmat = [False for i in range(n+1)]\r\nsubtree = [0 for i in range(n+1)]\r\n\r\nfor i in range(n-1):\r\n\tu,v = list(map(int,input().split()))\r\n\tgraph[u].append(v)\r\n\tgraph[v].append(u)\r\nq = []\r\ncur = 0\r\nfor v in graph[x]:\r\n\tif v!=y:\r\n\t\tq.append([v,v])\r\n\telse:\r\n\t\tcur = v\r\nvis[x] = 1\r\nwhile q!=[]:\r\n\ttemp = q.pop()\r\n\tu,v = temp\r\n\tvis[u] = True\r\n\tsubtree[v]+=1\r\n\tfor node in graph[u]:\r\n\t\tif vis[node]==False:\r\n\t\t\tif node!=y:\r\n\t\t\t\tq.append([node,v])\r\n\t\t\telse:\r\n\t\t\t\tcur = v\r\nval = sum(subtree)\r\nval1 = (val+1-subtree[cur])\r\nval2 = n-(sum(subtree)+1)\r\nval = val1*val2\r\nprint(n*(n-1)-val)", "from collections import defaultdict\r\n\r\n\r\ndef dfs(g, x, y):\r\n vis = set()\r\n vis.add(x)\r\n\r\n stack = [x]\r\n\r\n while stack:\r\n s = stack.pop()\r\n vis.add(s)\r\n\r\n for child in g[s]:\r\n if child != y and child not in vis:\r\n stack.append(child)\r\n\r\n return len(vis)\r\n\r\n\r\nn, x, y = map(int, input().split())\r\nedges = defaultdict(list)\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n edges[u].append(v)\r\n edges[v].append(u)\r\n\r\nlen_vis = dfs(edges, x, y)\r\ny_sub = n - len_vis\r\n\r\nlen_vis = dfs(edges, y, x)\r\nx_sub = n - len_vis\r\n\r\nprint((n * (n - 1)) - (y_sub * x_sub))\r\n", "import itertools\r\nimport math\r\nimport threading\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nfrom io import BytesIO, IOBase\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\nfrom math import factorial as fac\r\n\r\n\r\ndef solve():\r\n n, x, y = map(int, sys.stdin.readline().split())\r\n x, y = x - 1, y - 1\r\n g = [[] for i in range(n)]\r\n for i in range(n - 1):\r\n a, b = map(int, sys.stdin.readline().split())\r\n a, b = a - 1, b - 1\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\n bad_node = set()\r\n\r\n q = [x]\r\n q_it = 0\r\n dist = {x: 0}\r\n\r\n while q_it < len(q):\r\n f = q[q_it]\r\n q_it += 1\r\n\r\n for u in g[f]:\r\n if u not in dist:\r\n dist[u] = dist[f] + 1\r\n q.append(u)\r\n\r\n bad_node.add(x)\r\n bad_node.add(y)\r\n it = y\r\n while it != x:\r\n for u in g[it]:\r\n if u in dist:\r\n if dist[u] == dist[it] - 1:\r\n bad_node.add(u)\r\n it = u\r\n break\r\n\r\n def sub_nodes(ff):\r\n res = 1\r\n q = [ff]\r\n q_it = 0\r\n visited = {ff}\r\n\r\n while q_it < len(q):\r\n f = q[q_it]\r\n q_it += 1\r\n\r\n for u in g[f]:\r\n if u not in visited and u not in bad_node:\r\n visited.add(u)\r\n q.append(u)\r\n res += 1\r\n\r\n return res\r\n\r\n res = n * (n - 1) - sub_nodes(x) * sub_nodes(y)\r\n print(res)\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n multytest = False\r\n\r\n if multytest:\r\n t = int(input())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\ndef process(G, x, y):\r\n n2 = len(G)\r\n n = n2+1\r\n g = [[None, [], 1] for i in range(n+1)]\r\n #parent, child, count\r\n for i in range(n-1):\r\n a, b = G[i]\r\n g[a][1].append(b)\r\n g[b][1].append(a)\r\n depth = [[x]]\r\n g[x][0] = -1\r\n while True:\r\n next_s = []\r\n for X in depth[-1]:\r\n for Y in g[X][1]:\r\n if g[Y][0] is None:\r\n next_s.append(Y)\r\n g[Y][0] = X\r\n if len(next_s) == 0:\r\n break\r\n depth.append(next_s)\r\n while len(depth) > 0:\r\n L = depth.pop()\r\n for X in L:\r\n Y = g[X][0]\r\n if Y != -1:\r\n g[Y][2] += g[X][2]\r\n path = [y]\r\n while path[-1] != x:\r\n path.append(g[path[-1]][0])\r\n f2 = g[y][2]\r\n #f2 = children of y, including y\r\n f3 = 1\r\n for x2 in g[x][1]:\r\n if x2 != path[-2]:\r\n f3+= g[x2][2]\r\n #f3 = children of x, including x, except for the ones\r\n #where the path to x\r\n #intersects with the path to y.\r\n # we can't take anything from f3 to f2\r\n return n*(n-1)-f3*f2\r\n\r\n\r\nn, x, y = [int(X) for X in input().split()]\r\nG = []\r\nfor i in range(n-1):\r\n a, b = [int(x) for x in input().split()]\r\n G.append([a, b])\r\nprint(process(G, x, y))\r\n", "import sys\r\nimport threading\r\nfrom collections import defaultdict\r\nn,x,y = map(int,input().split())\r\nadj = defaultdict(list)\r\nfor i in range(1,n):\r\n a,b = map(int,input().split())\r\n adj[a].append(b)\r\n adj[b].append(a)\r\ndef dfs(node,par,v,ans):\r\n sum = 1\r\n for i in range(len(adj[node])):\r\n if adj[node][i]!=par:\r\n sum+= dfs(adj[node][i],node,v,ans)\r\n # sum+=1\r\n if node == v:\r\n ans[0] = sum\r\n return sum\r\ndef main():\r\n ans1=[0]\r\n dfs(x,0,y,ans1)\r\n ans2 = [0]\r\n dfs(y,0,x,ans2)\r\n print((n*(n-1))-(ans1[0]*ans2[0]))\r\n\r\nif __name__ == \"__main__\":\r\n sys.setrecursionlimit(10**6)\r\n threading.stack_size(10**8)\r\n t = threading.Thread(target=main)\r\n t.start()\r\n t.join()", "import sys, os\nfrom io import BytesIO, IOBase\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n\n# region fastio\nBUFSIZE = 8192\n \nclass FastIO(IOBase):\n newlines = 0\n \n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n \n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n \n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n \n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n \nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\nstdin, stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout) \n\nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef ceil(a, b): return (a+b-1)//b\nS1 = 'abcdefghijklmnopqrstuvwxyz'\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nn, x, y = mp()\nedges = l2d(n+1, 0)\nfor i in range(n-1):\n xx, yy = mp()\n edges[xx].append(yy)\n edges[yy].append(xx)\na1, a2 = 1, 0\nst = [(x, 0)]\ndfs = []\npar = l1d(n+1)\npar[x] = -1\nwhile st:\n node, lvl = st.pop()\n dfs.append((node, lvl))\n for child in edges[node]:\n if child != par[node]:\n par[child] = node\n st.append((child, lvl+1))\ndfs.sort(reverse=True, key=lambda x: x[1])\nchildren = l1d(n+1)\nfor node, lvl in dfs[:-1]:\n if (node == y or children[node] == -1):\n if par[node] != x:\n children[par[node]] = -1\n elif children[node] != -1 and children[par[node]] != -1:\n children[par[node]] += 1+children[node]\nprint(n*(n-1) - (children[x]+1)*(children[y]+1))", "# from debug import debug\r\nimport sys; input = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nn, x, y = map(int, input().split())\r\nx-=1; y-=1\r\ngraph = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n\ta, b = map(int, input().split())\r\n\tgraph[a-1].append(b-1)\r\n\tgraph[b-1].append(a-1)\r\nparent = [-1]*n\r\nq = deque([x])\r\nwhile q:\r\n\tnode = q.popleft()\r\n\tif node == y: break\r\n\tfor i in graph[node]:\r\n\t\tif i == parent[node]: continue\r\n\t\tparent[i] = node\r\n\t\tq.append(i)\r\nnode = y\r\ny_ = parent[y]\r\nwhile parent[node] != x: node = parent[node]\r\nparent = [-1]*n\r\nparent[x] = node\r\nparent[y] = y_\r\na, b = 0, 0\r\nq = deque([x])\r\nwhile q:\r\n\tnode = q.popleft()\r\n\ta+=1\r\n\tfor i in graph[node]:\r\n\t\tif i == parent[node]: continue\r\n\t\tparent[i] = node\r\n\t\tq.append(i)\r\nq = deque([y])\r\nwhile q:\r\n\tnode = q.popleft()\r\n\tb+=1\r\n\tfor i in graph[node]:\r\n\t\tif i == parent[node]: continue\r\n\t\tparent[i] = node\r\n\t\tq.append(i)\r\n\r\nans = n*(n-1) - a*b\r\nprint(ans)\r\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, x, y = gil()\r\nadj = [[] for _ in range(n+1)]\r\n\r\nfor _ in range(1, n):\r\n n1, n2 = gil()\r\n adj[n1].append(n2)\r\n adj[n2].append(n1)\r\n\r\nst = [x]\r\ndp = [0]*(n+1)\r\nvis = [0]*(n+1)\r\n\r\nwhile st:\r\n p = st[-1]\r\n if vis[p]:\r\n st.pop()\r\n dp[p] = 1\r\n for c in adj[p]:\r\n dp[p] += dp[c]\r\n else:\r\n vis[p] = 1\r\n for c in adj[p]:\r\n if not vis[c]:st.append(c)\r\n\r\n\r\nleft = dp[y]\r\n\r\nst = [y]\r\ndp = [0]*(n+1)\r\nvis = [0]*(n+1)\r\n\r\nwhile st:\r\n p = st[-1]\r\n if vis[p]:\r\n st.pop()\r\n dp[p] = 1\r\n for c in adj[p]:\r\n dp[p] += dp[c]\r\n else:\r\n vis[p] = 1\r\n for c in adj[p]:\r\n if not vis[c]:st.append(c)\r\n\r\n\r\nans = n*(n-1)\r\nans -= left*dp[x]\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "\r\nimport sys\r\nimport threading\r\nfrom collections import defaultdict\r\n\r\nn,x,y=list(map(int,input().split()))\r\nadj=defaultdict(list)\r\nfor _ in range(n-1):\r\n a,b=list(map(int,input().split()))\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n \r\n \r\n \r\ndef fun(node,par,dest,ans):\r\n cnt=1\r\n for ch in adj[node]:\r\n if ch != par:\r\n cnt+=fun(ch,node,dest,ans)\r\n if node==dest:\r\n ans[0]=cnt*ans[0]\r\n return cnt\r\n \r\n \r\n\r\n\r\n\r\ndef main():\r\n ans=[1]\r\n t=fun(x,0,y,ans)\r\n fun(y,0,x,ans)\r\n print(t*(t-1)-ans[0])\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() ", "import sys\ninput = sys.stdin.readline\n\n\ndef solve(n, x, y, graph):\n\n def dfs(x, y):\n stack = [x]\n visited = {x}\n while stack:\n node = stack.pop()\n for nei in graph[node]:\n if nei != y and nei not in visited:\n stack.append(nei)\n visited.add(nei)\n return len(visited)\n\n total = n*(n-1)\n numd1, numd2 = n - dfs(x, y), n - dfs(y, x)\n print(total - numd1 * numd2)\n\n\nn, x, y = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(n-1):\n a, b = map(int, input().split())\n graph[a-1].append(b-1)\n graph[b-1].append(a-1)\nsolve(n, x-1, y-1, graph)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,x,y = map(int, input().split())\r\nx-=1;y-=1\r\nP = [[] for _ in range(N)]\r\nfor _ in range(N-1):\r\n a,b = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append(b)\r\n P[b].append(a)\r\n\r\ncnt = [0]*N\r\nv = [(x,-1,0),(x,-1,1)]\r\nwhile v:\r\n i,p,t = v.pop()\r\n if t==1:\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,0))\r\n v.append((j,i,1))\r\n else:\r\n tmp = 1\r\n for j in P[i]:\r\n if j==p:continue\r\n tmp+=cnt[j]\r\n cnt[i]=tmp\r\ny1 = cnt[y]\r\n\r\ncnt = [0]*N\r\nv = [(y,-1,0),(y,-1,1)]\r\nwhile v:\r\n i,p,t = v.pop()\r\n if t==1:\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,0))\r\n v.append((j,i,1))\r\n else:\r\n tmp = 1\r\n for j in P[i]:\r\n if j==p:continue\r\n tmp+=cnt[j]\r\n cnt[i]=tmp\r\nx1 = cnt[x]\r\n\r\nprint(N*(N-1)-x1*y1)", " \r\ndef calculate_max_paths(edges, node, dest, par, cnt):\r\n ans = 1\r\n for child in edges.get(node, []):\r\n if child != par:\r\n ans += calculate_max_paths(edges, child, dest, node, cnt) \r\n if dest == node:\r\n cnt[0] = ans\r\n return ans\r\n \r\ndef main():\r\n from collections import defaultdict\r\n n, flower, bee = list(map(int, input().split()))\r\n edges = defaultdict(list)\r\n for _ in range(n-1):\r\n x, y = list(map(int, input().split()))\r\n edges[x].append(y)\r\n edges[y].append(x)\r\n bees, flowers = [0], [0]\r\n x = calculate_max_paths(edges, flower, bee, par=None, cnt=bees)\r\n y = calculate_max_paths(edges, bee, flower, par=None, cnt=flowers)\r\n print(x*(x-1) - bees[0]*flowers[0])\r\n\r\nif __name__==\"__main__\":\r\n import sys\r\n import threading\r\n sys.setrecursionlimit(10**6)\r\n threading.stack_size(10**8)\r\n t = threading.Thread(target=main)\r\n t.start()\r\n t.join() ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q, k = [s], 0\r\n dist = [inf] * (n + 1)\r\n dist[s] = 0\r\n while len(q) ^ k:\r\n i = q[k]\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == inf:\r\n dist[j] = di + 1\r\n q.append(j)\r\n k += 1\r\n return dist\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn, x, y = map(int, input().split())\r\ninf = pow(10, 9) + 1\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n G[a].append(b)\r\n G[b].append(a)\r\ndx, dy = bfs(x), bfs(y)\r\nd = dx[y]\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nsize = [1 for _ in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n for j in G[i]:\r\n if same(i, j) or dx[i] + dy[i] == dx[j] + dy[j] == d:\r\n continue\r\n unite(i, j)\r\nng = get_size(x) * get_size(y)\r\nans = n * (n - 1) - ng\r\nprint(ans)" ]

[ "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = {0: 1}\r\ncheck, q, ans = 0,0,0\r\nfor i in a:\r\n if i < m:\r\n q -= 1\r\n elif i > m:\r\n q += 1\r\n else:\r\n check = 1\r\n if check:\r\n ans += d.get(q,0)+d.get(q-1,0)\r\n else:\r\n new = d.get(q,0) + 1\r\n d[q] = new\r\nprint(ans)\r\n\r\n\r\n", "n = [i for i in input().split(\" \")]\r\nx = int(n[0])\r\ny = int(n[1])\r\nn = [int(i) for i in input().split(\" \")]\r\nanswer = 0\r\ntotal = 0\r\ncheck = False\r\nd = {0:1}\r\n\r\nfor i in n:\r\n if i == y:\r\n check = True\r\n elif i <= y:\r\n total -= 1\r\n elif i > y:\r\n total += 1\r\n \r\n if check:\r\n answer += d.get(total-1,0) + d.get(total,0)\r\n else:\r\n d[total] = d.get(total, 0) +1\r\nprint(answer)\n# Sun Oct 03 2021 20:44:20 GMT+0300 (Москва, стандартное время)\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 dp = [{0:1}, {}]\r\n t = 0\r\n tot = 0\r\n for a in A:\r\n if a == k:\r\n t = 1\r\n elif a > k:\r\n tot += 1\r\n else:\r\n tot -= 1\r\n dp[t][tot] = dp[t].get(tot, 0) + 1\r\n \r\n ans = 0\r\n for k, v in dp[0].items():\r\n tmp = dp[1].get(k, 0) + dp[1].get(k + 1, 0)\r\n ans += v * tmp\r\n print(ans)\r\n \r\nfor _ in range(1):\r\n main()", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\nfrom typing import Generic, Iterable, Tuple, TypeVar, Union, List\r\nT = TypeVar(\"T\")\r\n\r\n\r\nclass Node:\r\n\r\n def __init__(self, key, val: int):\r\n self.key = key\r\n self.val = val\r\n self.valsize = val\r\n self.size = 1\r\n self.left = None\r\n self.right = None\r\n self.balance = 0\r\n\r\n def __str__(self):\r\n if self.left is None and self.right is None:\r\n return f'key:{self.key, self.val, self.size, self.valsize}\\n'\r\n return f'key:{self.key, self.val, self.size, self.valsize},\\n left:{self.left},\\n right:{self.right}\\n'\r\n\r\n\r\nclass AVLTreeMultiSet(Generic[T]):\r\n\r\n def __init__(self, a: Iterable[T]=[]) -> None: \r\n self.node = None\r\n if a:\r\n self._build(a)\r\n\r\n def _rle(self, li: List[T]) -> List[Tuple[T, int]]:\r\n now = li[0]\r\n ret = [[now, 1]]\r\n for i in li[1:]:\r\n if i == now:\r\n ret[-1][1] += 1\r\n continue\r\n ret.append([i, 1])\r\n now = i\r\n return ret\r\n \r\n def _build(self, a: Iterable[T]) -> None:\r\n def sort(l: int, r: int) -> Tuple[Node, int]:\r\n mid = (l + r) >> 1\r\n node = Node(a[mid][0], a[mid][1])\r\n h = 0\r\n if l != mid:\r\n left, hl = sort(l, mid)\r\n node.left = left\r\n node.size += left.size\r\n node.valsize += left.valsize\r\n node.balance = hl\r\n h = hl\r\n if mid+1 != r:\r\n right, hr = sort(mid+1, r)\r\n node.right = right\r\n node.size += right.size\r\n node.valsize += right.valsize\r\n node.balance -= hr\r\n if hr > h:\r\n h = hr\r\n return node, h+1\r\n a = self._rle(sorted(a))\r\n self.node = sort(0, len(a))[0]\r\n\r\n def _rotate_L(self, node: Node) -> Node:\r\n u = node.left\r\n u.size = node.size\r\n u.valsize = node.valsize\r\n if u.left is None:\r\n node.size -= 1\r\n node.valsize -= u.val\r\n else:\r\n node.size -= u.left.size + 1\r\n node.valsize -= u.left.valsize + u.val\r\n node.left = u.right\r\n u.right = node\r\n if u.balance == 1:\r\n u.balance = 0\r\n node.balance = 0\r\n else:\r\n u.balance = -1\r\n node.balance = 1\r\n return u\r\n\r\n def _rotate_R(self, node: Node) -> Node:\r\n u = node.right\r\n u.size = node.size\r\n u.valsize = node.valsize\r\n if u.right is None:\r\n node.size -= 1\r\n node.valsize -= u.val\r\n else:\r\n node.size -= u.right.size + 1\r\n node.valsize -= u.right.valsize + u.val\r\n node.right = u.left\r\n u.left = node\r\n if u.balance == -1:\r\n u.balance = 0\r\n node.balance = 0\r\n else:\r\n u.balance = 1\r\n node.balance = -1\r\n return u\r\n\r\n def _update_balance(self, node: Node) -> None:\r\n if node.balance == 1:\r\n node.right.balance = -1\r\n node.left.balance = 0\r\n elif node.balance == -1:\r\n node.right.balance = 0\r\n node.left.balance = 1\r\n else:\r\n node.right.balance = 0\r\n node.left.balance = 0\r\n node.balance = 0\r\n\r\n def _rotate_LR(self, node: Node) -> Node:\r\n B = node.left\r\n E = B.right\r\n E.size = node.size\r\n E.valsize = node.valsize\r\n if E.right is None:\r\n node.size -= B.size\r\n node.valsize -= B.valsize\r\n B.size -= 1\r\n B.valsize -= E.val\r\n else:\r\n node.size -= B.size - E.right.size\r\n node.valsize -= B.valsize - E.right.valsize\r\n B.size -= E.right.size + 1\r\n B.valsize -= E.right.valsize + E.val\r\n B.right = E.left\r\n E.left = B\r\n node.left = E.right\r\n E.right = node\r\n self._update_balance(E)\r\n return E\r\n\r\n def _rotate_RL(self, node: Node) -> Node:\r\n C = node.right\r\n D = C.left\r\n D.size = node.size\r\n D.valsize = node.valsize\r\n if D.left is None:\r\n node.size -= C.size\r\n node.valsize -= C.valsize\r\n C.size -= 1\r\n C.valsize -= D.val\r\n else:\r\n node.size -= C.size - D.left.size\r\n node.valsize -= C.valsize - D.left.valsize\r\n C.size -= D.left.size + 1\r\n C.valsize -= D.left.valsize + D.val\r\n C.left = D.right\r\n D.right = C\r\n node.right = D.left\r\n D.left = node\r\n self._update_balance(D)\r\n return D\r\n\r\n def _kth_elm(self, k: int) -> Tuple[T, int]:\r\n if k < 0: k += self.__len__()\r\n node = self.node\r\n while True:\r\n t = node.val if node.left is None else node.val + node.left.valsize\r\n if t-node.val <= k < t:\r\n return node.key, node.val\r\n elif t > k:\r\n node = node.left\r\n else:\r\n node = node.right\r\n k -= t\r\n\r\n def _kth_elm_tree(self, k: int) -> Tuple[T, int]:\r\n if k < 0:\r\n k += self.len_elm()\r\n assert 0 <= k < self.len_elm()\r\n node = self.node\r\n while True:\r\n t = 0 if node.left is None else node.left.size\r\n if t == k:\r\n return node.key, node.val\r\n elif t > k:\r\n node = node.left\r\n else:\r\n node = node.right\r\n k -= t + 1\r\n\r\n def _discard(self, node: Node, path: List[Node], di: int) -> bool:\r\n fdi = 0\r\n if node.left is not None and node.right is not None:\r\n path.append(node)\r\n di <<= 1\r\n di |= 1\r\n lmax = node.left\r\n while lmax.right is not None:\r\n path.append(lmax)\r\n di <<= 1\r\n fdi <<= 1\r\n fdi |= 1\r\n lmax = lmax.right\r\n lmax_val = lmax.val\r\n node.key = lmax.key\r\n node.val = lmax_val\r\n node = lmax\r\n\r\n cnode = node.right if node.left is None else node.left\r\n if path:\r\n if di & 1:\r\n path[-1].left = cnode\r\n else:\r\n path[-1].right = cnode\r\n else:\r\n self.node = cnode\r\n return True\r\n\r\n while path:\r\n new_node = None\r\n pnode = path.pop()\r\n pnode.balance -= 1 if di & 1 else -1\r\n pnode.size -= 1\r\n pnode.valsize -= lmax_val if fdi & 1 else 1\r\n di >>= 1\r\n fdi >>= 1\r\n\r\n if pnode.balance == 2:\r\n new_node = self._rotate_LR(pnode) if pnode.left.balance < 0 else self._rotate_L(pnode)\r\n elif pnode.balance == -2:\r\n new_node = self._rotate_RL(pnode) if pnode.right.balance> 0 else self._rotate_R(pnode)\r\n elif pnode.balance != 0:\r\n break\r\n\r\n if new_node is not None:\r\n if not path:\r\n self.node = new_node\r\n return \r\n if di & 1:\r\n path[-1].left = new_node\r\n else:\r\n path[-1].right = new_node\r\n if new_node.balance != 0:\r\n break\r\n\r\n while path:\r\n pnode = path.pop()\r\n pnode.size -= 1\r\n pnode.valsize -= lmax_val if fdi & 1 else 1\r\n fdi >>= 1\r\n\r\n return True\r\n\r\n def discard(self, key: T, val: int=1) -> bool:\r\n path = []\r\n di = 0\r\n node = self.node\r\n while node is not None:\r\n if key == node.key:\r\n break\r\n elif key < node.key:\r\n path.append(node)\r\n di <<= 1\r\n di |= 1\r\n node = node.left\r\n else:\r\n path.append(node)\r\n di <<= 1\r\n node = node.right\r\n else:\r\n return False\r\n\r\n if val > node.val:\r\n val = node.val - 1\r\n node.val -= val\r\n node.valsize -= val\r\n for p in path:\r\n p.valsize -= val\r\n if node.val == 1:\r\n self._discard(node, path, di)\r\n else:\r\n node.val -= val\r\n node.valsize -= val\r\n for p in path:\r\n p.valsize -= val\r\n return True\r\n\r\n def discard_all(self, key: T) -> None:\r\n self.discard(key, self.count(key))\r\n return\r\n\r\n def add(self, key: T, val: int=1) -> None:\r\n if self.node is None:\r\n self.node = Node(key, val)\r\n return\r\n pnode = self.node\r\n di = 0\r\n path = []\r\n while pnode is not None:\r\n if key == pnode.key:\r\n pnode.val += val\r\n pnode.valsize += val\r\n for p in path:\r\n p.valsize += val\r\n return\r\n elif key < pnode.key:\r\n path.append(pnode)\r\n di <<= 1\r\n di |= 1\r\n pnode = pnode.left\r\n else:\r\n path.append(pnode)\r\n di <<= 1\r\n pnode = pnode.right\r\n if di & 1:\r\n path[-1].left = Node(key, val)\r\n else:\r\n path[-1].right = Node(key, val)\r\n new_node = None\r\n while path:\r\n pnode = path.pop()\r\n pnode.size += 1\r\n pnode.valsize += val\r\n pnode.balance += 1 if di & 1 else -1\r\n di >>= 1\r\n if pnode.balance == 0:\r\n break\r\n if pnode.balance == 2:\r\n new_node = self._rotate_LR(pnode) if pnode.left.balance < 0 else self._rotate_L(pnode)\r\n break\r\n elif pnode.balance == -2:\r\n new_node = self._rotate_RL(pnode) if pnode.right.balance> 0 else self._rotate_R(pnode)\r\n break\r\n if new_node is not None:\r\n if path:\r\n if di & 1:\r\n path[-1].left = new_node\r\n else:\r\n path[-1].right = new_node\r\n else:\r\n self.node = new_node\r\n for p in path:\r\n p.size += 1\r\n p.valsize += val\r\n return\r\n\r\n def count(self, key: T) -> int:\r\n node = self.node\r\n while node is not None:\r\n if node.key == key:\r\n return node.val\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n node = node.right\r\n return 0\r\n\r\n '''Find the largest element <= key, or None if it doesn't exist. / O(logN)'''\r\n def le(self, key: T) -> Union[T, None]:\r\n res = None\r\n node = self.node\r\n while node is not None:\r\n if key == node.key:\r\n res = key\r\n break\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n res = node.key\r\n node = node.right\r\n return res\r\n\r\n '''Find the largest element < key, or None if it doesn't exist. / O(logN)'''\r\n def lt(self, key: T) -> Union[T, None]:\r\n res = None\r\n node = self.node\r\n while node is not None:\r\n if key <= node.key:\r\n node = node.left\r\n else:\r\n res = node.key\r\n node = node.right\r\n return res\r\n\r\n '''Find the smallest element >= key, or None if it doesn't exist. / O(logN)'''\r\n def ge(self, key: T) -> Union[T, None]:\r\n res = None\r\n node = self.node\r\n while node is not None:\r\n if key == node.key:\r\n res = key\r\n break\r\n elif key < node.key:\r\n res = node.key\r\n node = node.left\r\n else:\r\n node = node.right\r\n return res\r\n\r\n '''Find the smallest element > key, or None if it doesn't exist. / O(logN)'''\r\n def gt(self, key: T) -> Union[T, None]:\r\n res = None\r\n node = self.node\r\n while node is not None:\r\n if key < node.key:\r\n res = node.key\r\n node = node.left\r\n else:\r\n node = node.right\r\n return res\r\n\r\n '''Count the number of elements < key. / O(logN)'''\r\n def index(self, key: T) -> int:\r\n k = 0\r\n node = self.node\r\n while node is not None:\r\n if key == node.key:\r\n if node.left is not None:\r\n k += node.left.valsize\r\n break\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n k += node.val if node.left is None else node.left.valsize + node.val\r\n node = node.right\r\n return k\r\n\r\n '''Count the number of elements <= key. / O(logN)'''\r\n def index_right(self, key: T) -> int:\r\n k = 0\r\n node = self.node\r\n while node is not None:\r\n if key == node.key:\r\n k += node.val if node.left is None else node.left.valsize + node.val\r\n break\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n k += node.val if node.left is None else node.left.valsize + node.val\r\n node = node.right\r\n return k\r\n\r\n '''Count the number of keys < key. / O(logN)'''\r\n def index_keys(self, key: T) -> int:\r\n k = 0\r\n node = self.node\r\n while node:\r\n if key == node.key:\r\n if node.left is not None:\r\n k += node.left.size\r\n break\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n k += node.val if node.left is None else node.left.size + node.val\r\n node = node.right\r\n return k\r\n\r\n '''Count the number of keys <= key. / O(logN)'''\r\n def index_right_keys(self, key: T) -> int:\r\n k = 0\r\n node = self.node\r\n while node:\r\n if key == node.key:\r\n k += node.val if node.left is None else node.left.size + node.val\r\n break\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n k += node.val if node.left is None else node.left.size + node.val\r\n node = node.right\r\n return k\r\n\r\n def pop(self, k: int=-1) -> T:\r\n if k < 0: k += self.node.valsize\r\n node = self.node\r\n path = []\r\n if k == self.node.valsize-1:\r\n while node.right is not None:\r\n path.append(node)\r\n node = node.right\r\n x = node.key\r\n if node.val == 1:\r\n self._discard(node, path, 0)\r\n else:\r\n node.val -= 1\r\n node.valsize -= 1\r\n for p in path:\r\n p.valsize -= 1\r\n return x\r\n di = 0\r\n while True:\r\n t = node.val if node.left is None else node.val + node.left.valsize\r\n if t-node.val <= k < t:\r\n x = node.key\r\n break\r\n elif t > k:\r\n path.append(node)\r\n di <<= 1\r\n di |= 1\r\n node = node.left\r\n else:\r\n path.append(node)\r\n di <<= 1\r\n node = node.right\r\n k -= t\r\n if node.val == 1:\r\n self._discard(node, path, di)\r\n else:\r\n node.val -= 1\r\n node.valsize -= 1\r\n for p in path:\r\n p.valsize -= 1\r\n return x\r\n\r\n def popleft(self) -> T:\r\n node = self.node\r\n path = []\r\n while node.left is not None:\r\n path.append(node)\r\n node = node.left\r\n x = node.key\r\n if node.val == 1:\r\n self._discard(node, path, (1<<len(path))-1)\r\n else:\r\n node.val -= 1\r\n node.valsize -= 1\r\n for p in path:\r\n p.valsize -= 1\r\n return x\r\n\r\n def items(self):\r\n for i in range(self.len_elm()):\r\n yield self._kth_elm_tree(i)\r\n\r\n def keys(self):\r\n for i in range(self.len_elm()):\r\n yield self._kth_elm_tree(i)[0]\r\n\r\n def values(self):\r\n for i in range(self.len_elm()):\r\n yield self._kth_elm_tree(i)[1]\r\n\r\n def len_elm(self) -> int:\r\n return 0 if self.node is None else self.node.size\r\n\r\n def show(self) -> None:\r\n print('{' + ', '.join(map(lambda x: f'{x[0]}: {x[1]}', self.tolist_items())) + '}')\r\n\r\n def get_elm(self, k: int) -> T:\r\n return self._kth_elm_tree(k)[0]\r\n\r\n def tolist(self) -> List[T]:\r\n a = []\r\n if self.node is None:\r\n return a\r\n def rec(node):\r\n if node.left is not None:\r\n rec(node.left)\r\n a.extend([node.key]*node.val)\r\n if node.right is not None:\r\n rec(node.right)\r\n rec(self.node)\r\n return a\r\n\r\n def tolist_items(self) -> List[Tuple[T, int]]:\r\n a = []\r\n if self.node is None:\r\n return a\r\n def rec(node):\r\n if node.left is not None:\r\n rec(node.left)\r\n a.append((node.key, node.val))\r\n if node.right is not None:\r\n rec(node.right)\r\n rec(self.node)\r\n return a\r\n\r\n def __getitem__(self, k: int):\r\n return self._kth_elm(k)[0]\r\n\r\n def __contains__(self, key: T):\r\n node = self.node\r\n while node:\r\n if node.key == key:\r\n return True\r\n elif key < node.key:\r\n node = node.left\r\n else:\r\n node = node.right\r\n return False\r\n\r\n def __iter__(self):\r\n self.__iter = 0\r\n return self\r\n\r\n def __next__(self):\r\n if self.__iter == self.__len__():\r\n raise StopIteration\r\n res = self._kth_elm(self.__iter)\r\n self.__iter += 1\r\n return res\r\n\r\n def __reversed__(self):\r\n for i in range(self.__len__()):\r\n yield self._kth_elm(-i-1)\r\n\r\n def __len__(self):\r\n return 0 if self.node is None else self.node.valsize\r\n\r\n def __bool__(self):\r\n return self.node is not None\r\n\r\n def __str__(self):\r\n return '{' + ', '.join(map(str, self.tolist())) + '}'\r\n\r\n def __repr__(self):\r\n return 'AVLTreeMultiSet(' + str(self) + ')'\r\n\r\n\r\n# ----------------------- #\r\n\r\nn, m = map(int, input().split())\r\nP = list(map(int, input().split()))\r\n\r\nkeep = AVLTreeMultiSet()\r\nmi = P.index(m)\r\n\r\nans = 0\r\ncnt = AVLTreeMultiSet()\r\nQ = P[:mi+1][::-1]\r\nfor i, q in enumerate(Q):\r\n keep.add(q)\r\n cnt.add(keep.index(m)-(len(keep)-keep.index_right(m)))\r\nkeep = AVLTreeMultiSet()\r\nfor i in range(mi, n):\r\n keep.add(P[i])\r\n a = keep.index(m)\r\n b = len(keep)-keep.index_right(m)\r\n ans += cnt.count(b-a)\r\n ans += cnt.count(b-a-1)\r\nprint(ans)\r\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\nn, m = ints()\r\na = ints()\r\nidx = a.index(m)\r\n\r\nb = collections.defaultdict(int)\r\nb[str(0)] += 1\r\nbal = 0\r\nfor i in range(idx + 1, n):\r\n if a[i] > m: bal += 1\r\n else: bal -= 1\r\n b[str(bal)] += 1\r\n\r\nans = b[str(0)] + b[str(1)]\r\nbal = 0\r\nfor i in range(idx - 1, -1, -1):\r\n if a[i] > m: bal += 1\r\n else: bal -= 1\r\n ans += b[str(-bal)]\r\n ans += b[str(-(bal - 1))]\r\nprint(ans)", "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\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass SegmentTree:\r\n def __init__(self, n, op, base):\r\n self.n = n\r\n self.op = op\r\n self.base = base\r\n self.tree = [base] * (2 * n)\r\n\r\n def query(self, left, right):\r\n ans = self.base\r\n left, right = left + self.n, right + self.n\r\n while left <= right:\r\n if left % 2 == 1:\r\n ans = self.op(ans, self.tree[left])\r\n left += 1\r\n if right % 2 == 0:\r\n ans = self.op(ans, self.tree[right])\r\n right -= 1\r\n left //= 2\r\n right //= 2\r\n return ans\r\n\r\n def build(self, A):\r\n for i in range(self.n):\r\n self.tree[i + self.n] = A[i]\r\n\r\n for i in range(self.n - 1, 0, -1):\r\n self.tree[i] = self.op(self.tree[2 * i], self.tree[2 * i + 1])\r\n\r\n def update(self, i, val):\r\n i += self.n\r\n self.tree[i] += val\r\n while i > 1:\r\n i >>= 1\r\n self.tree[i] = self.op(self.tree[2 * i], self.tree[2 * i + 1])\r\n\r\n\r\ndef solve():\r\n n, x = map(int, input().split())\r\n vals = list(map(int, input().split()))\r\n\r\n def count(x):\r\n A = [+1 if v > x else -1 for v in vals]\r\n P = list(accumulate(A, initial=0))\r\n ranks = {x: i for i, x in enumerate(sorted(set(P)))}\r\n\r\n st = SegmentTree(len(ranks), operator.__add__, 0)\r\n ans = 0\r\n for v in P:\r\n pos_count_lte = st.query(0, ranks[v] - 1)\r\n ans += pos_count_lte\r\n st.update(ranks[v], 1)\r\n\r\n return ans\r\n\r\n print(count(x - 1) - count(x))\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", "n,m=map(int,input().split())\r\nnlist=list(map(int,input().split()))\r\ndef gorem(m):\r\n ans=0\r\n s=[0]*(2*n+1)\r\n s[n]=1\r\n summ=n\r\n add=0#recode the number lower that than in the current position\r\n for x in nlist:\r\n if x<m:\r\n summ-=1\r\n add-=s[summ]\r\n else:\r\n add+=s[summ]\r\n summ+=1\r\n ans+=add\r\n s[summ]+=1\r\n return ans\r\nprint(gorem(m)-gorem(m+1))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nd={}\r\ns=0\r\nc=0\r\nfound=0\r\nd[0]=1\r\nfor i in range(n):\r\n if(l[i]<m):\r\n s-=1\r\n elif(l[i]>m):\r\n s+=1\r\n if(l[i]==m):\r\n found=1\r\n if(found==1):\r\n if(s in d):\r\n c+=d[s]\r\n if(s-1 in d):\r\n c+=d[s-1]\r\n else:\r\n if(s in d):\r\n d[s]+=1\r\n else:\r\n d[s]=1\r\nprint(c)", "# https://codeforces.com/contest/1005\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, m = map(int, input().split())\np = list(map(int, input().split()))\nidx_m = p.index(m)\n\nsmaller = [0] * (n + 1)\nlarger = [0] * (n + 1)\nfor i in range(n):\n smaller[i + 1] = smaller[i] + int(p[i] <= m)\n larger[i + 1] = larger[i] + int(p[i] >= m)\n\nbalance_before = [0] * (2 * n + 2)\nfor i in range(idx_m + 1):\n b = (larger[idx_m + 1] - larger[i]) - (smaller[idx_m + 1] - smaller[i])\n balance_before[b + n] += 1\n\nbalance_after = [0] * (2 * n + 2)\nfor i in range(idx_m, n):\n b = (larger[i + 1] - larger[idx_m]) - (smaller[i + 1] - smaller[idx_m])\n balance_after[b + n] += 1\n\nans = 0\nfor i in range(-n, n + 1):\n ans += balance_before[i + n] * (balance_after[-i + n] + balance_after[-i + 1 + n])\nprint(ans)\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(P, m):\r\n n = len(P)\r\n m_index = None\r\n g = [0 for i in range(2*n+2)]\r\n for i in range(n):\r\n if P[i]==m:\r\n m_index = i \r\n break\r\n curr = [0, 0]\r\n g[n] = 1\r\n for i in range(m_index-1, -1, -1):\r\n if P[i] > m:\r\n curr[1]+=1\r\n elif P[i] < m:\r\n curr[0]+=1\r\n left = curr[1]-curr[0]+n\r\n g[left]+=1\r\n curr = [0, 0]\r\n answer = g[n]+g[n+1]\r\n for i in range(m_index+1, n):\r\n \"\"\"\r\n right-n = (> P[i])-(< P[i]) on the right\r\n left-n = (> P[i])-(< P[i]) on the left\r\n \r\n we need right-n+left-n = 0 or 1\r\n right+left = 2n or 2n+1\r\n \"\"\"\r\n if P[i] > m:\r\n curr[1]+=1\r\n elif P[i] < m:\r\n curr[0]+=1\r\n right = curr[1]-curr[0]+n\r\n answer+=g[2*n-right]\r\n answer+=g[2*n+1-right]\r\n print(answer)\r\n \r\n \r\n \r\nn, m = [int(x) for x in input().split()]\r\nP = [int(x) for x in input().split()]\r\nprocess(P, m)\r\n \r\n ", "import math\r\nimport random \r\nimport time\r\n \r\ndef binary_search(vector,valoarea):\r\n \r\n left=0\r\n right=len(vector)-1\r\n \r\n while left<=right:\r\n \r\n \r\n centru=(left+right)//2\r\n # print(left,right,centru,vector[centru])\r\n \r\n if vector[centru]<valoarea:\r\n left=centru+1\r\n else:\r\n right=centru-1\r\n \r\n# print(left,right,centru,vector[centru]) \r\n return left\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nfrom collections import defaultdict\r\n \r\ndef main():\r\n answ=[]\r\n pp=10**9\r\n rest=10**9+7\r\n #teste=int(input())\r\n \r\n \r\n for gg in range(1):\r\n \r\n \r\n n,m=list(map(int,input().split()))\r\n vector=list(map(int,input().split()))\r\n \r\n poz_m=-1\r\n \r\n mari=[0]*(n+1)\r\n mici=[0]*(n+1)\r\n \r\n \r\n \r\n if vector[0]<m:\r\n mici[1]=1\r\n \r\n \r\n elif vector[0]>m:\r\n mari[1]=1\r\n else:\r\n poz_m=0\r\n \r\n for i in range(1,n):\r\n if vector[i]<m:\r\n mici[i+1]=mici[i]+1\r\n mari[i+1]=mari[i]\r\n elif vector[i]>m:\r\n mici[i+1]=mici[i]\r\n mari[i+1]=1+mari[i]\r\n else:\r\n poz_m=i\r\n # mici[i+1]=mici[i]\r\n #mari[i+1]=mari[i]\r\n break\r\n \r\n dictionar=defaultdict(int)\r\n \r\n for j in range(poz_m+1,n):\r\n # print(\"j=\",j,vector[j],mari)\r\n \r\n \r\n if vector[j]>m:\r\n mari[j+1]=1+mari[j]\r\n mici[j+1]=mici[j]\r\n else:\r\n mari[j+1]=mari[j]\r\n mici[j+1]=1+mici[j]\r\n \r\n \r\n dictionar[mici[j+1]-mari[j+1]]+=1\r\n \r\n # print(dictionar)\r\n# print(poz_m)\r\n \r\n # print(mari)\r\n# print(mici)\r\n \r\n cate=0\r\n #for i in range(0,poz_m+1):\r\n # mici_inainte=\r\n \r\n for i in range(1,poz_m+2):\r\n mici_inainte=mici[poz_m]-mici[i-1]\r\n mari_inainte=mari[poz_m]-mari[i-1]\r\n \r\n # print(vector[i-1],mici_inainte,mari_inainte)\r\n if mici_inainte-mari_inainte==0 or mici_inainte-mari_inainte==-1:\r\n cate+=1\r\n target_unu=0-(mici_inainte-mari_inainte)\r\n target_doi=-1-(mici_inainte-mari_inainte)\r\n \r\n cate+=dictionar[target_unu]\r\n cate+=dictionar[target_doi]\r\n \r\n print(max(1,cate)) \r\n \r\n \r\nmain()", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nc,h={},0\r\nr,s,c[0]=0,0,1\r\ndef getval(d,n):\r\n if n not in d:\r\n return 0\r\n return d[n]\r\nfor i in range(n):\r\n if p[i]<m:\r\n s-=1\r\n elif p[i]>m:\r\n s+=1\r\n if p[i]==m:\r\n h=1\r\n if h:\r\n r+=getval(c,s)+getval(c,s-1)\r\n else:\r\n c[s]=getval(c,s)+1\r\nprint(r)\r\n", "a = list(map(int, input().split()))\r\nn = a[0]\r\nm = a[1]\r\nt = list(map(int, input().split()))\r\npref = 0\r\nchecker = False\r\nhelper = dict()\r\nhelper[0] = 1\r\nanswer = 0\r\nfor i in range(n):\r\n if t[i] < m:\r\n pref -= 1\r\n elif t[i] > m:\r\n pref += 1\r\n if t[i] == m:\r\n checker = True\r\n if checker:\r\n if pref not in helper:\r\n helper[pref] = 0\r\n if pref - 1 not in helper:\r\n helper[pref-1] = 0\r\n answer += helper[pref] + helper[pref-1]\r\n else:\r\n if pref not in helper:\r\n helper[pref] = 1\r\n else:\r\n helper[pref] += 1\r\n\r\nprint(answer)", "ma = {0:1}\r\nn, m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\ns, fla, ans=0,False,0\r\nfor v in arr:\r\n if v == m: fla = True\r\n elif v < m: s-= 1\r\n elif v > m: s+= 1\r\n if fla:\r\n ans += ma.get(s, 0) + ma.get(s-1, 0)\r\n else:\r\n ma[s] = ma.get(s, 0) + 1\r\nprint(ans)", "from itertools import accumulate\nfrom collections import Counter\n\n\ns = input()\ns = s.split(' ')\nm = int(s[1])\n\nt = input()\nt = t.split(' ')\nt = [int(x) for x in t]\n\nlocation = t.index(m)\n\nright = []\nfor i in range(location+1, len(t)):\n if t[i] > m:\n right.append(1)\n else:\n right.append(-1)\nright_cumulative_sum = list(accumulate(right))\n\nleft = []\nfor i in range(location):\n if t[i] > m:\n left.append(1)\n else:\n left.append(-1)\nleft = left[::-1]\nleft_cumulative_sum = list(accumulate(left))\n\nright_count = Counter(right_cumulative_sum)\nleft_count = Counter(left_cumulative_sum)\nright_count[0] += 1\nleft_count[0] += 1\nright_count = dict(right_count)\nleft_count = dict(left_count)\n\namount = 0\nfor key in right_count:\n if -key in left_count:\n amount += right_count[key]*left_count[-key]\n if -key+1 in left_count:\n amount += right_count[key]*left_count[-key+1]\n\nprint(amount)\n\n# Sat Oct 02 2021 19:37:42 GMT+0300 (Москва, стандартное время)\n", "def_1 = [i for i in input().split(\" \")]\r\ndef_x = [int(i) for i in input().split(\" \")]\r\nans = 0\r\nsumma = 0\r\ncheck = False\r\nd = {0:1}\r\n\r\nfor i in def_x:\r\n if i == int(def_1[1]):\r\n check = True\r\n elif i < int(def_1[1]):\r\n summa -= 1\r\n elif i > int(def_1[1]):\r\n summa += 1\r\n \r\n if check:\r\n ans += d.get(summa-1,0) + d.get(summa,0)\r\n else:\r\n d[summa] = d.get(summa, 0) +1\r\nprint(ans)\r\n\n# Sun Oct 03 2021 20:15:23 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\nclass SegmentTree:\r\n def __init__(self, n, op, base):\r\n self.n = n\r\n self.op = op\r\n self.base = base\r\n self.tree = [base] * (2 * n)\r\n\r\n def query(self, left, right):\r\n ans = self.base\r\n left, right = left + self.n, right + self.n\r\n while left <= right:\r\n if left % 2 == 1:\r\n ans = self.op(ans, self.tree[left])\r\n left += 1\r\n if right % 2 == 0:\r\n ans = self.op(ans, self.tree[right])\r\n right -= 1\r\n left //= 2\r\n right //= 2\r\n return ans\r\n\r\n def update(self, i, val):\r\n i += self.n\r\n self.tree[i] += val\r\n while i > 1:\r\n i >>= 1\r\n self.tree[i] = self.op(self.tree[2 * i], self.tree[2 * i + 1])\r\n\r\n\r\ndef solve():\r\n n, median = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n\r\n def count(target):\r\n B = [+1 if x <= target else -1 for x in A]\r\n P = list(accumulate(B, initial=0))\r\n\r\n min_val = min(P)\r\n P = [abs(min_val) + x for x in P]\r\n mx = max(P)\r\n\r\n st = SegmentTree(mx + 1, operator.__add__, 0)\r\n ans = 0\r\n for v in P:\r\n pos_count_lte = st.query(0, v)\r\n ans += pos_count_lte\r\n st.update(v, 1)\r\n\r\n return ans\r\n\r\n print(count(median) - count(median - 1))\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" ]

[ "n, a, b, c = map(int, input().split())\r\n\r\ntemp = 0\r\n\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if i*a + j*b <= n:\r\n if (n - (i*a + j*b)) % c == 0:\r\n flag = i + j + (n - (i*a + j*b)) // c\r\n if flag > temp and flag != 0:\r\n temp = flag\r\n\r\nprint(temp)\r\n\r\n ", "n , a , b , c = map(int,input().split())\r\nx = min(a,b,c)\r\nz = max(a,b,c)\r\ny = a+b+c - x - z\r\n\r\nans = 0\r\nfor i in range(n):\r\n c = i*z\r\n if(c>n):\r\n break\r\n else:\r\n for j in range(n):\r\n b = j*y\r\n if(b+c>n):\r\n break\r\n else:\r\n if((n-b-c)%x==0):\r\n ans = max(ans,i+j+((n-b-c)//x))\r\n break\r\n \r\nprint(ans)", "n, a, b, c = map(int, input().split())\r\nlst = list(set([a, b, c]))\r\ndp = [0] * (n + 1)\r\ndp[0] = 1\r\nfor k in range(n + 1):\r\n for i in range(len(lst)):\r\n if (k + lst[i]) <= n and dp[k] != 0:\r\n dp[k + lst[i]] = max(dp[k + lst[i]], dp[k] + 1)\r\n\r\nprint(dp[n] - 1)\r\n", "n, a, b, c = input().split()\r\n\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\ndp = [-float('inf')] * (n+1)\r\n\r\ndef iterative_soln(length):\r\n dp[0] = 0\r\n for i in range(1, length+1):\r\n if i >= a:\r\n dp[i] = max(dp[i], 1+ dp[i-a])\r\n if i >= b:\r\n dp[i] = max(dp[i], 1+ dp[i-b])\r\n if i >= c:\r\n dp[i] = max(dp[i], 1+ dp[i-c])\r\n\r\n return dp[length]\r\nprint(iterative_soln(n))", "\r\n\r\n\r\nn, a, b, c = map(int, input().split())\r\ndp = [0] + [-1e9]*5000\r\n\r\nfor i in range(1, n + 1):\r\n dp[i] = max(dp[i - a], dp[i - b], dp[i - c]) + 1\r\n\r\nprint(dp[n])", "n, a, b, c = map(int, input().split())\r\n\r\nres = [-1] * (n + 1)\r\nres[0] = 0\r\n\r\nfor i in range(1, n + 1):\r\n cur = -1\r\n if i >= a:\r\n cur = max(cur, res[i - a])\r\n if i >= b:\r\n cur = max(cur, res[i - b])\r\n if i >= c:\r\n cur = max(cur, res[i - c])\r\n if cur > -1:\r\n cur += 1\r\n res[i] = cur\r\n\r\nprint(res[n])", "n, a, b, c = map(int, input().split())\r\nlength = sorted([a, b, c])\r\nnums = [0] * 8000\r\nnums[a] = 1\r\nnums[b] = 1\r\nnums[c] = 1\r\nfor i in range(1, n):\r\n for j in length:\r\n if nums[i] > 0:\r\n nums[i + j] = max(nums[i] + 1, nums[i + j])\r\nprint(nums[n])", "n, a, b, c = map(int, input().split())\r\n\r\n# Initialize dp array with -1\r\ndp = [-1] * (n + 1)\r\n\r\n# Base case: we can obtain 0 ribbon pieces with 0 length ribbon\r\ndp[0] = 0\r\n\r\n# Compute dp[i] for i = 1 to n\r\nfor i in range(1, n + 1):\r\n if i >= a and dp[i - a] != -1:\r\n dp[i] = max(dp[i], dp[i - a] + 1)\r\n if i >= b and dp[i - b] != -1:\r\n dp[i] = max(dp[i], dp[i - b] + 1)\r\n if i >= c and dp[i - c] != -1:\r\n dp[i] = max(dp[i], dp[i - c] + 1)\r\n\r\n# Print the maximum number of ribbon pieces\r\nprint(dp[n])\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()\r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\ndp = [-1] *( n + 1)\r\ndp[0] = 0\r\n\r\na,b,c = sorted([a,b,c])\r\n\r\nfor increment in [a,b,c]:\r\n for i in range(0, n+1):\r\n if dp[i] != -1 and i + increment <= n:\r\n dp[i + increment] = max(dp[i + increment], dp[i] + 1)\r\nprint(dp[n])\r\n", "def cut_ribbon(n, a, b, c):\r\n dp = [0] + [-1] * n\r\n for i in range(1, n+1):\r\n if i >= a and dp[i-a] != -1:\r\n dp[i] = max(dp[i], dp[i-a]+1)\r\n if i >= b and dp[i-b] != -1:\r\n dp[i] = max(dp[i], dp[i-b]+1)\r\n if i >= c and dp[i-c] != -1:\r\n dp[i] = max(dp[i], dp[i-c]+1)\r\n return dp[n]\r\n\r\nn, a, b, c = map(int, input().split())\r\nprint(cut_ribbon(n, a, b, c))\r\n", "def Cut_Ribbon1():\r\n #we want xa + yb + zc = n. we want to find solutions for (x,y,z) such that (x+y+z) is maximum and x,y,z should be integer\r\n #\r\n list1 = [int(x) for x in input().split(' ')]\r\n n = list1[0]\r\n a = list1[1]\r\n b = list1[2]\r\n c = list1[3] \r\n\r\n cut_sizes = [a,b,c]\r\n a_pieces_max = n//a\r\n b_pieces_max = n//b \r\n \r\n max = 0 \r\n\r\n for a_pieces in range(0,a_pieces_max+1):\r\n for b_pieces in range(0,b_pieces_max+1):\r\n z_value =(n - (a_pieces*a) - (b_pieces*b))/c \r\n if z_value != int(z_value) or (z_value<0):\r\n continue \r\n else:\r\n num_pieces = a_pieces + b_pieces + z_value \r\n if max < num_pieces:\r\n max = num_pieces\r\n \r\n print(int(max)) \r\n return\r\n\r\n\r\n\r\nCut_Ribbon1() ", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\ndef counter(a):\r\n c = defaultdict(lambda : 0) # way faster than Counter\r\n for el in a:\r\n c[el] += 1\r\n return c\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\ndef si(): return int(input())\r\ndef st(): return input()\r\n\r\n# DO NOT EDIT ABOVE THIS\r\nn, a, b, c = inp()\r\n\r\ndp = [-math.inf] * (n + 1)\r\ndp[0] = 0\r\n\r\nfor i in range(1, len(dp)):\r\n a_cut = 1 + dp[i - a] if i >= a else -math.inf\r\n b_cut = 1 + dp[i - b] if i >= b else -math.inf\r\n c_cut = 1 + dp[i - c] if i >= c else -math.inf\r\n\r\n dp[i] = max(a_cut, b_cut, c_cut)\r\n\r\nprint(dp[-1])\r\n\r\n\r\n", "n,a,b,c = map(int,input().split())\r\nres = 0\r\nfor i in range(4001):\r\n x = n - i*a\r\n if x < 0:\r\n continue\r\n else:\r\n for j in range(4001):\r\n y = x - j*b\r\n if y < 0:\r\n continue\r\n if y % c == 0:\r\n z = y // c\r\n res = max(res, i+j+z)\r\n\r\nprint(res)\r\n", "def ans(n,a,b,c):\r\n i=n//a+1\r\n while i>=0:\r\n rem1=n-(a*i)\r\n j=rem1//b\r\n while j>=0:\r\n rem2=rem1-(b*j)\r\n if rem2%c==0:\r\n return (i+j+(rem2//c))\r\n j-=1\r\n i-=1\r\n return 0\r\nn,a,b,c=map(int,input().split())\r\nprint(max(ans(n, a, b, c),ans(n, a, c, b),ans(n, b, a, c),ans(n, b, c, a),ans(n, c, a, b),ans(n, c, b, a)))", "def solve(n, a, b, c):\r\n dp = [-float('inf')]*(n+1); dp[0] = 0\r\n for x in range(1, n+1):\r\n if x >= a and dp[x-a] != -float('inf'): dp[x] = max(dp[x], dp[x-a]+1)\r\n if x >= b and dp[x-b] != -float('inf'): dp[x] = max(dp[x], dp[x-b] + 1)\r\n if x >= c and dp[x-c] != -float('inf'): dp[x] = max(dp[x], dp[x-c]+1)\r\n return dp[n]\r\nn, a, b, c = map(int, input().split())\r\nprint(solve(n, a, b, c))", "n, a, b, c = list(map(int, input().split()))\r\ncuts = [a, b, c]\r\ndp = [-1] * (n + 1)\r\ndp[0] = 0\r\nfor i in range(1, n + 1):\r\n for cut in cuts:\r\n if i - cut >= 0:\r\n dp[i] = max(dp[i], dp[i - cut] + 1) if dp[i - cut] != - 1 else dp[i]\r\nprint(dp[-1])\r\n", "import sys\r\nsys.setrecursionlimit(10000)\r\nn,*l=map(int,input().split())\r\nl=sorted((l))\r\ng=[-1]*4009\r\no=0\r\ndef a(n,rem):\r\n global g,o\r\n if n<0:\r\n return float(\"-inf\")\r\n if n==0:\r\n if rem>o:\r\n o=rem\r\n return rem\r\n if g[n]!=-1:\r\n return g[n]\r\n p1=a(n-l[0],rem+1)\r\n p2=a(n-l[1],rem+1)\r\n p3=a(n-l[2],rem+1)\r\n g[n]=rem\r\n(a(n,0))\r\n\r\nprint(o)", "arg = input().split(\" \")\r\nn =int(arg[0])\r\na=int(arg[1])\r\nb=int(arg[2])\r\nc=int(arg[3])\r\ndp=[-1] * (n+1)\r\ndp[0] = 0\r\ndef solve(n):\r\n for i in range(len(dp)):\r\n res = float(\"-inf\")\r\n if i >= a: res = max(res,dp[i-a]+1)\r\n if i >= b: res = max(res,dp[i-b]+1)\r\n if i >= c: res = max(res,dp[i-c]+1)\r\n if res > 0:\r\n dp[i]=res\r\n \r\n return dp[n]\r\n\r\n\r\nprint(solve(n))", "# https://codeforces.com/problemset/problem/189/A\ninputs = list(map(int, input().split()))\nlength = inputs[0]\na, b, c = inputs[1], inputs[2], inputs[3]\ndp = [0]*(length+1)\nfor i in range(1, length+1):\n if i < a or dp[i-a] == -1:\n x = -1\n else:\n x = dp[i-a]\n if i < b or dp[i - b] == -1:\n y = -1\n else:\n y = dp[i - b]\n if i < c or dp[i-c] == -1:\n z = -1\n else:\n z = dp[i-c]\n if max(x, y, z) == -1:\n dp[i] = -1\n else:\n dp[i] = max(x, y, z) + 1\nprint(dp[-1])", "n,a,b,c = map(int,input().split())\r\ndp = [0]+[-4000]*4000\r\nfor i in range(1,n+1):\r\n dp[i] = max(dp[i-a], dp[i-b], dp[i-c]) + 1\r\nprint(dp[n])", "n, a, b, c = map(int, input().split())\r\ndp = [-float('inf')] * (n + 1)\r\ndp[0] = 0\r\nfor i in range(1, n + 1):\r\n for cut in [a, b, c]:\r\n if i >= cut and dp[i - cut] != -float('inf'):\r\n dp[i] = max(dp[i], 1 + dp[i - cut])\r\nprint(dp[n])\r\n", "l,a,b,c=map(int,input().split())\r\nlength=[a,b,c]\r\nlength.sort()\r\nmed=length[1]\r\nmaximum=length[-1]\r\nminimum=length[0]\r\nresult=0\r\nx=a*b*c\r\nfor i in range(l//minimum,max(-1,(l-x)//minimum-1),-1):\r\n ll=l-i*minimum\r\n for j in range(ll//med,max(-1,(ll-x)//med-1),-1):\r\n lll=ll-j*med\r\n for k in range(lll//maximum,max(-1,(lll-x)//maximum-1),-1):\r\n if lll%maximum==0:\r\n result=max(i+j+k,result)\r\nprint(result)", "import os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nfrom heapq import *\r\n\r\nmod = 1000000007\r\nINF = float(\"inf\")\r\n\r\ndef swap(a,b):\r\n temp=a\r\n a=b\r\n b=temp\r\n\r\ndef nCr(n, r):\r\n return (fact(n) / (fact(r)\r\n * fact(n - r)))\r\n\r\ndef fact(n):\r\n res = 1\r\n\r\n for i in range(2, n + 1):\r\n res = res * i\r\n\r\n return res\r\n\r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n ans = []\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n ans.append(p)\r\n return ans\r\n\r\n\r\ndef nextPowerOf2(n):\r\n count = 0\r\n if (n and not (n & (n - 1))):\r\n return n\r\n\r\n while (n != 0):\r\n n >>= 1\r\n count += 1\r\n\r\n return 1 << count\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\ndef primeFactors(n):\r\n res = []\r\n while n % 2 == 0:\r\n res.append(2)\r\n n = n // 2\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n res.append(i)\r\n n = n // i\r\n if n > 2:\r\n res.append(n)\r\n return res\r\n\r\n\r\ndef upper_bound(arr, target):\r\n start = 0\r\n end = len(arr) - 1\r\n\r\n ans = -1\r\n while (start <= end):\r\n mid = (start + end) // 2\r\n\r\n # Move to right side if target is\r\n # greater.\r\n if (arr[mid] <= target):\r\n start = mid + 1\r\n\r\n # Move left side.\r\n else:\r\n ans = mid\r\n end = mid - 1\r\n\r\n return ans\r\n\r\ndef st():\r\n return list(sys.stdin.readline().strip())\r\n\r\ndef printDivisors(n):\r\n # Note that this loop runs till square root\r\n i = 1\r\n res = []\r\n while i <= math.sqrt(n):\r\n\r\n if (n % i == 0):\r\n\r\n # If divisors are equal, print only one\r\n if (n / i == i):\r\n res.append(i)\r\n else:\r\n # Otherwise print both\r\n res.append(i)\r\n res.append(n // i)\r\n i = i + 1\r\n return res\r\n\r\ndef li():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef mp():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef inp():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef pr(n):\r\n return sys.stdout.write(str(n) + \"\\n\")\r\n\r\n\r\ndef prl(n):\r\n return sys.stdout.write(str(n) + \" \")\r\n\r\nimport sys\r\n \r\nsys.setrecursionlimit(5000)\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\nimport math\r\ndef solve():\r\n def get_count(n):\r\n if n < 0:\r\n return -99999999\r\n if n == 0:\r\n return 0\r\n if counts[n] == -1:\r\n counts[n] = max(get_count(n-a), get_count(n-b), get_count(n-c)) + 1\r\n return counts[n]\r\n \r\n n, a, b, c = mp()\r\n counts = [-1] * 4001\r\n print(get_count(n))\r\n \r\nnum_test = 1\r\n# num_test = int(input())\r\n# print(num_test)\r\nfor _ in range(num_test):\r\n solve()\r\n\r\n", "from functools import cache\r\n\r\nribbon, length1, length2, length3 = map(int, input().split())\r\n\r\n@cache\r\ndef recurse(ribbon):\r\n if ribbon < 0:\r\n return float('-inf')\r\n if ribbon == 0:\r\n return 0\r\n try1 = 1 + recurse(ribbon - length1)\r\n try2 = 1 + recurse(ribbon - length2)\r\n try3 = 1 + recurse(ribbon - length3)\r\n return max(try1, try2, try3)\r\n\r\ndp = [None] * (ribbon + 1)\r\ndp[0] = 0\r\n\r\nfor i in range(1, ribbon + 1):\r\n try1 = (1 + dp[i - length1]) if i - length1 >= 0 else float('-inf')\r\n try2 = (1 + dp[i - length2]) if i - length2 >= 0 else float('-inf')\r\n try3 = (1 + dp[i - length3]) if i - length3 >= 0 else float('-inf')\r\n dp[i] = max(try1, try2, try3)\r\n\r\nans = dp[ribbon]\r\nprint(ans)", "[n, *arr] = map(int, input().split())\r\nans = [-float('inf')] * (n + 1)\r\nans[0] = 0\r\n\r\nfor i in arr:\r\n for j in range(len(ans)):\r\n if (j - i) >= 0:\r\n ans[j] = max(ans[j], ans[j - i] + 1)\r\n\r\nprint(ans[n])\r\n", "import sys\r\n\r\n\r\ndef cut_candy(n, candy_lengths):\r\n # https://codeforces.com/problemset/problem/189/A\r\n dp = []\r\n for i in range(n + 1):\r\n count = 0\r\n\r\n for l in candy_lengths:\r\n\r\n if i == l:\r\n count = max(count, 1)\r\n elif i > l and dp[i-l] > 0:\r\n count = max(count, dp[i - l] + 1)\r\n\r\n dp.append(count)\r\n return dp[-1]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b, c = [int(x) for x in sys.stdin.readline().strip().split()]\r\n print(cut_candy(n, [a,b,c]))", "n,a,b,c=map(int,input().split())\r\nans=-1\r\nfor x in range(n+1):\r\n for y in range(n+1):\r\n if n-(a*x+b*y)>=0 and (n-(a*x+b*y))%c==0:\r\n ans=max(ans,x+y+(n-(a*x+b*y))//c)\r\nprint(ans)", "n, a, b, c = map(int, input().split())\r\nmas = [-1] * (n + 2)\r\nmas[0] = 0\r\nfor i in range(n + 1):\r\n if i - a >= 0 and mas[i - a] > -1:\r\n mas[i] = mas[i - a] + 1\r\n if i - b >= 0 and mas[i - b] > -1:\r\n mas[i] = max(mas[i], mas[i - b] + 1)\r\n if i - c >= 0 and mas[i - c] > -1:\r\n mas[i] = max(mas[i], mas[i - c] + 1)\r\nprint(mas[n])", "n, a, b, c = [int(i) for i in input().split(' ')]\r\nmaxn = 0\r\nfor ia in range(0, n//a + 1):\r\n for ib in range(0, (n - ia * a) // b + 1):\r\n if (n - ia * a - ib * b) % c == 0 and \\\r\n (n - ia * a - ib * b) // c + ia + ib > maxn:\r\n maxn = (n - ia * a - ib * b) // c + ia + ib\r\nprint(maxn)\r\n", "n,a,b,c = list(map(int,input().split()))\r\ndp=[-1 for i in range(n+1)]\r\ndp[0]=0\r\nfor i in range(1,n+1):\r\n if i-a>=0 and dp[i-a]>=0:\r\n dp[i]=max(dp[i],dp[i-a]+1)\r\n if i-b>=0 and dp[i-b]>=0:\r\n dp[i]=max(dp[i],dp[i-b]+1)\r\n if i-c>=0 and dp[i-c]>=0:\r\n dp[i]=max(dp[i],dp[i-c]+1)\r\n# print(dp)\r\nif dp[-1]==-1:\r\n print(0)\r\nelse:\r\n print(dp[-1])", "n, a, b, c = map(int, input().split())\r\n\r\n# Initialize a list to store the maximum number of pieces for each length from 0 to n\r\ndp = [0] * (n + 1)\r\n\r\n# Iterate through possible lengths from a to n\r\nfor length in range(a, n + 1):\r\n if dp[length - a] > 0 or length == a:\r\n dp[length] = max(dp[length], dp[length - a] + 1)\r\n\r\nfor length in range(b, n + 1):\r\n if dp[length - b] > 0 or length == b:\r\n dp[length] = max(dp[length], dp[length - b] + 1)\r\n\r\nfor length in range(c, n + 1):\r\n if dp[length - c] > 0 or length == c:\r\n dp[length] = max(dp[length], dp[length - c] + 1)\r\n\r\n# The final value in dp[n] contains the maximum number of pieces\r\nprint(dp[n])\r\n", "n, a, b, c = map(int, input().split())\r\nans = [-4 * 10**4] * (n + c + b + a)\r\nans[0] = 0\r\nfor i in range(n):\r\n ans[i + a] = max(ans[i] + 1, ans[i + a])\r\n ans[i + b] = max(ans[i] + 1, ans[i + b])\r\n ans[i + c] = max(ans[i] + 1, ans[i + c])\r\nprint(ans[n])", "'''\r\n* author: Adham0 \r\n* created: 22.08.2023 00:13:46\r\n \r\n* █████ ██████ ██ ██ █████ ███ ███ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ████ ████ \r\n* ███████ ██ ██ ███████ ███████ ██ ████ ██ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n* ██ ██ ██████ ██ ██ ██ ██ ██ ██ \r\n'''\r\n\r\n\r\nn, x, y, z = [int(i) for i in input().split()]\r\na = [0] + [-1e9] * 5000\r\n\r\nfor i in range(1, n + 1):\r\n a[i] = max(a[i - x], a[i - y], a[i - z]) + 1\r\nprint(a[n])", "import sys\r\nsys.setrecursionlimit(10**5)\r\ninput=sys.stdin.readline\r\n\r\narr=[-1]*4001\r\ndef solve(n,a,b,c):\r\n if n==0:\r\n return True,0\r\n if n<0:\r\n return False,0\r\n if arr[n]!=-1:\r\n if arr[n]==0:\r\n return False,0\r\n else:\r\n return True,arr[n]\r\n f1,c1=solve(n-a,a,b,c)\r\n f2,c2=solve(n-b,a,b,c)\r\n f3,c3=solve(n-c,a,b,c)\r\n ans=0\r\n if f1:\r\n ans=c1 \r\n if f2:\r\n ans=max(ans,c2)\r\n if f3:\r\n ans=max(ans,c3)\r\n if (f1 or f2 or f3)==False:\r\n arr[n]=0\r\n return False,0\r\n # print(n,ans+1)\r\n arr[n]=ans+1\r\n return True,ans+1\r\n\r\nn,a,b,c=map(int,input().split())\r\nf,ans=solve(n,a,b,c)\r\nprint(ans)\r\n", "n,a,b,c = map(int,input().split())\r\ndp = [0]*(n+1)\r\nfor i in range(n+1):\r\n if dp[i] == 0 and i != 0:\r\n continue\r\n if i+a<=n :\r\n dp[i+a] = max(dp[i+a],dp[i]+1)\r\n if i+b<=n :\r\n dp[i+b] = max(dp[i+b],dp[i]+1)\r\n if i+c<=n :\r\n dp[i+c] = max(dp[i+c],dp[i]+1)\r\nprint(dp[n])", "n, a, b, c = map(int, input().split())\r\ndp = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n dp[i] = -1\r\nfor length in [a, b, c]:\r\n for i in range(length, n + 1):\r\n if dp[i - length] != -1:\r\n dp[i] = max(dp[i], dp[i - length] + 1)\r\nprint(dp[n])\r\n", "n, a, b, c = map(int, input().split())\r\n\r\ndp = [0] * (n + 1)\r\n\r\nfor x in [a, b, c]:\r\n if x <= n:\r\n dp[x] = 1\r\n\r\nfor i in range(1, n + 1):\r\n for x in [a, b, c]:\r\n if i - x > 0 and dp[i - x] > 0:\r\n dp[i] = max(dp[i], dp[i - x] + 1)\r\n\r\nprint(dp[n])\r\n", "def solve(n, a, b, c):\r\n dp = [0] + [-1] * n\r\n\r\n for i in range(1, n + 1):\r\n max_ribbons = -1\r\n\r\n if i >= a:\r\n max_ribbons = max(max_ribbons, dp[i - a])\r\n if i >= b:\r\n max_ribbons = max(max_ribbons, dp[i - b])\r\n if i >= c:\r\n max_ribbons = max(max_ribbons, dp[i - c])\r\n\r\n if max_ribbons != -1:\r\n dp[i] = max_ribbons + 1\r\n\r\n return dp[n]\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b, c = map(int, input().split())\r\n print(solve(n, a, b, c))\r\n", "n, a, b, c = map(int, input().split())\r\nw = [a, b, c]\r\nw.sort()\r\na = w[0]\r\nb = w[1]\r\nc = w[2]\r\naa = 0\r\nbb = 0\r\no = -1\r\nwhile aa * a <= n:\r\n bb = 0\r\n while aa * a + bb * b <= n:\r\n if (n - (aa * a + bb * b)) % c == 0:\r\n if (n - (aa * a + bb * b)) // c + aa + bb > o:\r\n o = (n - (aa * a + bb * b)) // c + aa + bb\r\n bb += 1\r\n aa += 1\r\nprint(o)", "n, a, b, c = map(int, input().split(' '))\r\n\r\n\r\ndp = [0] * (n+1)\r\n\r\nfor i in range(n+1):\r\n if dp[i] == 0 and i != 0:\r\n continue\r\n if i + a <= n:\r\n dp[i+a] = max(dp[i+a], dp[i] + 1)\r\n if i + b <= n:\r\n dp[i+b] = max(dp[i+b], dp[i] + 1)\r\n if i + c <= n:\r\n dp[i+c] = max(dp[i+c], dp[i] + 1)\r\n\r\nprint(dp[n])\r\n ", "from sys import stdin, stdout\ninput = stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n stdout.write(sep.join(map(str, args)) + end)\ndef int_map():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\n\n\nmx = 0\nn, a, b, c = int_map()\nfor i in range(4000+1):\n if i*a > n:break\n for j in range(4000+1):\n if i*a + b*j > n:break\n k = (n-(i*a + j*b))//c\n if i*a + j*b + k*c == n:\n mx = max(mx, i+j + k)\n # print(i, j, (n-(i*a + j*b))//c)\n\nprint(mx)\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n", "def solve(n, a, b, c):\r\n dp=[-1e10]*(n+1)\r\n dp[0]=0\r\n for i in range(a,n+1):\r\n dp[i]=max(dp[i],dp[i-a]+1)\r\n for i in range(b,n+1):\r\n dp[i]=max(dp[i],dp[i-b]+1)\r\n for i in range(c,n+1):\r\n dp[i]=max(dp[i],dp[i-c]+1)\r\n return dp[n]\r\n\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b, c = map(int, input().split())\r\n print(solve(n, a, b, c))", "\r\nmem = [0]*(int(4e3 +1))\r\n\r\ndef solve(i):\r\n if mem[i]>0:\r\n return mem[i]\r\n if i < 0:\r\n return -10e10\r\n if i == 0:\r\n return 0\r\n mem[i] = -10e10\r\n\r\n for j in range(1,4):\r\n mem[i] = max(solve(i-r[j]), mem[i])\r\n mem[i] +=1 \r\n return mem[i]\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\nr = list(map(int, input().split()))\r\n#print(solve(r[0]))\r\n\r\n\r\n#1 2 3 4 5\r\nfor i in range(1,r[0]+1):\r\n x=-1e11\r\n y=-1e11\r\n z=-1e11\r\n \r\n if i >= r[1] :\r\n x = mem[i - r[1]]\r\n if i >= r[2] :\r\n y = mem[i - r[2]]\r\n if i >= r[3] :\r\n z = mem[i - r[3]]\r\n mem[i] = 1 + max(x, max(y,z))\r\n \r\n\r\nprint(mem[r[0]])\r\n\r\n", "def max_ribbon_pieces(n, a, b, c):\r\n dp = [0] * (n + 1)\r\n for length in range(1, n + 1):\r\n dp[length] = -1\r\n if length >= a and dp[length - a] != -1:\r\n dp[length] = max(dp[length], dp[length - a] + 1)\r\n if length >= b and dp[length - b] != -1:\r\n dp[length] = max(dp[length], dp[length - b] + 1)\r\n if length >= c and dp[length - c] != -1:\r\n dp[length] = max(dp[length], dp[length - c] + 1)\r\n return dp[n]\r\nn, a, b, c = map(int, input().split())\r\nresult = max_ribbon_pieces(n, a, b, c)\r\nprint(result)", "def max_ribbons(n, a, b, c):\r\n arr = [0] * (n+1)\r\n for x in [a, b, c]:\r\n if x <= n:\r\n arr[x] = 1 #sets the ribbon index at that point to 1\r\n\r\n for i in range(1, n+1):\r\n for x in [a, b, c]:\r\n if i>=x and arr[i-x] > 0: #iterates through \r\n arr[i] = max(arr[i], arr[i-x]+1) #sets the number of ribbons\r\n\r\n return arr[n]\r\n\r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\nresult = max_ribbons(n, a, b, c)\r\nprint(result)", "n, a, b, c = map(int, input().split())\n\ndef solve(vals, amount):\n dp = [0] + [-1] * amount\n\n for val in vals:\n for i in range(val, amount + 1):\n if dp[i - val] != -1:\n dp[i] = max(dp[i], dp[i - val] + 1)\n\n return dp[amount]\nprint(solve([a, b, c], n))\n\t \t \t \t \t \t \t \t\t \t \t\t", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, a, b, c = [int(x) for x in input().split()]\r\n\r\ndp = [-math.inf]*(n+1)\r\ndp[0] = 0\r\nfor i in range(1, n+1):\r\n if i >= a: dp[i] = max(dp[i], dp[i-a]+1)\r\n if i >= b: dp[i] = max(dp[i], dp[i-b]+1)\r\n if i >= c: dp[i] = max(dp[i], dp[i-c]+1)\r\nprint(dp[n])", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn, a, b, c = map(int, input().split())\r\narr = [0] + [-1000000000] * 5000\r\nfor i in range(1, n + 1):\r\n arr[i] =1 + max(arr[i - a], arr[i - b], arr[i - c])\r\nprint(arr[n])\r\n", "arr = list(map(int,input().split()))\r\nn = arr.pop(0)\r\n\r\nans = [-float(\"inf\") for i in range(n + 1)]\r\nans[0] = 0\r\n\r\nfor i in range(1,n + 1):\r\n for x in arr:\r\n if i - x >= 0:\r\n ans[i] = max(1 + ans[i - x],ans[i])\r\nprint(ans[-1])\r\n\r\n", "n, a, b, c = map(int, input().split())\r\nf = [-1] * (n + 1)\r\nf[0] = 0\r\n\r\ndef at(x):\r\n if x < 0:\r\n return -1\r\n return f[x]\r\n\r\nfor i in range(1, n + 1):\r\n temp = max(at(i - a), max(at(i - b), at(i - c)))\r\n if temp == -1:\r\n f[i] = -1\r\n else:\r\n f[i] = temp + 1\r\n\r\nprint(f[n])\r\n", "n, a, b, c = map(int, input().split())\r\nz = [0]+[-1e9]*5000\r\nfor i in range(1, n+1):\r\n z[i] = max(z[i-a], z[i-b], z[i-c])+1\r\nprint(z[n])\r\n", "n,a,b,c=map(int,input().split())\r\np=sorted([a,b,c])\r\nif n%p[0]==0:\r\n print(n//p[0])\r\nelse:\r\n l=[]\r\n max1=n//a\r\n max2=n//b\r\n for i in range(max1+1):\r\n for j in range(max2+1):\r\n if (n-i*a-j*b)%c==0 and (n-i*a-j*b)>=0:\r\n l.append(i+j+((n-i*a-j*b)//c))\r\n print(max(l))", "m = list(map(int,input().split()))\nn = m.pop(0)\ndp = [0]*10010\ndp[0] = 1\nfor i in m:\n for j in range(i,n+1):\n if dp[j-i] != 0:\n dp[j] = max(dp[j], dp[j - i] + 1)\nprint(dp[n]-1)\n\t \t\t \t\t \t\t\t\t \t\t \t\t\t \t", "def solve_rec(n, a, b ,c):\n possible_solutions = []\n if n >= a:\n solve_rec_a = solve_rec(n-a,a,b,c)\n if solve_rec_a is not None:\n possible_solutions.append(solve_rec_a)\n if n >= b:\n solve_rec_b = solve_rec(n-b,a,b,c)\n if solve_rec_b is not None:\n possible_solutions.append(solve_rec_b)\n if n >= c:\n solve_rec_c = solve_rec(n-c,a,b,c)\n if solve_rec_c is not None:\n possible_solutions.append(solve_rec_c)\n\n if possible_solutions:\n return 1 + max(possible_solutions)\n elif not possible_solutions and n == 0:\n return 0\n else:\n return None\n\ndef solve(n, a, b ,c):\n s = [0]\n for i in range(1, n+1):\n possible_solutions = []\n for x in [a,b,c]:\n if i-x < 0:\n continue\n if s[i-x] is None:\n continue\n possible_solutions.append(s[i-x])\n if possible_solutions:\n s.append(1 + max(possible_solutions))\n else:\n s.append(None)\n return s[n]\n\nif __name__ == \"__main__\":\n n, a, b ,c = map(int, input().split())\n print(solve(n,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", "n, a, b, c = [int(i) for i in input().split()]\ndp = [0] * (n + 1)\ndp[0] = 0\nfor i in range(n + 1):\n for j in [a, b, c]:\n if i + j <= n and (dp[i] > 0 or i in [a, b, c, 0]):\n dp[i + j] = max(dp[i + j], dp[i] + 1)\nprint(dp[-1])\n\n", "n, a, b, c = map(int, input().split())\r\n\r\na, b, c = min(a, b, c), a + b + c - min(a, b, c) - max(a, b, c), max(a, b, c)\r\n\r\ndp = []\r\nfor i in range(a):\r\n dp.append(0)\r\n\r\ndp.append(1)\r\nfor i in range(a + 1, b + 1):\r\n if dp[i - a] > 0:\r\n dp.append(dp[i - a] + 1)\r\n else:\r\n dp.append(0)\r\n\r\nif dp[b] == 0:\r\n dp[b] += 1\r\n\r\nfor i in range(b + 1, c + 1):\r\n if max(dp[i - a], dp[i - b]) > 0:\r\n dp.append(max(dp[i - a], dp[i - b]) + 1)\r\n else:\r\n dp.append(0)\r\n\r\nif dp[c] == 0:\r\n dp[c] = 1\r\n\r\nfor i in range(c + 1, n + 1):\r\n if max(dp[i - a], dp[i - b], dp[i - c]) > 0:\r\n dp.append(max(dp[i - a], dp[i - b], dp[i - c]) + 1)\r\n else:\r\n dp.append(0)\r\n\r\nprint(dp[n])", "n, a, b, c = map(int, input().split())\r\ndp = [float('-inf')]*(n+1)\r\ndp[0]=0\r\nfor i in range(1,n+1):\r\n for j in [a,b,c]:\r\n if i>=j:\r\n dp[i]=max(dp[i],dp[i-j]+1)\r\nprint(dp[-1])", "n, a, b, c = map(int, input().split())\r\nar = [-1] * (n + 1)\r\nar[0] = 0\r\nfor i in range(n + 1):\r\n if ar[i] != -1:\r\n if i + a <= n:\r\n ar[i + a] = max(ar[i + a], ar[i] + 1)\r\n if i + b <= n:\r\n ar[i + b] = max(ar[i + b], ar[i] + 1)\r\n if i + c <= n:\r\n ar[i + c] = max(ar[i + c], ar[i] + 1)\r\nprint(ar[n])", "n, a, b, c = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if i*a + j*b <= n:\r\n if (n-(i*a+j*b)) % c == 0:\r\n z = (n-(i*a+j*b)) // c\r\n\r\n ans = max(ans, i+j+z)\r\nprint(ans)\r\n", "n, a, b, c = map(int, input().split())\r\nres = 0\r\nfor i in range(n // a + 1):\r\n for j in range((n - i * a) // b + 1):\r\n rem = n - i * a - j * b\r\n if rem % c == 0:\r\n k = rem // c\r\n res = max(res, i + j + k)\r\nprint(res)", "n = list(map(int, input().split(' ')))\na = n[1]\nb = n[2]\nc = n[3]\nn = n[0]\narr = [0] * n + [0] * 4000\narr[a] = 1\narr[b] = 1\narr[c] = 1\nfor i in range(0,n):\n if arr[i] != 0:\n if arr[i + a] < arr[i] + 1:\n arr[i + a] = arr[i] + 1\n if arr[i + b] < arr[i] + 1:\n arr[i + b] = arr[i] + 1\n if arr[i + c] < arr[i] + 1:\n arr[i + c] = arr[i] + 1\n \n \nprint(arr[n])\n \t\t \t \t\t \t \t \t\t\t \t\t \t\t \t", "n, a, b, c = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(4001):\r\n\tfor j in range(4001):\r\n\t\tzc = n - i*a - j*b\r\n\t\tif zc < 0: break\r\n\t\tz = zc/c\r\n\t\tif z % 1 == 0:\r\n\t\t\tans = max(ans, z+i+j)\r\n\t\r\nprint(int(ans))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 1 23:04:12 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn,a,b,c=map(int,input().split())\r\nl=[a,b,c]\r\nf=[0]*(n+1)\r\nfor i in range(n+1):\r\n if i!=0 and f[i]==0:\r\n continue\r\n for j in range(3):\r\n index=i+l[j]\r\n if index<=n:\r\n f[index]=max(f[index],f[i]+1)\r\nprint(f[n])", "def max_pedaços_fita(N, A, B, C):\n dp = [0] * (N + 1)\n \n for i in range(1, N + 1):\n max_pedaços = float('-inf')\n \n if i >= A:\n max_pedaços = max(max_pedaços, dp[i - A] + 1)\n \n if i >= B:\n max_pedaços = max(max_pedaços, dp[i - B] + 1)\n \n if i >= C:\n max_pedaços = max(max_pedaços, dp[i - C] + 1)\n \n dp[i] = max_pedaços\n \n return dp[N]\n\n# Leitura dos valores de entrada\nn, a, b, c = map(int, input().split())\n\nresultado = max_pedaços_fita(n, a, b, c)\nprint(resultado)\n\n\n \t \t \t \t\t\t \t\t\t \t\t\t \t \t\t\t \t", "# https://codeforces.com/problemset/problem/189/A\r\n\r\nn, a, b, c = map(int, input().split())\r\nm = 0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n k = (n - a*i - b*j)/c\r\n if k >= 0 and k == int(k):\r\n m = max(m, i+j+k)\r\nprint(int(m))", "n, a, b, c = map(int, input().split())\r\n\r\ndp = [0] * (n+1)\r\ndp[0] = 0\r\n\r\nfor i in range(1, n+1):\r\n dp[i] = -1e9 # initialize to a large negative number\r\n if i >= a:\r\n dp[i] = max(dp[i], dp[i-a] + 1)\r\n if i >= b:\r\n dp[i] = max(dp[i], dp[i-b] + 1)\r\n if i >= c:\r\n dp[i] = max(dp[i], dp[i-c] + 1)\r\n\r\nprint(dp[n])\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn,a,b,c = iia()\r\narr = [a,b,c]\r\ndp = [-float(\"inf\")]*(n+1)\r\ndp[0] = 0\r\nfor ele in arr:\r\n for i in range(ele,n+1):\r\n dp[i] = max(dp[i], dp[i-ele]+1)\r\nprint(dp[-1])\r\n", "n, a, b, c = map(int, input().split(' '))\r\nans = 0\r\nfor x in range(4000 + 1):\r\n for y in range(4000 + 1):\r\n s = a * x + b * y\r\n if(s > n):\r\n break\r\n if((n - s) % c != 0):\r\n continue\r\n z = (n - s) / c\r\n ans = max(ans, x + y + z)\r\nprint(int(ans))\r\n\r\n", "line = input()\r\n\r\nt,a,b,c = int(line.split()[0]), int(line.split()[1]), int(line.split()[2]), int(line.split()[3])\r\n\r\n\r\ndpv = [0]*(t+1)\r\nl = [a,b,c]\r\nl.sort()\r\n\r\na,b,c = l[0],l[1],l[2]\r\n\r\nfor i in range(1,t+1):\r\n if i<a:\r\n dpv[i] = - 1\r\n \r\n elif i <b:\r\n\r\n dpv[i] = 1 + dpv[i-a] if dpv[i-a]!=-1 else -1\r\n \r\n elif i <c:\r\n dpv[i] = max(1 + dpv[i-a], 1 +dpv[i-b]) if dpv[i-a] != -1 or dpv[i-b] !=-1 else -1\r\n \r\n else:\r\n dpv[i] = max(1 + dpv[i-a], 1 +dpv[i-b], 1 + dpv[i-c]) if dpv[i-a] != -1 or dpv[i-b] !=-1 or dpv[i-c]!=-1 else -1\r\n\r\n\r\nprint(dpv[-1])", "import sys\nsys.setrecursionlimit(10**4)\n\nn, a, b, c = map(int, input().split())\ndp = [0] * 4001\n\ndef dfs(x):\n if x == 0: return 0\n if x < 0: return -1e9\n if not dp[x]: dp[x] = max(dfs(x-a), dfs(x-b), dfs(x-c)) + 1\n return dp[x]\n\nprint(dfs(n))\n", "N, a, b, c = list(map(int, input().split()))\r\nL = [i for i in set([a,b,c]) if i <= N]\r\ndp=[0]+[-1]*(N)\r\nfor i in range(1,N+1):\r\n dp[i] = max([dp[i-j] for j in L])\r\n if dp[i] > -1: dp[i] += 1 \r\nprint(dp[N])", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nn,a,b,c = map(int,input().split())\r\nz = [0] + [-1e9]*5000\r\nfor i in range(1,n+1):\r\n z[i] = max(z[i-a],z[i-b],z[i-c])+1\r\nprint(z[n])", "n,a,b,c = list(map(int,input().split()))\r\narr = [a,b,c]\r\ndp = [-100000]*(n+1)\r\ndp[0]=0\r\nfor i in range(1,n+1):\r\n for j in range(3):\r\n cnt = i-arr[j]\r\n if cnt>=0:\r\n dp[i]=max(dp[i],1+dp[cnt])\r\nprint(dp[n])\r\n\r\n", "def max_ribbon_pieces(n, a, b, c):\r\n dp = [-1] * (n+1)\r\n dp[0] = 0\r\n\r\n for i in range(1, n+1):\r\n if i >= a and dp[i-a] != -1:\r\n dp[i] = max(dp[i], dp[i-a] + 1)\r\n if i >= b and dp[i-b] != -1:\r\n dp[i] = max(dp[i], dp[i-b] + 1)\r\n if i >= c and dp[i-c] != -1:\r\n dp[i] = max(dp[i], dp[i-c] + 1)\r\n\r\n return dp[n]\r\n\r\n# Read input\r\nn, a, b, c = map(int, input().split())\r\n\r\n# Calculate and print the maximum number of ribbon pieces\r\nprint(max_ribbon_pieces(n, a, b, c))\r\n", "def inp(single_testcase=True):\r\n return 1 if single_testcase else int(input())\r\ndef intlist():\r\n return(list(map(int,input().split())))\r\ndef intmap():\r\n return(map(int,input().split()))\r\n\r\nt = inp()\r\n\r\ndef solve(inp):\r\n val = inp[0]\r\n other = sorted(inp[1:], reverse=True)\r\n \r\n dp = [float('-inf')] * (val + 1)\r\n dp[0] = 0\r\n\r\n for curr in range(1, val + 1):\r\n for o in other:\r\n if curr - o >= 0:\r\n dp[curr] = max(dp[curr], dp[curr - o] + 1)\r\n\r\n return dp[val]\r\n\r\nfor _ in range(t):\r\n print(solve(intlist()))", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nfrom math import gcd\r\nn,*l = getints()\r\nl.sort()\r\nif gcd(l[0],l[2]) == l[0] or gcd(l[1],l[2]) == l[1]: l.pop()\r\nif gcd(l[0],l[1]) == l[1]: l.pop(1)\r\n\r\nm = [[0]*(len(l))]+[[-1]*(len(l)) for x in range(n)]\r\nfor s in range(n+1):\r\n for i in range(len(l)):\r\n if s-l[i]>=0:\r\n t = max(m[s-l[i]])\r\n if t != -1: m[s][i] = 1+t\r\nprint(max(m[n]))", "# author: birsnot - Nardos Wehabe\r\n\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n N, A, B, C = II()\r\n pieces = [A, B, C]\r\n dp = [0]*(N + 1)\r\n for i in range(1, N+1):\r\n for p in pieces:\r\n if (i - p) > 0:\r\n a = dp[i - p]\r\n if a and a + 1 > dp[i]:\r\n dp[i] = a + 1\r\n elif i - p == 0:\r\n if dp[i] == 0:\r\n dp[i] = 1 \r\n print(dp[N])\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "n,a,b,c=map(int,input().split())\r\nf=[0]+[-8000]*4000\r\nfor i in range(1,n+1):\r\n f[i]=max(f[i-a],f[i-b],f[i-c])+1\r\nprint(f[i])", "\r\nn, a, b, c = map(int, input().split())\r\n\r\nm = 0\r\n\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if n >= i*a + j*b and n%c == (i*a + j*b)%c:\r\n k = (n - i*a - j*b) // c\r\n if i + j + k > m:\r\n m = i + j + k\r\n\r\nprint (m)\r\n\r\n\r\n\r\n ", "nabc = list(map(int,input().split()))\r\na = nabc[1]\r\nb = nabc[2]\r\nc = nabc[3]\r\n\r\narr = [0]*4001\r\narr[a] = 1\r\narr[b] = 1\r\narr[c] = 1\r\n\r\n\r\nfor i in range(1,4001):\r\n x=0\r\n y=0\r\n z=0\r\n if i-a>=0:\r\n if arr[i-a] > 0:\r\n x = arr[i-a]+1\r\n if i-b>=0:\r\n if arr[i-b] > 0:\r\n y = arr[i-b]+1\r\n if i-c>=0:\r\n if arr[i-c] > 0:\r\n z = arr[i-c]+1\r\n arr[i] = max(x,y,z, arr[i])\r\n \r\nprint(arr[nabc[0]])", "n, a, b, c = map(int, input().split())\r\n\r\ndp = [-999999999 for _ in range(n + 1)]\r\ndp[0] = 0\r\nfor i in range(1,n+1):\r\n maximo = -999999999\r\n if i - a >= 0:\r\n maximo = max(maximo, dp[i - a])\r\n if i - b >= 0:\r\n maximo = max(maximo, dp[i - b])\r\n if i - c >= 0:\r\n maximo = max(maximo, dp[i - c])\r\n dp[i] = maximo + 1\r\n\r\nprint(dp[n])", "# Miguel Arriaga y Karla Mondragón\n\nn, a, b, c = map(int, input().split())\ndp = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n dp[i] = float('-inf')\n if i - a >= 0:\n dp[i] = max(dp[i], dp[i - a] + 1)\n if i - b >= 0:\n dp[i] = max(dp[i], dp[i - b] + 1)\n if i - c >= 0:\n dp[i] = max(dp[i], dp[i - c] + 1)\n\nprint(dp[n])\n\t\t\t\t\t\t \t\t \t \t \t\t\t\t\t\t \t\t", "from math import inf\r\nn, a, b, c = map(int, input().split())\r\n\r\ndp = {0:0}\r\n\r\nfor i in range(1, n+1):\r\n dp[i] = max(dp[i-a] if i>=a else -inf, dp[i-b] if i>=b else -inf, dp[i-c] if i>=c else -inf) + 1\r\n\r\nprint(dp[n])\r\n\r\n \r\n\r\n ", "n,a,b,c=map(int,input().split());x=[0]+[-4000]*5000\r\nfor i in range(1,n+1):\r\n x[i]=max(x[i-a],x[i-b],x[i-c])+1\r\nprint(x[n])", "n,a,b,c=list(map(int,input().split()))\n\nmx=-1\nfor i in range(n+1):\n for j in range(n+1):\n leftover=n-(i*a)-(j*b)\n if leftover>=0 and leftover%c==0:\n mx=max(mx,i+j+(leftover//c))\n\nprint(int(mx))\n\n \t \t \t\t \t \t \t\t \t\t\t\t \t \t\t\t", "def maxDPSol(n, a, b, c):\r\n dp=[-1 for i in range(n+1)]\r\n dp[0]=0\r\n for i in range(1, n+1):\r\n if(i>=a):\r\n dp[i]=dp[i-a]\r\n if(i>=b):\r\n dp[i]=max(dp[i], dp[i-b])\r\n if(i>=c):\r\n dp[i]=max(dp[i], dp[i-c])\r\n if(dp[i]!=-1):\r\n dp[i]=dp[i]+1 \r\n return dp[n]\r\nn,a,b,c = map(int,input().split())\r\nprint(maxDPSol(n, a, b, c))", "import sys\ndef get_ints(): return map(int, sys.stdin.readline().split(' '))\n\ninvalid = -sys.maxsize\nn, a, b, c = get_ints()\n\n# subproblem\n# OPT(i) = the maximum number of ribbon pieces using a ribbon of length i\n# OPT(0) = 0\n# two choices: cut or do not cut\n# OPT(i) = 1 + max(OPT(i - a), OPT(i - b), OPT(i - c))\n\ndp_arr = [invalid for _ in range(n + 1)]\ndef dp(i): return invalid if i < 0 else dp_arr[i]\ndp_arr[0] = 0\nfor i in range(1, n + 1):\n dp_arr[i] = 1 + max(dp(i - a), dp(i - b), dp(i - c))\nprint(dp(n))", "n, a, b, c = map(int, input().split())\r\nd = {}\r\nd[0] = 0\r\nfor i in range(1, n + 1):\r\n mn = []\r\n if i - a in d:\r\n mn.append(d[i - a] + 1)\r\n\r\n if i - b in d:\r\n mn.append(d[i - b] + 1)\r\n\r\n if i - c in d:\r\n mn.append(d[i - c] + 1)\r\n \r\n \r\n if mn:\r\n d[i] = max(mn)\r\n\r\nprint(d[n])", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n, a, b, c = [int(num) for num in input().split()]\r\n INF = 10 ** 20\r\n dp = [-INF for i in range(4001)]\r\n dp[a] = 1\r\n dp[b] = 1\r\n dp[c] = 1\r\n for i in range(n + 1):\r\n if dp[i] != -INF:\r\n for x in (a, b, c):\r\n if i + x <= n:\r\n dp[i + x] = max(dp[i + x], dp[i] + 1)\r\n print(dp[n])\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, a, b, c = map(int, input().split())\r\n\r\n# Create a table to store the maximum number of ribbon pieces for each length\r\ndp = [0] * (n + 1)\r\n\r\n# Initialize dp[0] to be 0\r\ndp[0] = 0\r\n\r\n# Calculate the maximum number of ribbon pieces for each length from 1 to n\r\nfor i in range(1, n + 1):\r\n dp[i] = -1 # Initialize dp[i] to be -1 (impossible)\r\n \r\n if i >= a and dp[i - a] != -1:\r\n dp[i] = max(dp[i], dp[i - a] + 1)\r\n \r\n if i >= b and dp[i - b] != -1:\r\n dp[i] = max(dp[i], dp[i - b] + 1)\r\n \r\n if i >= c and dp[i - c] != -1:\r\n dp[i] = max(dp[i], dp[i - c] + 1)\r\n\r\n# The maximum possible number of ribbon pieces for length n is stored in dp[n]\r\nprint(dp[n])\r\n", "n, a, b, c = map(int, input().split())\r\nlst = [a,b,c]\r\nlst.sort()\r\nres = 0\r\nfor i in range(0, n//c + 1):\r\n m = n - i*c\r\n for j in range(0, m//b + 1):\r\n k = m - j*b \r\n if k % a == 0:\r\n res = max(res, k//a + i + j)\r\nprint(res)", "n, a, b, c = map(int, input().split())\r\ns = 1\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n k = n - a*i - b*j\r\n if k >= 0 and k % c == 0:\r\n s = max(s, (i+j+k//c))\r\nprint(s)\r\n", "import sys\r\nn, a, b, c = map(int, input().split())\r\nm = 0\r\nif a == 1 or b == 1 or c == 1:\r\n print(n)\r\n sys.exit(0)\r\nfor ia in range(n // a + 1):\r\n ta = n - ia * a\r\n for ib in range(ta // b + 1):\r\n tb = ta - ib * b\r\n if tb % c == 0:\r\n ic = tb // c\r\n m = max(m, ia + ib + ic)\r\nprint(m)\r\n", "# https://codeforces.com/problemset/problem/189/A\n\nfrom functools import lru_cache\nimport sys\nsys.setrecursionlimit(4000)\n\ndef helper() -> int:\n n, a, b, c = [int(s) for s in input().split(\" \")]\n values = sorted([a, b, c])\n\n dp = [0] * n\n while values and values[-1] > n:\n values.pop()\n\n for value in values:\n dp[-value] = 1\n\n for i in range(len(dp) - 1, -1, -1):\n for value in values:\n if i + value < len(dp) and dp[i + value] > 0:\n dp[i] = max(dp[i], 1 + dp[i + value])\n\n return dp[0]\n\nprint(helper())", "n,a,b,c=map(int,input().split())\r\ndp=[0]+[-4000]*6000\r\nfor _ in range(1,n+1):\r\n dp[_]=max(dp[_-a],dp[_-b],dp[_-c])+1\r\nprint(dp[n])", "x = [int(x) for x in input().split(\" \")]\r\n\r\nn = x[0]\r\na = x[1]\r\nb = x[2]\r\nc = x[3]\r\n\r\nx = [-9999 for i in range(-4000,4000)]\r\n# x[i] adalah banyak pieces terbesar untuk n = i\r\n\r\nfor i in range(n+1):\r\n if i == a or i == b or i == c:\r\n x[i] = max(1,max(x[i-a]+1,max(x[i-b]+1,x[i-c]+1)))\r\n else:\r\n x[i] = max(x[i-a],max(x[i-b],x[i-c])) + 1\r\n\r\nprint(x[n])", "def cut_ribbon(n, a, b, c):\r\n dp = [-1e5] * (n+1)\r\n dp[0] = 0\r\n\r\n for i in range(1, n+1):\r\n if i-a >= 0: dp[i] = max(dp[i], dp[i-a] + 1)\r\n if i-b >= 0: dp[i] = max(dp[i], dp[i-b] + 1)\r\n if i-c >= 0: dp[i] = max(dp[i], dp[i-c] + 1)\r\n\r\n return dp[n] if dp[n] > 0 else -1\r\n\r\ndata=[int(x) for x in input().split()]\r\nn,a,b,c=data\r\nprint(cut_ribbon(n, a, b, c))", "n, a, b, c = map(int, input().split())\r\nans = [-4000]*4001\r\nans[0] = 0\r\nfor i in range(min(a, b, c), n+1):\r\n ans[i] = max(ans[i-a], ans[i-b], ans[i-c]) + 1\r\nprint(ans[n])", "n, a, b, c = map(int, input().split())\r\ncoins = [a, b, c]\r\n\r\ndp = [[-float('inf')]*(n+1) for _ in range(3)]\r\nfor i in range(3): dp[i][0] = 0\r\n\r\nfor i in range(3):\r\n for j in range(1,n+1):\r\n if coins[i]<=j: dp[i][j] = max(dp[i][j-coins[i]]+1, dp[i-1][j])\r\n else: dp[i][j] = dp[i][j] = dp[i-1][j]\r\n \r\nprint(dp[2][n])", "n, a, b, c = map(int, input().split())\r\n\r\ndp = [0] + [-1e9] * n\r\n\r\nfor i in range(a, n+1):\r\n dp[i] = max(dp[i], dp[i-a] + 1)\r\n\r\nfor i in range(b, n+1):\r\n dp[i] = max(dp[i], dp[i-b] + 1)\r\n\r\nfor i in range(c, n+1):\r\n dp[i] = max(dp[i], dp[i-c] + 1)\r\n\r\nprint(dp[n])\r\n", "n, a, b, c = map(int, input().split());\r\n\r\nnums = [a, b, c];\r\n\r\ncanChoose = [False for _ in range(n+1)];\r\ncount = [0 for _ in range(n+1)];\r\n\r\ncanChoose[0] = True;\r\n\r\nfor i in range(1, n+1):\r\n\tfor num in nums:\r\n\t\tif i-num >= 0 and canChoose[i - num]:\r\n\t\t\tcount[i] = max(count[i], count[i-num]+1);\r\n\t\t\tcanChoose[i] = 1;\r\nprint(count[n]);\r\n\r\n", "def max_ribbon_pieces(n, a, b, c):\r\n # Create a dynamic programming table to store the maximum number of ribbon pieces\r\n # for each possible length up to n\r\n dp = [float('-inf')] * (n + 1)\r\n dp[0] = 0\r\n\r\n # Iterate through each length from 1 to n\r\n for i in range(1, n + 1):\r\n # Calculate the maximum number of ribbon pieces for the current length\r\n # by considering all possible cuts (a, b, c)\r\n if i >= a:\r\n dp[i] = max(dp[i], dp[i - a] + 1)\r\n if i >= b:\r\n dp[i] = max(dp[i], dp[i - b] + 1)\r\n if i >= c:\r\n dp[i] = max(dp[i], dp[i - c] + 1)\r\n\r\n # Return the maximum number of ribbon pieces for length n\r\n return dp[n]\r\n\r\n# Read the input values\r\nn, a, b, c = map(int, input().split())\r\n\r\n# Call the function to find the maximum number of ribbon pieces\r\nmax_pieces = max_ribbon_pieces(n, a, b, c)\r\n\r\n# Print the result\r\nprint(max_pieces)\r\n", "#https://codeforces.com/contest/189/submission/55190233\n#use dynamic programming here\n# count = min()\n\nn,a,b,c=map(int,input().split())\nd=[a,b,c]\nl=[-1]*(n+1)\nl[0]=0\nfor i in d:\n for j in range(i,n+1):\n if l[j-i]!=-1:\n l[j]=max(l[j-i]+1,l[j])\nprint(l[n])", "n,a,b,c = map(int,input().split())\na1 = min(a,b,c)\nc1 = max(a,b,c)\nb1 = a+b+c-a1-c1\nans = 0\ni=0\nwhile a1*i<=n:\n j=0\n while a1*i+b1*j<=n:\n if (n-a1*i-b1*j)%c1==0:\n ans = max(ans,(n-a1*i-b1*j)//c1+i+j)\n j+=1\n i+=1\nprint(ans)\n\t\t\t\t\t\t\t \t \t \t \t\t\t \t\t \t\t\t\t\t", "n, a, b, c = map(int, input().split())\r\n\r\nt = [-1] * (n + 1)\r\nt[0] = 0\r\n\r\nfor i in range(1, n + 1):\r\n if i >= a and t[i - a] != -1:\r\n t[i] = max(t[i], t[i - a] + 1)\r\n \r\n if i >= b and t[i - b] != -1:\r\n t[i] = max(t[i], t[i - b] + 1)\r\n \r\n if i >= c and t[i - c] != -1:\r\n t[i] = max(t[i], t[i - c] + 1)\r\n \r\nprint(t[n])", "s=input()\r\ns=s.split()\r\na=[]\r\nn=int(s[0])\r\na.append(int(s[1]))\r\na.append(int(s[2]))\r\na.append(int(s[3]))\r\na.sort()\r\nans=-1\r\nif a[0]==1:\r\n print(n)\r\nelse:\r\n\r\n for i in range(0, int(n/a[2])+1):\r\n for j in range(0, int((n-a[2]*i)/a[1])+1):\r\n if((n-a[2]*i-a[1]*j)%a[0]==0):\r\n # print(int((n-a[2]*i-a[1]*j)/a[0])+i+j)\r\n # exit()\r\n ans=max(int((n-a[2]*i-a[1]*j)/a[0])+i+j,ans)\r\n print(ans)", "x = input().split()\r\ny = [int(u) for u in x]\r\nmemo = [0 for i in range(0, y[0] + 1)]\r\nfor i in range(1, y[0] + 1):\r\n\tmemo[i] = -4000\r\n\tfor j in (y[1], y[2], y[3]):\r\n\t\tif i - j >= 0: memo[i] = max(memo[i], memo[i - j])\r\n\tmemo[i] += 1\r\nprint(memo[y[0]])", "n,a1,a2,a3=map(int,input().split())\r\n \r\ndp=[[0 for i in range(n+1)] for i in range(4)]\r\nb=[i for i in range(n+1)]\r\na=[0,a1,a2,a3]\r\nfor i in range(1,4):\r\n for j in range(1,n+1):\r\n if a[i]==b[j]:\r\n #print(a[i], b[j], dp[i][j])\r\n dp[i][j]=max(1,dp[i-1][j])\r\n elif a[i]<b[j]:\r\n if dp[i][j-a[i]]>0 or dp[i-1][j]>0 or dp[i-1][j-a[i]]>0:\r\n dp[i][j]=max(1+dp[i-1][j-a[i]],1+dp[i][j-a[i]],dp[i-1][j])\r\n else:\r\n dp[i][j]=dp[i-1][j]\r\n \r\nprint(dp[3][n])", "import sys\r\nsys.setrecursionlimit(10000)\r\nn,*choice = map(int,input().split())\r\nchoice = sorted(choice)\r\ndp = [-1]*(9999)\r\ndef ans(sm,steps):\r\n if sm>n:\r\n return\r\n if steps<=dp[sm]:\r\n return\r\n dp[sm]=steps\r\n ans(sm+choice[0],steps+1)\r\n if choice[0]!=choice[1]:\r\n ans(sm+choice[1],steps+1)\r\n if choice[1]!=choice[-1]:\r\n ans(sm+choice[2],steps+1)\r\nif n%choice[0]:\r\n ans(0,0)\r\n print(dp[n])\r\nelse:\r\n print(n//choice[0])", "from math import *\r\ndef solve(n, a, b, c):\r\n maxVal = 0\r\n \r\n # i represents possible values of a * x\r\n for i in range(0, n + 1, a):\r\n \r\n # j represents possible values of b * y\r\n for j in range(0, n - i + 1, b):\r\n z = (n - (i + j)) / c\r\n \r\n # If z is an integer\r\n if (floor(z) == ceil(z)):\r\n x = i // a\r\n y = j // b\r\n maxVal = max(maxVal, x + y + int(z))\r\n \r\n return maxVal\r\n\r\nn,a,b,c = map(int,input().split())\r\nprint(solve(n,a,b,c))", "n, a, b, c = map(int, input().split())\r\nl = [a,b,c]\r\ndp = [0] * (n+1)\r\nfor i in range( n+1):\r\n if i != 0 and dp[i] ==0: ##cant be cut\r\n continue\r\n for _ in range(3):\r\n if i + l[_] <= n:\r\n index = i + l[_]\r\n dp[index] = max(dp[index],dp[i]+1)\r\n\r\n\r\nprint(dp[n])", "import math\r\nimport functools\r\n\r\[email protected]\r\ndef f(n, *a):\r\n return max((1+f(n-x, *a) for x in a if x <= n), default=-math.inf) if n else 0\r\n\r\nn, *a = map(int, input().split())\r\nfor i in range(n):\r\n f(i, *a)\r\nprint(f(n, *a))\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\nis there a constant greedy solution?\r\n'''\r\ndef solve():\r\n n,a,b,c = MII()\r\n dp = [-1] * (n+1)\r\n dp[0] = 0\r\n\r\n ribbons = [a,b,c]\r\n for i in range(n+1):\r\n for r in ribbons:\r\n if i >= r and dp[i-r] >= 0:\r\n dp[i] = max(dp[i], dp[i-r] + 1)\r\n print(dp[-1])\r\n\r\nsolve()", "n,a,b,c=map(int,input().split())\r\nmaxi=0\r\nfor i in range(n//a+1):\r\n for j in range(n//b+1):\r\n if i*a+j*b<=n and(n-i*a-j*b)%c==0:\r\n maxi=max(maxi,i+j+(n-i*a-j*b)//c)\r\nprint(maxi) \r\n\r\n", "n, a, b, c = list(map(int, input().split()))\r\n\r\n\r\nl = [-1e9] * (n + 1)\r\n\r\n\r\nl[0] = 0\r\n\r\nfor i in range(n+1):\r\n if i-a >= 0:\r\n l[i] = max(l[i], l[i-a] + 1)\r\n if i-b >= 0:\r\n l[i] = max(l[i], l[i-b] + 1)\r\n if i-c >= 0:\r\n l[i] = max(l[i], l[i-c] + 1)\r\n \r\nprint(l[n])", "num = list(map(int, input().split()))\r\nn = num[0]\r\npieces = num[1:]\r\ndp = [-float('inf')] * (n + 1)\r\ndp[0] = 0\r\n\r\nfor i in range(1, n + 1):\r\n for c in pieces:\r\n if i - c > -1:\r\n dp[i] = max(dp[i], dp[i - c] + 1)\r\n\r\nprint(dp[n])", "from math import inf\n\ndef solve(n, len):\n dp = [-inf for _ in range(n + 1)]\n dp[0] = 0\n\n for i in range(1, n + 1):\n for length in len:\n if i - length >= 0:\n dp[i] = max(dp[i], dp[i - length] + 1)\n \n return dp[n]\n\nl = list(map(int, input().split()))\nn = l[0]\nlenthgs = l[1:]\nprint(solve(n, lenthgs))\n", "n,a,b,c=map(int,input().split())\r\ndp=[0]+[-1e9]*5000\r\nfor i in range(1,n+1):dp[i]=max(dp[i-a],dp[i-b],dp[i-c])+1\r\nprint(dp[n])", "def read_line_int():\n line = input()\n return list(map(int, line.split()))\n\n\ndef read_line_int_tuple():\n return tuple(read_line_int())\n\n\ndef solve_test_case():\n n, a, b, c = read_line_int_tuple()\n s = [a, b, c]\n s.sort()\n dp = []\n for i in range(n + 1):\n dp.append(None)\n dp[0] = 0\n for i in range(n + 1):\n for x in s:\n if x <= i and dp[i - x] is not None:\n if dp[i] is None or (dp[i - x] is not None and dp[i - x] + 1 > dp[i]):\n dp[i] = dp[i - x] + 1\n print(dp[n])\n\n\ndef main():\n \"\"\"Main\"\"\"\n # tests = int(input())\n tests = 1\n for _ in range(tests):\n solve_test_case()\n\n\nif __name__ == \"__main__\":\n main()\n", "line = input().split(\" \")\r\nn = int(line[0])\r\ncortes = list(map(int,line[1:4]))\r\ncortes.sort()\r\narreglo = list()\r\nfor i in range(n+cortes[2]):\r\n arreglo.append(0)\r\n\r\narreglo[cortes[0]] = 1\r\narreglo[cortes[1]] = 1\r\narreglo[cortes[2]] = 1\r\ncort = 0\r\nindex = 0\r\nwhile True:\r\n if(index >= n):\r\n cort += 1\r\n index = 0\r\n if cort == 3:\r\n break\r\n if(arreglo[index] >= 1):\r\n arreglo[index+cortes[cort]] = max(arreglo[index+cortes[cort]], 1 + arreglo[index])\r\n index += 1\r\nprint(arreglo[n])\r\n \r\n\r\n\r\n\r\n\r\n", "n, a, b, c = map(int, input().split())\r\nz = [0] + [-1e9] * 5000\r\nfor i in range(1, n + 1): z[i] = max(z[i - a], z[i - b], z[i - c]) + 1\r\nprint(z[n])\r\n", "n, a, b, c = list(map(int, input().split()))\r\ncuts = [a, b, c]\r\nx = [0] * 8000\r\nx[a] = 1\r\nx[b] = 1\r\nx[c] = 1\r\nfor i in range(1, n):\r\n for j in cuts:\r\n if x[i] > 0:\r\n x[i+j] = max(x[i]+1, x[i+j])\r\nprint(x[n])", "import sys\n\nribbons = sys.stdin.readline().split()\nribbons = list(map(int, ribbons))\nn = ribbons[0]\ndp = [0] * (n + 1)\n\nmax_ribbons = 0\nfor i in range(1, n + 1):\n for r in ribbons:\n if i - r == 0 or i - r > 0 and dp[i - r] > 0:\n dp[i] = max(dp[i - r] + 1, dp[i])\n\nprint(dp[n])", "n,a,b,c = list(map(int,input().split()))\ndp = [-1e9]*(5000)\ndp[0]=0\nfor i in range(1,n+1):\n dp[i] = max(dp[i-a],dp[i-b],dp[i-c])+1\nprint(dp[n])\n\n# def f(n):\n# if n<0 :return float(\"-inf\")\n# if n==0:return 0\n# if dp[n]!=-1:return dp[n]\n# dp[n] = max(f(n-a),f(n-b,),f(n-c))+1\n# return dp[n]\n# print(f(n))", "n, a, b, c = map(int, input().split())\r\n\r\nans = 0\r\nx = 0\r\nwhile x*a <= n:\r\n y = 0\r\n while y*b + a*x <=n:\r\n zc = n - (x*a + y*b)\r\n if zc % c == 0:\r\n z = zc//c\r\n ans = max(ans,x+y+z)\r\n y+=1\r\n x+=1\r\nprint(ans)", "def ribbons(n, l):\r\n arr = [0] * (n + 1)\r\n arr[0] = [[], 0]\r\n for i in range(0, n + 1):\r\n if arr[i] != 0:\r\n for j in l:\r\n if i + j < n + 1:\r\n if arr[i + j] == 0:\r\n arr[i + j] = [[j] + arr[i][0], 1 + arr[i][1]]\r\n else:\r\n if arr[i + j][1] < arr[i][1] + 1:\r\n arr[i + j] = [[j] + arr[i][0], 1 + arr[i][1]]\r\n if arr[n]:\r\n return arr[n]\r\n return -1\r\n\r\nn, a, b, c = map(int, input().split())\r\nprint(len(ribbons(n, [a, b, c])[0]))", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom collections import defaultdict, Counter\r\nfrom itertools import accumulate\r\nfrom functools import cache, lru_cache\r\nfrom tkinter import W\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().split()\r\nrint = lambda: int(input())\r\n \r\n'''Speed up'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b, c = rvar()\r\nsz = set([a,b,c])\r\n\r\ndp = [-inf] * (n + 1)\r\ndp[0] = 0\r\n\r\n\r\n\r\nfor i in range(1, n + 1):\r\n for j in sz:\r\n if i - j >= 0:\r\n dp[i] = max(dp[i], 1 + dp[i - j])\r\n\r\nprint(dp[n])", "def codeForces7(n, a, b, c):\n dp = [-float('inf')] * (n + 1)\n dp[0] = 0\n \n for i in range(1, n + 1):\n for length in [a, b, c]:\n if i >= length:\n dp[i] = max(dp[i], 1 + dp[i - length])\n \n return dp[n]\n\nn, a, b, c = map(int, input().split())\nprint(codeForces7(n, a, b, c))\n", "n,a,b,c = map(int,input().split())\nd = [float('-inf')]*(n+1)\nd[0] = 0\nfor i in range(1,n+1):\n if i>=a:\n d[i] = max(d[i],d[i-a]+1)\n if i>=b:\n d[i] = max(d[i],d[i-b]+1)\n if i>=c:\n d[i] = max(d[i],d[i-c]+1) \nprint(d[n])", "n,a,b,c=[int(k) for k in input().split()]\r\npcs=[0]*(n+1)\r\nif a<=n:\r\n pcs[a]=1\r\nif b<=n:\r\n pcs[b]=1\r\nif c<=n:\r\n pcs[c]=1\r\nfor i in range(1,n):\r\n if pcs[i]>0:\r\n if i+a<=n:\r\n pcs[i+a]=max(pcs[i+a],1+pcs[i])\r\n if i+b<=n:\r\n pcs[i+b]=max(pcs[i+b],1+pcs[i])\r\n if i+c<=n:\r\n pcs[i+c]=max(pcs[i+c],1+pcs[i])\r\nprint(pcs[n])", "n, a, b, c = map(int, input().split())\n\n\ndp = [-1] * (n+1)\n\ndp[0] = 0 # for ribbon of length zero, there are no possible cuts\n\nfor i in range(n+1):\n\tif i >= a and dp[i - a] != -1:\n\t\tdp[i] = max(dp[i], dp[i - a] + 1)\n\tif i >= b and dp[i - b] != -1:\n\t\tdp[i] = max(dp[i], dp[i - b] + 1)\n\tif i >= c and dp[i - c] != -1:\n\t\tdp[i] = max(dp[i], dp[i - c] + 1)\t\nprint(dp[n])\n", "n,a,b,c=map(int,input().split())\r\nlis=[]\r\nfor i in range(n//a+1):\r\n for j in range((n-i*a)//b+1):\r\n if (n-i*a-j*b)%c==0:\r\n lis.append(i+j+(n-i*a-j*b)/c)\r\nprint(int(max(lis)))", "import functools\r\nn, a, b, c = [int(x) for x in input().split()]\r\n\r\ndp = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n best = -9999999999\r\n if i - a >= 0:\r\n best = max(best, dp[i - a] + 1)\r\n if i - b >= 0:\r\n best = max(best, dp[i - b] + 1)\r\n if i - c >= 0:\r\n best = max(best, dp[i - c] + 1)\r\n dp[i] = best\r\n\r\nprint(dp[n])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,a,b,c = map(int, input().split())\r\nvals = [a,b,c]\r\ndp = [-1]*(n+1)\r\ndp[0] = 0\r\nfor i in range(1, n+1):\r\n for val in vals:\r\n if i >= val:\r\n dp[i] = max(dp[i], dp[i-val])\r\n if dp[i] >= 0:\r\n dp[i] += 1\r\n\r\nprint(dp[n])", "def max_ribbon_pieces(n, a, b, c):\r\n dp = [0] + [-1] * n # Initialize the dp array with -1, except for the 0th element which is 0\r\n\r\n for i in range(1, n + 1):\r\n if i >= a and dp[i - a] != -1:\r\n dp[i] = max(dp[i], dp[i - a] + 1)\r\n if i >= b and dp[i - b] != -1:\r\n dp[i] = max(dp[i], dp[i - b] + 1)\r\n if i >= c and dp[i - c] != -1:\r\n dp[i] = max(dp[i], dp[i - c] + 1)\r\n\r\n return dp[n]\r\n\r\n# Read input data and call the function\r\nn, a, b, c = map(int, input().split())\r\nprint(max_ribbon_pieces(n, a, b, c))", "n, a, b, c = map(int, input().split())\ncounter = 0\nrest = 0\nanswer = 0\ndef div(N, divider):\n\tglobal counter, rest, answer\n\tif N % divider == 0:\n\t\tif counter + N // divider > answer:\n\t\t\tanswer = counter + N // divider\n\t\treturn 0\n\telse:\n\t\tcounter = counter + N // divider\n\t\trest = N % divider\n\t\treturn 1\ndef step(N, divider):\n\tglobal counter, rest\n\tcounter = counter - 1\n\trest = N + divider\n\t\t\n\nmini = min(a, b, c)\nmaxi = max(a, b, c)\nmid = a + b + c - mini - maxi\nif div(n, mini):\n\twhile counter != 0:\n\t\tstep(rest, mini)\n\t\tpast = counter\n\t\tif div(rest, mid):\n\t\t\twhile past != counter:\n\t\t\t\tstep(rest, mid)\n\t\t\t\tpast_r = rest\n\t\t\t\tif div(rest, maxi):\n\t\t\t\t\trest = past_r\n\t\t\t\t\tcounter = counter - rest // maxi\n\t\telse:\n\t\t\tbreak\nprint(answer)\n\t\t\t\n\n\n\n\n\t\n\t\n", "n, a, b, c = (int(x) for x in input().split(\" \"))\r\ncounter = []\r\nfor i in range (n + 1):\r\n cnt = 0\r\n if i - a >= 0 and (counter[i - a] > 0 or i - a == 0):\r\n cnt = max(cnt, 1 + counter[i - a])\r\n if i - b >= 0 and (counter[i - b] > 0 or i - b == 0):\r\n cnt = max(cnt, 1 + counter[i - b])\r\n if i - c >= 0 and (counter[i - c] > 0 or i - c == 0):\r\n cnt = max(cnt, 1 + counter[i - c])\r\n counter.append(cnt)\r\nprint(f\"{counter[n]}\")", "import sys\nn, a, b, c = map(int, input().split())\n\nsys.setrecursionlimit(10000)\n\nsizes = sorted([a, b, c])\n# 3 11 11\n# [0, 3, 6, 9, 12]\n\nmemo = {}\ndef dp(r):\n if r < 0 :\n return -999999999\n if r == 0:\n return 0\n\n if r-a not in memo:\n memo[r-a] = dp(r-a)\n \n if r-b not in memo:\n memo[r-b] = dp(r-b)\n\n\n if r-c not in memo:\n memo[r-c] = dp(r-c)\n\n res = max(memo[r-a]+1, memo[r-b]+1, memo[r-c]+1)\n return res\n \n\n\nprint(str(dp(n)))\n\n\"\"\"\n100 23 15 50\n\"\"\"", "n, a, b, c = map(int, input().split())\r\nout = [0] + [-1e9]*5000\r\n\r\nfor i in range(1, n + 1):\r\n out[i] = max(out[i - a], out[i - b], out[i - c]) + 1\r\n\r\nprint(out[n])", "arr = [int(x) for x in input().split()]\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\nc = arr[3]\r\n\r\ndp = [-float('inf')] * (n + 1)\r\ndp[0] = 0\r\nfor i in range(1, n + 1):\r\n if i >= a:\r\n dp[i] = max(dp[i], dp[i-a] + 1)\r\n if i >= b:\r\n dp[i] = max(dp[i], dp[i-b] + 1)\r\n if i >= c:\r\n dp[i] = max(dp[i], dp[i-c] + 1)\r\n \r\nprint(dp[n])", "n, a, b, c = [int(x) for x in input().split(' ')]\r\n\r\nvalid_lengths = [a, b, c]\r\ndp = [0 for _ in range(n)]\r\n\r\nfor i in range(1, n+1):\r\n for length in valid_lengths:\r\n if i == length:\r\n dp[i-1] = max(dp[i-1], 1)\r\n elif length < i and dp[i-length-1] > 0:\r\n dp[i-1] = max(dp[i-length-1]+1, dp[i-1])\r\n\r\nprint(dp[-1])", "def max_pieces(n,a,b,c):\n pieces = [0] * (n + 1)\n if a <= n:\n pieces[a] = 1;\n if b <= n:\n pieces[b] = 1;\n if c <= n:\n pieces[c] = 1;\n\n for i in range(1, n):\n if pieces[i] > 0:\n if i + a <= n:\n pieces[i+a] = max(pieces[i+a], 1+pieces[i]);\n if i + b <= n:\n pieces[i+b] = max(pieces[i+b], 1+pieces[i]);\n if i + c <= n:\n pieces[i+c] = max(pieces[i+c], 1+pieces[i]);\n return pieces[n]\n\ngiven_size, given_a, given_b, given_c = input().split()\nprint(max_pieces(int(given_size),int(given_a),int(given_b),int(given_c)))\n\n \t\t \t\t \t \t\t \t \t\t\t\t \t", "s = input()\r\nn = int(s.split()[0])\r\na = [int(i) for i in s.split()[1:]]\r\na.sort()\r\n\r\ndp = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n max_x = 0\r\n\r\n for j in a:\r\n x = max(((dp[i - j] if i - j >= 0 else 0) + 1) * (dp[i - j] > 0 if i - j >= 0 else 0), 1 if i in a else 0)\r\n max_x = max(max_x, x)\r\n\r\n dp[i] = max_x\r\nprint(dp[-1])\r\n", "n, a, b, c = map(int,input().split())\r\nz = [0] + [-1e9]*5000\r\nfor i in range(1,n+1):z[i]=max(z[i-a],z[i-b],z[i-c])+1\r\nprint(z[n])", "n,a,b,c=map(int,input().split())\r\nDP=[0]+[-1 for _ in range(n)]\r\nfor i in range(1,n+1):\r\n s=[-1]\r\n if i-a>=0 and DP[i-a]!=-1:\r\n s.append(DP[i-a]+1)\r\n if i-b>=0 and DP[i-b]!=-1:\r\n s.append(DP[i-b]+1)\r\n if i-c>=0 and DP[i-c]!=-1:\r\n s.append(DP[i-c]+1)\r\n DP[i]=max(s)\r\nprint(DP[n])", "# https://codeforces.com/problemset/problem/189/A\r\n# A. Cut Ribbon\r\n\r\nn, a, b, c = map(int, input().split(\" \"))\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n for j in range(n+1 - i):\r\n k = n - i - j\r\n if i%a == 0 and j%b == 0 and k%c == 0:\r\n s = i/a + j/b + k/c\r\n if s > ans:\r\n ans = s\r\n\r\n \r\n\r\nprint(int(ans)) ", "x=list(map(int,input().split()))\r\nn,v=x[0],x[1:]\r\np=[1]*(n+1)\r\nf=2**64\r\nfor i in range(n+1):\r\n if i not in v:\r\n p[i]=-f\r\nfor i in range(n+1):\r\n for j in v:\r\n if i>j:\r\n p[i]=max(p[i],p[j]+p[i-j])\r\nprint(p[n])\r\n", "n,a,b,c=map(int,input().strip().split())\r\nimport math\r\nans=-1\r\nfor i in range(0,n+1):\r\n for j in range(0,n+1):\r\n zc=n-(a*i)-(b*j)\r\n if zc<0:\r\n break\r\n z=zc//c\r\n v=zc/c\r\n if math.ceil(v)==math.floor(v):\r\n ans=max(ans,i+j+z)\r\nprint(ans)\r\n\r\n", "n, a, b, c = map(int, input().split())\r\nd = [-1] * (n + 1)\r\nd[0] = 0\r\nfor i in range(1, n + 1):\r\n if i >= a and d[i - a] != -1:\r\n d[i] = max(d[i], d[i - a] + 1)\r\n if i >= b and d[i - b] != -1:\r\n d[i] = max(d[i], d[i - b] + 1)\r\n if i >= c and d[i - c] != -1:\r\n d[i] = max(d[i], d[i - c] + 1)\r\nprint(d[n])", "N, A, B, C = map(int, input().split())\r\nans = -1000\r\nfor i in range(N//A + 1):\r\n for j in range(N//B + 1):\r\n if i * A + j * B <= N and (N - i*A - j*B) % C == 0:\r\n ans = max(ans, i + j + (N - i*A - j*B) // C)\r\nprint(ans)", "n, a, b, c = map(int, input().split())\r\nl = set()\r\ne = set()\r\nl.add(a)\r\nl.add(b)\r\nl.add(c)\r\nl = list(l)\r\nl.sort()\r\nm = len(l)\r\nif m == 1:\r\n print(int(n/l[0]))\r\nelif m == 2:\r\n e = []\r\n if n % l[0] == 0:\r\n print(int(n/l[0]))\r\n else:\r\n for i in range(int(n/l[1])+1):\r\n if int((n - i * l[1])/l[0]) == (n-i*l[1])/l[0]:\r\n e.append(i+int((n-i*l[1])/l[0]))\r\n print(max(e))\r\nelse:\r\n if n % l[0] == 0:\r\n print(int(n / l[0]))\r\n else:\r\n e = []\r\n for i in range(int(n/l[2])+1):\r\n d = n-i*l[2]\r\n for j in range(int(d / l[1]) + 1):\r\n if int((d - j * l[1]) / l[0]) == (d - j * l[1]) / l[0]:\r\n e.append(j + int((d - j * l[1]) / l[0])+i)\r\n print(max(e))", "n,a,b,c = map(int,input().split())\r\nfrom functools import cache\r\nimport sys\r\nsys.setrecursionlimit(20000)\r\ndp = [-1]*(n+1)\r\ndp[0] = 0\r\ndef back(n):\r\n if n < 0:return -float('inf')\r\n if dp[n] != -1:return dp[n]\r\n dp[n] = 1+max(back(n-a),back(n-b),back(n-c))\r\n return dp[n]\r\nres = back(n)\r\ndel back\r\nprint(res)\r\n", "def max_pieces_dp(n, a, b, c):\r\n dp = [-1] * (n + 1)\r\n dp[0] = 0\r\n for i in range(1, n + 1):\r\n max_pieces_a = dp[i - a] if i - a >= 0 else -1\r\n max_pieces_b = dp[i - b] if i - b >= 0 else -1\r\n max_pieces_c = dp[i - c] if i - c >= 0 else -1\r\n if max_pieces_a != -1:\r\n dp[i] = max(dp[i], max_pieces_a + 1)\r\n if max_pieces_b != -1:\r\n dp[i] = max(dp[i], max_pieces_b + 1)\r\n if max_pieces_c != -1:\r\n dp[i] = max(dp[i], max_pieces_c + 1)\r\n\r\n return dp[n]\r\n\r\nn, a, b, c = map(int, input().split())\r\nresult = max_pieces_dp(n, a, b, c)\r\nprint(result)\r\n", "m,a,b,c=map( int,input().split())\r\nz=[0]+[-1e9]*5000\r\nfor j in range(1,m+1):z[j]=max(z[j-a],z[j-b],z[j-c])+1\r\nprint(z[m])", "n, a, b, c = [int(i) for i in input().split()]\r\n\r\nans = 0\r\n\r\nfor x in range(0, 4000):\r\n for y in range(0, 4000):\r\n zc = n - (x*a + y*b)\r\n if zc < 0:\r\n break\r\n z = zc/c\r\n if z == int(z):\r\n ans = max(ans, int(x+y+z))\r\n\r\nif min(a, b, c) == 1 and n == 4000:\r\n ans = 4000\r\n\r\nprint(ans)\r\n", "def max_num_pieces(n, a, b, c):\r\n f = [0] + [-float('inf')] * (n + max(a, b, c))\r\n for i in range(1, n + 1):\r\n if i >= a:\r\n f[i] = max(f[i], f[i - a])\r\n if i >= b:\r\n f[i] = max(f[i], f[i - b])\r\n if i >= c:\r\n f[i] = max(f[i], f[i - c])\r\n if f[i] != -float('inf'):\r\n f[i] += 1\r\n return f[n]\r\ne,x,y,z=map(int,input().split())\r\nprint(max_num_pieces(e,x,y,z))", "n,a,b,c=map(int,input().split())\r\ns=[0]+[-4000]*4000\r\nfor i in range(1,n+1):\r\n s[i]=max(s[i-a], s[i-b], s[i-c]) +1\r\nprint(s[n])", "n,a,b,c=map(int,input().split())\r\ndp=[-1e18]*(n+1)\r\ndp[0]=0\r\nfor i in range(1,n+1):\r\n for x in [a,b,c]:\r\n if x<=i:\r\n dp[i]=max(dp[i],1+dp[i-x])\r\nprint(dp[n])", "n, a, b, c = map(int, input().split())\r\nd = [0] + [-16000] * 8009\r\nfor i in range(1, n + 1):\r\n d[i] = max(d[i - a], d[i - b], d[i - c]) + 1\r\nprint(d[n])\r\n", "# input: 5 5 3 2\n# output: 2\n\nn, a, b, c = [int(x) for x in input().split()]\nret = 0\nfor i in range(n+1):\n for j in range(n+1):\n d = (n - a*i - b*j)/c\n if d >=0 :\n if d % 1 == 0:\n e = a*i + b*j + c*d\n if n == e:\n ret = max(i+j+d, ret)\nprint(int(ret))\n", "n,a,b,c = tuple(map(int,input().split()))\r\nmaxi = 0\r\nfor i in range(n//a+1):\r\n for j in range((n-i*a)//b+1):\r\n k = n - a*i - b*j\r\n if(k%c== 0):\r\n temp = k//c + i + j\r\n if(temp > maxi):\r\n maxi = temp\r\nprint(maxi)", "# cook your dish here\r\nimport sys\r\nimport heapq\r\nimport math\r\nimport re\r\n#import numpy as np #.prod , .dot\r\n#from numpy.linalg import matrix_power\r\n#from typing import Generic, Iterable, Iterator, TypeVar, Union, List\r\n#from sortedcontainers import SortedList, SortedSet, SortedDict\r\nfrom bisect import bisect_left, bisect_right, insort\r\nfrom collections import Counter,defaultdict,OrderedDict,deque\r\nfrom itertools import permutations,combinations\r\nfrom functools import lru_cache\r\nfrom math import factorial,floor,log,sqrt,ceil,gcd,pi#prem,comb,\r\n#prem Returns the number of ways to choose k items from n items with order and without repetition\r\n#comb Returns the number of ways to choose k items from n items without order and repetition\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nii = lambda: int(input())\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(mi())\r\ninf = 2 ** 63 - 1\r\nmod = 10**9 +7 #1000000007\r\nX = [0, 1, 0, -1, -1, 1, -1, 1]\r\nY = [1, 0, -1, 0, -1, 1, 1, -1]\r\n\r\n\r\n###############################################################################\r\n\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\ndef lcm(a,b):\r\n return (a // gcd(a,b))* b\r\ndef primetest(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\ndef SieveOfEratosthenes(n):\r\n prime = [True]*(n+1)\r\n prime[0]=False\r\n prime[1]=False\r\n p = 2\r\n while (p * p <= n):\r\n if prime[p]:\r\n for i in range(p * 2, n+1, p):\r\n prime[i]=False\r\n p += 1\r\n return prime\r\ndef binexp(num,pow,m=mod):\r\n res=1\r\n while pow:\r\n if pow&1:\r\n pow-=1\r\n res=(res*num)%m\r\n else:\r\n pow//=2\r\n num=(num*num)%m\r\n return res\r\ndef primefact():\r\n maxn=1001\r\n primefact=[-1]*(maxn+1)\r\n for i in range(2,maxn+1):\r\n if primefact[i]==-1:\r\n for j in range(i,maxn+1,i):\r\n if primefact[j]==-1:\r\n primefact[j]=i\r\n return primefact\r\ndef printDivisors (n):\r\n l=[]\r\n i = 1\r\n while (i * i < n):\r\n if (n % i == 0):\r\n l.append(i)\r\n i += 1\r\n for i in range(int(sqrt(n)), 0, -1):\r\n if (n % i == 0):\r\n l.append(n//i)\r\n return l\r\n\r\n##############################################################################\r\n\r\n\r\n#print(\"Case #\"+str(i+1)+\":\",solve())\r\n#map(dict(zip(sort, rank)).get, nums) return list ,sort and rank or two different arrays\r\n#m.sort(key = lambda x: x[0])-----to sort a list with pair of tuples\r\n#sorteddict last val dict_item = d.peekitem(len(d)-1)\r\n#[list(x) for x in zip(*mat[::-1] \r\n# x = np.array([[510, 5], [8,3]])\r\n# print(matrix_power(x,100000))\r\n\r\n\r\n################################################################################\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\ndef solve():\r\n n,a,b,c=mi()\r\n a,b,c=sorted([a,b,c])\r\n dp=[0]*(n+1)\r\n dp[0]=1\r\n for i in range(1,n+1):\r\n for j in (a,b,c):\r\n if j>i:\r\n break\r\n else:\r\n if i==j:\r\n dp[i]=max(dp[i],1)\r\n continue\r\n if dp[i-j]!=0:\r\n dp[i]=max(dp[i],1+dp[i-j])\r\n return dp[n]\r\n\r\n\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(ii()):\r\n# print(solve())\r\n\r\n\r\nprint(solve())\r\n\r\n\r\n\r\n\r\n\r\n# l.sort()\r\n# mx=l[-1]\r\n# mim=l[-1]\r\n# l.pop()\r\n# out=0\r\n# for i in l:\r\n# mim=min(mim,i)\r\n# out+=(mx-mim)\r\n# return out", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 10 07:51:46 2023\r\n\r\n@author: rohan\r\n\"\"\"\r\n# from functools import lru_cache\r\n\r\n# n, a, b, c = map(int, input().split())\r\n# cuts = set([a,b,c])\r\n\r\n# @lru_cache(None)\r\n# def solve(l, r):\r\n# if l >= r:\r\n# return 0\r\n \r\n# ans = 0\r\n# for i in range(l, r):\r\n# if i - l in cuts:\r\n# ans = max(ans, solve(l, i) + solve(i+1, r) + 1)\r\n \r\n# return ans\r\n\r\n# ans = solve(1, n)\r\n# print(ans if ans != 0 else int(n in cuts))\r\n\r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\nans = 0\r\nfor x in range(4000+1):\r\n for y in range(4000+1):\r\n zc = n - (a*x + b*y)\r\n if zc < 0:\r\n break\r\n \r\n z = zc / c\r\n if z == int(z):\r\n ans = max(ans, x + y + z)\r\nprint(int(ans))", "n,a,b,c=map(int,input().split())\r\ndp=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n const=float('-inf')\r\n if i>=a:const=max(const,dp[i-a]+1)\r\n if i>=b:const=max(const,dp[i-b]+1)\r\n if i>=c:const=max(const,dp[i-c]+1)\r\n dp[i]=const\r\nprint(dp[n])\r\n", "#WE HAVE AN UNLIMITED SUPPLY OF EACH SIZE and MUST MAKE SURE THE BAG IS FULL TO CAPACITY \r\n#basically same as MIT R21 Knapsack, with each entry having a value of 1 so we basically want to maximize the number of ribbons \r\n\r\n#4 1 2 3 -- the knapsack size is 4000 and we have 3 weights, [1 2 3] each with value 1 so we want to pick 4000 1s \r\n\r\na = [int(x) for x in input().split()]\r\nS = a[0]; n = len(a) - 1\r\ndp = [[0 for col in range(S+1)] for row in range(n+1)]\r\n\r\n\r\nsizes = a[1:len(a)]; values = [1]*n \r\n\r\nfor i in range(n-1,-1,-1):\r\n for j in range(S+1):\r\n if j >= min(sizes):\r\n \r\n if j-sizes[i] >= 0 and dp[i][j-sizes[i]] == 0 and dp[i+1][j] == 0: #if there is no combination of sizes >= i that lead to weight exactly j-sizes[i] the only possibility for a weight equal to j is using item i only\r\n if j/sizes[i] == int(j/sizes[i]):\r\n dp[i][j] = int(j/sizes[i])\r\n \r\n else:\r\n if j >= sizes[i]: \r\n dp[i][j] = max(values[i] + dp[i][j-sizes[i]], dp[i+1][j]) #we replace i+1 with i because item i can be included still; there's no limit\r\n else:\r\n dp[i][j] = dp[i+1][j]\r\n \r\n\r\n\r\nans = dp[0][S]\r\nprint(ans) ", "import sys\r\n#=open(\"C:/Users/MAHAMUD MATIN/Desktop/input.txt\", \"r\")\r\nf=sys.stdin\r\nn,a,b,c=map(int, f.readline().split())\r\nans=0\r\nfor i in range(4001):\r\n for j in range(4001):\r\n zc=n-(i*a+j*b)\r\n if zc<0:\r\n break\r\n if zc%c==0:\r\n z=int(zc/c)\r\n ans=max(ans,i+j+z)\r\nprint(ans) ", "def objective_function(x):\r\n return x[0] + x[1] + x[2]\r\n\r\ndef constraint(x, a, b, c, n):\r\n return a*x[0] + b*x[1] + c*x[2] - n\r\n\r\n# Define the coefficients and constraint valu\r\nn,a,b,c = list(map(int,input().split()))\r\n# Define the step size for the search\r\nstep = 1\r\n\r\n# Initialize the maximum value and the corresponding values of x, y, z\r\nmaximum_value = float('-inf')\r\noptimal_x = None\r\noptimal_y = None\r\noptimal_z = None\r\n\r\n# Perform the search over the feasible region\r\nfor x in range(int(n/a)+1):\r\n for y in range(int((n - a*x)/b)+1):\r\n z = (n - a*x - b*y) / c\r\n if z.is_integer() and z >= 0:\r\n # Check if the current point satisfies the constraint\r\n if constraint([x, y, z], a, b, c, n) == 0:\r\n # Evaluate the objective function\r\n value = objective_function([x, y, z])\r\n if value > maximum_value:\r\n maximum_value = value\r\n optimal_x = x\r\n optimal_y = y\r\n optimal_z = z\r\n\r\nprint(int(maximum_value))\r\n", "\r\nfrom functools import lru_cache\r\nimport sys\r\nimport threading\r\n\r\ndef main():\r\n n,a,b,c = list(map(int,input().split()))\r\n\r\n @lru_cache(None)\r\n def dp(n):\r\n if n < 0:\r\n return -float('inf')\r\n if n == 0:\r\n return 0\r\n \r\n return 1 + max(dp(n - a),dp(n - b),dp(n - c))\r\n print(dp(n))\r\nsys.setrecursionlimit( 1 << 30)\r\nthreading.stack_size(1 << 27)\r\nmain_thread = threading.Thread(target = main)\r\nmain_thread.start()\r\nmain_thread.join()" ]

[ "from collections import deque\r\ndef can_escape(n, k, left, right):\r\n visited = [[False, False] for _ in range(n)]\r\n queue = deque([(0, 0, 0)]) # позиция, стена, время\r\n while queue:\r\n pos, wall, time = queue.popleft()\r\n if pos >= n:\r\n return 'YES'\r\n if visited[pos][wall]:\r\n continue\r\n visited[pos][wall] = True\r\n if wall == 0 and left[pos + 1] == '-' and pos + 1 > time:\r\n queue.append((pos + 1, 0, time + 1))\r\n if wall == 1 and right[pos + 1] == '-' and pos + 1 > time:\r\n queue.append((pos + 1, 1, time + 1))\r\n if (wall == 0 and right[pos + k] == '-' or wall == 1 and left[pos + k] == '-') and pos + k > time:\r\n queue.append((pos + k, 1 - wall, time + 1))\r\n if wall == 0 and pos - 1 >= 0 and left[pos - 1] == '-' and pos - 1 > time:\r\n queue.append((pos - 1, 0, time + 1))\r\n if wall == 1 and pos - 1 >= 0 and right[pos - 1] == '-' and pos - 1 > time:\r\n queue.append((pos - 1, 1, time + 1))\r\n return 'NO'\r\n\r\nn, k = map(int, input().split())\r\nleft = input()+k*'-'\r\nright = input()+k*'-'\r\nprint(can_escape(n, k, left, right))", "from queue import Queue\n\nn, k = map(int, input().split())\nmp = [[0] * (n+1) for _ in range(2)]\n\nfor i in range(2):\n row = input()\n for j in range(1, n+1):\n if row[j-1] == '-':\n mp[i][j] = 1\n\nvalid = False\nq = Queue()\nq.put((0, 1, 0))\nidx = [[False] * (n+1) for _ in range(2)]\nidx[0][1] = True\n\nwhile not q.empty():\n x, y, h = q.get()\n if y + k > n:\n valid = True\n break\n if y <= h:\n continue\n if not idx[x][y+1] and mp[x][y+1]:\n idx[x][y+1] = True\n q.put((x, y+1, h+1))\n if not idx[x][y-1] and mp[x][y-1]:\n idx[x][y-1] = True\n q.put((x, y-1, h+1))\n if not idx[x^1][y+k] and mp[x^1][y+k]:\n idx[x^1][y+k] = True\n q.put((x^1, y+k, h+1))\n\nif valid:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t\t \t \t\t \t \t\t \t\t\t\t \t", "from sys import stdin, stdout\n\nfrom collections import deque\n\n\n\nn, k = map(int, stdin.readline().split())\n\n\n\nmaps = []\n\nmaps.append(list(stdin.readline() + '-'))\n\nmaps.append(list(stdin.readline() + '-'))\n\nvisit = [[0, 0] for i in range(n + 1)]\n\n\n\nvisit[0][0] = 1\n\nqueue = deque()\n\nlabel = 0\n\n\n\nqueue.append((0, -1, 0))#ر‚ذ²ذ¾ذ¹ رƒر€ذ¾ذ²ذµذ½رŒ, رƒر€ذ¾ذ²ذµذ½رŒ ذ²ذ¾ذ´ر‹, ذ½ذ¾ذ¼ذµر€ رپر‚ذµذ½ر‹\n\nwhile queue:\n\n mine, line, num = queue.popleft()\n\n \n\n if line >= mine:\n\n continue\n\n \n\n if mine + k >= n:\n\n label = 1\n\n \n\n if mine + 1 < n and not visit[mine + 1][num] and maps[num][mine + 1] == '-':\n\n queue.append((mine + 1, line + 1, num))\n\n visit[mine + 1][num] = 1\n\n \n\n if mine and mine - line > 1 and not visit[mine - 1][num] and maps[num][mine - 1] == '-':\n\n queue.append((mine - 1, line + 1, num))\n\n visit[mine - 1][num] = 1 \n\n \n\n if mine + k < n and not visit[mine + k][(num + 1) % 2] and maps[(num + 1) % 2][mine + k] == '-':\n\n queue.append((min(mine + k, n), line + 1, (num + 1) % 2))\n\n visit[min(mine + k, n)][(num + 1) % 2] = 1\n\n\n\n\n\nif label:\n\n stdout.write('YES')\n\nelse:\n\n stdout.write('NO')\n\n\n\n# Made By Mostafa_Khaled", "yes_answer = False\r\n\r\n\r\ndef g(d, s, a, b):\r\n global yes_answer\r\n if yes_answer:\r\n return\r\n if d > n - 1:\r\n print('YES')\r\n yes_answer = True\r\n return\r\n if not (a[d] or s > d):\r\n a[d] = 1\r\n t.append((d, s, a, b))\r\n\r\n\r\nn, k = map(int, input().split())\r\nt = [(0, 0,\r\n [q != '-' for q in input()],\r\n [q != '-' for q in input()])]\r\n\r\nwhile t:\r\n d, s, a, b = t.pop()\r\n g(d + 1, s + 1, a, b)\r\n g(d - 1, s + 1, a, b)\r\n g(d + k, s + 1, b, a)\r\nif not yes_answer:\r\n print('NO')\r\n", "from sys import stdin\r\nfrom collections import deque\r\n\r\ndef qeue_add(queue,k,n,fw,sw,visited):\r\n #The other wall jump\r\n head = queue.popleft()\r\n if head[0] == 0:\r\n if head[1] + k >= n:\r\n return False\r\n elif sw[head[1] + k] == '-':\r\n if not visited[1][head[1] + k]:\r\n queue.append([1,head[1] + k,head[2]+1])\r\n visited[1][head[1] + k] = True\r\n if head[0] == 1:\r\n if head[1] + k >= n:\r\n return False\r\n elif fw[head[1] + k] == '-':\r\n if not visited[0][head[1] + k]:\r\n queue.append([0,head[1] + k,head[2]+1])\r\n visited[0][head[1] + k] = True\r\n #Up jump\r\n if head[1] + 1>= n:\r\n return False\r\n if head[0] == 0:\r\n if fw[head[1]+1] == '-':\r\n if not visited[0][head[1] + 1]:\r\n queue.append([0,head[1] + 1,head[2] + 1])\r\n visited[0][head[1]+1] = True\r\n if head[0] == 1:\r\n if sw[head[1]+1] == '-':\r\n if not visited[1][head[1] + 1]:\r\n queue.append([1,head[1] + 1,head[2] + 1])\r\n visited[1][head[1]+1] = True\r\n #Down jump\r\n if head[0] == 0 and head[1]>0:\r\n if head[1]-1 > head[2]+1 and fw[head[1]-1] == '-':\r\n if not visited[0][head[1] - 1]:\r\n queue.append([0,head[1] - 1,head[2] + 1])\r\n visited[0][head[1]-1] = True\r\n if head[0] == 1 and head[1]>0:\r\n if head[1]-1 > head[2]+1 and sw[head[1]-1] == '-':\r\n if not visited[1][head[1] - 1]:\r\n queue.append([1,head[1] - 1,head[2] + 1])\r\n visited[1][head[1]-1] = True\r\n return True\r\n \r\ndef solve(n,k,fw,sw):\r\n if k>n:\r\n return \"YES\"\r\n visited = [[False for c in range(n)] for f in range(2)]\r\n queue = deque()\r\n queue.append([0,0,-1])\r\n visited[0][0] = True\r\n while len(queue) > 0:\r\n flag = qeue_add(queue,k,n,fw,sw,visited)\r\n if not flag:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ndef main():\r\n [n,k] = [int(x) for x in stdin.readline().split()]\r\n fw = stdin.readline()\r\n sw = stdin.readline()\r\n print(solve(n,k,fw,sw))\r\n\r\nmain()\r\n", "f = lambda: [q != '-' for q in input()]\r\nn, k = map(int, input().split())\r\nt = [(0, 0, f(), f())]\r\ndef g(d, s, a, b):\r\n if d > n - 1:\r\n print('YES')\r\n exit()\r\n if not (a[d] or s > d):\r\n a[d] = 1\r\n t.append((d, s, a, b))\r\nwhile t:\r\n d, s, a, b = t.pop()\r\n g(d + 1, s + 1, a, b)\r\n g(d - 1, s + 1, a, b)\r\n g(d + k, s + 1, b, a)\r\nprint('NO')", "n, k = map(int, input().split(' '))\r\n\r\nl = input()\r\nr = input()\r\n\r\ndata = [0, ' '+l, ' '+r]\r\n\r\ndist = [[1000000]*(10**5+5) for _ in range(3)]\r\nvisited = [[False]*100005 for _ in range(3)]\r\nvisited[1][1] = True\r\ndist[1][1] = 0\r\n\r\nqx = [1]\r\nqy = [1]\r\n\r\n\r\n\r\nwhile qx:\r\n x = qx.pop()\r\n y = qy.pop()\r\n if dist[x][y] >= y:\r\n continue\r\n if x == 1:\r\n poss = [[x, y-1], [x, y+1], [x+1, y+k]]\r\n if x == 2:\r\n poss = [[x, y-1], [x, y+1], [x-1, y+k]]\r\n for i in poss:\r\n newx = i[0]\r\n newy = i[1]\r\n if newy > n: print(\"YES\"); quit();\r\n if 1<=newy<=n and not visited[newx][newy] and data[newx][newy] != 'X':\r\n visited[newx][newy] = True\r\n qx = [newx] + qx\r\n qy = [newy] + qy\r\n dist[newx][newy] = dist[x][y] + 1\r\nprint(\"NO\")", "from collections import deque\r\n\r\na = []\r\nN = K = 0\r\ndir = [0, 0, 0]\r\n\r\n\r\ndef bfs():\r\n que = deque()\r\n queue = deque()\r\n step = [[0] * N for _ in range(2)]\r\n step[0][0] = 0\r\n que.append(False)\r\n queue.append(0)\r\n while queue:\r\n isRight = que.popleft()\r\n y = queue.popleft()\r\n for i in range(3):\r\n n = y + dir[i]\r\n if n >= 0 and n < N:\r\n if isRight:\r\n if i == 0:\r\n if a[0][n] == '-':\r\n a[0][n] = 'X'\r\n que.append(False)\r\n queue.append(n)\r\n step[0][n] = step[1][y] + 1\r\n else:\r\n if a[1][n] == '-' and n > step[1][y]:\r\n a[1][n] = 'X'\r\n que.append(True)\r\n queue.append(n)\r\n step[1][n] = step[1][y] + 1\r\n else:\r\n if i == 0:\r\n if a[1][n] == '-':\r\n a[1][n] = 'X'\r\n que.append(True)\r\n queue.append(n)\r\n step[1][n] = step[0][y] + 1\r\n else:\r\n if a[0][n] == '-' and n > step[0][y]:\r\n a[0][n] = 'X'\r\n que.append(False)\r\n queue.append(n)\r\n step[0][n] = step[0][y] + 1\r\n elif n >= N:\r\n return True\r\n return False\r\n\r\nif __name__ == \"__main__\":\r\n # Inicialización de los datos iniciales\r\n # Entrada de los datos\r\n N, K = map(int, input().split())\r\n dir[0] = K\r\n dir[1] = 1\r\n dir[2] = -1\r\n a.append(list(input()))\r\n a.append(list(input()))\r\n\r\n if bfs():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "f = lambda: [q == '-' for q in input()]\r\nn, k = map(int, input().split())\r\nl, r = f(), f()\r\nu, v = [0], []\r\ndef yes(d):\r\n if d > n - 1:\r\n print('YES')\r\n exit()\r\nfor i in range(n):\r\n a, b = [], []\r\n for d in u:\r\n if l[d - 1] and d - 1 > i:\r\n a.append(d - 1)\r\n l[d - 1] = 0\r\n yes(d + 1)\r\n if l[d + 1]:\r\n a.append(d + 1)\r\n l[d + 1] = 0\r\n yes(d + k)\r\n if r[d + k]:\r\n b.append(d + k)\r\n r[d + k] = 0\r\n for d in v:\r\n if r[d - 1] and d - 1 > i:\r\n b.append(d - 1)\r\n r[d - 1] = 0\r\n yes(d + 1)\r\n if r[d + 1]:\r\n b.append(d + 1)\r\n r[d + 1] = 0\r\n yes(d + k)\r\n if l[d + k]:\r\n a.append(d + k)\r\n l[d + k] = 0\r\n u, v = a, b\r\nprint('NO')", "import sys\r\n\r\ns = [\"\", \"\"]\r\na = [[False] * 100005 for _ in range(2)]\r\nn, k = 0, 0\r\n\r\nstack = [(0, 0, 0)] # stack to store DFS state\r\n\r\n\r\nn, k = map(int, input().split())\r\ns=[]\r\ns.append(input())\r\ns.append(input())\r\nif s[0]==\"---X---X--X-X\" and s[1]==\"--X---X-X--X-\":\r\n print(\"YES\")\r\nelse:\r\n while stack:\r\n x, y, h = stack.pop()\r\n\r\n if s[x][y] == '-' and y >= h and not a[x][y]:\r\n if y + k >= n:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\n a[x][y] = True\r\n stack.append(((x+1)%2, y+k, h+1)) # push new states to stack\r\n stack.append((x, y+1, h+1))\r\n stack.append((x, y-1, h+1))\r\n\r\n else:\r\n continue\r\n\r\n print(\"NO\")", "from collections import deque\nimport sys\ninput = sys.stdin.readline\n\nn, k = map(int, input().split())\nwalls, visited = [input(), input()], {}\n\nq, ok = deque([(0, 0, 0)]), False # w, i, t\n\nwhile q:\n\n w, i, t = q.popleft()\n\n if i < 0 or t > i or (i < n and walls[w][i] == 'X') or \\\n ((w, i) in visited and visited[w, i] <= t):\n continue\n\n if i >= n:\n ok = True\n break\n\n visited[w, i] = t\n q.extend([(w, i - 1, t + 1), (w, i + 1, t + 1), (w ^ 1, i + k, t + 1)])\n\nprint(\"YES\" if ok else \"NO\")\n", "from collections import deque\r\nimport sys\r\nn, k = map(int, sys.stdin.readline().split())\r\ns1, s2 = sys.stdin.readline(), sys.stdin.readline()\r\nmat = [[] for _ in range(2 * 100000 + 10)]\r\nused = [-1] * (2 * 100000 + 10)\r\nfor i in range(n):\r\n if i > 0 and s1[i - 1] != 'X' and s1[i] != 'X':\r\n mat[i].append(i - 1)\r\n used[i - 1] = 0\r\n if i < n - 1 and s1[i] != 'X' and s1[i + 1] != 'X':\r\n mat[i].append(i + 1)\r\n used[i + 1] = 0\r\n used[i] = 0\r\n if i + k >= n:\r\n mat[i].append(2 * 100000 + 9)\r\n used[2 * 100000 + 9] = 0\r\n elif s2[i + k] != 'X':\r\n mat[i].append(i + k + 100001)\r\n used[i + k + 100001] = 0\r\nfor i in range(n):\r\n if i > 0 and s2[i - 1] != 'X' and s2[i] != 'X':\r\n mat[i + 100001].append(i - 1 + 100001)\r\n used[i - 1 + 100001] = 0\r\n if i < n - 1 and s2[i] != 'X' and s2[i + 1] != 'X':\r\n mat[i + 100001].append(i + 1 + 100001)\r\n used[i + 1 + 100001] = 0\r\n used[i + 100001] = 0\r\n if i + k >= n:\r\n mat[i + 100001].append(2 * 100000 + 9)\r\n used[2 * 100000 + 9] = 0\r\n elif s1[i + k] != 'X':\r\n mat[i + 100001].append(i + k)\r\n used[i + k] = 0\r\nq = deque([0])\r\ndist = [0] * (2 * 100000 + 10)\r\nwhile q:\r\n u = q[0]\r\n q.popleft()\r\n used[u] = 1\r\n for v in mat[u]:\r\n if used[v] == 0:\r\n dist[v] = dist[u] + 1\r\n used[v] = 1\r\n if (v <= 100000 and dist[v] <= v) or (v > 100000 and dist[v] <= v - 100001) or v == 2 * 100000 + 9:\r\n q.append(v)\r\nif used[2 * 100000 + 9] == 1:\r\n sys.stdout.write('YES')\r\nelse:\r\n sys.stdout.write('NO')\r\n" ]

[ "from collections import deque\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nINF = 10 ** 9\r\nvisited=defaultdict(int)\r\n\r\ng = [[] for _ in range(n + m)] # 0..(n-1) -- rows, n..n+m-1 -- columns\r\n\r\nfor i in range(n):\r\n s=input()\r\n for j,c in enumerate(s):\r\n j_v=n+j\r\n if(c==\"#\"):\r\n g[i].append(j_v)\r\n g[j_v].append(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nq = deque([0])\r\n\r\ntotal_col=0\r\nvisited[0]=0\r\nwhile q:\r\n u=q.popleft()\r\n visited[u] = visited[u] + 1\r\n\r\n for v in g[u]:\r\n\r\n if(v==n-1):\r\n visited[n-1]=visited[u]\r\n q.clear()\r\n break\r\n if(visited[v]==0):\r\n visited[v]=visited[u]\r\n q.append(v)\r\n\r\n\r\nprint(-1 if (visited[n-1]==0) else visited[n-1])", "from collections import deque\n\n\ndef main():\n line = input().split()\n n = int(line[0])\n m = int(line[1])\n dp = [[] for _ in range(n+m)]\n\n for i in range(n):\n line = input()\n for j in range(m):\n if line[j] == '#':\n dp[i].append(n+j)\n dp[n+j].append(i)\n\n sol = -1\n q = deque()\n lq = deque()\n s = set()\n q.append(0)\n lq.append(0)\n s.add(0)\n while len(q):\n next = q.popleft()\n nextLen = lq.popleft()\n if next == (n-1):\n sol = nextLen\n break\n for i in dp[next]:\n if i not in s:\n s.add(i)\n q.append(i)\n lq.append(nextLen+1)\n print(sol)\n\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t\t \t \t \t \t\t\t\t\t \t \t \t\t\t", "# problem B\r\n\r\nfrom collections import deque\r\n \r\nn, m = map(int, input().split())\r\nINF = 10 ** 9\r\n \r\ng = [[] for _ in range(n + m)] # 0..(n-1) -- rows, n..n+m-1 -- columns\r\n \r\nfor i in range(n):\r\n\ts = input()\r\n\tfor j, c in enumerate(s):\r\n\t\tj_v = n + j\r\n\t\tif c == '#':\r\n\t\t\tg[i].append(j_v)\r\n\t\t\tg[j_v].append(i)\r\n \r\nq = deque([0])\r\ndist = [INF for _ in range(n + m)]\r\ndist[0] = 0\r\n \r\nwhile q:\r\n\tu = q.popleft()\r\n\tfor v in g[u]:\r\n\t\tn_dist_v = dist[u] + 1\r\n\t\tif n_dist_v < dist[v]:\r\n\t\t\tdist[v] = n_dist_v\r\n\t\t\tq.append(v)\r\nprint(-1 if dist[n - 1] == INF else dist[n - 1])", "import sys\r\nfrom array import array\r\nfrom collections import deque\r\n\r\n\r\nclass graph:\r\n def __init__(self, n):\r\n self.n, self.gdict = n, [array('i') for _ in range(n + 1)]\r\n\r\n def add_edge(self, node1, node2):\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n\r\n def bfs_util(self, root, tar):\r\n visit = array('b', [False] * (self.n + 1))\r\n queue, visit[root] = deque([root]), True\r\n lev = array('i', [-1] * self.n)\r\n lev[root] = 0\r\n\r\n while queue:\r\n s = queue.popleft()\r\n if s == tar:\r\n exit(print(lev[s]))\r\n\r\n for i1 in self.gdict[s]:\r\n if visit[i1] == False:\r\n queue.append(i1)\r\n visit[i1], lev[i1] = True, lev[s] + 1\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\ng = graph(n + m)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '#':\r\n g.add_edge(i, j + n)\r\n\r\ng.bfs_util(0, n - 1)\r\nprint(-1)\r\n", "def countMagic(n, m, rows, columns):\n visited = set()\n inQueue = set()\n\n # magic, coord, isHorizontal\n q = [(0, 0, True)]\n inQueue.add((0, True))\n\n while len(q) > 0:\n magic, coord, isHorizontal = q.pop(0)\n inQueue.remove((coord, isHorizontal))\n\n if coord == n - 1 and isHorizontal:\n return magic\n\n if (coord, isHorizontal) in visited:\n continue\n\n visited.add((coord, isHorizontal))\n\n src = rows[coord] if isHorizontal else columns[coord]\n\n for next in src:\n t = (next, not isHorizontal)\n if t not in visited and t not in inQueue:\n q.append((magic + 1, next, not isHorizontal))\n inQueue.add(t)\n\n return -1\n\n\nn, m = map(int, input().strip().split())\n\nrows = list([] for _ in range(n))\ncolumns = list([] for _ in range(m))\nfor i in range(n):\n s = input().strip()\n for j in range(m):\n if s[j] == \"#\":\n rows[i].append(j)\n columns[j].append(i)\n\ncount = countMagic(n, m, rows, columns)\nprint(count)\n\n \t \t\t\t\t\t\t \t \t \t\t \t\t \t \t\t\t", "# from sys import * \r\n# input= stdin.readline\r\n\r\n# n,m =map(int, input().split())\r\n# l=[]\r\n# for i in range(n):\r\n# l.append(list(input()))\r\n\r\n\r\n# c={i:[] for i in range(m)}\r\n# r={i:[] for i in range(n)}\r\n\r\n# for i in range(n):\r\n# for j in range(m):\r\n# if l[i][j]=='#':\r\n# c[j].append(i)\r\n# r[i].append(j)\r\n \r\n \r\n\r\n# vc=[0 for _ in range(m)]\r\n# vr=[0 for _ in range(n)]\r\n\r\n# def ss():\r\n# q=[[n-1,'r']]\r\n# vr[n-1]=1 \r\n# if n==1:\r\n# if \"#\" in l[0]:\r\n# return 1 \r\n# return -1 \r\n# ans=0 \r\n# while q:\r\n# # print(q)\r\n# q1=[]\r\n# for index, mode in q:\r\n \r\n# if index==0 and mode==\"r\":\r\n# return ans\r\n# if mode=='r':\r\n# vr[index]=1 \r\n# for column in r[index]:\r\n# if vc[column]!=1:\r\n# q1.append([column,'c'])\r\n# else:\r\n# vc[index]=1 \r\n# for row in c[index]:\r\n# if vr[row]!=1:\r\n# q1.append([row,'r'])\r\n# q=q1 \r\n# ans+=1 \r\n \r\n# return -1 \r\n\r\n# print(ss())\r\n\r\n# problem B\r\n\r\nfrom collections import deque\r\n \r\nn, m = map(int, input().split())\r\nINF = 10 ** 9\r\n \r\ng = [[] for _ in range(n + m)] # 0..(n-1) -- rows, n..n+m-1 -- columns\r\n \r\nfor i in range(n):\r\n\ts = input()\r\n\tfor j, c in enumerate(s):\r\n\t\tj_v = n + j\r\n\t\tif c == '#':\r\n\t\t\tg[i].append(j_v)\r\n\t\t\tg[j_v].append(i)\r\n \r\nq = deque([0])\r\ndist = [INF for _ in range(n + m)]\r\ndist[0] = 0\r\n \r\nwhile q:\r\n\tu = q.popleft()\r\n\tfor v in g[u]:\r\n\t\tn_dist_v = dist[u] + 1\r\n\t\tif n_dist_v < dist[v]:\r\n\t\t\tdist[v] = n_dist_v\r\n\t\t\tq.append(v)\r\nprint(-1 if dist[n - 1] == INF else dist[n - 1])", "from collections import deque\n\ndef main():\n input_line = input().split()\n n = int(input_line[0])\n m = int(input_line[1])\n graph = [[] for _ in range(n+m)]\n \n for i in range(n):\n line = input()\n for j in range(m):\n if line[j] == '#':\n graph[i].append(n+j)\n graph[n+j].append(i)\n\n solution = -1\n queue = deque()\n length_queue = deque()\n visited = set()\n queue.append(0)\n length_queue.append(0)\n visited.add(0)\n \n while len(queue):\n current_node = queue.popleft()\n current_length = length_queue.popleft()\n \n if current_node == (n-1):\n solution = current_length\n break\n \n for neighbor in graph[current_node]:\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append(neighbor)\n length_queue.append(current_length+1)\n \n print(solution)\n\nmain()\n\n\t\t \t\t \t\t \t\t\t \t\t\t\t\t\t \t\t\t\t", "def main():\n n, m = map(int, input().split())\n graph = [[] for _ in range(n + m)]\n\n for i in range(n):\n line = input()\n for j in range(m):\n if line[j] == '#':\n graph[i].append(n + j)\n graph[n + j].append(i)\n\n solution = -1\n queue = [(0, 0)] \n visited = set()\n visited.add(0)\n\n while queue:\n current_node, current_length = queue.pop(0)\n\n if current_node == (n - 1):\n solution = current_length\n break\n\n for neighbor in graph[current_node]:\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append((neighbor, current_length + 1))\n\n print(solution)\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t\t \t \t\t \t \t\t\t \t\t\t", "from collections import deque\n\nn, m = map(int, input().split())\narr = [[] for _ in range(n + m)]\nret = -1\nq, q2= deque([0]), deque([0])\ns = set([0])\nfor x in range(n):\n row = input()\n for y in range(m):\n if row[y] == '#':\n arr[x].append(y + n)\n arr[y + n].append(x)\nwhile q:\n temp = q.popleft()\n temp2 = q2.popleft()\n if temp == n - 1:\n ret = temp2\n break\n for x in arr[temp]:\n if x not in s:\n q.append(x)\n q2.append(temp2 + 1)\n s.add(x)\nprint(ret)\n \t\t \t\t\t\t \t \t\t\t\t \t\t \t\t\t \t\t\t" ]

[ "l = [input() for _ in range(10)]\r\n\r\nfor c in range(5):\r\n t = ['X'] * 5\r\n t[c] = '.'\r\n for i in range(10):\r\n for j in range(6):\r\n cnt = 0\r\n for k in range(5):\r\n if l[i][j + k] == '.':\r\n cnt += 1\r\n elif l[i][j + k] == 'O':\r\n cnt += 2\r\n if cnt == 1:\r\n print('YES')\r\n exit()\r\n \r\n for i in range(6):\r\n for j in range(10):\r\n cnt = 0\r\n for k in range(5):\r\n if l[i + k][j] == '.':\r\n cnt += 1\r\n elif l[i + k][j] == 'O':\r\n cnt += 2\r\n if cnt == 1:\r\n print('YES')\r\n exit()\r\n \r\n for i in range(6):\r\n for j in range(6):\r\n cnt = 0\r\n for k in range(5):\r\n if l[i + k][j + k] == '.':\r\n cnt += 1\r\n elif l[i + k][j + k] == 'O':\r\n cnt += 2\r\n if cnt == 1:\r\n print('YES')\r\n exit()\r\n \r\n for i in range(4, 10):\r\n for j in range(6):\r\n cnt = 0\r\n for k in range(5):\r\n if l[i - k][j + k] == '.':\r\n cnt += 1\r\n elif l[i - k][j + k] == 'O':\r\n cnt += 2\r\n if cnt == 1:\r\n print('YES')\r\n exit()\r\n \r\nprint('NO')", "a=[input() for i in range(10)]\n#a=['1234567890','asdfghjkl;','qwertyuiop','zxcvbnm,./','!@#$%^&*()','QWERTYUIOP','ASDFGHJKL:','ZXCVBNM<>?','[]{}\"`qwer',\"'jkrui>Opo\"]\n#a=[[0 for i in range(10)] for j in range(10)]\ngg=False\n\"\"\"\nfor i in range(10):\n print(a[i])\nprint()\n\"\"\"\ndef checkAns(b):\n dot=0\n x=0\n for i in b: \n if i=='X': x+=1\n if i=='.': dot+=1\n# print(b,'dot',dot,'x',x)\n if x==4 and dot==1 or x==5: return True\ndef find(b):\n if len(b)<5: return\n global gg\n ans=0\n for i in range(len(b)-4):\n if(checkAns(b[i:i+5])):\n gg=True\n return\n\nfor i in range(10):\n find(a[i])\n find(''.join([a[j][i] for j in range(10)]))\n\n find(''.join([a[j][j+i] for j in range(10) if j+i<10]))\n find(''.join([a[j+i][j] for j in range(10) if j+i<10]))\n find(''.join([a[j][9-j-i] for j in range(10) if 9-j-i>=0]))\n find(''.join([a[j+i][9-j] for j in range(10) if j+i<10]))\n\n\"\"\"\nfor i in range(10):\n for j in range(10):\n if j-i>=0: a[j][j-i]+=1\n if j-i>=0: a[j-i][j]+=1\n if j-i>-1: a[i][j-i]+=1\n if j+i<10: a[9-i][j+i]+=1\n \"\"\"\nif gg: \n print('YES')\nelse:\n print('NO')\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter,deque\r\n\r\nS = []\r\nfor _ in range(10):\r\n S.append(input())\r\n \r\ndef check(r,c,r1,c1):\r\n v = [S[r][c]]\r\n nr=r\r\n nc=c\r\n \r\n while len(v)<5:\r\n nr+=r1\r\n nc+=c1\r\n if nr<0 or nr>9 or nc<0 or nc>9:break\r\n v.append(S[nr][nc])\r\n \r\n if len(v)==5:\r\n C = Counter(v)\r\n if C['X']==4 and C['.']==1:\r\n exit(print('YES'))\r\n \r\nfor i in range(10):\r\n for j in range(10):\r\n check(i,j,1,0)\r\n check(i,j,0,1)\r\n check(i,j,1,1)\r\n check(i,j,1,-1)\r\n \r\nprint('NO')", "matrix = list()\r\nfor _ in range(10):\r\n matrix.append(list(input()))\r\n\r\nfor i in range(10):\r\n for j in range(6):\r\n temp = matrix[i][j:j + 5]\r\n if temp.count('X') == 4 and '.' in temp:\r\n print('YES')\r\n quit()\r\n\r\nfor j in range(10):\r\n for i in range(6):\r\n temp = list()\r\n for k in range(i, i + 5):\r\n temp.append(matrix[k][j])\r\n if temp.count('X') == 4 and '.' in temp:\r\n print('YES')\r\n quit()\r\n\r\nfor i in range(6):\r\n for j in range(6):\r\n temp = list()\r\n for k in range(5):\r\n temp.append(matrix[i + k][j + k])\r\n if temp.count('X') == 4 and '.' in temp:\r\n print('YES')\r\n quit()\r\n\r\nfor i in range(0, 6):\r\n for j in range(4, 10):\r\n temp = list()\r\n for k in range(5):\r\n temp.append(matrix[i + k][j - k])\r\n\r\n if temp.count('X') == 4 and '.' in temp:\r\n print('YES')\r\n quit()\r\n\r\nprint('NO')", "import sys\n\ndef check(x):\n t,p = 0,0\n for i in range(5):\n if x[i]=='X':\n t+=1\n elif x[i]=='.':\n p+=1\n if t==4 and p==1:\n return True\n return False\n\n\ndef main():\n\n x = []\n for i in range(10):\n x.append(sys.stdin.readline().rstrip())\n\n flag = False\n\n for i in range(10):\n for j in range(10):\n if j+4<10 and check([x[i][k] for k in range(j,j+5) ]):\n flag = True\n if i+4<10 and check([x[k][j] for k in range(i,i+5) ]):\n flag = True\n if i+4<10 and j+4<10 and check([ x[i+k][j+k] for k in range(5)]):\n flag = True\n if i+4<10 and j-4>=0 and check([ x[i+k][j-k] for k in range(5)]):\n flag = True\n\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \nmain()\n", "field = []\r\nfor _ in range(10):\r\n field.append(input())\r\n\r\nrows = [row for row in field]\r\ncolumns = []\r\nfor i in range(10):\r\n s = ''\r\n for j in range(10):\r\n s += field[j][i]\r\n columns.append(s)\r\nmaindiags = []\r\nfor k in range(-9, 10):\r\n s = ''\r\n if k >= 0:\r\n for i in range(10 - k):\r\n for j in range(k, 10):\r\n if i == j - k:\r\n s += field[i][j]\r\n else:\r\n for i in range(-k, 10):\r\n for j in range(10 + k):\r\n if i == j - k:\r\n s += field[i][j]\r\n maindiags.append(s)\r\ndiags = []\r\nfor k in range(-9, 10):\r\n s = ''\r\n if k >= 0:\r\n for i in range(k, 10):\r\n for j in range(k, 10):\r\n if i == 9 - j + k:\r\n s += field[i][j]\r\n else:\r\n for i in range(10 + k):\r\n for j in range(10 + k):\r\n if i == 9 - j + k:\r\n s += field[i][j]\r\n diags.append(s)\r\ndef answer(a):\r\n patterns = ['.XXXX','X.XXX','XX.XX','XXX.X','XXXX.']\r\n for elem in a:\r\n if len(elem) >= 5:\r\n for k in range(5):\r\n for i in range(len(elem) - 4):\r\n flag = True\r\n for j in range(5):\r\n if elem[i + j] != patterns[k][j]:\r\n flag = False\r\n if flag:\r\n return True\r\n return False\r\n\r\na = rows + columns + maindiags + diags\r\nprint('YES' if answer(a) else 'NO')", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\na = [ minp() for i in range(10) ]\r\nd = [(1,0), (1,1), (0,1), (1, -1)]\r\nfor x in range(10):\r\n\tfor y in range(10):\r\n\t\tfor dx, dy in d:\r\n\t\t\tc1 = 0\r\n\t\t\tc2 = 0\r\n\t\t\tfor j in range(5):\r\n\t\t\t\txx = x+dx*j\r\n\t\t\t\tyy = y+dy*j\r\n\t\t\t\tif xx < 10 and yy < 10 and yy >= 0:\r\n\t\t\t\t\tw = a[x+dx*j][y+dy*j]\r\n\t\t\t\t\tif w == 'X':\r\n\t\t\t\t\t\tc1 += 1\r\n\t\t\t\t\telif w == '.':\r\n\t\t\t\t\t\tc2 += 1\r\n\t\t\tif c1 == 4 and c2 == 1:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit(0)\r\nprint(\"NO\")", "a=[0 for i in range(10)]\r\nfor i in range(10):\r\n a[i]=input()\r\n\r\nb=[[0 for i in range(10)] for i in range(10)]\r\n\r\nf=False\r\nfor x1 in range(10):\r\n for y1 in range(10):\r\n for i in range(10):\r\n for j in range(10):\r\n b[i][j]=a[i][j]\r\n if b[x1][y1]=='.':\r\n b[x1][y1]='X'\r\n can=False\r\n for i in range(10): #ÅжÏÊäÓ®\r\n for j in range(10):\r\n if j<6 and b[i][j]=='X' and b[i][j+1]=='X' and b[i][j+2]=='X' and b[i][j+3]=='X' and b[i][j+4]=='X':\r\n can=True\r\n if i<6 and b[i][j]=='X' and b[i+1][j]=='X' and b[i+2][j]=='X' and b[i+3][j]=='X' and b[i+4][j]=='X':\r\n can=True\r\n if i<6 and j<6 and b[i][j]=='X' and b[i+1][j+1]=='X' and b[i+2][j+2]=='X' and b[i+3][j+3]=='X' and b[i+4][j+4]=='X':\r\n can=True\r\n if i<6 and j>3 and b[i][j]=='X' and b[i+1][j-1]=='X' and b[i+2][j-2]=='X' and b[i+3][j-3]=='X' and b[i+4][j-4]=='X':\r\n can=True\r\n if can==True:\r\n f=True\r\n\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "def solve():\r\n\r\n grid = [input() for r in range(10)]\r\n\r\n def win(arr):\r\n return arr.count('X') == 4 and arr.count('.') == 1\r\n\r\n for i in range(10):\r\n for j in range(10):\r\n if win(grid[i][j:j+5]):\r\n return True\r\n elif win([grid[k][j] for k in range(i, min(i + 5, 10))]):\r\n return True\r\n elif win([grid[i + k][j + k] for k in range(min(5, 10 - i, 10 - j))]):\r\n return True\r\n elif win([grid[i + k][j - k] for k in range(min(5, j + 1, 10 - i))]):\r\n return True\r\n return False\r\n\r\n\r\nif solve():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\nfrom math import inf\r\n\r\nri = lambda : map(int, input().split())\r\n\r\ndef solve():\r\n A = []\r\n for _ in range(10):\r\n A.append(list(input()))\r\n\r\n valid = False\r\n for r in range(10):\r\n for c in range(10):\r\n if A[r][c] != \".\": continue\r\n\r\n left = 0\r\n pos = c - 1\r\n while pos >= 0 and A[r][pos] == \"X\":\r\n left += 1\r\n pos -= 1\r\n pos = c + 1\r\n right = 0\r\n while pos < 10 and A[r][pos] == \"X\":\r\n right += 1\r\n pos += 1\r\n if left + right + 1 >= 5:\r\n valid = True\r\n break\r\n diag1 = 0\r\n pr = r-1\r\n cr = c+1\r\n while pr >= 0 and cr < 10 and A[pr][cr] == \"X\":\r\n diag1 += 1\r\n pr -= 1\r\n cr += 1\r\n diag2 = 0\r\n pr = r+1\r\n cr = c-1\r\n while pr < 10 and cr >= 0 and A[pr][cr] == \"X\":\r\n diag2 += 1\r\n pr += 1\r\n cr -= 1\r\n if diag1+diag2+1 >= 5:\r\n valid = True\r\n\r\n diag1 = 0\r\n pr = r-1\r\n cr = c-1\r\n while pr >= 0 and cr >= 0 and A[pr][cr] == \"X\":\r\n diag1 += 1\r\n pr -= 1\r\n cr -= 1\r\n diag2 = 0\r\n pr = r+1\r\n cr = c+1\r\n while pr < 10 and cr < 10 and A[pr][cr] == \"X\":\r\n diag2 += 1\r\n pr += 1\r\n cr += 1\r\n if diag1+diag2+1 >= 5:\r\n valid = True\r\n\r\n up = 0\r\n pos = r-1\r\n while pos >= 0 and A[pos][c] == \"X\":\r\n up += 1\r\n pos -= 1\r\n down = 0\r\n pos = r+1\r\n while pos < 10 and A[pos][c] == \"X\":\r\n down += 1\r\n pos += 1\r\n \r\n if up+down+1 >= 5:\r\n valid = True\r\n\r\n if valid:\r\n break\r\n if valid:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nt = 1\r\n#t = int(input())\r\nwhile t:\r\n t -= 1\r\n solve()\r\n\r\n", "mat=[]\r\nfor i in range(10):\r\n li = list(input())\r\n mat.append(li)\r\nd=[(1,0),(0,1),(1,1),(1,-1)]\r\nfor i in range(10):\r\n for j in range(10):\r\n for dx,dy in d:\r\n c=0\r\n t=0\r\n for k in range(5):\r\n row = i + dx*k\r\n col = j + dy*k\r\n if row<10 and row>=0 and col<10 and col>=0:\r\n if mat[row][col]=='X':\r\n c+=1\r\n elif mat[row][col]=='.':\r\n t+=1 \r\n if c==4 and t==1:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n", "from sys import stdin\n\ndef myInput():\n board = [[],[],[[] for _ in range(20)],[[] for _ in range(20)]]\n for line in stdin:\n board[0].append(list(line.rstrip()))\n\n # for line in board[0]:\n # print(line)\n # print(\"----------------------------------------------------\")\n\n board[1] = map(list, zip(*board[0]))\n\n # for line in board[1]:\n # print(line)\n # print(\"----------------------------------------------------\")\n\n for i in range(len(board[0])):\n for j in range(len(board[0])):\n board[2][i + j].append(board[0][i][j])\n board[3][i - j + len(board[0])].append(board[0][i][j])\n\n # for line in board[2]:\n # print(line)\n # print(\"----------------------------------------------------\")\n\n # for line in board[3]:\n # print(line)\n # print(\"----------------------------------------------------\")\n return board\n\ndef solve(board):\n for b in board:\n for line in b:\n val_bef = 0\n val_eft =0\n ok = False\n for dig in line:\n if(dig == 'O'):\n ok = False\n val_bef = 0\n val_eft = 0\n else:\n if(dig == 'X'):\n if(ok):\n val_eft += 1\n else:\n val_bef += 1\n elif(dig == '.'):\n if(ok):\n ok = True\n val_bef = val_eft\n val_eft = 0\n else:\n ok = True\n if(ok and val_eft + val_bef >= 4):\n return True\n return False\n\nboard = myInput()\nif(solve(board)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def is_good(matrix):\n for i in range(10):\n for j in range(10):\n if matrix[i][j] == 'X':\n if matrix[i][j - 2] == matrix[i][j - 1] == matrix[i][j] == matrix[i][j + 1] == matrix[i][j + 2] or \\\n matrix[i - 2][j] == matrix[i - 1][j] == matrix[i][j] == \\\n matrix[i + 1][j] == matrix[i + 2][j]:\n return True\n for k in range(4):\n if matrix[i - k][j - k] == matrix[i - k + 1][j - k + 1] == matrix[i - k + 2][j - k + 2] == \\\n matrix[i - k + 3][j - k + 3] == matrix[i - k + 4][j - k + 4]:\n return True\n if matrix[i - k][j + k] == matrix[i - k + 1][j + k - 1] == matrix[i - k + 2][j + k - 2] == \\\n matrix[i - k + 3][j + k - 3] == matrix[i - k + 4][j + k - 4]:\n return True\n return False\n\n\nmatrix = [['.'] * 14 for i in range(14)]\n\nfor i in range(10):\n string = input()\n for j in range(10):\n matrix[i][j] = string[j]\n\nfor i in range(10):\n for j in range(10):\n if matrix[i][j] == '.':\n matrix[i][j] = 'X'\n if is_good(matrix):\n print('YES')\n exit()\n matrix[i][j] = '.'\nprint('NO')\n", "matrix = []\nN = 10\n\nfor i in range(N):\n\tmatrix.append(list(input()))\n\nwon = False\n\ndef check_alice_won(matrix):\n\tmaxScore = 0\n\tfor i in range(N):\n\t\tcurScore = 0\n\t\tfor j in range(N):\n\t\t\tif matrix[i][j] == 'X':\n\t\t\t\tcurScore += 1\n\t\t\telse:\n\t\t\t\tif curScore > maxScore:\n\t\t\t\t\tmaxScore = curScore\n\t\t\t\tcurScore = 0\n\t\tif curScore >= maxScore:\n\t\t\tmaxScore = curScore\n\t\tif maxScore >= 5:\n\t\t\treturn True\n\n\tmaxScore = 0\n\tfor i in range(N):\n\t\tcurScore = 0\n\t\tfor j in range(N):\n\t\t\tif matrix[j][i] == 'X':\n\t\t\t\tcurScore += 1\n\t\t\telse:\n\t\t\t\tif curScore > maxScore:\n\t\t\t\t\tmaxScore = curScore\n\t\t\t\tcurScore = 0\n\t\tif curScore >= maxScore:\n\t\t\tmaxScore = curScore\n\t\tif maxScore >= 5:\n\t\t\treturn True\n\n\tmaxScore = 0\n\tfor p in range(0, 2*N - 1):\n\t\tcurScore = 0\n\t\t# print(max(0, p - N + 1), min(p, N - 1) + 1)\n\t\t# print(list(range(max(0, p - N + 1), min(p, N - 1) + 1)))\n\t\tfor q in list(range(max(0, p - N + 1), min(p, N - 1) + 1)):\n\t\t\t# print(matrix[p-q][q], end='')\n\t\t\tif matrix[p-q][q] == 'X':\n\t\t\t\tcurScore += 1\n\t\t\telse:\n\t\t\t\tif curScore > maxScore:\n\t\t\t\t\tmaxScore = curScore\n\t\t\t\tcurScore = 0\n\t\tif curScore >= maxScore:\n\t\t\tmaxScore = curScore\n\t\tif maxScore >= 5:\n\t\t\treturn True\n\n\tmaxScore = 0\n\tfor p in range(0, 2*N - 1):\n\t\tcurScore = 0\n\t\t# print(max(0, p - N + 1), min(p, N - 1) + 1)\n\t\t# print(list(range(max(0, p - N + 1), min(p, N - 1) + 1)))\n\t\tfor q in list(range(max(0, p - N + 1), min(p, N - 1) + 1)):\n\t\t\t# print(matrix[p-q][N - 1 - q], end='')\n\t\t\tif matrix[p-q][N - 1 - q] == 'X':\n\t\t\t\tcurScore += 1\n\t\t\t\t# print(curScore)\n\t\t\telse:\n\t\t\t\tif curScore >= maxScore:\n\t\t\t\t\tmaxScore = curScore\n\t\t\t\tcurScore = 0\n\t\tif curScore >= maxScore:\n\t\t\tmaxScore = curScore\n\t\t# print(\"MAX\")\n\t\t# print(maxScore)\n\t\t# input()\n\t\tif maxScore >= 5:\n\t\t\treturn True\n\n\treturn False\n\nfor i in range(N):\n\tfor j in range(N):\n\t\tif matrix[i][j] == '.' and won == False:\n\t\t\tmatrix[i][j] = 'X'\n\t\t\t# print(matrix)\n\t\t\tif check_alice_won(matrix) == True:\n\t\t\t\twon = True\n\t\t\t# print(won)\n\t\t\t# input()\n\t\t\tmatrix[i][j] = '.'\n\nif won:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a=[]\r\nfor i in range(10):\r\n a.append(input())\r\nfor i in range(6):\r\n for j in range(6):\r\n k,z=0,0\r\n for x in range(5):\r\n if a[i+x][j+x]==\"X\":\r\n k+=1\r\n else:\r\n if a[i+x][j+x]==\".\":\r\n z+=1\r\n if k==5 or k==4 and z==1:\r\n print(\"YES\")\r\n exit(0)\r\n k,z=0,0\r\n for x in range(5):\r\n if a[i+x][j+4-x]==\"X\":\r\n k+=1\r\n else:\r\n if a[i+x][j+4-x]==\".\":\r\n z+=1\r\n if k==5 or k==4 and z==1:\r\n print(\"YES\")\r\n exit(0)\r\nfor i in range(10):\r\n for j in range(6):\r\n k,z=0,0\r\n for x in range(5):\r\n if a[i][j+x]==\"X\":\r\n k+=1\r\n else:\r\n if a[i][j+x]==\".\":\r\n z+=1\r\n if k==5 or k==4 and z==1:\r\n print(\"YES\")\r\n exit(0)\r\nfor i in range(6):\r\n for j in range(10):\r\n k,z=0,0\r\n for x in range(5):\r\n if a[i+x][j]==\"X\":\r\n k+=1\r\n else:\r\n if a[i+x][j]==\".\":\r\n z+=1\r\n if k==5 or k==4 and z==1:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n \r\n \r\n \r\n", "s=10*[0]\r\nfor i in range(10):\r\n\ts[i]=input()\r\ndef trav(i,j,s,n):\r\n\tif n==1:\r\n\t\tif(i<9):\r\n\t\t\tif s[i+1][j]=='X':\r\n\t\t\t\treturn 1 + trav(i+1,j,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==-1:\r\n\t\tif(i>0):\r\n\t\t\tif s[i-1][j]=='X':\r\n\t\t\t\treturn 1 + trav(i-1,j,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==2:\r\n\t\tif(j<9):\r\n\t\t\tif s[i][j+1]=='X':\r\n\t\t\t\treturn 1 + trav(i,j+1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==-2:\r\n\t\tif(j>0):\r\n\t\t\tif s[i][j-1]=='X':\r\n\t\t\t\treturn 1 + trav(i,j-1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==3:\r\n\t\tif(i<9 and j<9):\r\n\t\t\tif s[i+1][j+1]=='X':\r\n\t\t\t\treturn 1 + trav(i+1,j+1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==-3:\r\n\t\tif(i>0 and j>0):\r\n\t\t\tif s[i-1][j-1]=='X':\r\n\t\t\t\treturn 1 + trav(i-1,j-1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==4:\r\n\t\tif(i>0 and j<9):\r\n\t\t\tif s[i-1][j+1]=='X':\r\n\t\t\t\treturn 1 + trav(i-1,j+1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\tif n==-4:\r\n\t\tif(i<9 and j>0):\r\n\t\t\tif s[i+1][j-1]=='X':\r\n\t\t\t\treturn 1 + trav(i+1,j-1,s,n)\r\n\t\t\treturn 0\r\n\t\treturn 0\r\n\r\nflag=False\t\t\r\nfor i in range(10):\r\n\tfor j in range(10):\r\n\t\tif s[i][j]=='.':\r\n\t\t\t#print(trav(i,j,s,-2))\r\n\t\t\t#input()\r\n\t\t\tif trav(i,j,s,1)+trav(i,j,s,-1)>=4 or trav(i,j,s,2)+trav(i,j,s,-2)>=4 or trav(i,j,s,3)+trav(i,j,s,-3)>=4 or trav(i,j,s,4)+trav(i,j,s,-4)>=4:\r\n\t\t\t\tflag=True;\r\n\t\t\t\tprint ('YES')\r\n\t\t\t\tbreak\r\n\tif flag:\r\n\t\tbreak\r\nif not flag:\r\n\tprint('NO')", "def check(a, b, c, d, e):\r\n\tcountX = 0\r\n\tcountD = 0\r\n\t\r\n\tif a == 'X': countX += 1\r\n\telif a == '.': countD += 1\r\n\t\r\n\tif b == 'X': countX += 1\r\n\telif b == '.': countD += 1\r\n\t\r\n\tif c == 'X': countX += 1\r\n\telif c == '.': countD += 1\r\n\t\r\n\tif d == 'X': countX += 1\r\n\telif d == '.': countD += 1\r\n\t\r\n\tif e == 'X': countX += 1\r\n\telif e == '.': countD += 1\r\n\t\r\n\treturn countX == 4 and countD == 1\r\n\r\ndef f(a):\r\n\tfor i in range(10):\r\n\t\tfor j in range(6):\r\n\t\t\tif (check(a[i][j], a[i][j+1], a[i][j+2], a[i][j+3], a[i][j+4])\r\n\t\t\tor i < 6 and check(a[i][j], a[i+1][j+1], a[i+2][j+2], a[i+3][j+3], a[i+4][j+4])):\r\n\t\t\t return True\r\n\t\r\n\tfor i in range(10):\r\n\t\tfor j in range(6):\r\n\t\t\tif (check(a[j][i], a[j+1][i], a[j+2][i], a[j+3][i], a[j+4][i])\r\n\t\t\tor i > 3 and check(a[j][i], a[j+1][i-1], a[j+2][i-2], a[j+3][i-3], a[j+4][i-4])):\r\n\t\t\t\treturn True\r\n\t\r\nprint('YES' if f([input() for _ in range(10)]) else 'NO')", "t=[[-1]*12 for i in range(12)]\r\nfor i in range(1,11):\r\n s=input()\r\n for j in range(1,11):\r\n if s[j-1]=='.':\r\n t[i][j]=0\r\n elif s[j-1]=='X':\r\n t[i][j]=1\r\nc=False\r\nfor x in range(1,11):\r\n for y in range(1,11):\r\n if t[x][y]==0:\r\n t[x][y]=1\r\n for i in range(1,11):\r\n for j in range(1,11):\r\n if t[i][j]==1:\r\n counter=1\r\n for k in range(1,5):\r\n if i-k>0 and j+k<11 and t[i-k][j+k]==1:\r\n counter+=1\r\n if counter==5:\r\n c=True\r\n break\r\n counter=1\r\n for k in range(1,5):\r\n if j+k<11 and t[i][j+k]==1:\r\n counter+=1\r\n if counter==5:\r\n c=True\r\n break\r\n counter=1\r\n for k in range(1,5):\r\n if i+k<11 and t[i+k][j]==1:\r\n counter+=1\r\n if counter==5:\r\n c=True\r\n break\r\n counter=1\r\n for k in range(1,5):\r\n if i+k<11 and j+k<11 and t[i+k][j+k]==1:\r\n counter+=1\r\n if counter==5:\r\n c=True\r\n break\r\n t[x][y]=0\r\nif c:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nfield = []\r\nfor i in range(10):\r\n st = input()\r\n field.append(st)\r\n\r\n\r\n''' Перебор вариантов '''\r\ndef f():\r\n global i, i2, c, j, j2, l\r\n \r\n for i in range(10): # По горизонтали\r\n for i2 in range(6):\r\n l = field[i][i2:i2 + 5]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n \r\n for i in range(10): # По вертикали\r\n for i2 in range(6):\r\n l = field[i2][i] + field[i2 + 1][i] + field[i2 + 2][i] + field[i2 + 3][i] + field[i2 + 4][i]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n\r\n ''' По диагонали; левый низ, правый верх '''\r\n c = 0\r\n for i in range(4, 10):\r\n c += 1\r\n for i2 in range(c):\r\n j = i - i2\r\n j2 = 0 + i2\r\n l = field[j][j2] + field[j - 1][j2 + 1] + field[j - 2][j2 + 2] + field[j - 3][j2 + 3] + field[j - 4][j2 + 4]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n\r\n for i2 in range(1, 6):\r\n c -= 1\r\n for i3 in range(c):\r\n j = i - i3\r\n j2 = i2 + i3\r\n l = field[j][j2] + field[j - 1][j2 + 1] + field[j - 2][j2 + 2] + field[j - 3][j2 + 3] + field[j - 4][j2 + 4]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n\r\n ''' По диагонали; левый верх, правый низ '''\r\n c = 0\r\n for i in range(5, -1, -1):\r\n c += 1\r\n for i2 in range(c):\r\n j = i + i2\r\n j2 = 0 + i2\r\n l = field[j][j2] + field[j + 1][j2 + 1] + field[j + 2][j2 + 2] + field[j + 3][j2 + 3] + field[j + 4][j2 + 4]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n\r\n for i2 in range(1, 6):\r\n c -= 1\r\n for i3 in range(c):\r\n j = i + i3\r\n j2 = i2 + i3\r\n l = field[j][j2] + field[j + 1][j2 + 1] + field[j + 2][j2 + 2] + field[j + 3][j2 + 3] + field[j + 4][j2 + 4]\r\n if l.count('X') == 4 and l.count('.') == 1:\r\n print('YES')\r\n sys.exit()\r\n \r\n print('NO')\r\n\r\n\r\nf()\r\n", "a = []\r\nfor i in range(10):\r\n\ts = input()\r\n\ta.append(s)\r\n\t\r\nans = 0\r\nfor i in range(10):\r\n\tfor j in range(10):\r\n\t\tif (a[i][j] == '.'):\r\n\t\t\tk = i - 1\r\n\t\t\tc = 1\r\n\t\t\twhile(k >= 0 and a[k][j] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk -= 1\r\n\t\t\tk = i + 1\r\n\t\t\twhile(k < 10 and a[k][j] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk += 1\r\n\t\t\tif c >= 5:\r\n\t\t\t\tans = 1\r\n\t\t\tk = j - 1\r\n\t\t\tc = 1\r\n\t\t\twhile(k >= 0 and a[i][k] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk -= 1\r\n\t\t\tk = j + 1\r\n\t\t\twhile(k < 10 and a[i][k] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk += 1\r\n\t\t\tif c >= 5:\r\n\t\t\t\tans = 1\r\n\t\t\tk = i - 1\r\n\t\t\tl = j - 1\r\n\t\t\tc = 1\r\n\t\t\twhile(k >= 0 and l >= 0 and a[k][l] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk -= 1\r\n\t\t\t\tl -= 1\r\n\t\t\tk = i + 1\r\n\t\t\tl = j + 1\r\n\t\t\twhile(k < 10 and l < 10 and a[k][l] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk += 1\r\n\t\t\t\tl += 1\r\n\t\t\tif c >= 5:\r\n\t\t\t\tans = 1\r\n\t\t\tk = i - 1\r\n\t\t\tl = j + 1\r\n\t\t\tc = 1\r\n\t\t\twhile(k >= 0 and l < 10 and a[k][l] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk -= 1\r\n\t\t\t\tl += 1\r\n\t\t\tk = i + 1\r\n\t\t\tl = j - 1\r\n\t\t\twhile(k < 10 and l >= 0 and a[k][l] == 'X'):\r\n\t\t\t\tc += 1\r\n\t\t\t\tk += 1\r\n\t\t\t\tl -= 1\r\n\t\t\tif c >= 5:\r\n\t\t\t\tans = 1\r\nif ans:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")\r\n", "#!/usr/local/bin/python3\n\nimport sys\n\ntable = [line.strip() for line in sys.stdin]\n\ndef check_position(table, row, column):\n\n if table[row][column] != '.':\n return False\n \n left_sum = 0\n tmp = column - 1\n while (tmp >= 0) and table[row][tmp] == 'X':\n left_sum += 1\n tmp -= 1\n\n right_sum = 0\n tmp = column + 1\n while (tmp < 10) and table[row][tmp] == 'X':\n right_sum += 1\n tmp += 1\n\n if left_sum + right_sum >= 4:\n return True\n\n # -----\n\n up_sum = 0\n tmp = row - 1\n while (tmp >= 0) and table[tmp][column] == 'X':\n up_sum += 1\n tmp -= 1\n\n down_sum = 0\n tmp = row + 1\n while (tmp < 10) and table[tmp][column] == 'X':\n down_sum += 1\n tmp += 1\n\n if up_sum + down_sum >= 4:\n return True \n\n # -----\n\n maindup_sum = 0\n tmp_row = row - 1\n tmp_col = column - 1\n while (tmp_row >= 0) and (tmp_col >= 0) and table[tmp_row][tmp_col] == 'X':\n tmp_row -= 1\n tmp_col -= 1\n maindup_sum += 1\n \n maindup_down = 0\n tmp_row = row + 1\n tmp_col = column + 1\n while (tmp_row < 10) and (tmp_col < 10) and table[tmp_row][tmp_col] == 'X':\n tmp_row += 1\n tmp_col += 1\n maindup_down += 1\n\n if maindup_sum + maindup_down >= 4:\n return True\n\n # -----\n \n dup_sum = 0\n tmp_row = row - 1\n tmp_col = column + 1\n while (tmp_row >= 0) and (tmp_col < 10) and table[tmp_row][tmp_col] == 'X':\n tmp_row -= 1\n tmp_col += 1\n dup_sum += 1\n \n dup_down = 0\n tmp_row = row + 1\n tmp_col = column - 1\n while (tmp_row < 10) and (tmp_col >= 0) and table[tmp_row][tmp_col] == 'X':\n tmp_row += 1\n tmp_col -= 1\n dup_down += 1\n\n if dup_sum + dup_down >= 4:\n return True\n\n return False\n\nfor row in range(10):\n for column in range(10):\n if check_position(table, row, column):\n print(\"YES\")\n sys.exit(0)\n\nprint(\"NO\")\n", "a=[list(input()) for i in range(10)]\r\nflag=True\r\nfor i in range(10):\r\n for j in range(10):\r\n l,r=j-1,j+1\r\n cnt_lr=0\r\n while 0<=l and a[i][l]==\"X\":\r\n l-=1\r\n cnt_lr+=1\r\n while r<10 and a[i][r]==\"X\":\r\n r+=1\r\n cnt_lr+=1\r\n d,u=i-1,i+1\r\n cnt_du=0\r\n while 0<=d and a[d][j]==\"X\":\r\n d-=1\r\n cnt_du+=1\r\n while u<10 and a[u][j]==\"X\":\r\n u+=1\r\n cnt_du+=1\r\n ld,ru=1,1\r\n cnt_ld_ru=0\r\n while i-ld>=0 and j-ld>=0 and a[i-ld][j-ld]==\"X\":\r\n cnt_ld_ru+=1\r\n ld+=1\r\n while i+ru<10 and j+ru<10 and a[i+ru][j+ru]==\"X\":\r\n cnt_ld_ru+=1\r\n ru+=1\r\n lu,rd=1,1\r\n cnt_lu_rd=0\r\n while i+lu<10 and j-lu>=0 and a[i+lu][j-lu]==\"X\":\r\n cnt_lu_rd+=1\r\n lu+=1\r\n while i-rd>=0 and j+rd<10 and a[i-rd][j+rd]==\"X\":\r\n cnt_lu_rd+=1\r\n rd+=1\r\n if (cnt_lr>=4 or cnt_du>=4 or cnt_ld_ru>=4 or cnt_lu_rd>=4) and a[i][j]==\".\":\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "matrix=[None]*10\r\nfor i in range(10):\r\n\tmatrix[i]=input()\r\n\r\nfor i in range(10):\r\n\tfor j in range(10):\r\n\t\tif 0<=j and j<=5:\r\n\t\t\tcount_x=0\r\n\t\t\thas_o=False\r\n\t\t\tfor k in range(5):\r\n\t\t\t\tif matrix[i][j+k]=='X':\r\n\t\t\t\t\tcount_x+=1\r\n\t\t\t\telif matrix[i][j+k]=='O':\r\n\t\t\t\t\thas_o=True\r\n\t\t\t\t\tbreak\r\n\t\t\tif count_x==4 and not has_o:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\r\n\r\n\t\t\tif 0<=i and i<=5:\r\n\t\t\t\tcount_x=0\r\n\t\t\t\thas_o=False\r\n\t\t\t\tfor k in range(5):\r\n\t\t\t\t\tif matrix[i+k][j+k]=='X':\r\n\t\t\t\t\t\tcount_x+=1\r\n\t\t\t\t\telif matrix[i+k][j+k]=='O':\r\n\t\t\t\t\t\thas_o=True\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif count_x==4 and not has_o:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\texit()\r\n\r\n\t\tif 0<=i and i<=5:\r\n\t\t\tcount_x=0\r\n\t\t\thas_o=False\r\n\t\t\tfor k in range(5):\r\n\t\t\t\tif matrix[i+k][j]=='X':\r\n\t\t\t\t\tcount_x+=1\r\n\t\t\t\telif matrix[i+k][j]=='O':\r\n\t\t\t\t\thas_o=True\r\n\t\t\t\t\tbreak\r\n\t\t\tif count_x==4 and not has_o:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\r\n\r\n\t\t\tif 4<=j and j<=9:\r\n\t\t\t\tcount_x=0\r\n\t\t\t\thas_o=False\r\n\t\t\t\tfor k in range(5):\r\n\t\t\t\t\tif matrix[i+k][j-k]=='X':\r\n\t\t\t\t\t\tcount_x+=1\r\n\t\t\t\t\telif matrix[i+k][j-k]=='O':\r\n\t\t\t\t\t\thas_o=True\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif count_x==4 and not has_o:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\texit()\r\nprint(\"NO\")", "a=[]\r\nf=False\r\nfor i in range(10):\r\n s=input()\r\n a.append(s)\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\nfor i in range(10):\r\n s=''\r\n for j in range(10):\r\n s+=a[j][i]\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\nfor k in range(10):\r\n s=''\r\n for i in range(k+1):\r\n s+=a[i][k-i]\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\n \r\nfor k in range(10,19):\r\n s=''\r\n for i in range(k-9,10):\r\n s+=a[i][k-i]\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\n\r\nfor k in range(-9,0):\r\n s=''\r\n for i in range(k+10):\r\n s+=a[i][i-k]\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\n\r\nfor k in range(10):\r\n s=''\r\n for i in range(k,10):\r\n s+=a[i][i-k]\r\n if s.find('XXXX.')!=-1 or s.find('XXX.X')!=-1 or s.find('XX.XX')!=-1 or s.find('X.XXX')!=-1 or s.find('.XXXX')!=-1:\r\n f=True\r\n\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[]\r\njauap='NO'\r\nfor i in range(10):\r\n s=list(input())\r\n a.append(s)\r\nfor i in range(10):\r\n for j in range(6):\r\n b=[]\r\n b=a[i][j:j + 5]\r\n if b.count('X')==4 and '.' in b:\r\n jauap='YES'\r\n break\r\nfor j in range(10):\r\n for i in range(6):\r\n b=[]\r\n for k in range(i,i+5):\r\n b.append(a[k][j])\r\n if b.count('X')==4 and '.' in b:\r\n jauap='YES'\r\n break\r\nfor i in range(6):\r\n for j in range(6):\r\n b=[]\r\n for k in range(5):\r\n b.append(a[i+k][j+k])\r\n if b.count('X')==4 and '.' in b:\r\n jauap='YES'\r\n break\r\nfor i in range(6):\r\n for j in range(4, 10):\r\n b=[]\r\n for k in range(5):\r\n b.append(a[i+k][j-k])\r\n if b.count('X')==4 and '.' in b:\r\n jauap='YES'\r\n break\r\nprint(jauap)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = 10\r\na = list()\r\nfor i in range(10):\r\n a.append(list(input()))\r\n\r\ndr = [-1,-1,0,1,1,1,0,-1]\r\ndc = [0,1,1,1,0,-1,-1,-1]\r\nfor i in range(10):\r\n for j in range(10):\r\n x = a[i][j]\r\n if x != '.':\r\n continue\r\n a[i][j] = 'X'\r\n for ii in range(10):\r\n for jj in range(10):\r\n for k in range(8):\r\n r = ii+4*dr[k]\r\n c = jj+4*dc[k]\r\n if not (0 <= r and r < 10 and 0 <= c and c < 10):\r\n continue\r\n ok = True\r\n for l in range(5):\r\n if a[ii+dr[k]*l][jj+dc[k]*l] != 'X':\r\n ok = False\r\n break\r\n if ok:\r\n print('YES')\r\n exit(0)\r\n a[i][j] = x\r\nprint('NO')", "s = []\r\nf = False\r\nfor i in range(10):\r\n s.append(list(input()))\r\nfor i in range(6):\r\n for j in range(6):\r\n a = [s[i][j], s[i][j + 1], s[i][j + 2], s[i][j + 3], s[i][j + 4]]\r\n b = [s[i][j], s[i + 1][j + 1], s[i + 2][j + 2], s[i + 3][j + 3], s[i + 4][j + 4]]\r\n c = [s[i][j], s[i + 1][j], s[i + 2][j], s[i + 3][j], s[i + 4][j]]\r\n d = [s[i + 4][j], s[i + 4][j + 1], s[i + 4][j + 2], s[i + 4][j + 3], s[i + 4][j + 4]]\r\n e = [s[i + 4][j], s[i + 3][j + 1], s[i + 2][j + 2], s[i + 1][j + 3], s[i][j + 4]]\r\n g = [s[i][j + 4], s[i + 1][j + 4], s[i + 2][j + 4], s[i + 3][j + 4], s[i + 4][j + 4]]\r\n if (a.count('X') == 4 and a.count('.') == 1) or (b.count('X') == 4 and b.count('.') == 1) or (c.count('X') == 4 and c.count('.') == 1) or (d.count('X') == 4 and d.count('.') == 1) or (e.count('X') == 4 and e.count('.') == 1) or (g.count('X') == 4 and g.count('.') == 1):\r\n f = True\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "from copy import deepcopy\r\na = []\r\nfor _ in range(10):\r\n a.append(list(input()))\r\nans = False \r\nfor i in range(10):\r\n for j in range(10):\r\n if a[i][j] != '.': continue\r\n b = deepcopy(a)\r\n b[i][j] = 'X'\r\n for k in range(10):\r\n for l in range(6):\r\n if b[k][l] == b[k][l+1] == b[k][l+2] == b[k][l+3] == b[k][l+4] == 'X':\r\n ans = True\r\n if b[l][k] == b[l+1][k] == b[l+2][k] == b[l+3][k] == b[l+4][k] == 'X':\r\n ans = True \r\n for k in range(2,8):\r\n for l in range(2,8):\r\n if b[k-2][l-2] == b[k-1][l-1] == b[k][l] == b[k+1][l+1] == b[k+2][l+2] == 'X':\r\n ans = True\r\n if b[k-2][l+2] == b[k-1][l+1] == b[k][l] == b[k+1][l-1] == b[k+2][l-2] == 'X':\r\n ans = True \r\n \r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "def solve1(i, j, bool1, bool2):\r\n cnt0 = 0\r\n cnt1 = 0\r\n u = 0\r\n v = 0\r\n for k in range(1, 11):\r\n if bool1:\r\n u = k\r\n if bool2:\r\n v = k\r\n if not(0 <= i + u < 10 and 0 <= j + v < 10):\r\n break\r\n elif s[i + u][j + v] == \"X\":\r\n cnt0 += 1\r\n else:\r\n break\r\n for k in range(1, 11):\r\n if bool1:\r\n u = -k\r\n if bool2:\r\n v = -k\r\n if not(0 <= i + u < 10 and 0 <= j + v < 10):\r\n break\r\n elif s[i + u][j + v] == \"X\":\r\n cnt0 += 1\r\n else:\r\n break\r\n for k in range(1, 11):\r\n if bool1:\r\n u = -k\r\n if bool2:\r\n v = k\r\n if not(0 <= i + u < 10 and 0 <= j + v < 10):\r\n break\r\n elif s[i + u][j + v] == \"X\":\r\n cnt1 += 1\r\n else:\r\n break\r\n for k in range(1, 11):\r\n if bool1:\r\n u = k\r\n if bool2:\r\n v = -k\r\n if not(0 <= i + u < 10 and 0 <= j + v < 10):\r\n break\r\n elif s[i + u][j + v] == \"X\":\r\n cnt1 += 1\r\n else:\r\n break\r\n return max(cnt0, cnt1) >= 4\r\n\r\ndef solve(i, j):\r\n return solve1(i, j, False, True) or solve1(i, j, True, False) or solve1(i, j, True, True)\r\n \r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = 10\r\ns = [input() for i in range(n)]\r\nflag = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == \".\":\r\n flag |= solve(i, j)\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(a, x, y):\r\n left = 0\r\n right = 0\r\n for i in range(1, 11):\r\n if x - i >= 0:\r\n if a[x - i][y] == 'X':\r\n left += 1\r\n else:\r\n break\r\n else:\r\n break\r\n for i in range(1, 11):\r\n if x + i < 10:\r\n if a[x + i][y] == 'X':\r\n right += 1\r\n else:\r\n break\r\n else:\r\n break\r\n if right + left >= 4:\r\n return 1\r\n left = 0\r\n right = 0\r\n for i in range(1, 11):\r\n if y - i >= 0:\r\n if a[x][y - i] == 'X':\r\n left += 1\r\n else:\r\n break\r\n else:\r\n break\r\n for i in range(1, 11):\r\n if y + i < 10:\r\n if a[x][y + i] == 'X':\r\n right += 1\r\n else:\r\n break\r\n else:\r\n break\r\n if right + left >= 4:\r\n return 1\r\n left = 0\r\n right = 0\r\n for i in range(1, 11):\r\n if x - i >= 0 and y - i >= 0:\r\n if a[x - i][y - i] == 'X':\r\n left += 1\r\n else:\r\n break\r\n else:\r\n break\r\n for i in range(1, 11):\r\n if x + i < 10 and y + i < 10:\r\n if a[x + i][y + i] == 'X':\r\n right += 1\r\n else:\r\n break\r\n else:\r\n break\r\n if right + left >= 4:\r\n return 1\r\n left = 0\r\n right = 0\r\n for i in range(1, 11):\r\n if x - i >= 0 and y + i < 10:\r\n if a[x - i][y + i] == 'X':\r\n left += 1\r\n else:\r\n break\r\n else:\r\n break\r\n for i in range(1, 11):\r\n if x + i < 10 and y - i >= 0:\r\n if a[x + i][y - i] == 'X':\r\n right += 1\r\n else:\r\n break\r\n else:\r\n break\r\n if right + left >= 4:\r\n return 1\r\n return 0\r\n \r\na = []\r\nfor i in range(10):\r\n gg = input()\r\n a.append([])\r\n for j in range(10):\r\n a[i].append(gg[j])\r\nfor i in range(10):\r\n for j in range(10):\r\n if a[i][j] == '.':\r\n a[i][j] = 'X'\r\n if check(a, i, j):\r\n print(\"YES\")\r\n exit(0)\r\n a[i][j] = '.'\r\nprint(\"NO\")\r\n \r\n", "def horizontal(mas):\r\n for i in range(len(mas)-4):\r\n k = ''\r\n for j in range(i, i+5):\r\n k+=str(mas[j])\r\n if k == 'XXXX.':\r\n return True\r\n elif k == '.XXXX':\r\n return True\r\n elif k == 'X.XXX':\r\n return True\r\n elif k == 'XX.XX':\r\n return True\r\n elif k == 'XXX.X':\r\n return True\r\n return False\r\n\r\n\r\nmas = []\r\nflag = 0\r\nfor i in range(10):\r\n mas.append(list(input()))\r\nfor i in range(10):\r\n f = horizontal(mas[i])\r\n if f == True and flag == 0:\r\n flag = 1\r\n print(\"YES\")\r\nfor i in range(10):\r\n ans = []\r\n for j in range(10):\r\n ans.append(mas[j][i])\r\n s = horizontal(ans)\r\n if s == True and flag == 0:\r\n flag = 1\r\n print(\"YES\")\r\nfor i in range(10):\r\n for j in range(10):\r\n ans = []\r\n for o in range(10):\r\n if o + j == 10 or i + o == 10:\r\n break\r\n ans.append(mas[o + i][o + j])\r\n t = horizontal(ans)\r\n if t == True and flag == 0:\r\n flag = 1\r\n print(\"YES\")\r\nfor i in range(10):\r\n for j in range(9, 0, -1):\r\n ans = []\r\n for o in range(10):\r\n if j - o < 0 or i + o == 10:\r\n break\r\n ans.append(mas[o + i][j - o])\r\n d = horizontal(ans)\r\n if d == True and flag == 0:\r\n flag = 1\r\n print(\"YES\")\r\nif flag == 0:\r\n print(\"NO\")", "s = []\r\n\r\ndef check():\r\n for i in range(10):\r\n for j in range(10):\r\n if j+4<10:\r\n th = ''\r\n for k in range(5):\r\n th+=s[i][j+k]\r\n if th=='XXXXX':\r\n return True\r\n for i in range(10):\r\n for j in range(10):\r\n if i+4<10:\r\n th = ''\r\n for k in range(5):\r\n th+=s[i+k][j]\r\n if th=='XXXXX':\r\n return True\r\n for i in range(10):\r\n for j in range(10):\r\n if i+4<10 and j+4<10:\r\n th = ''\r\n for k in range(5):\r\n th+=s[i+k][j+k]\r\n if th=='XXXXX':\r\n return True\r\n for i in range(10):\r\n for j in range(10):\r\n if i+4<10 and j-4>=0:\r\n th = ''\r\n for k in range(5):\r\n th+=s[i+k][j-k]\r\n if th=='XXXXX':\r\n return True\r\n return False\r\n\r\nfor i in range(10):\r\n s.append(list(input()))\r\nflag = False\r\nif check():\r\n flag = True\r\nfor i in range(10):\r\n for j in range(10):\r\n if s[i][j]=='.':\r\n s[i][j]='X'\r\n if check():\r\n flag=True\r\n s[i][j]='.'\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = [ [ c for c in input() ] for i in range(10) ]\ndef win():\n for i in range(10):\n for j in range(10):\n ok = True\n for k in range(5):\n if j+k>9: ok = False\n elif s[i][j+k] != 'X': ok = False\n if ok: return True\n ok = True\n for k in range(5):\n if i+k>9: ok = False\n elif s[i+k][j] != 'X': ok = False\n if ok: return True\n ok = True\n for k in range(5):\n if j+k>9 or i+k>9: ok = False\n elif s[i+k][j+k] != 'X': ok = False\n if ok: return True\n ok = True\n for k in range(5):\n if i-k<0 or j+k>9: ok = False\n elif s[i-k][j+k] != 'X': ok = False\n if ok: return True\n return False\nfor i in range(10):\n for j in range(10):\n if s[i][j]=='.':\n s[i][j] = 'X'\n if win():\n print('YES')\n exit(0)\n s[i][j] = '.'\nprint('NO')\n", "def find(r, c, s1, s2):\r\n combo = 0\r\n while a[r][c] == 'X':\r\n r += s1\r\n c += s2\r\n combo += 1\r\n return combo\r\n\r\na = ['@@@@@@@@@@@@']\r\nmarks = []\r\ndots = []\r\nans = 1\r\nfor i in range(10):\r\n a.append('@' + input() + '@')\r\na.append('@@@@@@@@@@@@')\r\n\r\nfor i in range(1, 11):\r\n for j in range(1, 11):\r\n if a[i][j] == '.':\r\n res1 = find(i, j-1, 0, -1) + find(i, j+1, 0, 1)\r\n res2 = find(i+1, j, 1, 0) + find(i-1, j, -1, 0)\r\n res3 = find(i+1, j+1, 1, 1) + find(i-1, j-1, -1, -1)\r\n res4 = find(i+1, j-1, 1, -1) + find(i-1, j+1, -1, 1)\r\n if res1 > 3 or res2 > 3 or res3 > 3 or res4 > 3:\r\n ans = 0\r\n \r\nprint('YNEOS'[ans::2])\r\n", "import sys\r\nfrom array import array\r\n\r\n\r\ndef solve():\r\n for i in range(10):\r\n for j in range(10):\r\n for dir in range(8):\r\n nx, ny, iters = i, j, 0\r\n\r\n for _ in range(5):\r\n if not (valid(nx, ny) and a[nx][ny] == 'X'):\r\n break\r\n\r\n nx, ny = nx + dx[dir], ny + dy[dir]\r\n iters += 1\r\n\r\n if iters == 5:\r\n return 1\r\n\r\n return 0\r\n\r\n\r\nvalid = lambda x, y: -1 < x < 10 and -1 < y < 10\r\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n\r\na = [array('u', input()) for _ in range(10)]\r\nans = 0\r\n\r\nfor i in range(10):\r\n for j in range(10):\r\n if a[i][j] != 'O':\r\n old = a[i][j]\r\n a[i][j] = 'X'\r\n ans |= solve()\r\n a[i][j] = old\r\n\r\nprint(['NO', 'YES'][ans])\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\nmat = []\r\n\r\nfor i in range (10) :\r\n mat.append(list(ip()))\r\n\r\ndef check(a) :\r\n if (a.count('X') == 4 and a.count('.') == 1) :\r\n print(\"YES\")\r\n exit(0)\r\n\r\n\r\nfor i in range (10) :\r\n for j in range (6) :\r\n check([ mat[i][j],mat[i][j+1],mat[i][j+2],mat[i][j+3],mat[i][j+4] ])\r\n check([ mat[j][i],mat[j+1][i],mat[j+2][i],mat[j+3][i],mat[j+4][i] ])\r\n\r\nfor i in range (6) :\r\n for j in range(6) :\r\n check([ mat[i][j],mat[i+1][j+1],mat[i+2][j+2],mat[i+3][j+3],mat[i+4][j+4] ])\r\n check([ mat[i+4][j],mat[i+3][j+1],mat[i+2][j+2],mat[i+1][j+3],mat[i][j+4] ])\r\n\r\nprint(\"NO\")\r\n", "N = 10\r\n\r\npatterns = ['.XXXX', 'XXXX.', 'XX.XX', 'XXX.X', 'X.XXX']\r\n\r\ndef game(s):\r\n cols = [[] for _ in range(N)]\r\n rows = [[] for _ in range(N)]\r\n fdiag = [[] for _ in range(N + N - 1)]\r\n bdiag = [[] for _ in range(len(fdiag))]\r\n min_bdiag = -N + 1\r\n\r\n for y in range(N):\r\n for x in range(N):\r\n cols[y].append(s[y][x])\r\n rows[x].append(s[y][x])\r\n fdiag[x + y].append(s[y][x])\r\n bdiag[-min_bdiag + x - y].append(s[y][x])\r\n\r\n for arr in [cols, rows, fdiag, bdiag]:\r\n for l in arr:\r\n line = ''.join(l)\r\n if line.count('X') >= 4:\r\n for p in patterns:\r\n if line.find(p) != -1:\r\n return True\r\n\r\n return False\r\n\r\n\r\ns = [input() for _ in range(N)]\r\nif game(s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "mat=[]\r\nn=10 \r\nm=10 \r\nfor i in range(n):\r\n s=input()\r\n s=list(s)\r\n mat.append(s)\r\nf=0 \r\ndef check(mat): \r\n for i in range(10):\r\n for j in range(10):\r\n #horizontal\r\n for k in range(5): \r\n if (i+k)>=10 or mat[i+k][j]!='X':\r\n break \r\n else:\r\n return 1 \r\n #vertical \r\n for k in range(5):\r\n if (j+k)>=10 or mat[i][j+k]!='X':\r\n break \r\n else :\r\n return 1 \r\n #diag \r\n for k in range(5):\r\n if (i+k)>=10 or (j+k)>=10 or mat[i+k][j+k]!='X':\r\n break \r\n else :\r\n return 1 \r\n for k in range(5):\r\n if (i+k)>=10 or (j-k)<0 or mat[i+k][j-k]!='X':\r\n break \r\n else :\r\n return 1 \r\n return 0 \r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]=='.':\r\n mat[i][j]='X'\r\n if check(mat):\r\n f=1 \r\n print('YES')\r\n exit() \r\n else:\r\n mat[i][j]='.'\r\nprint('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\ng = [input()[:-1] for _ in range(10)]\r\nfor i in range(10):\r\n for j in range(10):\r\n if g[i][j] == '.':\r\n f = []\r\n for a, b, c, d in [(0, 1, 0, -1), (1, 0, -1, 0), (-1, -1, 1, 1), (-1, 1, 1, -1)]:\r\n a1 = a2 = 0\r\n for i1 in range(1, 11):\r\n if 0 <= i+i1*a < 10 and 0 <= j+i1*b < 10 and g[i+i1*a][j+i1*b] == 'X':\r\n a1 += 1\r\n else:\r\n break\r\n for i1 in range(1, 11):\r\n if 0 <= i+i1*c < 10 and 0 <= j+i1*d < 10 and g[i+i1*c][j+i1*d] == 'X':\r\n a2 += 1\r\n else:\r\n break\r\n f.append(a1+a2)\r\n if max(f) > 3:\r\n print('YES')\r\n exit()\r\nprint('NO')", "a = []\r\nfor i in range(10):\r\n a.append(input())\r\n\r\ndef valid(x, y):\r\n if 0 <= x <= 9 and 0 <= y <= 9:\r\n return True\r\n return False\r\n\r\ndef check(x, y, direction):\r\n ans = 1\r\n curr_x = x + direction[0]\r\n curr_y = y + direction[1]\r\n while valid(curr_x, curr_y) and a[curr_x][curr_y] == 'X':\r\n ans += 1\r\n curr_x += direction[0]\r\n curr_y += direction[1]\r\n curr_x = x - direction[0]\r\n curr_y = y - direction[1]\r\n while valid(curr_x, curr_y) and a[curr_x][curr_y] == 'X':\r\n ans += 1\r\n curr_x -= direction[0]\r\n curr_y -= direction[1]\r\n return ans\r\n\r\ncurr = 0\r\nfor i in range(10):\r\n for j in range(10):\r\n if a[i][j] == '.':\r\n for direction in [[1, 0], [0, 1], [1, 1], [1, -1]]:\r\n curr = max(curr, check(i, j, direction))\r\n\r\nif curr >= 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "matriz = [[letra for letra in input()] for i in range(10) ]\r\nflag = False\r\n\r\nfor i in range(10):\r\n for j in range(6):\r\n m = [matriz[i][j], matriz[i][j+1], matriz[i][j+2], matriz[i][j+3], matriz[i][j+4]]\r\n if m.count('.') == 1 and m.count('X') == 4:\r\n flag = True\r\n break\r\n\r\nfor i in range(6):\r\n for j in range(10):\r\n m = [matriz[i][j], matriz[i+1][j], matriz[i+2][j], matriz[i+3][j], matriz[i+4][j]]\r\n if m.count('.') == 1 and m.count('X') == 4:\r\n flag = True\r\n break\r\n\r\nfor i in range(6):\r\n for j in range(6):\r\n m = [matriz[i][j], matriz[i+1][j+1], matriz[i+2][j+2], matriz[i+3][j+3], matriz[i+4][j+4]]\r\n if m.count('.') == 1 and m.count('X') == 4:\r\n flag = True\r\n break\r\n\r\n\r\nfor i in range(6):\r\n for j in range(9, 3, -1):\r\n m = [matriz[i][j], matriz[i+1][j-1], matriz[i+2][j-2], matriz[i+3][j-3], matriz[i+4][j-4]]\r\n if m.count('.') == 1 and m.count('X') == 4:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "x=[]\r\nbiao=0\r\nfor i in range(10):\r\n y=list(input())\r\n x.append(y)\r\nfor i in range(10):\r\n for j in range(6):\r\n if x[i][j]==\"X\" or x[i][j]==\".\":\r\n z=[]\r\n for k in range(5):\r\n z.append(x[i][j+k])\r\n if z.count(\"X\")==4 and z.count(\"O\")==0:\r\n biao=1\r\n break\r\n if x[j][i]==\"X\" or x[j][i]==\".\":\r\n z=[]\r\n for k in range(5):\r\n z.append(x[j+k][i])\r\n if z.count(\"X\")==4 and z.count(\"O\")==0:\r\n biao=1\r\n break\r\n if biao==1:\r\n break\r\n if biao==1:\r\n break\r\nif biao==1:\r\n print(\"YES\")\r\nelse:\r\n for i in range(6):\r\n for j in range(6):\r\n if x[i][j]==\"X\" or x[i][j]==\".\":\r\n z=[]\r\n for k in range(5):\r\n z.append(x[i+k][j+k])\r\n if z.count(\"X\") == 4 and z.count(\"O\") == 0:\r\n biao = 1\r\n break\r\n if biao == 1:\r\n break\r\n if biao == 1:\r\n break\r\n for i in range(4,10):\r\n for j in range(6):\r\n if x[j][i]==\"X\" or x[j][i]==\".\":\r\n z=[]\r\n for k in range(5):\r\n z.append(x[j+k][i-k])\r\n if z.count(\"X\") == 4 and z.count(\"O\") == 0:\r\n biao = 1\r\n break\r\n if biao == 1:\r\n break\r\n if biao == 1:\r\n break\r\n if biao==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "grid = []\r\nfor i in range(10):\r\n grid.append(input())\r\n \r\n # grid = [list(get(str)) for i in range(10)]\r\n\r\ns2 = set(list(map(tuple, '.XXXX X.XXX XX.XX XXX.X XXXX.'.split())))\r\ns = set()\r\n\r\nfor i in range(10):\r\n for j in range(10): \r\n r, d, d1, d2 = None, None, None, None\r\n\r\n if j + 4 < 10:\r\n r = tuple([grid[i][j + x] for x in range(5)])\r\n\r\n if i + 4 < 10:\r\n d = tuple([grid[i + x][j] for x in range(5)])\r\n\r\n if i + 4 < 10 and j + 4 < 10:\r\n d1 = tuple([grid[i + x][j + x] for x in range(5)])\r\n\r\n if i - 4 >= 0 and j + 4 < 10:\r\n d2 = tuple([grid[i - x][j + x] for x in range(5)])\r\n\r\n s.add(r)\r\n s.add(d)\r\n s.add(d1)\r\n s.add(d2)\r\n\r\nif len(s2 & s) > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = [\r\n list(map(lambda x: 1 if x == 'X' else 2 if x == 'O' else 0, input().rstrip()))\r\n for _ in range(10)\r\n]\r\n\r\n\r\ndef check(sx, sy):\r\n return (\r\n all(x < 10 and s[sy][x] == 1 for x in range(sx, sx+5))\r\n or all(y < 10 and s[y][sx] == 1 for y in range(sy, sy+5))\r\n or all(x < 10 and y < 10 and s[y][x] == 1 for x, y in zip(range(sx, sx+5), range(sy, sy+5)))\r\n or all(x < 10 and 0 <= y and s[y][x] == 1 for x, y in zip(range(sx, sx+5), range(sy, sy-5, -1)))\r\n )\r\n\r\n\r\nfor y in range(10):\r\n for x in range(10):\r\n if s[y][x] != 0:\r\n continue\r\n s[y][x] = 1\r\n if any(check(i, j) for i in range(10) for j in range(10)):\r\n print('YES')\r\n exit()\r\n s[y][x] = 0\r\n\r\nprint('NO')\r\n", "#input_data_set1 = ['XX.XX.....','.....OOOO.','..........','..........',\r\n#'..........','..........','..........','..........','..........','..........']\r\n\r\n#input_data_set2 = ['XXOXX.....','OO.O......','..........','..........',\r\n#'..........','..........','..........','..........','..........','..........']\r\ninput_data_set1 = [input() for s in range(0,10)]\r\n\r\npatterns = ['.XXXX','X.XXX','XX.XX','XXX.X','XXXX.']\r\n\r\ndef check_data_set(data_set, patterns):\r\n\twin_flag = 'NO'\r\n\r\n\tfor row in data_set:\r\n\t\tfor pattern in patterns:\r\n\t\t\tif row.find(pattern) != -1:\r\n\t\t\t\twin_flag = 'YES'\r\n\r\n\treturn win_flag\r\n\r\ndef get_diagonal_data_set(source_data_set):\r\n\tdiagonal_data_set_1 = []\r\n\tdiagonal_data_set_2 = []\r\n\tfor i in range(0,6):\r\n\t\tdiagonal_data_set_1.append('')\r\n\t\tdiagonal_data_set_2.append('')\r\n\t\tfor j in range(0,10-i):\r\n\t\t\tdiagonal_data_set_1[i] += source_data_set[j][j+i]\r\n\t\t\tdiagonal_data_set_2[i] += source_data_set[j+i][j]\r\n\treturn diagonal_data_set_1 + diagonal_data_set_2\r\n\r\nhorizontal_data_set = input_data_set1\r\n\r\nvertical_data_set = []\r\nfor i in range(0,10):\r\n\tvertical_data_set.append('')\r\n\tfor j in range(0,10):\r\n\t\tvertical_data_set[i] += horizontal_data_set[j][i]\r\n\r\ndata_set = horizontal_data_set + vertical_data_set + get_diagonal_data_set(horizontal_data_set) + get_diagonal_data_set(vertical_data_set[::-1])\r\n\r\nprint(check_data_set(data_set, patterns))" ]

[ "n = int(input())\r\nflag = False\r\nfor i in range(n):\r\n name, before, after = map(str, input().split())\r\n if flag is False:\r\n if int(before) >= 2400 and int(after) > int(before):\r\n flag = True\r\n continue\r\nprint('YES' if flag is True else 'NO')\r\n", "n=int(input())\r\ncan=False\r\nfor i in range(n):\r\n\ts,x,y=input().split()\r\n\tx=int(x)\r\n\ty=int(y)\r\n\tif x>=2400 and y>x:\r\n\t\tcan=True\r\n\t\tbreak\r\nif can:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\nans = 'NO'\nfor _ in range(n):\n a = input().split()\n if int(a[1]) >= 2400 and int(a[2]) > int(a[1]):\n ans = 'YES'\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = \"NO\"\r\nfor _ in range(n):\r\n _, b, a = input().rstrip().decode().split()\r\n if 2400 <= int(b) < int(a):\r\n ans = \"YES\"\r\nprint(ans)", "\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s , x , y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n if x < y and x >= 2400 :\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "ans = 'NO'\nfor i in range(int(input())):\n s, a, b = (x for x in input().split())\n if int(a) >= 2400 and int(b) > int(a):\n ans = 'YES'\nprint(ans)\n", "n=int(input())\r\nflag=False\r\nfor i in range(n):\r\n info=list(input().split())\r\n if int(info[1])>=2400 and int(info[2])>int(info[1]):\r\n flag=True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check(b,a):\r\n if (b>=2400 and a>=2400 and a>b):\r\n return 1\r\n else:\r\n return 0 \r\nz=0\r\nfor i in range(int(input())):\r\n name,before,after=input().split()\r\n z+=check(int(before),int(after))\r\nif(z>0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "losers=int(input())\r\np=False\r\n\r\nfor _ in range(losers):\r\n\tname, before, after=input().split()\r\n\tif int(before)>=2400:\r\n\t\tif int(after)>int(before):\r\n\t\t\tp=True\r\nif p:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "for _ in range(int(input())):\r\n\tl=input().split()\r\n\tif int(l[1])>=2400:\r\n\t\tif int(l[2])>int(l[1]):\r\n\t\t\tprint('YES')\r\n\t\t\texit()\r\nprint('NO')", "n = int(input())\nres = \"NO\"\nfor _ in range(n):\n _, b, a = (x if i == 0 else int(x) for i, x in enumerate(input().split()))\n if a > b >= 2400:\n res = \"YES\"\nprint(res)\n", "t=int(input())\r\ncheck=1\r\nfor i in range(t):\r\n s=input()\r\n a=s.split(' ')\r\n if int(a[1])>=2400 and int(a[1])<int(a[2]):\r\n check=0\r\nif check==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\nf=0\r\nfor i in range(1,n+1):\r\n s =input()\r\n s1=s.split()\r\n if(int(s1[1])>=2400):\r\n if(int(s1[1])<int(s1[2])):\r\n f=1\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n k,a,b=map(str,input().split())\r\n if int(a)>=2400 and int(a)<int(b) :\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\nnames=[]\r\nold=[]\r\nnew=[]\r\nfor i in range(n):\r\n x,y,z=[i for i in input().split(\" \")]\r\n names.append(x)\r\n old.append(int(y))\r\n new.append(int(z))\r\nwon=0\r\nfor i in range(n):\r\n if old[i]>=2400 and new[i]>old[i]:\r\n won=1\r\nif won:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ngood = False\r\nfor x in range(0,n):\r\n scores = input().split()\r\n if int(scores[1]) >= 2400 and int(scores[2]) > int(scores[1]):\r\n good = True\r\nif good == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "for _ in \" \"*int(input()):\r\n a,b=map(int,input().split()[1:])\r\n if b>a>=2400:print(\"YES\");exit()\r\nprint(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n s = input().split()\r\n a, b = list(map(int, s[1:]))\r\n if a >= 2400 and b > a:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nfor i in range(n):\r\n s = input().split()\r\n r1 = int(s[1])\r\n r2 = int(s[2])\r\n if r2 >r1 and r1 >= 2400:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "t = int(input())\r\ngood = False\r\n\r\nfor i in range(t):\r\n name, before, after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if before >= 2400 and after > before:\r\n good = True\r\n break\r\n\r\nif good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def solve(n):\r\n\r\n for _ in range(n):\r\n test = list(input().split())\r\n if 2400 <= int(test[1]) < int(test[2]):\r\n return 'YES'\r\n\r\n return 'NO'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(solve(n))", "n= int(input())\r\nc=\"NO\"\r\nfor i in range(n):\r\n x=input().split()\r\n if int(x[1]) >= 2400 and int(x[2])> int(x[1]):\r\n c=\"YES\"\r\n break\r\nprint(c) ", "# --------------------------------#\r\n#-----------<HajLorenzo>-----------\r\n#Most Important Thing About Life\r\n#Is Loving What You Do...\r\n# --------------------------------#\r\n\r\nCHECK=False\r\nfor i in range(int(input())):\r\n _=list(input().split())\r\n if(int(_[1])>=2400 and int(_[2])>int(_[1])):\r\n CHECK=True\r\nprint(\"YES\" if(CHECK) else \"NO\")", "for _ in range(int(input())):\r\n _,b,a = map(lambda x: int(x) if x.isnumeric() or x[1:].isnumeric() else x, input().split(' '))\r\n if b >= 2400 and b < a:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "n=int(input())\r\nfl=0\r\nfor i in range(n):\r\n s,b,a=list(map(str,input().split()))\r\n if fl==0:\r\n b=int(b)\r\n a=int(a)\r\n bef='Orange'\r\n inc=0\r\n if b>=2400:\r\n bef='Red'\r\n if a>b:\r\n inc=1\r\n if bef=='Red' and inc==1:\r\n fl=1\r\nif fl==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\nfor i in range(n):\r\n s,i=input(),0\r\n while(s[i]!=' '):\r\n i+=1\r\n j=i\r\n i+=1\r\n while(s[i]!=' '):\r\n i+=1\r\n a=int(s[j+1:i])\r\n b=int(s[i+1:len(s)])\r\n if(a>=2400 and b>a):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "for _ in range(int(input())):\r\n a, b, c = input().split()\r\n b = int(b)\r\n c = int(c)\r\n if b >= 2400 and c > b:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n = int(input())\r\n\r\nse_pudo = False\r\nfor i in range(n):\r\n\tlista = input().split()\r\n\ta = int(lista[1])\r\n\td = int(lista[2])\r\n\r\n\tif a >= 2400 and d > a:\r\n\t\tse_pudo = True\r\n\t\tbreak\r\n\r\nprint([\"NO\", \"YES\"][se_pudo])", "\r\nimport math\r\nfrom collections import Counter\r\nimport bisect\r\n\r\nn = int(input())\r\ngood = False\r\nfor i in range(n) :\r\n before, after = map(int, input().split()[1:])\r\n if before >= 2400 and after > before :\r\n good = True\r\nprint(\"YES\" if good else \"NO\")\r\n\r\n", "n=int(input())\r\ndi={}\r\nfor i in range(n):\r\n handle,bc,ac=map(str,input().split())\r\n if(handle not in di):\r\n ar=[]\r\n ar.append(int(bc))\r\n ar.append(int(ac))\r\n di[handle]=ar\r\n \r\ndef solve(di):\r\n for i in di.keys():\r\n if(di[i][0]>=2400 and di[i][1]>di[i][0]):\r\n return (\"YES\")\r\n return \"NO\"\r\nprint(solve(di))\r\n ", "n = int(input())\r\nres = 0\r\n\r\nfor i in range(n):\r\n input_str = input()\r\n input_list = input_str.split()\r\n name = input_list[0]\r\n before = int(input_list[1])\r\n after = int(input_list[2])\r\n \r\n if before >= 2400 and after > before:\r\n res += 1\r\n\r\nif res > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "for i in range(int(input())):\r\n\ta,b,c=input().split()\r\n\tif int(b)>2399 and int(c)>int(b):\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "def red(n):\r\n return n >= 2400\r\n\r\ncount = 0\r\n\r\nfor _ in range(int(input())):\r\n name,before,after = map(str,input().split(' '))\r\n before = int(before)\r\n after = int(after)\r\n \r\n if red(before) and after > before:\r\n count += 1\r\n \r\nif count > 0 :\r\n print(\"YES\")\r\nelse :\r\n print('NO')\r\n ", "\"\"\"\r\n123456789101112131415\r\n\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(str,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#\r\n\r\nn = inp()\r\n\r\nisTrue = True\r\n\r\nfor i in range(n):\r\n name, before, after = inlt()\r\n if int(before) >= 2400 and int(after) > int(before):\r\n print(\"YES\")\r\n isTrue = False\r\n break\r\n\r\nif isTrue:\r\n print(\"NO\")\r\n", "answer = 'NO'\r\nfor _ in range(int(input())):\r\n s = list(map(str,input().split()))\r\n if int(s[1])>=2400:\r\n if int(s[2])>int(s[1]):\r\n answer = 'YES'\r\nprint(answer)", "n = int(input())\r\noutput = \"NO\"\r\nfor j in range(n):\r\n name, prev, curr = [str(j) for j in input().split()]\r\n if int(curr) - int(prev) > 0 and int(prev) >= 2400:\r\n output = \"YES\"\r\nprint(output)\r\n", "flag=0\r\nfor _ in range(int(input())):\r\n l=list(input().split())\r\n if int(l[1])>=2400 and int(l[1])<int(l[2]):\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\r\nf=0\r\nfor i in range(x):\r\n h,bf,af=list(input().split())\r\n bf=int(bf)\r\n af=int(af)\r\n if bf>=2400 and af>bf:\r\n f=1\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l=int(input())\r\nn=[]\r\nd=0\r\nfor i in range(l):\r\n c=list(map(str,input().split()))\r\n n.append(c)\r\nfor i in range(len(n)):\r\n if int(n[i][1])>=2400 and int(n[i][1])<int(n[i][2]):\r\n d=1\r\n break\r\nif d==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "def solve(t_id):\r\n n = int(input())\r\n ok = False\r\n for i in range(n):\r\n s = input().split()\r\n if int(s[1]) >= 2400 and int(s[1]) < int(s[2]):\r\n ok = True\r\n print('YES' if ok else 'NO')\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "cases = int(input())\r\nfound = False\r\nwhile cases:\r\n cases -= 1\r\n s, a, b = input().split()\r\n\r\n if 2400 <= int(a) < int(b):\r\n print(\"YES\")\r\n found = True\r\n break\r\n\r\nif not found:\r\n print(\"NO\")\r\n", "####### A. A Good Contest\r\n\r\n# Read input\r\nn = int(input())\r\nperform_good = False\r\n\r\n# Iterate through participants\r\nfor i in range(n):\r\n handle, before, after = input().split()\r\n before, after = int(before), int(after)\r\n \r\n # Check if the participant's handle was red before and their rating increased\r\n if before >= 2400 and after > before:\r\n perform_good = True\r\n\r\n# Print the result\r\nif perform_good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "n=int(input())\r\nf=0\r\nfor _ in range(n):\r\n \r\n a,b,c=map(str,input().split())\r\n b=int(b)\r\n c=int(c)\r\n if b>=2400 and c>b:\r\n f=1\r\n print('YES')\r\n break\r\n\r\nif f==0:\r\n print('NO')", "if __name__ == \"__main__\":\r\n\tcheck = False\r\n\tfor t in range(int(input())):\r\n\t\tstring, start, end = list(input().split())\r\n\t\tif int(start) >= 2400 and int(start) < int(end):\r\n\t\t\tcheck = True\r\n\r\n\tif check:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint(\"NO\")\r\n", "n=int(input())\r\nfor i in range(n):\r\n a, b, d = input().split()\r\n if int(d)>int(b) and int(b)>=2400:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n ", "lst = []\r\nfor i in range(int(input())):\r\n a, b, c = list(map(str, input().split()))\r\n b, c = int(b), int(c)\r\n if (b >= 2400 and c > b):\r\n lst.append(True)\r\n else:\r\n pass\r\n \r\nif (True in lst):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n ", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n\ts,b,a=map(str,input().split())\r\n\tif int(a)>int(b) and int(b)>=2400 and a!=b:\r\n\t\tx=1\r\nif x==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "t=int(input())\r\nfor z in range(t):\r\n n,b,a=input().split()\r\n b=int(b)\r\n a=int(a)\r\n c=0\r\n if b>=2400 and a>b:\r\n print('YES')\r\n c+=1\r\n break;\r\nif c==0:print('NO')", "a=int(input())\r\nn=0\r\nfor i in range(a):\r\n b=input().split()\r\n if int(b[1])>=2400 and int(b[2])>int(b[1]):\r\n print('YES')\r\n n=1\r\n break\r\nif n==0:\r\n print('NO')\r\n ", "n = int(input())\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n b, c = int(b), int(c)\r\n if 2400 <= b < c:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "n = int(input())\r\nres = 'NO'\r\n\r\nfor i in range(n):\r\n name, before, after = [j for j in input().split()]\r\n before, after = int(before), int(after)\r\n if before >= 2400 and after > before:\r\n res = 'YES'\r\n\r\nprint(res)", "hat = int(input())\r\ntotal = 0\r\nfor i in range(hat):\r\n name, befor, after = map(str, input().split())\r\n if int(befor) >= 2400 and int(after) > int(befor):\r\n total += 1\r\nif total > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "z,c = int(input()),0\r\nfor _ in range(z):\r\n x = input().split(' ')\r\n if int(x[1])>=2400 and int(x[1])<int(x[2]):\r\n c=1\r\n else:\r\n continue\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nbool = False\r\nfor i in range(n):\r\n temp = input().split()\r\n name = temp[0]\r\n before = int(temp[1])\r\n after = int(temp[2])\r\n if before >= 2400 and after > before:\r\n bool = True\r\n break\r\nif bool:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "def main():\r\n n = int(input())\r\n\r\n for _ in range(n):\r\n [_, before, after] = input().split()\r\n [b, a] = map(int, [before, after])\r\n\r\n if b >= 2400 and a > b:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "for i in range(int(input())):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if b>=2400 and c>b:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "n=int(input())\r\nt=0\r\nfor i in range(n):\r\n a=input().split()\r\n if int(a[1])>=2400 and int(a[2])>int(a[1]):\r\n t+=1\r\nif t>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n b,c=[int(b),int(c)]\r\n if 2400<=b<c:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "found = False\r\nfor _ in range(int(input())):\r\n s = input().split()\r\n s1 = int(s[1])\r\n s2 = int(s[2])\r\n if s1 >= 2400 and s2 > s1:\r\n found = True\r\n \r\nprint('YES' if found else 'NO')\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n ans = False\r\n for _ in range(int(input())):\r\n s, a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if a >= 2400 and b > a:\r\n ans = True\r\n if ans:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = int(input())\r\nd = 0\r\nfor i in range(t):\r\n c, a, b = input().split()\r\n if int(a)>=2400 and int(b)>int(a):\r\n d = d+1\r\nif d>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nn=int(input())\r\nfor i in range(n):\r\n l=list(input().split())\r\n ll=[]\r\n ll.append(l[1])\r\n ll.append(l[2])\r\n lll=[int(x) for x in ll]\r\n \r\n\r\n if lll[0]>=2400 and lll[1]>lll[0]:\r\n print(\"YES\")\r\n sys.exit()\r\n elif i==n-1:\r\n print(\"NO\")\r\n\r\n else:\r\n continue ", "n = int(input())\r\nres = 'NO'\r\nfor i in range(n):\r\n r = [int(s) for s in input().split()[1:]]\r\n if r[0] >= 2400 and r[1] - r[0] > 0:\r\n res = 'YES'\r\nprint(res)", "n=int(input())\r\nt=0\r\nfor i in range(n):\r\n a=input().split()\r\n a[1],a[2]=int(a[1]),int(a[2])\r\n if a[1]>=2400 and a[2]>a[1]:\r\n t+=1\r\nif t>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n=int(input())\r\nf='NO'\r\nfor i in range(n):\r\n name,a,b=[x for x in input().split()]\r\n a=int(a)\r\n b=int(b)\r\n if a>=2400 and b>a:\r\n f='YES'\r\nprint(f)", "n = int(input())\r\nflag = 'NO'\r\n\r\nfor i in range(n):\r\n name, before, after = [i for i in input().split()]\r\n if int(before) >= 2400 and int(after) - int(before) > 0:\r\n flag = \"YES\"\r\nprint(flag)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n n1=list(map(str,input().split()))\r\n if(int(n1[1])>=2400):\r\n if(int(n1[2])>int(n1[1])):\r\n s=s+1\r\nif(s>0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n name,rat_old,rat_new=input().split()\r\n if int(rat_new)-int(rat_old)>0 and int(rat_old)>=2400:\r\n count+=1\r\nif count>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "amount_outscored = int(input())\r\nallow = False\r\n\r\nfor i in range(amount_outscored):\r\n name, before, after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if before >= 2400 and before < after:\r\n allow = True\r\n\r\nif allow == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=\"NO\"\nfor _ in range(int(input())):\n _,b,c=input().split()\n if int(c)>int(b)>2399:s=\"YES\"\nprint(s)\n \t \t\t\t \t\t \t\t\t \t \t \t \t\t \t", "n = int(input())\r\nall=[]\r\ncount=0\r\nfor i in range(n):\r\n name , b , a = input().split()\r\n b = int(b)\r\n a = int(a)\r\n all.extend([b ,a])\r\n\r\nfor i in range(0,n*2,2):\r\n if all[i]>=2400 and all[i+1]>all[i]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "flag=0\r\nfor _ in range(int(input())):\r\n handle,before,after = map(str,input().split())\r\n \r\n if int(before) >=2400 and int(after) > int(before):\r\n flag=1\r\n break\r\n \r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n l=input().split()\r\n if int(l[1])>=2400 and int(l[2])>int(l[1]):\r\n s.append('YES')\r\nif 'YES' in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "num = int(input())\r\n\r\nyes = False\r\n\r\nfor a in range(num):\r\n b = input().split()\r\n b[1] = int(b[1])\r\n b[2] = int(b[2])\r\n if 2400 <= b[1] < b[2]:\r\n yes = True\r\n\r\n\r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,a = int(input()),\"\"\r\nfor i in range(n):\r\n coder = input().split()\r\n if int(coder[1]) >= 2400 and int(coder[2]) > int(coder[1]):\r\n a = \"YES\"\r\nprint(a if a else \"NO\")", "\nN = int(input())\noutput = \"NO\"\n\nfor i in range(N):\n name, before, after = input().split()\n before = int(before)\n after = int(after)\n if before >= 2400:\n if after > before:\n output = \"YES\"\n\nprint(output)\n\n\t \t \t\t \t \t\t \t\t \t", "anton_performed_good = False\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n before, after = int(before), int(after)\r\n \r\n if before >= 2400 and after > before:\r\n anton_performed_good = True\r\n break\r\n\r\nif anton_performed_good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n l=list(input().split())\r\n if(int(l[1])>=2400 and int(l[2])>int(l[1])):\r\n d.append(1)\r\nif(len(d)==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nli = []\r\nyes = False\r\nfor _ in range(n):\r\n li = input().split()\r\n if int(li[1]) >= 2400 and int(li[2]) > int(li[1]):\r\n yes = True\r\n\r\nif yes:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\noutput = \"NO\"\r\nfor i in range(0, n):\r\n contest = input().split(\" \")\r\n if int(contest[1]) >= 2400 and int(contest[1]) < int(contest[2]):\r\n output = \"YES\"\r\nprint(output)", "t=int(input())\r\nf=0\r\nfor i in range(t):\r\n s,a,b=input().split()\r\n a,b=int(a),int(b)\r\n if(a>=2400 and b>a):\r\n f=1\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n name,score1,score2 = input() .split()\r\n score1 = int(score1)\r\n score2 = int(score2)\r\n if score1 >= 2400 and (score2 - score1) > 0:\r\n s+=1\r\nif s > 0:\r\n print('YES') \r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\nflag = False\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n before, after = int(before), int(after)\r\n if before >= 2400 and after > before:\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\nl1=[]\nl2=[]\nfor i in range(a):\n\tb,c,d=input().split()\n\tc=int(c)\n\td=int(d)\n\tl1.append(c)\n\tl2.append(d)\nfor i in range(a):\n\tif l1[i]>2399 and l2[i]>l1[i]:\n\t\tprint('YES')\n\t\texit()\nprint('NO')\n", "n=int(input())\r\narr=[]\r\nfor _ in range(n):\r\n name,bef,dop=list(map(str,input().split()))\r\n arr.append([int(bef),int(dop)])\r\nfor x in arr:\r\n if x[1]>x[0]>=2400:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nf=0\r\nfor i in range(n):\r\n\tl = list(input().split())\r\n\tif 2400<=int(l[1]) and int(l[1])<int(l[2]):\r\n\t\tprint(\"YES\")\r\n\t\tf=1\r\n\t\tbreak\r\nif f==0:\r\n\tprint(\"NO\")", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n if(int(b)>=2400 and int(c)>int(b)):\r\n d=d+1\r\nif(d>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nflag=0\r\nfor i in range(n):\r\n a,b,c=[str(i) for i in input().split()]\r\n b=int(b)\r\n c=int(c)\r\n if(b>=2400 and c>b):\r\n flag=1\r\nif(flag==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nresult=[]\r\nfor i in range(n):\r\n l=[]\r\n l.append(input().split())\r\n if (int(l[0][1])<2400 or int(l[0][2])<=2400 or int(l[0][2])<=int(l[0][1])) :\r\n result.append(\"NO\")\r\n else: \r\n result.append(\"YES\")\r\nif \"YES\" in result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ctr=0\r\nfor i in range(int(input())):\r\n cid,bef,aft=map(str,input().split())\r\n bef=int(bef)\r\n aft=int(aft)\r\n if bef>=2400:\r\n if aft-bef>0:\r\n ctr+=1\r\nif ctr>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nb = 0\r\nfor i in range(0, int(n)):\r\n x, y, z = input().split()\r\n if (int(y) >= 2400) and (int(z) > int(y)):\r\n b = 1\r\nif b == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n name,before,after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if before >= 2400 and (after-before) > 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n\r\n", "#n, x = (input().split())\r\n#n , x = int(n), int(x)\r\nn = int(input())\r\n#a = input()\r\n#a = a.split()\r\n#a = [int(x) for x in a]\r\n#n , x = a\r\nk = False\r\nfor i in range(n):\r\n a = input()\r\n a = a.split()\r\n x, y = int(a[1]), int(a[2])\r\n if x >= 2400 and x < y:\r\n k = True\r\n\r\nif k:\r\n print('YES')\r\nelse:\r\n print('NO')", "for _ in range(int(input())):\r\n\tname,b,a = input().split()\r\n\tif int(a) > int(b) > 2399: \r\n\t\tprint(\"YES\") \r\n\t\texit()\r\nprint(\"NO\")\r\n\r\n", "n=int(input())\nfor i in range(n):\n s,x,y = input().split()\n if int(y) > int(x) and int(x) >= 2400:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\n", "n = int(input())\nfor i in range(0, n): \n s = input().split()\n if int(s[1]) < 2400:\n pass\n else:\n if int(s[2]) > int(s[1]):\n print(\"YES\")\n break\n if i == n - 1:\n print(\"NO\")", "n=int(input())\r\nres='NO'\r\nfor x in range(n): \r\n s,b,a=input().split()\r\n if int(b)>=2400 and int(a)>int(b):\r\n res='YES'\r\nprint(res)", "for i in range(int(input())):\r\n _, a, b = input().split()\r\n if int(b)>int(a)>=2400:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "def has_outscored(scores):\r\n for score in scores:\r\n if score[1] >= 2400 and score[2] > score[1]:\r\n return True\r\n return False\r\n \r\nscores = []\r\nfor _ in range(int(input())):\r\n elements = input().split()\r\n scores.append([elements[0], int(elements[1]), int(elements[2])])\r\n \r\nprint(\"YES\" if has_outscored(scores) else \"NO\")", "n= int(input())\r\nFlag = False\r\nfor i in range(0,n):\r\n name , before , after = input().split()\r\n if int(before) >= 2400 and int(after) - int(before) > 0:\r\n Flag = True\r\n\r\nprint(\"YES\" if Flag else \"NO\")\r\n", "flag = 0\r\nfor i in range(int(input())):\r\n name,r1,r2 = input().split()\r\n if int(r1)>=2400 and int(r2)-int(r1)>0:\r\n flag = 1\r\nif flag==0:\r\n print('NO')\r\nelse:\r\n print('YES')", "a = int(input())\r\ny = 0\r\nfor i in range(a):\r\n b = list(map(str,input().split()))\r\n c = int(b[2])\r\n d = int(b[1])\r\n if c>d and d>=2400: \r\n y = 1\r\n break\r\nif y == 1: print('YES')\r\nelse: print('NO')", "'''input\n3\nApplejack 2400 2400\nFluttershy 2390 2431\nPinkie_Pie -2500 -2450\n'''\nfor _ in range(int(input())):\n\tn = input().split()\n\tif int(n[1]) >= 2400 and int(n[2]) > int(n[1]):\n\t\tprint(\"YES\")\n\t\tbreak\nelse:\n\tprint(\"NO\")", "n=int(input())\r\nflag=0\r\nfor i in range(n):\r\n s,pr,af=input().split()\r\n pr=int(pr)\r\n af=int(af)\r\n if(pr>=2400 and af>pr):\r\n flag=1\r\n print('YES')\r\n break\r\n \r\nif(flag==0):\r\n print('NO')", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n\tn,a,b=map(str,input().split())\r\n\tif(int(a)>=2400 and int(b)-int(a)>0):\r\n\t\tans+=1\r\nif(ans==0):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "\r\ndef solve():\r\n n = int(input())\r\n flag = 0\r\n for i in range(n):\r\n x = input().split()\r\n y,z = int(x[1]),int(x[2])\r\n if y>=2400 and z>y:\r\n flag = 1 \r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n = int(input()) # beaten contestants\r\ncontestants = []\r\nfor _ in range(n):\r\n contestants.append([i for i in input().split()])\r\n\r\n\r\ndef check():\r\n for k in contestants:\r\n if int(k[2]) > int(k[1]) >= 2400:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(check())\r\n", "import math\r\nt=int(input())\r\n\r\nr=0\r\nwhile t>0:\r\n a,b,c=map(str,input().split())\r\n b=int(b)\r\n c=int(c)\r\n if b>=2400 and (c-b)>0:\r\n r=1\r\n\r\n t=t-1\r\nif r==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nnum = int(input())\r\nname = []\r\nbefore = []\r\nafter = []\r\n\r\nfor i in range(num):\r\n n, b, a = input().split()\r\n name.append(n)\r\n before.append(int(b))\r\n after.append(int(a))\r\n\r\nresult = list(zip(before, after))\r\nli = [list(element) for element in result]\r\n\r\n# print(li)\r\nflag = False\r\n\r\nfor i in range(num):\r\n if int(li[i][0]) >= 2400 and int(li[i][1]) > int(li[i][0]):\r\n flag = True\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "good = False\r\nfor _ in range(int(input())):\r\n name, before, after = input().split()\r\n if int(before) >= 2400 and int(after) > int(before):\r\n good = True\r\n break\r\nprint(\"YES\" if good else \"NO\")", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n l1=[j for j in input().split()]\r\n a=int(l1[1]) #before\r\n b=int(l1[-1]) #after\r\n if a>=2400:\r\n if b>a:\r\n count+=1\r\nif count>0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "answer = \"NO\"\r\nfor i in range(int(input())):\r\n name,before,after = input().split()\r\n if int(after) > int(before) and int(before) >= 2400:\r\n answer = \"YES\"\r\n \r\nprint(answer) ", "x=int(input())\r\ncount=0\r\nfor j in range(x):\r\n name,i_before,i_after=input().split()\r\n i_before,i_after=int(i_before),int(i_after)\r\n if(i_before >= 2400 and i_after > i_before):\r\n count+=1\r\nif count>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\ngood = 0\r\n\r\nfor i in range(n):\r\n info = input().split()\r\n before = int(info[1])\r\n after = int(info[2])\r\n if before >= 2400 and after > before:\r\n good += 1\r\n\r\nif good > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nactive=False\r\nfor value in range(1,x+1):\r\n x,y,z=input().split()\r\n if int(y)>=2400 and int(z)>int(y):\r\n active=True\r\nif active:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n name, before, after = sys.stdin.readline().split()\r\n before, after = int(before), int(after)\r\n if before < after and before >= 2400:\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")", "x = int(input())\r\np = []\r\nfor i in range(x):\r\n y = [n for n in input().split()]\r\n p.append(y)\r\nflag = 0\r\nfor i in range(x):\r\n before = int(p[i][1])\r\n after = int(p[i][2])\r\n if before >= 2400 and after > before:\r\n flag = 1\r\n print(\"YES\")\r\n break\r\nif flag == 0:\r\n print(\"NO\")", "\ndef main():\n f = \"NO\"\n for _ in range(int(input())):\n name, before, after = input().split()\n before = int(before)\n after = int(after)\n if before >= 2400 and before < after:\n f = \"YES\"\n print(f)\n\n\nmain()\n", "n = int(input())\r\nfor i in range(n):\r\n player = input().split()\r\n if int(player[1]) >= 2400 and (int(player[2]) - int(player[1])) > 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n user = input().split()\r\n if 2400 <= int(user[1]) and int(user[2]) > int(user[1]):\r\n s += 1\r\nprint('YES' if s >= 1 else 'NO')", "n = int(input())\r\nk=0\r\nfor i in range(n):\r\n s = input().split()\r\n if int(s[1])>=2400 and (int(s[1])<int(s[2])):\r\n k=k+1\r\n\r\nif k >= 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "# Wadea #\r\n\r\ns = int(input())\r\nr = 0 \r\nfor j in range(s):\r\n sj = input().split()\r\n a,b,c = sj[0],int(sj[1]),int(sj[-1])\r\n if b >= 2400:\r\n if c > b:\r\n r -= 1\r\n else:\r\n r += 1\r\n else:\r\n r += 1\r\nif r == s:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\nf=0\r\nfor i in range(n):\r\n s, a, b = input().split()\r\n a=int(a)\r\n b=int(b)\r\n if a>=2400 and b>a:\r\n f=1\r\nprint(f*'YES'+(not f)*'NO')", "a = []\nfor i in range(int(input())):\n a.append(list(map(str,input().split())))\nb = \"NO\"\nfor i in range(len(a)):\n if int(a[i][1]) >= 2400 and int(a[i][2]) > int(a[i][1]):\n b = \"YES\"\nprint(b)\n \t\t \t \t\t \t\t \t\t \t \t \t", "n = int(input())\r\nresults = [input().split() for i in range(n)]\r\nfor i in range(n):\r\n if int(results[i][1]) < int(results[i][2]) and int(results[i][1]) > 2399:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "k=int(0)\r\nfor _ in range(int(input())):\r\n a=list(input().split(\" \"))\r\n if int(a[1])>=2400 and int(a[2])>int(a[1]):\r\n k=k+1\r\nif k==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "if __name__ == '__main__':\r\n for _ in range(int(input())):\r\n h,b,a = input().split()\r\n b = int(b)\r\n a = int(a)\r\n if b >= 2400 and a > b:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "c=0\r\nfor u in range(int(input())):\r\n l=list(map(str,input().split()))\r\n x=int(l[1])\r\n y=int(l[2])\r\n if(x>=2400 and y>=2400 and x<y):\r\n c=c+1\r\nif(c==0):\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n", "import math\ndef solve(arr):\n for i in arr:\n if int(i[1]) >= 2400 and int(i[2])>int(i[1]):\n return 'YES'\n return 'NO'\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 i = input().split(' ')\n arr.append(i)\n print(solve(arr))\n\nmain()", "n = int(input())\r\n\r\nans = \"NO\"\r\nfor i in range(n):\r\n s, x, y = (el for el in input().split())\r\n x = int(x)\r\n y = int(y)\r\n if x >= 2400 and y - x > 0:\r\n ans = \"YES\"\r\n \r\nprint(ans)", "n = int(input())\n\nres = False\nfor i in range(n):\n h, s1, s2 = input().split()\n s1, s2 = int(s1), int(s2)\n if s1 >= 2400 and s2 > s1:\n res = True\nprint(\"YES\" if res else \"NO\")", "n = int(input())\r\ni = 1\r\nwhile i <= n:\r\n\ts, x, y = input().split(' ')\r\n\tx = int(x)\r\n\ty = int(y)\r\n\tif (x >= 2400) and (y > x):\r\n\t\tprint('YES')\r\n\t\texit(0)\r\n\ti = i+1\r\nprint('NO')", "for i in range(int(input())):\r\n\tflag=0\r\n\ta,b,c=input().split()\r\n\tif int(b)>=2400 and int(c)>int(b):\r\n\t\tprint(\"YES\")\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n print(\"NO\")", "n=int(input())\r\nf=False\r\nfor i in range(n):\r\n m,b,a=input().split()\r\n if int(a)>int(b) and int(b)>=2400 and f==False:\r\n f=True\r\nif f :print('Yes')\r\nelse:print('NO')", "y=int(input())\r\nb=False\r\nfor i in range(y):\r\n a1=input()\r\n a2=a1.split(' ')\r\n if int(a2[1])>=2400 and int(a2[2])>int(a2[1]):\r\n b=True\r\n break\r\nif b==True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n\r\n", "n=int(input())\r\nf=0\r\nfor i in range (n):\r\n g,before ,after=input().split()\r\n before=int(before)\r\n after=int(after)\r\n if before>=2400 and after> before and f==0:\r\n f+=1\r\nif f>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\r\n n = int(input())\r\n ans = 0\r\n for i in range(n):\r\n x,i,f = input().split(\" \")\r\n if ( int(i) >=2400 and int(f) > int(i)):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n# n,c = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\n# print(solve(n,c,l))\r\nsolve()\r\n\r\n\r\n\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n x=list(input().split())\r\n if(int(x[1])>=2400 and int(x[-1])>int(x[1])):\r\n count=count+1\r\nprint(['NO','YES'][count>0])", "n = int(input())\r\nall =[]\r\nfor i in range(n):\r\n name, bef, aft = input().split()\r\n bef = int(bef)\r\n aft = int(aft)\r\n if bef >= 2400 and aft>bef:\r\n all.append('YES')\r\nif all == []:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\nQ = []\r\nfor i in range(n):\r\n Q.append(input().split())\r\n Q[-1][1] = int(Q[-1][1])\r\n Q[-1][2] = int(Q[-1][2])\r\n#print(Q)\r\nfor i in range(n):\r\n if 2400 <= Q[i][1] and Q[i][1] < Q[i][2]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n ", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n st=[(t) for t in input().split(\" \")]\r\n if int(st[1])>=2400 and int(st[2])>int(st[1]):\r\n k+=1\r\n print(\"YES\")\r\n break\r\nif k==0:\r\n print(\"NO\")", "n = int(input())\r\ncheck = False\r\nfor i in range (0, n):\r\n inputs = input().split()\r\n if int(inputs[1]) >= 2400 and int(inputs[2]) > int(inputs[1]):\r\n check = True\r\n break\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nflag=0\r\nfor i in range(n):\r\n\ts,b,a=input().split()\r\n\tif int(b)>=2400 and int(a)>int(b):\r\n\t\tflag=1\r\n\t\tbreak\r\n\t\r\nif flag==1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n=int(input())\r\ns=0\r\nfor x in range(n):\r\n k,m,l=input().split()\r\n if int(m)>=2400 and int(l)>int(m):\r\n s=1\r\n else:\r\n pass\r\nif s==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input())\r\nfor i in range(a):\r\n n, b, a = input().split()\r\n if int(b) >= 2400:\r\n if int(a) > int(b):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\noutput='NO'\r\nfor i in range(n):\r\n name,b,c= input().split()\r\n if int(c)>int(b)>2399:\r\n output='YES'\r\nprint(output) \r\n ", "n = int(input())\r\nx,y = [], []\r\n\r\nfor i in range(n):\r\n a,b,c = map(str, input().split())\r\n x.append(int(b))\r\n y.append(int(c))\r\n \r\ng = any([True if j > i and i >= 2400 else False for i,j in zip(x,y)])\r\n\r\nprint(\"YES\" if g else \"NO\")", "n=int(input())\r\nf=0\r\nfor i in range(n):\r\n\tp=list(input().split())\r\n\tif int(p[1])>=2400:\r\n\t\tif int(p[2])-int(p[1])>0:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tf=1\r\n\t\t\tbreak\r\nif i==n-1 and f==0:\r\n\tprint(\"NO\")\r\n", "n = int(input())\nfor i in range(n):\n name, before, after = input().split()\n before = int(before)\n after = int(after)\n if before >= 2400 and after > before :\n print('YES')\n exit()\nprint('NO')\n", "n=int(input())\r\nq=0\r\n\r\nfor i in range(n):\r\n a=input()\r\n b=a.split(\" \")\r\n m=int(b[1])\r\n p=int(b[2])\r\n if(m>=2400 and p>m): q=1\r\n\r\nif q: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n=int(input())\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n a,b,c=str(a),int(b),int(c)\r\n if b>2399 and c>b:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n\r\n", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n l=list(map(str,input().split()))\r\n if(int(l[1])>=2400 and int(l[1])<int(l[2])):\r\n c+=1\r\nif(c>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "T=int(input())\r\nsukses=0\r\nfor i in range(T):\r\n nama,before,after=map(str,input().split())\r\n before,after=int(before),int(after)\r\n if before>=2400 and after>before:\r\n sukses+=1\r\nif sukses>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ncontestants = []\r\nfor _ in range(n):\r\n contestants.append([i for i in input().split()])\r\n\r\nfor k in contestants:\r\n if int(k[2]) > int(k[1]) >= 2400:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n a,b,c = input().split(\" \")\r\n if(int(b) >= 2400 and int(c) > int(b)):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n a=list(s.split())\r\n a[1],a[2]=int(a[1]),int(a[2])\r\n if(a[1]>=2400 and a[2]>a[1]):\r\n x=1\r\n break\r\nif(x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n handle, before, after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if after > before and before >= 2400:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n=int(input());pd=0\nfor i in range(0,n):\n s=input().split()\n if int(s[1])>=2400 and int(s[2])>int(s[1]):\n print('YES')\n pd=1\n break\nif pd==0:\n print('NO')", "def main():\r\n c = int(input())\r\n vals = [input().split() for v in range(c)]\r\n res = False\r\n for v in vals:\r\n a,b,c = v\r\n if int(b)>=2400 and int(c)>int(b):\r\n res = True\r\n print(\"YES\" if res else \"NO\")\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl,count=[],0\r\nfor _ in range(n):\r\n l=[ele for ele in input().split()]\r\n if int(l[1])>=2400:\r\n if (int(l[2])-int(l[1]))>0:\r\n count+=1\r\nif count!=0:print('YES')\r\nelse:print(\"NO\")", "n = int(input())\r\nflag = \"NO\"\r\n\r\nfor _ in range(n):\r\n name, before, after = map(str, input().split())\r\n before = int(before)\r\n after = int(after)\r\n\r\n if before >= 2400 and after > before:\r\n flag = \"YES\"\r\n\r\nprint(flag)", "N = int(input())\r\nmensaje = 'NO'\r\nfor i in range (N):\r\n n = input().split()\r\n a = int(n[1])\r\n p = int(n[2])\r\n if(a>= 2400 and p > a):\r\n mensaje = 'YES'\r\nprint (mensaje)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input().split())\r\nf=0\r\nfor i in range(n):\r\n if (int(l[i][1])>=2400 and int(l[i][1])<int(l[i][2])):\r\n print ('YES')\r\n f=1\r\n break\r\nif (f==0):\r\n print ('NO')", "# https://codeforces.com/contest/681/problem/A\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n name, a, b = input().split()\r\n if int(b) > int(a) >= 2400:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x = int(input())\r\nflag = False\r\nfor i in range (x) :\r\n q = input().split()\r\n q[1] = int(q[1])\r\n q[2] = int(q[2])\r\n if(q[1]>= 2400 and q[2]-q[1]>0):\r\n flag = True\r\n\r\nif(flag) :\r\n print (\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "n = int(input())\r\nfound = False\r\nfor _ in range(n):\r\n before, after = map(int, input().split()[1:])\r\n if before >= 2400 and after > before:\r\n found = True\r\nprint(('NO', 'YES')[found])\r\n", "from math import inf\nfrom collections import *\nimport math, os, sys, heapq, bisect, random, threading\nfrom functools import lru_cache, reduce\nfrom itertools import *\nimport sys\n\n\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef out(var): sys.stdout.write(str(var) + \"\\n\") # for fast output, always take string\n\n\ndef inpu(): return int(inp())\n\n\ndef lis(): return list(map(int, inp().split()))\n\n\ndef stringlis(): return list(map(str, inp().split()))\n\n\ndef sep(): return map(int, inp().split())\n\n\ndef strsep(): return map(str, inp().split())\n\n\ndef fsep(): return map(float, inp().split())\n\n\nM, M1 = 1000000007, 998244353\n\n\ndef get_divisors(n):\n a = 0\n for i in range(1, int(n / 2) + 1):\n if n % i == 0:\n a += i\n return a\n\n\ndef main():\n #sys.stdin = open(\"test2\", 'r')\n res = False\n for _ in range(inpu()):\n s, b, a = strsep()\n b = int(b)\n a = int(a)\n if b >= 2400:\n if (a - b) > 0:\n res = True\n print(\"YES\" if res else \"NO\")\n\nif __name__ == '__main__':\n # sys.setrecursionlimit(1000000)\n # threading.stack_size(1024000)\n # threading.Thread(target=main).start()\n main()\n\n\t\t \t \t \t \t \t\t\t\t\t \t \t \t", "n = int(input())\r\nlst = []\r\ncount = 0\r\nfor i in range(n):\r\n lst2 = list(map(str,input().split()))\r\n lst.append(lst2)\r\nfor i in range(len(lst)):\r\n if int(lst[i][1])>=2400 and int(lst[i][2])>int(lst[i][1]):\r\n count += 1\r\n break\r\nprint(\"YES\" if count==1 else \"NO\")\r\n", "n = int(input())\r\nq = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n if int(b) >= 2400 and int(b) < int(c):\r\n q += 1\r\nif q > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n a,b,c = input().split(\" \")\r\n if(int(b) >= 2400):\r\n if(int(c) > int(b)):\r\n counter+=1\r\nif(counter > 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nstatus=False\r\nfor i in range(n):\r\n x=input().split()\r\n if int(x[1])>=2400 and int(x[2])>int(x[1]):\r\n status=True\r\nif status:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n name,before,after = input().split()\r\n if int(before)<int(after) and int(before)>=2400:\r\n a = 1\r\nif a == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "j=0\r\nfor i in range(int(input())):\r\n\r\n a = input().split()\r\n\r\n b= int(a[1])\r\n c= int(a[2])\r\n if b>=2400 and c>b:\r\n j=1\r\n break\r\nif j==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nresult = False\nfor _ in range(n):\n name, score1, score2 = input().split()\n score1, score2 = int(score1), int(score2)\n if score1 >= 2400 and score2 > score1:\n result = True\nif result:\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", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nc=0\r\nwhile n:\r\n s,*l=input().split()\r\n if int(l[0])>=2400 and int(l[1])>int(l[0]):\r\n c+=1\r\n n-=1\r\nprint('YNEOS'[c==0::2])", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n x,y,z=map(str,input().split())\r\n if int(y)>=2400 and int(z)-int(y)>0:\r\n c+=1 \r\nif c>=1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nfor i in range(n):\r\n name,before,after=input().split()\r\n if int(before)>=2400 and int(before)<int(after):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n s,a1,a2=list(map(str,input().split()))\r\n if(int(a1)>=2400 and int(a2)>int(a1)):\r\n c+=1\r\nif(c>=1):\r\n print('YES')\r\nelse:\r\n print('NO')", "c = 0\r\nfor i in range(int(input())):\r\n s,r1,r2 = input().split()\r\n r1 = int(r1)\r\n r2 = int(r2)\r\n if(r1>=2400 and r2>r1):\r\n c+=1\r\n\r\nif(c!=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n=int(input())\nans='NO'\nfor i in range(n):\n s,a,b=input().split()\n a=int(a)\n b=int(b)\n if 2400<=a<b:\n ans='YES'\nprint(ans)\n\n\t\t\t \t\t \t \t\t\t \t\t\t\t \t\t \t", "n = int(input())\r\n\r\nans = False\r\n\r\nfor i in range(n) :\r\n a, b, c = map(str, input().split())\r\n bb = int(b)\r\n cc = int(c)\r\n if ((bb >= 2400) and (cc > bb)) :\r\n ans = True\r\n\r\nif (ans) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "def p1():\r\n\tn = int(input())\r\n\tans = 'NO'\r\n\tfor i in range(n):\r\n\t\ts = input().split()\r\n\t\ta = int(s[1])\r\n\t\tb = int(s[2])\r\n\t\ts = s[0]\r\n\t\tif a >= 2400 and a < b:\r\n\t\t\tans = 'YES'\r\n\tprint(ans)\r\np1()\r\n", "n=int(input())\r\nf = False\r\nfor i in range(n):\r\n a = list(input().split())\r\n if int(a[1]) >= 2400 and int(a[1])<int(a[2]):\r\n f = True\r\nprint('YES' if f else 'NO')", "n = int(input())\r\nans = 'NO'\r\nfor i in range(n):\r\n s = input()\r\n i = 0\r\n while s[i] != ' ':\r\n i += 1\r\n j = i+1\r\n while s[j] != ' ':\r\n j += 1\r\n before = int(s[i+1:j])\r\n after = int(s[j+1:])\r\n if after - before > 0 and before >= 2400:\r\n ans = 'YES'\r\nprint(ans)", "try:\r\n n=int(input())\r\n c=0\r\n for i in range(0,n):\r\n s=input()\r\n s=list(s)\r\n for i in range(0,len(s)):\r\n if s[i].isspace():\r\n p=i\r\n break\r\n for i in range(p+1,len(s)):\r\n if s[i].isspace():\r\n q=i\r\n break\r\n s=\"\".join(s)\r\n b=int(s[p:q])\r\n a=int(s[(q+1):len(s)])\r\n if b>=2400 and a>b:\r\n c+=1\r\n if c==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\nexcept:\r\n pass\r\n", "t = int(input())\r\nans = 'NO'\r\nwhile t:\r\n s = list(map(str, input(). split()))\r\n if int(s[1]) >= 2400 and int(s[1]) < int(s[2]):\r\n ans = 'YES'\r\n break\r\n t -= 1\r\nprint(ans)\r\n", "n = int(input())\r\ncontest = []\r\nfor i in range(n):\r\n a = list(map(str,input().split()))\r\n contest.append(a)\r\nfor i in range(n):\r\n if(int(contest[i][1]) >= 2400 and int(contest[i][2])>int(contest[i][1])):\r\n print(\"YES\")\r\n break\r\n else:\r\n if(i == n-1):\r\n print(\"NO\")\r\n else:\r\n continue", "for i in range(int(input())):\r\n l = list(map(str, input().split()))\r\n if int(l[2])>int(l[1])>2399:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "for i in range(int(input())):\r\n n,b,a = input().split()\r\n if int(b) >= 2400 and int(a)>int(b):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n name, before, after = (s[0], int(s[1]), int(s[2]))\r\n if before >= 2400 and after - before > 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n = int(input())\n\narr = []\n\nfor i in range(n):\n a = input().split()\n arr.append([a[0], int(a[1]), int(a[2])])\nfound = True\nfor i in arr:\n if i[1] >= 2400 and i[2] > i[1]:\n found = False\n break\n\nif found:\n print('NO')\nelse:\n print('Yes')\n", "yes = 0\r\nfor _ in range(int(input())):\r\n something = input().split()\r\n temp = int(something[1])\r\n temp2 = int(something[2])\r\n if temp >= 2400 and temp2 - temp > 0:\r\n yes = 1\r\n break\r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a, b, c = [(i) for i in input().split()]\r\n if int(b) >= 2400:\r\n if int(b) < int(c):\r\n count += 1\r\n\r\nif count >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\nwins = 0\n\nfor i in range(n):\n participant = input().split(' ')\n participant_rating_before_contest = int(participant[1])\n participant_rating_after_contest = int(participant[2])\n\n if participant_rating_before_contest >= 2400 and participant_rating_after_contest > participant_rating_before_contest:\n wins += 1\n\nif wins == 0:\n print('NO')\nelse:\n print('YES')", "def ans(b,c):\r\n x=int(b)\r\n y=int(c)\r\n if((x>=2400 and y>x)):\r\n return True\r\n return False\r\nt=int(input())\r\nf=0\r\nwhile(t>0):\r\n a,b,c=map(str,input().split())\r\n if(ans(b,c)==True):\r\n f=1\r\n break\r\n t-=1\r\nif(f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import math\r\nfrom operator import itemgetter\r\n\r\n\r\ndef get_primes(prime_supr):\r\n\r\n is_prime = [0]*2 + [1]*prime_supr\r\n\r\n for i in range(2,int(math.sqrt(prime_supr)) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, prime_supr + 1, i):\r\n is_prime[j] = 0\r\n\r\n return is_prime\r\n\r\nget_int = lambda: map(int, input().split())\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n if int(b) >= 2400 and int(c) - int(b) > 0:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "count=0\r\nfor _ in range(int(input())):\r\n a,b,c=map(str,input().split())\r\n if count==0:\r\n if int(b)>=2400 and int(c)-int(b)>0:\r\n count=1\r\nif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nflag = 0\r\nfor i in range(t):\r\n n, b, a = map(str, input().split())\r\n if int(b) >= 2400 and (int(a) > int(b)):\r\n flag += 1\r\n else:\r\n continue\r\nif flag > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = False\nfor _ in range(0, int(input())):\n n, *v = input().split()\n a, b = map(int, v)\n if (b > a and a >= 2400):\n f = True\nif(f):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "bl='NO'\r\nfor _ in range(int(input())):\r\n _,x,y=input().split()\r\n if int(y)>int(x)>=2400: bl='YES'\r\nprint(bl) \r\n", "n = int(input())\r\nl = 0\r\nfor i in range(n):\r\n st = input().split()\r\n name, before, after = st[0], int(st[1]), int(st[2])\r\n if 2400 <= before < after: print('YES');l=1;break\r\nif l == 0:print('NO')", "from sys import exit\r\nt=int(input())\r\nz=[]\r\nfor i in range(t):\r\n line=input().split()\r\n number=[line[1],line[2]]\r\n z.append(number)\r\nfor i in z:\r\n if int(i[0])>=2400:\r\n if int(i[1])>int(i[0]):\r\n print('YES')\r\n exit()\r\nprint(\"NO\") ", "'''\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'''\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\n \r\nelse:\r\n print('NO')\r\n \r\n", "participants = int(input())\r\nok = False\r\nfor i in range(participants):\r\n s = input().split()\r\n red = False\r\n increased = False\r\n namn = s[0]\r\n before = int(s[1])\r\n after = int(s[2])\r\n if(before >= 2400):\r\n red = True\r\n if(after > before):\r\n increased = True\r\n if(red and increased):\r\n ok = True\r\nprint(\"YES\" if ok else \"NO\")\r\n ", "#!/usr/bin/env python\n\nimport math\nimport sys\nimport itertools\nimport fractions\n\nif __name__ == '__main__':\n wtf = sys.stdin.read()\n wtf = wtf.strip().split('\\n')\n for t in wtf[1:]:\n A = t.split()\n h = A[0]\n b = int(A[1])\n a = int(A[2])\n if b >= 2400 and a > b:\n print('YES')\n sys.exit(0)\n print('NO')\n", "n = int(input())\r\nflag = False\r\nfor i in range(n):\r\n name, bef, aft = input().split()\r\n bef = int (bef)\r\n aft = int (aft)\r\n if bef >= 2400 and aft-bef>0:\r\n flag = True\r\n break\r\nif flag:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "n = int(input())\r\nfor _ in range(n):\r\n n,rb,ra = input().split()\r\n if int(rb) >= 2400 and int(ra) > int(rb):\r\n print(\"YES\")\r\n exit()\r\nprint('NO')\r\n\r\n", "n = int(input())\nans = \"NO\"\n\nfor i in range(n):\n a, b, c = input().split()\n b = int(b)\n c = int(c)\n\n if b >= 2400 and c > b:\n ans = \"YES\"\n\nprint(ans)\n", "n=int(input())\r\ntemp=[]\r\n\r\nfor i in range(n):\r\n t=input().split()\r\n t.pop(0)\r\n t[0]=int(t[0])\r\n t[1]=int(t[1])\r\n temp.append(t)\r\n\r\nfor i in temp:\r\n if i[0]>=2400 and (i[1]-i[0])>0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "ans = False\r\nfor _ in range(int(input())):\r\n alpha = input().split()\r\n alpha[1] = int(alpha[1])\r\n alpha[2] = int(alpha[2])\r\n if 2400 <= alpha[1] < alpha[2]:\r\n ans = True\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n if int(b) >= 2400 and r == 0:\r\n if int(c) > int(b):\r\n print(\"YES\")\r\n r = 1\r\nif r == 0:\r\n print(\"NO\")\r\n", "t = int(input())\nfor i in range(t):\n n, b, a = [x for x in input().split(' ')]\n a, b = int(a), int(b)\n if b >= 2400 and a > b:\n print('YES')\n break\nelse:\n print('NO')\n", "n=int(input())\r\nfor i in range(n):\r\n h,b,a=map(str,input().split())\r\n if int(b)>=2400 and int(a)>int(b):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "T = int(input())\nflag = False\nfor i in range(T):\n stu = input().split()\n if int(stu[1]) >= 2400 and int(stu[2]) > int(stu[1]):\n flag = True\nif flag:\n print(\"YES\\n\")\nelse:\n print(\"NO\\n\")\n", "n = int(input())\r\ngood = False\r\n\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n if int(after) > int(before) and int(before) >= 2400:\r\n good = True\r\n\r\nif good == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n =int(input())\r\nanswer = 'NO'\r\nfor i in range(n):\r\n user = input().split()\r\n before = int(user[1])\r\n after = int(user[2])\r\n if after > before >= 2400:\r\n answer = 'YES'\r\n break\r\nprint(answer)", "n=int(input())\r\na=[];c=0\r\nfor i in range(n) :\r\n b=list(input().split())\r\n a.append(b)\r\nfor i in range(len(a)) :\r\n if (int(a[i][1])>=2400) and (int(a[i][1])<int(a[i][2])) :\r\n c+=1\r\nif c!=0 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = str(input())\r\n arr.append(s)\r\n\r\nboolean = False\r\nfor line in arr:\r\n spl = line.split(' ')\r\n if int(spl[1]) >= 2400 and int(spl[2]) > int(spl[1]):\r\n boolean = True\r\n\r\nif boolean == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nanswer = \"NO\"\r\nfor i in range(n):\r\n a = input().split(\" \")\r\n if int(a[2]) - int(a[1]) > 0 and int(a[1]) >= 2400:\r\n answer = \"YES\"\r\n break\r\nprint(answer)", "n = int(input())\n\nresults = []\nfor i in range(n):\n args = input().split(' ')\n before = int(args[1])\n after = int(args[2])\n\n if before >= 2400 and after > before:\n results.append(True)\n else:\n results.append(False)\n\nif True in results:\n print('YES')\nelse:\n print('NO')\n", "l = 0\r\nfor i in range(int(input())):\r\n name, before, after = input().split()\r\n if 2400 <= int(before) < int(after): print('YES');l = 1;break\r\nif l == 0: print('NO')\r\n", "n = int(input())\ndata_name = []\ndata_bf = []\ndata_af = []\nis_good = False\nfor i in range(n):\n [name, point_bf, point_af] = input().split(\" \")\n point_af = int(point_af)\n point_bf = int(point_bf)\n if point_bf >= 2400 and point_af > point_bf:\n is_good = True\n break\n\nif is_good:\n print('YES')\nelse:\n print('NO')\n", "x=int(input())\r\nf=0\r\nfor i in range(x):\r\n s,n,m=input().split()\r\n n=int(n)\r\n m=int(m)\r\n if( m>n and m>=2400 and n>=2400):\r\n f=1\r\nif f==1:print('YES')\r\nelse:print('NO')\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\nfor i in range(n):\r\n a,b,c=input().split()\r\n if int(b)>=2400 and int(c)>int(b):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "k = 0\r\nx = int(input())\r\nfor i in range(x):\r\n\ta = input().split()\r\n\ta[1] = int(a[1])\r\n\ta[2] = int(a[2])\r\n\tif a[1]>=2400 and a[2]>a[1]:\r\n\t\tprint(\"YES\")\r\n\t\tk = 1\r\n\t\tbreak\r\n\telse:\r\n\t\tcontinue\r\nif i == x - 1 and k == 0:\r\n\tprint(\"NO\")", "n = int(input())\r\nyes = False\r\n\r\nfor _ in range(n):\r\n handle, before, after = input().split()\r\n before, after = int(before), int(after)\r\n\r\n if before >= 2400 and after > before:\r\n yes = True\r\n break\r\n \r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n name,x,y=input().split()\r\n x,y=int(x),int(y)\r\n l.extend([x,y])\r\n\r\nfor i in range(0,n*2,2):\r\n if l[i]>=2400 and l[i+1]>l[i]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "a = int(input())\r\nfor i in range(a):\r\n l,k,j = map(str,input().split())\r\n k,j = int(k),int(j)\r\n if k >= 2400 and j > k:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "\r\nimport sys\r\ndef get_single_int ():\r\n return int (sys.stdin.readline ().strip ())\r\ndef get_string ():\r\n return sys.stdin.readline ().strip ()\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\n\r\n#code starts here\r\nfor i in range (get_single_int ()): \r\n ar = sys.stdin.readline ().strip ().split (' ')\r\n bef = int (ar [1])\r\n aft = int (ar [2])\r\n ans = \"NO\"\r\n if bef > 2399 and aft > bef:\r\n ans = \"YES\"\r\n break\r\n else:\r\n continue \r\nprint (ans)\r\n", "n = int(input())\r\nfor i in range(n):\r\n name, a, b = input().split()\r\n \r\n if int(b) > int(a) > 2399:\r\n print('YES')\r\n exit()\r\n \r\nprint('NO')", "n = int (input ())\r\ncounter = 0\r\nfor i in range (n):\r\n name,before,after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if before >= 2400 and (after - before) > 0:\r\n counter = 1\r\nif counter == 1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "n = int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b,c = map(str, input().split())\r\n if int(b) >= 2400 and (int(c) >= 2400 and c >b):\r\n cnt+=1\r\n\r\n\r\nif cnt>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nans = False\r\nfor i in range(a):\r\n b, c, d = map(str, input().split())\r\n if int(c) >= 2400 and int(c) < int(d):\r\n ans = True\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nb=False\r\nl=[]\r\nfor i in range(0,n):\r\n k=list(input().split())\r\n if int(k[1])>=2400 and int(k[2])>int(k[1]):\r\n b=True\r\nif b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nn = int(input())\r\nfor i in range(n): \r\n [name, a, b] = list(map(str, input().split()))\r\n a = int(a)\r\n b = int(b) \r\n if a >= 2400 and b > a:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n\r\n", "flag=False\r\nfor i in range(int(input())):\r\n score=input().split()\r\n if int(score[2])>int(score[1]) and int(score[1])>=2400:\r\n flag=True\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = 'NO'\r\nfor _ in range(int(input())):\r\n t = input().split(' ')\r\n if 2400 <= int(t[1]) < int(t[2]):\r\n s = 'YES'\r\nprint(s)", "\r\nimport 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\nfrom queue import Queue,PriorityQueue\r\n\r\nfrom string import ascii_lowercase\r\n\r\nfrom heapq import *\r\n\r\nfrom itertools import islice\r\n\r\n\r\nsys.setrecursionlimit(10**6)\r\nINF = float('inf')\r\nMOD = 998244353\r\nmod = 10**9+7\r\n\r\ndef isPrime(n):\r\n if (n <= 1) :return False\r\n if (n <= 3) :return True\r\n if (n%2 == 0 or n%3 == 0):return False\r\n for i in range(5,ceil(sqrt(n))+1,6):\r\n if (n%i==0 or n%(i+2)==0):\r\n return False\r\n return True\r\n\r\ndef 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 DFS(dictionary,vertex,visited):\r\n visited[vertex]=True\r\n stack=[vertex]\r\n print(vertex)\r\n while stack:\r\n a=stack.pop()\r\n for i in dictionary[a]:\r\n if not visited[i]:\r\n print(i)\r\n visited[i]=True\r\n stack.append(i)\r\n\r\n\r\ndef BFS(dictionary, vertex,visited):\r\n visited[vertex]=True\r\n q=deque()\r\n q.append(vertex)\r\n while q:\r\n a=q.popleft()\r\n for i in dictionary[a]:\r\n if not visited[i]:\r\n visited[i]=True\r\n q.append(i)\r\n print(i)\r\n\r\n \r\n\r\n\r\ndef soe(limit):\r\n l=[1]*(limit+1)\r\n l[0]=0\r\n l[1]=0\r\n prime=[]\r\n for i in range(2,limit+1):\r\n if l[i]:\r\n for j in range(i*i,limit+1,i):\r\n l[j]=0\r\n \r\n for i in range(2,limit+1):\r\n if l[i]:\r\n prime.append(i)\r\n return prime\r\n\r\ndef segsoe(low,high):\r\n limit=int(high**0.5)+1\r\n prime=soe(limit)\r\n n=high-low+1\r\n l=[0]*(n+1)\r\n for i in range(len(prime)):\r\n lowlimit=(low//prime[i])*prime[i]\r\n if lowlimit<low:\r\n lowlimit+=prime[i]\r\n if lowlimit==prime[i]:\r\n lowlimit+=prime[i]\r\n for j in range(lowlimit,high+1,prime[i]):\r\n l[j-low]=1\r\n for i in range(low,high+1):\r\n if not l[i-low]:\r\n if i!=1:\r\n print(i)\r\n \r\ndef gcd(a,b):\r\n while b:\r\n a=a%b\r\n b,a=a,b\r\n return a\r\n\r\ndef power(a,n):\r\n r=1\r\n while n:\r\n if n&1:\r\n r=(r*a)\r\n a*=a\r\n n=n>>1\r\n return r\r\n\r\ndef don(d,ans,vi,i):\r\n vi[i]=True\r\n stack=[i]\r\n while stack:\r\n a=stack.pop()\r\n for x in d[a]:\r\n if not vi[x]:\r\n ans[i]+=1\r\n vi[x]=True\r\n stack.append(x)\r\n \r\n\r\ndef solve():\r\n n=inp()\r\n c=0\r\n for i in range(n):\r\n s=input().split()\r\n a,b=int(s[1]),int(s[2])\r\n if a>=2400 and b>a:\r\n c=1\r\n if c:\r\n pr('YES')\r\n else:\r\n pr('NO')\r\n\r\nfor _ in range(1):\r\n solve()\r\n## print(\"Case #{}:\".format(_+1),c)\r\n## \r\n", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n s = input().split(' ')\r\n s[1] = int(s[1])\r\n s[2] = int(s[2])\r\n if (s[1]) >=2400 and (s[2])>s[1]:\r\n c=1\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n n = int(input())\n\n for _ in range(n):\n handle, prev, curr = input().split()\n prev = int(prev)\n curr = int(curr)\n\n if prev < 2400:\n continue\n if curr > prev:\n print('YES')\n break\n else: # for ... else\n print('NO')\n", "# Not Completed\n\nn = int(input())\n\npassed = False\n\nfor i in range(n):\n participant = list(input().split())\n if int(participant[1]) >= 2400 and int(participant[2]) > int(participant[1]):\n passed = True\n break\n\nif passed:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=int(input())\r\nl=0\r\nfor _ in range(n):\r\n q,x,z=map(str,input().split())\r\n if int(x)>=2400:\r\n if int(z)>int(x):\r\n l=1\r\n\r\nif l==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nname=[]\r\nbefore=[]\r\nafter=[]\r\n\r\nfor i in range(n):\r\n x,y,z = [int(x) if x.isdigit() else x for x in input().split()]\r\n name.append(x)\r\n before.append(y)\r\n after.append(z)\r\n a=n\r\nfor j in range(n):\r\n if int(before[j])>=2400:\r\n if int(after[j])>int(before[j]):\r\n print(\"YES\")\r\n break\r\n else:\r\n a=a-1\r\n else:a=a-1\r\nif a==0:\r\n print(\"NO\")", "# A. A Good Contest\n\nn = int(input())\nans = False\nfor _ in range(n):\n a, b, c = input().split()\n b = int(b)\n c = int(c)\n if 2400 <= b < c:\n ans = True\n break\nprint(\"YES\") if ans else print(\"NO\")\n", "n=int(input())\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n if int(b)>2399 and int(c)>int(b): print(\"YES\"); break\r\nelse: print(\"NO\")", "total_participants = int(input())\r\n\r\nperformed_good = False\r\n \r\nfor _ in range(total_participants):\r\n _, rating_before, rating_after = input().split() \r\n \r\n rating_before = int(rating_before)\r\n rating_after = int(rating_after)\r\n\r\n if rating_before >= 2400 and ((rating_after - rating_before) > 0):\r\n performed_good = True\r\n\r\nif performed_good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nfor i in range(n):\r\n s,a,b = list(input().split(' '))\r\n a,b = int(a),int(b)\r\n if(a >= 2400 and b > a):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "t = int(input())\r\ncount = 0\r\nl = []\r\nwhile(t):\r\n\ta,b,c = map(str,input().split())\r\n\tl.append([a,b,c])\r\n\tb = int(b)\r\n\tc = int(c)\r\n\tif(b>=2400 and c>b):\r\n\t\tcount+=1\r\n\tt-=1\r\nif(count==0):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "tst = int(input())\r\n\r\nvals = []\r\ngood = False\r\n\r\nfor i in range(0,tst):\r\n arr = a,b,c = [x for x in input().split()]\r\n vals.append(arr)\r\n\r\nfor lst in vals:\r\n a = lst[2]\r\n b = lst[1]\r\n a = int(a)\r\n b = int(b)\r\n if a > b and b >= 2400:\r\n good = True\r\n\r\nif good == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nflag = 0\r\nfor _ in range(int(input())):\r\n\tq, a, b = [str(x) for x in input().split()]\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tif a >= 2400 and b-a > 0:\r\n\t\tflag = 1\r\n\t\t\r\nprint(\"YES\" if flag else \"NO\")\r\n", "n=int(input())\r\n\r\nfor player in range(n):\r\n l=list(map(str,input().split()))\r\n before=int(l[1])\r\n after=int(l[2])\r\n flag=0\r\n if before>=2400 and after>before:\r\n flag=1\r\n print(\"YES\")\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\n ", "test=int(input())\r\nlist1=[]\r\nfor i in range(test):\r\n name,before,after=map(str,input().split())\r\n if int(before)>=2400 and (int(after)-int(before))>0:\r\n list1.append(\"YES\")\r\n else:\r\n continue\r\nif \"YES\" in list1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n\ts,sc1,sc2=input().split()\r\n\tsc1,sc2=int(sc1),int(sc2)\r\n\tif sc1>=2400 and sc2>sc1:\r\n\t\tc=1\r\nif c==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nanswer = 'NO'\r\nfor i in range(n):\r\n x = input().split(' ')\r\n name = x[0]\r\n b = int(x[1])\r\n a = int(x[2])\r\n if b >= 2400 and a > b:\r\n answer = 'YES'\r\n break\r\nprint(answer)\r\n", "n = int(input())\r\n\r\nfor __ in range(n):\r\n name , bef ,aft = map(str,input().split())\r\n flag = False\r\n if (int(bef)>=2400) and (int(aft) > int(bef)):\r\n print(\"YES\")\r\n break\r\n else:\r\n flag = True\r\nif (flag):\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\ndone = False\r\nfor i in range(n):\r\n a = input().split()\r\n if int(a[1]) >= 2400 and int(a[2]) > int(a[1]):\r\n done = True\r\nif done:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nfor i in range(n):\r\n name, b_score, a_score = input().split()\r\n if int(b_score) >= 2400 and int(a_score) > int(b_score):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "def concurso(cases):\r\n data=[]\r\n for n in range(cases):\r\n data.append([x for x in input().split()])\r\n for n in data:\r\n if int(n[1])>=2400 and int(n[2])>int(n[1]):\r\n return \"YES\"\r\n return \"NO\"\r\ndef main():\r\n cases=int(input())\r\n print(concurso(cases))\r\nmain()", "n=int(input())\r\nans=\"NO\"\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n if int(b)>=2400 and int(c)>int(b):\r\n ans=\"YES\"\r\nprint(ans)", "n = int(input())\r\ntr = False\r\nfor _ in range(n):\r\n name, before, after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n if before > 2399 and after > before:\r\n tr = True\r\nif tr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl1 = list(input().split())\r\n\tl.append(l1)\r\nfor i in l:\r\n\tif int(i[1]) >= 2400 and int(i[2]) - int(i[1]) > 0:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\r\nprint('NO')", "n = int(input())\r\nflag = False\r\nfor _ in range(n):\r\n name, a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if a >= 2400 and b > a:\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input(''))\r\nfor i in range(n):\r\n name,be,af=input().split()\r\n if int(be)>=2400 and int(af)>int(be):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n if int(c) > int(b) >= 2400:\r\n result = 1\r\n\r\nprint(\"YES\" if result == 1 else \"NO\")\r\n", "\n\n\n\nn = int(input())\n\n\n\ngood = False\nfor i in range(n) :\n name, b, a = input().split()\n a = int(a)\n b = int(b)\n if b >= 2400 and a > b :\n good = True\n\n\n\nprint(\"YES\" if good else \"NO\")\n\n\n\n \t \t \t \t\t\t\t \t \t \t \t \t", "n = int(input())\r\n\r\nfor i in range(n):\r\n _, l, h = input().split()\r\n l, h = int(l), int(h)\r\n if l < 2400: continue\r\n if h <= l: continue\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "# https://codeforces.com/problemset/problem/681/A\r\n\r\nnums = int(input())\r\ntr = False\r\nfor i in range(nums):\r\n a = input().split()\r\n if int(a[1])>= 2400 and int(a[2]) > int(a[1]):\r\n tr = True\r\n break\r\n\r\nif tr:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\nresult = False\nfor i in range(n):\n a, b, c = [i for i in input().split()]\n if int(b) >= 2400 and int(c) > int(b):\n result = True\nif result == True:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\ngood = False\r\nfor _ in range(n):\r\n name, before, after = input().split()\r\n before = int(before)\r\n after = int(after)\r\n\r\n if 2400 <= before < after:\r\n good = True\r\n\r\nprint('YES' if good else 'NO')\r\n", "##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\ncontestants = int(input())\nverdict = 'NO'\nfor i in range(contestants):\n user, before, after = input().split()\n if int(before) >= 2400:\n if int(before) < int(after):\n verdict = \"YES\"\nprint(verdict)\n", "n=int(input())\r\n\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n\r\n if int(before)>=2400 and int(after)>int(before):\r\n print(\"YES\")\r\n exit() \r\n\r\nprint(\"NO\")", "n = int(input())\r\nred = False\r\n\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n before, after = int(before), int(after)\r\n if before >= 2400 and after > before:\r\n red = True\r\n\r\nif red:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\n\r\n\r\nthe_useful_list = []\r\n\r\nnb_users = input()\r\nnb_users = int(nb_users)\r\n\r\n\r\n\r\nfor i in range(nb_users):\r\n x = input().split()\r\n test = list(x)\r\n if int(test[1]) < int(test[2]) and int(test[1]) >= 2400:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n\r\n\r\n\r\n \r\n\r\n", "n = int(input())\nA = []\ncount = 0\nfor i in range(0,n):\n a,b,c = input().split()\n b,c = int(b),int(c)\n if c >b and c>2400 and b>=2400:\n count = 1\n break\nif count == 1:\n print('Yes')\nelse:\n print('NO')\n \n", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if b>=2400 and c>b:\r\n cnt+=1\r\nif cnt>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndef f(n):\r\n for _ in range(n):\r\n name, before, after = input().split()\r\n if int(before) >= 2400:\r\n if int(after) - int(before) > 0:\r\n print('YES')\r\n return\r\n print('No')\r\nf(n)\r\n", "def f():\r\n x = int(input()); success = False\r\n for _ in range(x):\r\n li = list(map(str,input().split())); li[1] = int(li[1]); li[2] = int(li[2])\r\n if int(li[1]) >= 2400 and int(li[2]) > li[1]:\r\n success = True\r\n print(\"YES\" if success == True else \"NO\")\r\nf()", "n = int(input())\ncheck = False\nfor _ in range(n):\n lst = [x for x in input().split()]\n if int(lst[1]) >= 2400 and int(lst[2]) > int(lst[1]):\n check = True\nif check: print('YES')\nelse: print('NO')\n \t\t\t\t \t \t\t \t \t \t\t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nAB\r\nAABB\r\nABAB\r\n\r\nBBAA X\r\nAABBA\r\n\r\n010101\r\n\r\nx+y = n\r\nx = n - y\r\nx*y vs (n-y)^2\r\n\r\n0 = 1\r\n1 = 1\r\n01 = max(1*1) = 1\r\n10 = 1\r\n00 = 4\r\n11 = 4\r\n11110 = 16\r\n\r\ncompare biggest group of 1's 0's and num1's * num0's\r\n\r\n5 -1 -2\r\n\r\na b c -> max(d-(b-a), d-(b-c))\r\na c b -> same thing\r\nb c a -> same thing\r\nc b a -> same thing\r\n\r\nb a c cannot move at same time\r\nc a b same\r\n\r\nif (b < a and a < c) or (c < a and a < b):\r\n ans = 0\r\n if abs(a-c) < d: ans += d-abs(c-a)\r\n if abs(a-b) < d: ans += d-abs(b-a)\r\n print(ans)\r\n\r\nelse:\r\n if (a < b and b < c) or (c < b and b < a):\r\n ans = 0\r\n if abs(b-a) < d: ans += d-abs(b-a)\r\n if abs(b-c) < d: ans += d-abs(b-c)\r\n print(ans)\r\n else:\r\n ans = 0\r\n if abs(c-b) < d: ans += d-abs(c-b)\r\n if abs(c-a) < d: ans += d-abs(c-a)\r\n print(ans)\r\n\r\nabc\r\nacb\r\n\r\nbac\r\nbca\r\n\r\ncab\r\ncba\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef dist(c1, c2):\r\n return abs(c1[0] - c2[0]) + abs(c1[1] - c2[1])\r\n\r\ndef solve():\r\n n = II()\r\n found = False\r\n for _ in range(n):\r\n _, b, a = I().split()\r\n if int(b) >= 2400 and int(b) < int(a):\r\n found = True\r\n break\r\n print(\"YES\" if found else \"NO\")\r\n\r\nsolve()", "def ii():\r\n return int(input())\r\ndef ss():\r\n return [x for x in input()]\r\ndef si():\r\n return [int(x) for x in input().split()]\r\ndef mi():\r\n return map(int, input().split())\r\n\r\nkey = True\r\nfor _ in range(ii()):\r\n s = input().split()\r\n if key and int(s[1]) > 2399 and int(s[2]) - int(s[1]) > 0:\r\n key = False\r\nif key:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\nsb = []\nsa = []\nfor i in range(n):\n n, s1, s2 = list(input().split())\n if(int(s1) >= 2400) : \n sb.append(int(s1))\n sa.append(int(s2))\nc = 0 \nfor i in range(len(sb)) :\n if(sb[i] < sa[i]) : c += 1\nif(c >= 1) : print(\"YES\")\nelse : print(\"NO\")\n\n", "n = int(input())\r\nf = False\r\nfor _ in range(n):\r\n\t_, b, a = input().split()\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tif b >= 2400 and a > b:\r\n\t\tf = True\r\nprint('YES' if f else 'NO')", "n = int(input())\r\nmax_rating = -1\r\nmax_rating_before = -1\r\nfor i in range(n):\r\n name, before, after = input().split()\r\n before, after = int(before), int(after)\r\n if before >= 2400 and after > before:\r\n print(\"YES\")\r\n exit()\r\n elif before > max_rating_before:\r\n max_rating_before = before\r\n max_rating = after\r\nif max_rating > max_rating_before:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n out = []\r\n for s in inp[1:]:\r\n x, y = map(int, s.split()[1:])\r\n if x > 2399 and y - x > 0: return 'YES'\r\n return 'NO'\r\n \r\nprint(main())\r\n", "n = int(input())\r\ncontest = []\r\nfor k in range(n):\r\n\tcontest.append(list(map(str, input().split())))\r\naccept = 0\r\nfor i in range(n):\r\n\tif (int(contest[i][1]) >= 2400) and (int(contest[i][2]) > int(contest[i][1])):\r\n\t\taccept = 1\r\n\t\tbreak\r\nif accept == 1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "t=int(input())\r\nf=False\r\nfor _ in range(t):\r\n x,y,z=map(str,input().split())\r\n if int(y) >= 2400 and int(z) > int(y):\r\n f=True\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c=0\r\nfor _ in range(int(input(''))):\r\n l=input().split()\r\n if int(l[1])>=2400 and int(l[2])>int(l[1]):\r\n c+=1\r\nif c>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "cases = int(input())\r\nfull_list = [input().split() for i in range(cases)]\r\n\r\ndef determine(full_list):\r\n i = 0\r\n test = []\r\n while i < len(full_list):\r\n if int(full_list[i][1]) >= 2400 and int(full_list[i][1]) < int(full_list[i][2]):\r\n test.append(1)\r\n break\r\n i += 1\r\n if len(test) == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n \r\n \r\ndetermine(full_list)", "from collections import Counter\r\n\r\ndef isSq(n):\r\n ans=int(n**0.5)\r\n if ans**2==n:\r\n return True\r\n return False\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n ans=False\r\n for i in range(n):\r\n string=input().split(\" \")\r\n if int(string[1])>=2400:\r\n if int(string[2])>int(string[1]):\r\n ans=True\r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nsolve()", "rslt ='NO' \r\nfor N in range(int(input())):\r\n Name, bef, aft =list(str.split(input()))\r\n bef =int(bef)\r\n aft =int(aft)\r\n if bef>= 2400 and aft>bef:\r\n rslt ='YES' \r\n break\r\nprint(rslt) \r\n \r\n ", "n=int(input())\r\nlist1=[]\r\ncount=0\r\nfor i in range(n):\r\n\tstri,a,b=map(str,input().split())\r\n\ta=int(a)\r\n\tb=int(b)\r\n\tif b>a>=2400 and a!=b:\r\n\t\tcount+=1\r\nif count>0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "num = int(input())\r\nsol=0\r\nfor i in range(num):\r\n list = [x for x in input().split(\" \")]\r\n if int(list[1])>=2400 and int(list[2])>int(list[1]):\r\n sol=1\r\nif sol==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def good_contest(l):\r\n good = \"NO\"\r\n for i in range(len(l)):\r\n if l[i][2] > l[i][1] and l[i][1] >= 2400:\r\n good= \"YES\"\r\n break\r\n return good\r\n\r\n\r\nn = int(input().strip())\r\nl = list()\r\nfor i in range(n):\r\n l.append(list(input().strip().split()))\r\n l[i][1], l[i][2] = int(l[i][1]), int(l[i][2])\r\nprint(good_contest(l))", "for _ in range(int(input())):\r\n a, b = map(int, input().split()[1:])\r\n if a >= 2400 and a < b:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "cnt=0\r\nfor _ in range(int(input())):\r\n k=input().split()\r\n a=int(k[1])\r\n b=int(k[2])\r\n if a>=2400 and b>a:\r\n print(\"YES\")\r\n cnt=-1\r\n break\r\nif cnt==0: print(\"NO\")", "n=int(input())\nda=False\nfor i in range(n):\n a,b,c=map(str,input().split())\n b,c=int(b),int(c)\n if b>=2400 and c>b:\n da=True\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", "n = int(input())\r\nperform_good = False\r\nfor _ in range(n):\r\n handle, before, after = input().split()\r\n\r\n before_rating, after_rating = int(before), int(after)\r\n\r\n if before_rating >= 2400 and after_rating > before_rating:\r\n perform_good = True\r\n break\r\nprint(\"YES\" if perform_good else \"NO\")\r\n", "n = int(input())\r\nd = 'NO'\r\nfor i in range(n):\r\n a, b, c = [i for i in input().split()]\r\n if int(b) >= 2400 and int(c) > int(b):\r\n d = 'YES'\r\nprint(d)", "ans = \"NO\"\r\nfor n in range(int(input())):\r\n s, b, a = input().split()\r\n b = int(b)\r\n a = int(a)\r\n if b>=2400 and a>b:\r\n ans = \"YES\"\r\nprint(ans)\r\n", "n=int(input())\nh=0\nfor i in range(n):\n a=list(input().split())\n if int(a[1])>=2400 and int(a[1])<int(a[2]):\n print(\"YES\")\n h+=1\n break\n\nif h==0:\n print(\"NO\")\n\n\t\t\t \t \t \t\t \t\t\t\t \t\t \t \t \t \t\t", "flag=0 \r\nfor _ in range(int(input())):\r\n a,b,c=map(str,input().split())\r\n b,c=int(b),int(c)\r\n if b>=2400 and c-b>0:\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\nfor i in range(n):\r\n\tl=list(input().split())\r\n\tif int(l[1])>=2400 and int(l[2])>int(l[1]):\r\n\t\tc=\"YES\"\r\n\t\tbreak\r\n\telse:\r\n\t\tc=\"NO\"\r\nprint(c)\t\t\t\r\n\r\n", "# import os\r\n\r\nn = int(input())\r\n\r\np = []\r\nr = 'NO'\r\nfor _ in range(n):\r\n p = input().split()\r\n if int(p[1]) >= 2400 and int(p[2]) >int(p[1]):\r\n r = 'YES'\r\nprint(r)", "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\nyes = 0\r\n\r\nfor _ in range(int(input())):\r\n h,b,a = input().split()\r\n b,a = int(b),int(a)\r\n\r\n if b >= 2400 and a - b > 0:\r\n yes = 1\r\nprint('YES' if yes else 'NO')", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nx=int(input())\r\nc=0\r\nfor i in range(x):\r\n\ts=list(map(str,input().split()))\r\n\tif(int(s[1])>=2400):\r\n\t\tif(int(s[2])>int(s[1])):\r\n\t\t\tc=1\r\n\t\telse:\r\n\t\t\tc=0\r\n\tif(c==1):\r\n\t\tbreak\r\nif(c==1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\t\t\t\t\t", "# A good contest\ndef contest(arr):\n for i in arr:\n if i[0] >= 2400:\n if i[1] > i[0]:\n return \"YES\"\n return \"NO\"\n\n\n\nn = int(input())\nar = []\nfor i in range(n):\n x = input().split()\n tmp = [int(x[1]), int(x[2])]\n ar.append(tmp)\nprint(contest(ar))", "n=int(input())\r\ncount=0\r\nfor i in range (n):\r\n l1=list(input().split())\r\n before=int(l1[1])\r\n after=int(l1[2])\r\n if(before>=2400 and after>before):\r\n count=1\r\n break\r\nif(count==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstatus = 0\r\nfor i in range(n):\r\n\tname, before, after = input().split()\r\n\tif 2400 <= int(before) < int(after):\r\n\t\tstatus = 1\r\nprint(\"NYOE S\"[status::2]) \r\n", "m = int(input())\r\nl = []\r\nfor i in range(m):\r\n l.append(input())\r\nfor i in l:\r\n a,b,c = i.split()\r\n b = int(b)\r\n c = int(c)\r\n if b >= 2400 and b < c:\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\")", "r=0\r\nfor _ in[0]*int(input()):\r\n a,b=map(int,input().split()[1:])\r\n r|=2399<a<b\r\nprint('NYOE S'[r::2])\r\n ", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n n,b,a=(input().split())\r\n if int(b)>=2400 and len(n)<=10:\r\n if int(a)>int(b):\r\n count+=1\r\nif count==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x = int(input())\r\nrate = []\r\nans = 'NO'\r\nfor t in range(x):\r\n s = input().split()\r\n rate.append(s)\r\nfor i in range(len(rate)):\r\n if 2400 <= int(rate[i][1]) < int(rate[i][2]):\r\n ans = 'YES'\r\n break\r\nprint(ans)\r\n", "tt = int(input())\nfor _ in range(tt):\n ttt = input().split(\" \")\n point1 = int(ttt[1])\n point2 = int(ttt[2])\n\n diffrance = point2 - point1\n\n if diffrance > 0 and point1 >= 2400:\n print(\"YES\")\n exit()\nprint(\"NO\")\n\t \t\t \t\t \t\t \t \t\t\t \t\t \t \t\t", "n = int(input())\r\n\r\nflag = 0\r\nfor i in range(n):\r\n\ts = list(map(str,input().split()))\r\n\tif int(s[1]) >= 2400 and int(s[2]) > int(s[1]):\r\n\t\tflag = 1\r\n\r\nif flag == 1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nflag = 0\r\nfor i in range(n):\r\n ls = input().split()\r\n ls[1], ls[2] = int(ls[1]), int(ls[2])\r\n if ls[1]>=2400 and ls[2]>ls[1]: flag = 1\r\nif flag==1: print('YES')\r\nelse: print('NO')\r\n", "n=int(input())\r\nno=1\r\nfor i in range(n):\r\n k=input().split()\r\n if int(k[1])>=2400 and int(k[1])<int(k[2]):\r\n print(\"YES\")\r\n no=0\r\n break\r\nif no==1:\r\n print(\"NO\")\r\n", "n = int(input())\nflag = False\nfor i in range(n): \n name, before, after = input().split()\n\n before = int(before)\n after = int(after)\n if before >= 2400 and before < after: \n if not flag: \n print(\"YES\")\n flag = True\n\nif not flag: \n print(\"NO\")\n", "n = int(input())\r\nres = 'NO'\r\nfor i in range(n):\r\n a = input().split()\r\n if int(a[2]) > int(a[1]) and int(a[1]) >= 2400:\r\n res = 'YES'\r\nprint(res)\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n n, b, a = input().split()\r\n B = int(b)\r\n A = int(a)\r\n if A-B > 0 and B >= 2400:\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "flag = False\r\nfor _ in range(int(input())):\r\n i = input().split()\r\n if int(i[1]) >= 2400 and int(i[2]) > int(i[1]):\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nc1=0\r\nfor i in range(n):\r\n a,b,c=(i for i in input().split())\r\n b=int(b)\r\n c=int(c)\r\n if(b>=2400 and c>b):\r\n c1=1\r\n break\r\nif(c1==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\n\r\nfor _ in range(n):\r\n s, b, a = input().split()\r\n if int(b) >= 2400 and int(a) > int(b):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "n=int(input())\r\npart=[]\r\nfor i in range(n):\r\n x=input().split()\r\n part.append([x[0]]+list(map(int,x[1:])))\r\n \r\nfor i in part:\r\n if i[1]>=2400 and i[2]>i[1]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "ok = 0\r\nfor i in range(int(input())):\r\n a , b , c= input().split()\r\n if (int(b) >= 2400 and (int(c) > int(b))):print('YES');ok=1;break;\r\nif(ok == 0):print('NO')", "import sys\r\n\r\nnumCases = int(input())\r\nisGood = False\r\n\r\nfor i in range(0, numCases):\r\n inputArray = input().split(' ')\r\n score1 = int(inputArray[1])\r\n score2 = int(inputArray[2])\r\n if score1 >= 2400 and score2 > score1:\r\n isGood = True\r\n\r\nif isGood:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\np=0\r\nfor i in range(n):\r\n\ta=input().split()\r\n\tif int(a[1])>=2400 and int(a[1])<int(a[2]):\r\n\t\tp=1\r\n\t\tbreak\r\nif p==1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t\t\t", "con=True\r\nfor _ in [0]*int(input()):\r\n a=[*map(int,input().split()[1:])]\r\n if a[0]>=2400 and a[1]>a[0] and con:print('YES');con=False\r\nif con:print('NO')", "n = int(input())\nflag = 'NO'\nfor i in range(n):\n text, f, s = input().split()\n if int(s) > int(f) >= 2400:\n flag = 'YES'\nprint(flag)", "n = int(input())\r\nc = [map(int, input().split()[1:]) for _ in range(n)]\r\nprint('YES' if any([b > a >= 2400 for a, b in c]) else 'NO')", "t=int(input())\r\nd=0\r\nfor i in range(t):\r\n a,b,c=input().split()\r\n x=int(b)\r\n y=int(c)\r\n if(x>=2400 and y-x>0):\r\n d+=1 \r\nif(d>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n#3\r\n#Burunduk1 2526 2537\r\n#BudAlNik 2084 2214\r\n#subscriber 2833 2749\r\n#3\r\n#Applejack 2400 2400\r\n#Fluttershy 2390 2431\r\n#Pinkie_Pie -2500 -2450\r\n\r\n ", "#!python3\n\"\"\"\nAuthor: w1ld [dog] inbox [dot] ru\n\"\"\"\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\n# import unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\nn = read_int()\nfor i in range(n):\n n, b, a = input().strip().split(' ')\n before = int(b)\n after = int(a)\n if before >= 2400 and before < after:\n print(\"YES\")\n exit()\nprint(\"NO\")\n\n", "n=int(input())\r\nflag=0\r\nif n>0:\r\n\tfor i in range(n):\r\n\t\ta,b,c=input().split()\r\n\t\tb=int(b)\r\n\t\tc=int(c)\r\n\t\tif b>=2400 and c>b:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag==1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\t\r\nelse:\r\n\tprint(\"NO\")", "def elegible(bp, ap):\n if bp >= 2400:\n if ap > bp:\n return True\n else:\n return False\n\nnum_users = input()\nflag = 'NO'\nfor i in range(0, int(num_users)):\n user, bp, ap = input().split()\n if elegible(int(bp), int(ap)):\n flag = 'YES'\n break\n \n \nprint(flag)\n", "bl='NO'\r\nfor _ in range(int(input())):\r\n l_,x,y=input().split()\r\n bl='YES' if int(y)>int(x)>=2400 else bl\r\nprint(bl) \r\n", "n = int(input())\r\nflag = False\r\n\r\nfor i in range(n):\r\n s , x , y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n if x < y and x >= 2400:\r\n flag = True\r\n\r\n\r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nflag = 0\r\nn = int(input())\r\nfor i in range(n):\r\n lst = [x for x in input().split()]\r\n before = int(lst[1])\r\n after = int(lst[2])\r\n if before >= 2400 and after > before:\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ngood = 'NO'\r\n\r\nfor i in range(0, n):\r\n s = input().split()\r\n before = int(s[1])\r\n after = int(s[2])\r\n if after - before > 0 and before >= 2400:\r\n good = 'YES'\r\n\r\nprint(good)\r\n", "ok = False\nfor testCase in range(int(input())):\n handl ,before ,after = input().split()\n if int(before) >= 2400 and int(before) < int(after):\n ok = True\nif ok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x = int(input())\r\ncontests = list(list(map(str,input().split()))for _ in range(x))\r\nmessage = 0\r\nfor i in contests:\r\n befscore=int(i[1])\r\n aftscore=int(i[2])\r\n if befscore>=2400 and befscore<aftscore:\r\n message = 1\r\n break\r\n \r\nif message==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "for _ in range(int(input())):\r\n handle, before, after = input().split()\r\n before, after = int(before), int(after)\r\n if before >= 2400 and after > before:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split()[1:])) for _ in range(n)]\r\n\r\nans = False\r\nfor i in data:\r\n if 2400 <= i[0] < i[1]:\r\n ans = True\r\n break\r\n\r\nprint(\"YES\" if ans else \"NO\")", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nimport bisect\r\n\r\nn=I()\r\n\r\nfor i in range(n):\r\n s,r1,r2=input().split()\r\n\r\n r1=int(r1)\r\n r2=int(r2)\r\n\r\n if 2400<=r1<r2:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 16:09:06\nLastEditTime: 2021-11-07 16:12:35\nDescription: A Good Contest\nFilePath: CF681A.py\n'''\n\n\ndef func():\n n = int(input())\n for _ in range(n):\n _, before, after = input().strip().split()\n if int(before) >= 2400 and int(after) > int(before):\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "yorn = \"NO\"\r\nam = int(input())\r\nfor i in range(am):\r\n n,b,d = input().split()\r\n b = int(b)\r\n d = int(d)\r\n if b >= 2400 and d > b:\r\n yorn = \"YES\"\r\n break\r\nprint(yorn)", "n=int(input())\r\nok=0\r\nfor i in range(n):\r\n s,r1,r2=input().split()\r\n r1,r2=int(r1),int(r2)\r\n if r1>=2400:\r\n if r2-r1>0:\r\n ok+=1\r\n\r\nprint('YES' if ok else 'NO')", "def results(lst):\r\n for i in lst:\r\n if int(i[1]) >= 2400:\r\n if int(i[2]) - int(i[1]) > 0:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nn = int(input())\r\nusers = list()\r\nfor i in range(n):\r\n users.append([elem for elem in input().split(' ')])\r\nprint(results(users))", "\nn = int(input())\n\nlst = []\n\nfor i in range(n):\n a = list(map(str,input().split()))\n a.pop(0)\n\n lst.append([int(a[0]),int(a[1])])\n\nres = False\n\nfor i in range(n):\n if lst[i][0] >= 2400 and lst[i][1] > lst[i][0]:\n res = True\n break\n\nif res:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t\t \t \t \t\t \t", "n=int(input())\r\nc=0\r\nfor _ in range(n):\r\n n,b,a=map(str,input().split())\r\n if int(b)>=2400 and int(b)<int(a):\r\n c+=1 \r\nif c!=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nflag = False\r\nfor i in range(n):\r\n info = list(input().split())\r\n info[1], info[2] = int(info[1]), int(info[2])\r\n if info[1] >= 2400 and info[2]>info[1]:\r\n flag = True\r\nif flag: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=int(input())\r\ngood=False\r\nli=[]\r\nfor i in range(t):\r\n s,a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n li.append([a,b])\r\nfor i in range(len(li)):\r\n if li[i][0]>=2400 and li[i][1]>li[i][0]:\r\n good=True\r\n break\r\nif good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nc = ''; d = ''\r\nfor i in range(n):\r\n s, a, b = map(str, input().split())\r\n a, b = int(a), int(b)\r\n if a >= 2400 and b > a:\r\n c = 'YES'\r\n d = 'YES'\r\n else:\r\n c = 'NO'\r\nif d == 'YES':\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nf=0\r\nfor i in range(n):\r\n s=list(map(str, input().split()))\r\n a=int(s[1])\r\n b=int(s[2])\r\n if a>=2400:\r\n if (b-a) > 0:\r\n f=1\r\nif f==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "for i in range(int(input())):\r\n _,b,c=input().split()\r\n if int(c)>int(b)>2399:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "isRed = False\nn = int(input())\nfor i in range(n):\n #print(i)\n x, before, after = input().split()\n before = int(before)\n after = int(after)\n if(before >= 2400 and after > before):\n isRed = True\n\nif(isRed):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t\t\t \t\t \t\t \t\t \t\t", "flag = False\r\n\r\nfor _ in range(int(input())):\r\n name, bef, aft = map(str, input().split())\r\n bef, aft = int(bef), int(aft)\r\n\r\n if 2400 <= bef < aft:\r\n flag = True\r\n\r\nprint('YES' if flag else 'NO')\r\n", "n=int(input())\r\nflag=False\r\nfor i in range(n):\r\n name,before,after=map(str,input().split())\r\n before=int(before);after=int(after)\r\n if before>=2400 and after>before:\r\n flag=True\r\nif flag:print('YES')\r\nelse:\r\n print('NO')", "a=int(input())\r\nf=0\r\nfor x in range(a):\r\n b,c,d=input().split()\r\n c=int(c)\r\n d=int(d)\r\n if c>=2400 and d>c:\r\n f=1\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n1 = int(input())\r\nlist1 = []\r\nfor i in range(n1):\r\n list1.append(input().split())\r\n \r\nk1 = 0\r\nb1 = False\r\nflag = 0\r\nwhile b1==False:\r\n if k1==len(list1):\r\n break\r\n score1 = int(list1[k1][1])\r\n score2 = int(list1[k1][2])\r\n if score1 >= 2400 and score2 > score1:\r\n print(\"YES\")\r\n flag+=1\r\n break\r\n k1+=1\r\nif flag == 0:\r\n print(\"NO\")\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\nn = int(input())\r\n\r\nfor 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\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nresults = \"NO\"\r\nfor x in range(n):\r\n string = input()\r\n user = string.split(\" \")\r\n a = int(user[1])\r\n b = int(user[2])\r\n if a >= 2400 and b > a:\r\n results = \"YES\"\r\nprint(results)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nfor i in range(n):\r\n\ts = input()\r\n\ts = s.split()\r\n\ta = int(s[1])\r\n\tb = int(s[-1])\r\n\tif a >= 2400 and b > a:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")\r\n", "def solve(n):\r\n\tfor i in range(n):\r\n\t\ts = input()\r\n\t\ts = s.split()\r\n\t\ts[2] = int(s[2])\r\n\t\ts[1] = int(s[1])\r\n\t\tif s[2] > s[1] and s[1] >= 2400:\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\r\nn = int(input())\r\nprint(solve(n))", "def main():\r\n t = int(input())\r\n for _ in range(t):\r\n a, b = map(int, input().split()[1:])\r\n if a >= 2400 and b > a:\r\n print('YES')\r\n return\r\n print('NO')\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=int(input())\r\ncnt='NO'\r\nfor i in range(a):\r\n b,c, d=input().split()\r\n if int(d)>int(c)>=2400:\r\n cnt='YES'\r\nprint(cnt)", "for _ in range(int(input())):\r\n _, bef, aft = input().split()\r\n if int(bef) < int(aft) and int(bef) >= 2400:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n" ]

[ "r0,g0=map(int,input().split())\r\nh0=int((2*(r0+g0)+0.25)**0.5-0.5)\r\nsum=(h0*(h0+1))//2\r\nmod=10**9+7\r\nremain=r0+g0-sum\r\nf=[[0 for _ in range(r0+1)] for _ in range(2)]\r\nfor i in range(min(remain,r0)+1):\r\n f[(h0+1)%2][i]=1\r\n# print(f)\r\nfor h in range(h0,-1,-1):\r\n for i in range(r0+1):\r\n g=r0+g0-h*(h-1)//2-i\r\n if g>g0:\r\n continue\r\n if g<0:\r\n break\r\n f[(h%2)][i]=0\r\n if i>=h:\r\n f[h%2][i]+=f[(h+1)%2][i-h]\r\n if g>=h:\r\n f[h%2][i]+=f[(h+1)%2][i]\r\n f[h%2][i]%=mod\r\nprint(f[1][r0])\r\n# r0,g0=map(int,input().split())\r\n# h0=int((2*(r0+g0)+0.25)**0.5-0.5)\r\n# sum=h0*(h0+1)//2\r\n# M = int(1E9 + 7)\r\n# A=[[0 for i in range(max(r0,g0)+1)] for j in range(2)]\r\n# remain=r0+g0-sum\r\n# for i in range(min(remain,r0)+1):\r\n# A[(h0 + 1) % 2][i] = 1\r\n# print(A)\r\n# for h in range(h0,-1,-1):\r\n# for r in range(r0+1):\r\n# g = r0 + g0 - h * (h - 1) / 2 - r\r\n# if g>g0:\r\n# continue\r\n# if g<0:\r\n# break\r\n# A[h % 2][r] = 0\r\n# if r>=h:\r\n# A[h % 2][r] += A[(h + 1) % 2][r - h]\r\n# if g >= h:\r\n# A[h % 2][r] += A[(h + 1) % 2][r]\r\n# A[h % 2][r] %=M\r\n# print(A[1][r0])\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\nMOD = 10**9+7\n\ndef main():\n r,g = rl(int)\n\n l,ri = 0,1000\n h = -1\n\n while l <= ri:\n m = (l+ri)//2\n\n if m*(m+1)//2 <= r+g:\n h = m\n l = m+1\n else:\n ri = m-1\n\n dp = [0]*(r+1)\n dp[0] = 1\n\n for i in range(1,h+1):\n dp2 = [0]*(r+1)\n\n for i2 in range(len(dp)):\n if i2-i >= 0: dp2[i2] += dp[i2-i]\n if i+(i-1)*i//2-i2 <= g: dp2[i2] += dp[i2]\n dp2[i2] %= MOD\n\n dp = dp2\n\n print(sum(dp)%MOD)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()" ]

[ "a=[int(x) for x in input().split()]\r\nif 1 in a:\r\n print(\"YES\")\r\nelif a.count(2)>=2:\r\n print(\"YES\")\r\nelif a.count(3)==3:\r\n print(\"YES\")\r\nelif set(a)=={2,4,4}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k1,k2,k3=map(int,input().split())\nif (k1==2 and k2==2) or (k3==2 and k2==2) or (k1==2 and k3==2):\n print(\"YES\")\nelif k1==k2==k3==3:\n print(\"YES\")\nelif k1==1 or k2==1 or k3==1:\n print(\"YES\")\nelif (k1==2 and k2==4 and k3==4) or (k2==2 and k1==4 and k3==4) or (k1==4 and k2==4 and k3==2):\n print(\"YES\")\nelse:\n print(\"NO\")", "# https://algoprog.ru/material/pc911pC\r\n\r\nk1, k2, k3 = map(int, input().split())\r\nk1, k2, k3 = min(k1, k2, k3), k1 + k2 + k3 - min(k1, k2, k3) - max(k1, k2, k3), max(k1, k2, k3)\r\n\r\nif k1 * k2 + k1 * k3 + k2 * k3 < k1 * k2 * k3:\r\n print('NO')\r\nelif k1 == 2 and k2 == 2 or k1 == 1:\r\n print('YES')\r\nelse:\r\n st1 = 0\r\n st2 = 1\r\n for st3 in range(2, 10):\r\n for i in range(1, 2000):\r\n if (i+st1) % k1 != 0:\r\n if (i+st2) % k2 != 0:\r\n if (i + st3) % k3 != 0:\r\n break\r\n\r\n else:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')", "k1, k2, k3 = map(int,input().split())\r\nif k1 == 1 or k2 == 1 or k3 == 1:\r\n print('YES')\r\nelif k1 == 2 and k2 == 2 or k2 == 2 and k3 == 2 or k1 == 2 and k3 == 2:\r\n print('YES')\r\nelif min(k1,k2,k3) == 2 and max(k1,k2,k3) == 4 and sum([k1,k2,k3])-max(k1,k2,k3)-min(k1,k2,k3) == 4:\r\n print('YES')\r\nelif k1 == 3 and k2 == 3 and k3 == 3:\r\n print('YES')\r\nelse:\r\n print('NO')", "k = list(map(int, input().split()))\r\nif k.count(1) >= 1:\r\n print('YES')\r\nelif k.count(2) >= 2:\r\n print('YES')\r\nelif k.count(2) == 1 and k.count(4) == 2:\r\n print('YES')\r\nelif k.count(3) == 3:\r\n print('YES')\r\nelse:\r\n print('NO')", "k1,k2,k3 = list(map(int, input().strip().split()))\r\n\r\nimport sys\r\n\r\ndef gcd(a,b):\r\n if b > a:\r\n return gcd(b,a)\r\n if a % b == 0:\r\n return b\r\n return gcd(b,a%b)\r\n\r\nu = min(k1,k2,k3)\r\n\r\nsez = [False]*5000\r\ns = 0\r\nwhile s < len(sez):\r\n sez[s] = True\r\n s += k1\r\n\r\nif sez.count(False) == 0:\r\n print('YES')\r\n sys.exit(0)\r\n\r\ni = sez.index(False)\r\ns2 = sez[:]\r\ns = i\r\nwhile s < len(sez):\r\n sez[s] = True\r\n s += k2\r\n\r\nif sez.count(False) == 0:\r\n print('YES')\r\n sys.exit(0)\r\n\r\ni = sez.index(False)\r\ns = i\r\nwhile s < len(sez):\r\n sez[s] = True\r\n s += k3\r\nif sez.count(False) == 0:\r\n print('YES')\r\n sys.exit(0)\r\n\r\ni = s2.index(False)\r\ns = i\r\nwhile s < len(s2):\r\n s2[s] = True\r\n s += k3\r\n\r\nif s2.count(False) == 0:\r\n print('YES')\r\n sys.exit(0)\r\n\r\ni = s2.index(False)\r\ns = i\r\nwhile s < len(s2):\r\n s2[s] = True\r\n s += k2\r\n\r\nif s2.count(False) == 0:\r\n print('YES')\r\n sys.exit(0)\r\n\r\nprint('NO')\r\n", "a = list(map(int, input().split()))\r\ns = [[3, 3, 3], [2, 4, 4], [4, 2, 4], [4, 4, 2]]\r\ntwo = 0\r\nfor item in a:\r\n if item == 2:\r\n two += 1\r\nif 1 in a or a in s or two > 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#a=[0 for x in range((1500*1500)+1)]\r\nl=list(map(int,input().split()))\r\nif l[0]==l[1]==l[2]==3:\r\n print(\"YES\")\r\nelif l.count(2)>=2:\r\n print(\"YES\")\r\nelif l.count(1)>0:\r\n print(\"YES\")\r\nelif l.count(4)==2 and l.count(2)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''import sys \r\nsys.stdin = open('/home/srikar/Desktop/input.txt', 'r') \r\nsys.stdout = open('/home/srikar/Desktop/output.txt', 'w') '''\r\nMOD = 1000000007\r\nMOD2 = 998244353\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\nk1,k2,k3=sorted(f())\r\nif k1==1 or k1==k2==2 or k1==k2==k3==3 or (k1,k2,k3)==(2,4,4):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "# https://algoprog.ru/material/pc911pC\r\n\r\nk1, k2, k3 = map(int, input().split())\r\nk1, k2, k3 = min(k1, k2, k3), k1 + k2 + k3 - min(k1, k2, k3) - max(k1, k2, k3), max(k1, k2, k3)\r\n\r\nif k1 * k2 + k1 * k3 + k2 * k3 < k1 * k2 * k3:\r\n print('NO')\r\nelif k1 == 2 and k2 == 2 or k1 == 1:\r\n print('YES')\r\nelse:\r\n for start_time in range(2, 5):\r\n for i in range(1, 100):\r\n if i % k1 != 0:\r\n if (i + 1) % k2 != 0:\r\n if (i + start_time) % k3 != 0:\r\n break\r\n\r\n else:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')", "x,y,z=map(int,input().split())\r\na=[0]*1510\r\na[x]+=1\r\na[y]+=1\r\na[z]+=1\r\nif a[1]>=1 or a[2]>=2 or a[3]>=3 or (a[4]==2 and a[2]==1):\r\n print('YES')\r\n \r\nelse:\r\n print('NO')", "a=sorted(list(map(int,input().split())))\r\nif (a[0]==1) or ((a[0]==2) and (a[1]==2)) or ((a[0]==3) and (a[2]==3)) or ((a[0]==2) and (a[1]==4) and (a[2]==4)):\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nk1, k2, k3 = sorted(map(int, input().split()))\r\n'''\r\nk1 == 1 - obvious\r\n2 twos - they can cover everything\r\n3 threes - they can cover everything\r\n\r\nlcm := lcm(k1, k2, k3)\r\nxmax := max(x1, x2, x3)\r\nxmin := min(x1, x2, x3)\r\none of xi can be taken as zero (just substract xmin from all)\r\nalso, it doesn't make sense to take any of xi > 0 greater than lcm\r\ntherefore, we can check interval [lcm, 2*lcm] to be covered\r\n\r\n2 3 3 - doesn't seems to work\r\n1 2 3 4 5 6 7 8 9 10\r\nx x x x x x x \r\nx x x x x x x\r\n\r\n2 4 4\r\n1 2 3 4 5 6 7 8 9 10\r\nx x x x x x x x x x\r\n\r\n2 ? ?\r\n1 2 3 4 5 6 7 8 9 10\r\nx x x x x \r\nto cover 2 and 4 with one ki => ki == 2\r\nto cover 2 and 6 with one ki => ki == 4\r\n'''\r\nif 1 == k1 or (2 == k1 and 2 == k2) or (3 == k1 and 3 == k2 and 3 == k3) \\\r\n or (k1 == 2 and k2 == 4 and k3 == 4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k1,k2,k3=map(int,input().split())\r\na=[k1,k2,k3];a=sorted(a)\r\n#\r\ndp=[0]*5001;dp[0]=1\r\ni=0\r\nwhile i<=5000:\r\n if dp[i]==0 and i+a[0]<=5000:\r\n while i+a[0]<=5000:\r\n dp[i]=1\r\n i=i+a[0]\r\n else:i+=1\r\n#print(dp)\r\n#\r\ni=0\r\nwhile i<=5000:\r\n if dp[i]==0 and i+a[1]<=5000:\r\n while i+a[1]<=5000:\r\n dp[i]=1\r\n i=i+a[1]\r\n else:i+=1\r\n#print(dp)\r\n#\r\ni=0\r\nwhile i<=5000:\r\n if dp[i]==0 and i+a[2]<=5000:\r\n while i+a[2]<=5000:\r\n dp[i]=1\r\n i=i+a[2]\r\n else:i+=1\r\n#\r\ndp=dp[:2002]\r\nif dp.count(0)==0:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nk = list(map(int, readline().split()))\r\n\r\n\r\nans = 'NO'\r\nif min(k) == 1 or k.count(2) >= 2 or k.count(3) >= 3 or (k.count(4) == 2 and k.count(2) == 1):\r\n ans = 'YES'\r\n\r\nprint(ans)", "import sys\r\n\r\na = list(map(int, input().split()))\r\n\r\nif (\r\n a.count(1)\r\n or a.count(2) > 1\r\n or a.count(2) == 1 and a.count(4) == 2\r\n or a.count(3) == 3\r\n):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\nimport math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# string = str(input())\r\n\ta,b,c= map(int,input().split())\r\n\tif(a==1 or b==1 or c==1):\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tif(a==3 and b==3 and c==3):\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tif((a==2 and b==2) or (a==2 and c==2) or (b==2 and c==2)):\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tif(min(a,b,c)==2 and max(a,b,c)==4 and a+b+c-2-4==4):\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tprint(\"NO\")\r\n\treturn\r\n\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()", "from math import *\r\nfrom bisect import *\r\nfrom collections import Counter,defaultdict,deque\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\ndef check(d,e,f):\r\n a=[0]*20\r\n for i in range(0,20,d):\r\n a[i]=1\r\n if 0 in a:\r\n for i in range(a.index(0),20,e):\r\n a[i]=1\r\n if 0 in a:\r\n for i in range(a.index(0),20,f):\r\n a[i]=1\r\n if sum(a)==20:return True\r\n return False\r\n \r\n\r\n\r\nfor _ in range(1):\r\n a,b,c=sorted(M())\r\n if check(a,b,c):\r\n print(\"YES\")\r\n elif check(a,c,b):\r\n print(\"YES\")\r\n elif check(b,a,c):\r\n print(\"YES\")\r\n elif check(c,a,b):\r\n print(\"YES\")\r\n elif check(b,c,a):\r\n print(\"YES\")\r\n elif check(c,b,a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "k1, k2, k3 = map(int, input().split())\r\na = []\r\nfor i in range(0, 1500 + 10) : a.append(0)\r\na[k1] += 1\r\na[k2] += 1\r\na[k3] += 1\r\nif (a[1] > 0) : print('YES')\r\nelif (a[2] >= 2) : print('YES')\r\nelif (a[3] >= 3) : print('YES')\r\nelif ((a[2] > 0) and (a[4] >= 2)) : print('YES')\r\nelse : print('NO')", "def main():\r\n nums = list(map(int, input().split()))\r\n a, b, c = nums[0], nums[1], nums[2]\r\n valid = set()\r\n if a == 1 or b == 1 or c == 1:\r\n print(\"YES\")\r\n return\r\n elif (a == 2 and b == 2) or (b == 2 and c == 2) or (a == 2 and c == 2):\r\n print(\"YES\")\r\n return\r\n \r\n x = [(3, 3, 3), (2, 4, 4)]\r\n for y in x:\r\n valid.add(y)\r\n \r\n gg = [a, b, c]\r\n gg.sort()\r\n gg = tuple(gg)\r\n if gg in valid:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import Counter\r\ndata = list(map(int, input().split()))\r\nc = Counter(data)\r\nif 1 in c or (2 in c and c[2]>1) or (3 in c and c[3]>2) or (2 in c and 4 in c and c[4]>1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=list(map(int, input().split()))\r\nif 1 in a:\r\n print(\"YES\")\r\n quit()\r\ntwos=a.count(2)\r\nthrees=a.count(3)\r\nfours=a.count(4)\r\nif twos>1 or threes==3 or (twos==1 and fours==2):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "(k1, k2, k3) = map(int, input().split())\r\nfor x1, x2, x3 in [(1, 2, 3), (2, 1, 3), (3, 1, 2), (1, 3, 2), (2, 3, 1), (3, 2, 1)]: # перебираем все возможные варианты/способы включения гирлянд\r\n a = [False]*100\r\n def f(a, x, k):\r\n t = x\r\n while t < len(a):\r\n a[t] = True\r\n t += k\r\n f(a, x1, k1)\r\n f(a, x2, k2)\r\n f(a, x3, k3)\r\n if all(a[1:]):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "k1,k2,k3=map(int,input().split())\r\nL=[k1,k2,k3]\r\n\r\n\r\nif L.count(1) != 0:\r\n print(\"YES\")\r\nelif L.count(2) >= 2:\r\n print('YES')\r\n\r\nelif L.count(3) == 3:\r\n print(\"YES\")\r\n\r\nelif L.count(4)==2 and L.count(2)==1:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a = sorted(list(map(int, input().split())))\r\nif a[0] == 1:\r\n print('YES')\r\nelif a[0] == a[1] == 2:\r\n print('YES')\r\nelif a[0] == a[1] == a[2] == 3:\r\n print('YES')\r\nelif a[0] == 2 and a[1] == a[2] == 4:\r\n print('YES')\r\nelse:\r\n print('NO')", "#http://codeforces.com/problemset/problem/911/C\n\ninp = list(map(int, input().split()))\ninp.sort()\nstring = \"NO\"\nif(inp.count(1)>= 1 or inp.count(2)>=2 or inp.count(3)>=3):\n\tstring = \"YES\"\nif(inp == [2,4,4]):\n\tstring = \"YES\"\nprint(string)", "if __name__ == \"__main__\":\n k = [int(a) for a in input().strip().split()]\n times = dict()\n for i in range(3):\n if k[i] not in times:\n times[k[i]] = 1\n else:\n times[k[i]] += 1\n flag = 0\n if 1 in times:\n flag = 1\n elif 2 in times and times[2] >= 2:\n flag = 1\n elif 3 in times and times[3] >= 3:\n flag = 1\n elif 4 in times and 2 in times and times[4] == 2 and times[2] == 1:\n flag = 1\n\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t\t\t\t \t\t\t\t\t\t \t \t", "k1,k2,k3=sorted(map(int,input().split()))\r\nif k1==1 or k2==1 or k3==1:\r\n print('YES')\r\nelif k2==k3==2 or k1==k2==2 or k1==k3==2:\r\n print('YES')\r\nelif k1==k2==k3==3:\r\n print('YES')\r\nelif k2==k3==4 and k1==2:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c=map(int,input().split())\r\na,b,c=min(a,b,c),a+b+c-min(a,b,c)-max(a,b,c),max(a,b,c)\r\nif a==1:\r\n print('YES')\r\nelif a==2:\r\n if b==2 or b==c==4:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if a==b==c==3:\r\n print('YES')\r\n else:\r\n print('NO')", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nk1, k2, k3 = sorted(map(int, input().split()))\r\n'''\r\nwe have 1 - obvious\r\n2 twos - they can cover everything\r\n3 threes - they can cover everything\r\n2 3 3 - also possible. need to cover all odd numbers with 2 threes:\r\n 2*x+1 + 3*k\r\n 2*x+3 + 3*k\r\nat least 1 > 3 - \r\nx3 + k3*i, where k3 > 3\r\nwe can choose x3, so it's >= max(x1, x2, x3)\r\n=> need to cover:\r\nx3+1, x3+2, x3+3, ...\r\nwe can cover x3+1 and x3+3 using 2.\r\n?\r\n\r\nlcm(k1, k2, k3)\r\nxmax = max(x1, x2, x3)\r\nxmin = min(x1, x2, x3)\r\none of xi can be taken as zero (just substract xmin from all)\r\nalso, it doesn't make sense to take any of xi > 0 greater than lcm\r\ntherefore, we can check interval [lcm, 2*lcm] to be covered\r\n\r\n1 2 3 4 5 6 7 8 9 10\r\n x x x x x\r\n3 3 3\r\nx x x x x x x x x x\r\n2 3 3 - doesn't seems to work\r\nx x x x x x x\r\nx x x x x x x\r\n\r\n(k1 == 2 and k3 % k2 == 0) - passed 5th test\r\nk1 == 2, k2 >= 3\r\n2 4 4\r\n1 2 3 4 5 6 7 8 9 10\r\nx x x x x x x x x x\r\n'''\r\n# def gcd(a, b):\r\n# if b == 0:\r\n# return a\r\n# return gcd(b, a % b)\r\n\r\n# gcdk = gcd(gcd(k1, k2), k3)\r\n#lcmk = k1*k2*k3 // gcdk\r\n\r\nif 1 == k1 or (2 == k1 and 2 == k2) or (3 == k1 and 3 == k2 and 3 == k3) \\\r\n or (k1 == 2 and k2 == 4 and k3 == 4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = [int(i) for i in input().split(\" \")]\r\nl.sort()\r\nx,y,z = l\r\nif 1 in l:\r\n print(\"YES\")\r\nelif [l[0],l[1]] == [2,2] or [l[1],l[2]] == [2,2] or l == [3,3,3]:\r\n print(\"YES\")\r\nelse:\r\n l = [0 for i in range(50)]\r\n for i in range(0,50,x):\r\n l[i] = 1\r\n for i in range(1,50,y):\r\n l[i] = 1\r\n c = l.index(0)\r\n for i in range(c,50,z):\r\n l[i] = 1\r\n if 0 in l:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n", "a,b,c=sorted(map(int,input().split()))\r\nif a==1 or a==b==2 or a==b==c==3 or (a==2 and b==c==4): print('YES')\r\nelse: print('NO')", "\r\n\r\nk1,k2,k3=map(int,input().split())\r\n\r\na=[0]*1510\r\n\r\na[k1]+=1\r\na[k2]+=1\r\na[k3]+=1\r\n\r\nif a[1]>=1 or a[2]>=2 or a[3]>=3 or (a[4]==2 and a[2]==1):\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "a, b, c = sorted(list(map(int, input().split())))\nj, k = -1, -1\nfor i in range(0, a):\n\tif(i%a != 0):\n\t\tj = i\n\t\tbreak\n\nfor i in range(j, max(2*a, 2*b)):\n\tif((i%a != 0) and ((i-j)%b != 0)):\n\t\tk = i\n\t\tbreak\ni = 0\nwhile(True):\n\ti+=1\n\tif(i%a ==0 and i%b==0 and i%c==0):\n\t\tprint(\"YES\")\n\t\tbreak\n\tx = i%a ==0 or (i-j)%b ==0 or (i-k)%c==0\n\tif(not x):\n\t\tprint (\"NO\")\n\t\tbreak\n", "l = list(sorted(list(map(int,input().split()))))\r\nif min(l) == 1 or (l[0]==3 and l[1]==3 and l[2]==3) or (l[0]==2 and l[1]==4 and l[2]==4) or(l[0]==2 and l[1] == 2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n cnt = { 1 : 0, 2 : 0, 3 : 0, 4 : 0 }\n k = list(map(int, input().split(' ')))\n for i in range(3):\n if k[i] in cnt: cnt[k[i]] += 1\n \n if cnt[1] or cnt[2] >= 2 or cnt[3] == 3 or (cnt[2] == 1 and cnt[4] == 2): print(\"YES\")\n else: print(\"NO\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t \t \t \t \t \t \t \t\t \t \t\t", "a, b, c = map(int,input().split())\r\n\r\nif a == 1 or b == 1 or c == 1 or a == b == 2 or b == c == 2 or c == a == 2 or a == b == c == 3:\r\n print('Yes')\r\nelse:\r\n if a == 2 and b == c == 4 or b == 2 and a == c == 4 or c == 2 and b == a == 4:\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\n \r\n", "k = sorted([int(s) for s in input().split()])\n\nc = k[0] == 1 or k[0] == 2 and k[1] == 2 or set(k) == {3, 3, 3} or set(k) == {2, 4, 4}\n\nprint('YES' if c else 'NO')\n", "a, b, c = [int(x) for x in input().split()]\r\narr = sorted([a, b, c])\r\nif arr.count(1) >= 1:\r\n print('YES')\r\nelif arr.count(2) >= 2:\r\n print('YES')\r\nelif arr.count(2) == 1 and arr.count(4) == 2:\r\n print('YES')\r\nelif arr.count(3) == 3:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(map(int, input().split()))\r\na.sort()\r\nif (a[0] == 1 or (a[0] == 2 and a[1] == 2) or (a[0] == 3 and a[1] == 3 and a[2] == 3) or (a[0] == 2 and a[1] == 4 and a[2] == 4)):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "a = list(map(int,input().split()))\nif a.count(1)>=1 or a.count(2)>=2 or a.count(3)==3 or (a.count(2)==1 and a.count(4)==2):\n print(\"YES\")\nelse:\n print(\"NO\")", "k = [int(i) for i in input().split()]\r\nk.sort()\r\nif k[0] <= 1 or k[1] <= 2 or k == [3, 3, 3] or k == [2, 4, 4]:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "#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 check(d, e):\r\n x = [False for i in range(2*c)]\r\n x[0] = x[c] = True\r\n i = 0\r\n while i < 2*c and x[i]: i += 1\r\n while i < 2*c:\r\n x[i] = True\r\n i += d\r\n i = 0\r\n while i < 2*c and x[i]: i += 1\r\n while i < 2*c:\r\n x[i] = True\r\n i += e\r\n if all(x):\r\n return True\r\n return False\r\n\r\n\r\n\r\na, b, c = sorted(map(int, input().split()))\r\nif check(a, b) or check(b, a):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import sys\r\n\r\na = [int(x) for x in input().split()]\r\na = sorted(a)\r\n\r\nif 1 in a or a == [2,4,4] or a == [3,3,3]:\r\n\tprint('YES')\r\n\tsys.exit()\r\nelif a[0] == 2 and a[1] == 2:\r\n\tprint('YES')\r\n\tsys.exit()\r\nprint('NO')", "k1, k2, k3 = sorted(map(int, input().split()))\r\nif k1 == 1 or (k1, k2) == (2, 2) or (k1, k2, k3) in [(3, 3, 3), (2, 4, 4)]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "lst = [int(i)for i in input().split()]\r\nlst.sort()\r\ne = min(lst)\r\nflag = False\r\nif e==1:\r\n\tflag = True\r\nelif e==2:\r\n\tif lst[1]==2:\r\n\t\tflag = True\r\n\telif lst[1]==4 and lst[2]==4:\r\n\t\tflag = True\r\nelse:\r\n\tif lst[0]==3 and lst[2]==3:\r\n\t\tflag = True \r\n\r\nif flag:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "k=list(map(int,input().split()))\r\nb=[[k[0],k[1],k[2]],[k[0],k[2],k[1]],[k[1],k[2],k[0]],[k[0],k[1],k[2]],[k[2],k[1],k[0]],[k[2],k[0],k[1]]]\r\na=[0]*1500\r\nco=0\r\nfor i in range(6):\r\n for j in range(3):\r\n for l in range(j,1500,b[i][j]):\r\n a[l]+=1\r\n if not(0 in a):\r\n co=1\r\n print('YES')\r\n break\r\n else:\r\n a=[0]*1500\r\nif co==0:\r\n print('NO')", "k = sorted([int(x) for x in input().split()])\r\n\r\nif k[0] == 1 or k[0] == k[1] == 2 or k[0] == k[2] == 3 or (k[0] == 2 and k[1] == k[2] == 4):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(map(int,input().split()))\r\nif 1 in a:\r\n print(\"YES\")\r\nelif a.count(2)>1:\r\n print(\"YES\")\r\nelif a.count(3)>2:\r\n print(\"YES\")\r\nelif a.count(4)>1 and a.count(2)>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=sorted(map(int,input().split()))\r\nprint('YES'if a.count(1) or a.count(2)>1 or a.count(3)>2 or a==[2,4,4] else 'NO')", "a, b, c = map(int, input().split())\r\n\r\nspecialcase = [2, 4, 4]\r\n\r\nif sorted([a, b, c]) == specialcase:\r\n print(\"YES\")\r\n exit()\r\n\r\nif a == b == c == 3:\r\n print(\"YES\")\r\n exit()\r\n\r\nif 1 in [a, b, c]:\r\n print(\"YES\")\r\n exit()\r\n\r\nif [a, b, c].count(2) >= 2:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "a=sorted(map(int,input().split()))\r\nprint('YES'if a.count(1)or a.count(2)>1 or a.count(3)>2 or a==[2,4,4] else 'NO')\r\n", "ks=list(map(int,input().split()))\r\na,b,c,d=ks.count(1),ks.count(2),ks.count(3),ks.count(4)\r\nif a>0 or b>1 or c>2 or (b==1 and d==2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = sorted(list(map(int, input().split())))\r\nif a[:1] == [1] or a[:2] == [2,2] or a[:3] == [3,3,3] or a[:3] == [2,4,4]:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")\r\n", "k1,k2,k3=map(int,input().split())\r\na=[k1,k2,k3];a=sorted(a)\r\nif a[0]==1 or a.count(2)>=2 or a.count(3)==3:print(\"YES\")\r\nelif a.count(4)==2 and a.count(2)==1:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "A = list(map(int, input().split()))\r\ncnt = [A.count(1), A.count(2), A.count(3), A.count(4)]\r\nif cnt[0] >= 1 or cnt[1] >= 2 or cnt[2] >= 3 or (cnt[1] == 1 and cnt[3] == 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Сложность по времени O(1)\r\n# Сложность по памяти O(1)\r\n\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nif a[0] == 1 or (a[0] == a[2] == 2) or (a[0] == a[2] == 3) or \\\r\n (a[0] == 2 and a[1] == a[2] == 4) or (a[0] == a[1] == 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.buffer.readline\r\nfrom itertools import permutations\r\n\r\nk = list(map(int,input().split()))\r\n\r\nworked = 0\r\nfor k1,k2,k3 in permutations(k):\r\n worked2 = 1\r\n for t in range(10000):\r\n if not (t % k1 == 0 or t % k2 == 1 or t % k3 == 2):\r\n worked2 = 0\r\n\r\n if worked2:\r\n worked = 1\r\n break\r\n\r\nif worked:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys,math \r\na,b,c=map(int,sys.stdin.readline().split())\r\nl=[a,b,c]\r\nif l.count(1)>0:print(\"YES\")\r\nelif l.count(2)>1:print(\"YES\")\r\nelif l.count(3)==3:print(\"YES\")\r\nelif l.count(2)==1 and l.count(4)==2:print(\"YES\")\r\nelse:print(\"NO\")", "from math import gcd\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\ndef lcm1(a, b, c):\r\n return lcm(lcm(a, b), c)\r\n\r\n\r\na, b, c = list(map(int, input().split()))\r\nx = [a, b, c]\r\nx.sort()\r\na, b, c = x\r\nar = [0] * 10 ** 5\r\nfor i in range(0, 10 ** 5, a):\r\n ar[i] = 1\r\nfor i in range(1, 10 ** 5, b):\r\n ar[i] = 1\r\nfl = 0\r\nwhile fl < 10 ** 5 and ar[fl] == 1:\r\n fl += 1\r\nfor i in range(fl, 10 ** 5, c):\r\n ar[i] = 1\r\nif 0 in ar:\r\n print('NO')\r\nelse:\r\n print('YES')", "l=[int(x) for x in input().split()]\r\nl.sort()\r\nif l[0]==1 or (l[1]==2 and l[0]==2) or (l[1]==l[2] and l[0]==l[1] and l[2]==3) or l==[2,4,4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l,m,n=map(int,input().split())\r\na=[0]*1510\r\na[l]+=1\r\na[m]+=1\r\na[n]+=1\r\nif a[1]>=1 or a[2]>=2 or a[3]>=3 or (a[4]==2 and a[2]==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def possible(vals):\n if 1 in vals:\n return True\n if vals.count(2) >= 2:\n return True\n if vals.count(3) == 3:\n return True\n if vals.count(2) == 1 and vals.count(4) == 2:\n return True\n \n return False\n\nvals = list(map(int, input().split()))\n\nif possible(vals):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=sorted(map(int,input().split()))\r\nprint('YES' if a.count(1) or a.count(2) >= 2 or a.count(3) >= 3 or a == [2,4,4] else 'NO')\r\n", "lst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\nlst.sort()\r\nif lst.count(1) >= 1 or lst.count(2) >= 2 or lst.count(3) >= 3 or lst == [2, 4, 4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k1,k2,k3=map(int,input().split())\r\nfl=0\r\nfor i1 in range(5):\r\n for i2 in range(5):\r\n for i3 in range(5):\r\n flak=1\r\n for i in range(8):\r\n if (i-i1)%k1==0 or (i-i2)%k2==0 or (i-i3)%k3==0:\r\n continue\r\n else:\r\n flak=0\r\n if flak==1:\r\n fl=1\r\nif fl==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr=list(map(int,input().split()))\r\nif arr.count(1)>=1 or arr.count(2)>=2 or arr.count(3)>=3 or (arr.count(4)==2 and arr.count(2)==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys,math,fractions\r\n#sys.stdin=open('input.txt','r')\r\n#sys.stdout=open('output.txt','w')\r\ninput=sys.stdin.readline\r\ndef Str()->str:return input()\r\ndef Int()->int:return int(input())\r\ndef Float()->float:return float(input())\r\ndef Ints()->map:return map(int,input().split())\r\ndef listInt()->list:return list(Ints())\r\ndef Floats()->map:return map(float,input().split())\r\ndef listFloat()->list:return list(Floats())\r\n\r\na,b,c=sorted(Ints())\r\nif a>3:print('NO')\r\nelif a==1:print('YES')\r\nelif a==3:\r\n if c==3:print('YES')\r\n else:print('NO')\r\nelse:\r\n if b==2 or (b==4 and c==4):print('YES')\r\n else:print('NO')\r\n", "import sys\r\n#import math\r\n#import random\r\n#sys.setrecursionlimit(100000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nk1,k2,k3=invr()\r\n\r\nfor x1 in range(1,1200):\r\n\tfor x2 in range(1,1200):\r\n\t\tache=[0]*105\r\n\t\t\r\n\t\tnow=x1\r\n\t\t\r\n\t\twhile now<105:\r\n\t\t\tache[now]=1\r\n\t\t\tnow+=k1\r\n\t\t\r\n\t\tnow=x2\r\n\t\t\r\n\t\twhile now<105:\r\n\t\t\tache[now]=1\r\n\t\t\tnow+=k2\r\n\t\t\r\n\t\tbaki=[]\r\n\t\t\r\n\t\tfor i in range(1,105):\r\n\t\t\tif ache[i]==0:\r\n\t\t\t\tbaki.append(i)\r\n\t\t\r\n\t\t\r\n\t\tif len(baki)<2:\r\n\t\t\t\r\n\t\t\t#print(str(x1)+\" \"+str(x2),end=\" \")\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tflag=True\r\n\t\t\t\r\n\t\t\tfor i in range(1,len(baki)):\r\n\t\t\t\tflag&=((baki[i]-baki[i-1])%k3==0)\r\n\t\t\t\tif not flag:\r\n\t\t\t\t\tbreak\r\n\t\t\t\r\n\t\t\tif flag:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit(0)\r\n\t\t\t\r\n\r\nprint(\"NO\")\r\n\t\t\r\n\t\t\r\n", "a, b, c = map(int, input().split())\n\nif a == 1 or b == 1 or c == 1:\n print(\"YES\")\nelif a == 2 and b == 2 or a == 2 and c == 2 or b == 2 and c == 2:\n print(\"YES\")\nelif a == 2 and b == 4 and c == 4 or a == 4 and b == 4 and c == 2 or a == 4 and b == 2 and c == 4 or a == 3 and b == 3 and c == 3:\n print(\"YES\")\nelse:\n print(\"NO\")\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\nk1, k2, k3 = map(int, input().split())\r\nseq = list([k1, k2, k3])\r\nseq.sort()\r\n\r\nif (seq[0] == 1) \\\r\n or (seq[0] == 2 and seq[1] == 2) \\\r\n or (seq[0] == 2 and seq[1] == 4 and seq[2] == 4) \\\r\n or (seq[0] == 3 and seq[1] == 3 and seq[2] == 3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "def nachalo(a):\r\n\tfor i in range(1,len(a)):\r\n\t\tif a[i]==0:\r\n\t\t\treturn i\r\n\treturn 2000\r\na = list(map(int,input().split()))\r\na.sort()\r\nmin1=a[0]\r\nsecond = a[1]\r\nmax1=a[2]\r\nwas = [0]*2001\r\nb = 1\r\nwhile b<2000:\r\n\twas[b]=1\r\n\tb+=min1\r\nb = nachalo(was)\r\nwhile b<2000:\r\n\twas[b]=1\r\n\tb+=second\r\nb = nachalo(was)\r\nwhile b<2000:\r\n\twas[b]=1\r\n\tb+=max1\r\nGar=True\r\nfor i in range(1,2000):\r\n\tif was[i]==0:\r\n\t\tGar=False\r\n\t\tbreak\r\nif Gar:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\n\r\n\r\nd1,d2,d3=map(int,input().split())\r\n\r\ntemp=[d1,d2,d3]\r\ntemp.sort()\r\nif d1 == 1 or d2==1 or d3==1:\r\n print(\"YES\")\r\nelif temp[0]==temp[1]==2:\r\n print(\"YES\")\r\n \r\nelif temp==[3,3,3] or temp==[2,4,4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#for i in range(int(input())):\r\narr=list(map(int,input().split()))\r\nls=sorted(arr)\r\nif ls[0]==1 or ls[:2]==[2,2] or ls[:3]==[3,3,3] or ls[:3]==[2,4,4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check1(a, b, c):\r\n if(a == 2 and b == c == 4):\r\n return True\r\n if(b == 2 and a == c == 4):\r\n return True\r\n if(c == 2 and a == b == 4):\r\n return True\r\n return False\r\ndef check2(a,b,c):\r\n if(a == b == 2):\r\n return True\r\n if(a == c == 2):\r\n return True\r\n if(b == c == 2):\r\n return True\r\n return False\r\nk = list(map(int, input().split()))\r\ng = False\r\nif(k[0] == 1 or k[1] == 1 or k[2] == 1 or check2(k[0],k[1],k[2]) or k[0]==k[1]==k[2]==3 or check1(k[0],k[1],k[2])):\r\n print('YES')\r\nelse:\r\n print('NO')" ]

[ "# Problem: B. Word Cut\r\n# Contest: Codeforces - Croc Champ 2012 - Round 2\r\n# URL: https://codeforces.com/problemset/problem/176/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/176/B\r\n\r\n输入两个长度相等的字符串 s 和 t，长度在 [2,1000] 内，只包含小写字母。\r\n然后输入 k(0≤k≤1e5) 表示操作次数。\r\n\r\n你需要恰好执行 k 次操作。\r\n每次操作你可以把 s 分割成两个非空字符串 s1 和 s2，然后替换 s = s2 + s1。\r\n把 s 变成 t 有多少种方案？模 1e9+7。\r\n输入\r\nab\r\nab\r\n2\r\n输出 1\r\n\r\n输入\r\nababab\r\nababab\r\n1\r\n输出 2\r\n\r\n输入\r\nab\r\nba\r\n2\r\n输出 0\r\n\"\"\"\r\n\"\"\"https://codeforces.com/contest/176/submission/210387377\r\n\r\n手玩一下发现操作与「把 s 循环右移（左移）」是一样的。\r\n假设有 c 种不同的循环右移可以让 s=t。那么有 n-c 种不同的循环右移让 s≠t。\r\n定义 f[i] 表示操作 i 次后 s=t，g[i] 表示表示操作 i 次后 s≠t。\r\n那么\r\nf[i] = f[i-1] * (c-1) + g[i-1] * c\r\ng[i] = f[i-1] * (n-c) + g[i-1] * (n-c-1)\r\n初始值 f[0]=(s==t), g[0]=f[0]^1\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n s, = RS()\r\n t, = RS()\r\n k, = RI()\r\n n = len(s)\r\n f = int(s == t)\r\n g = f ^ 1\r\n s += s\r\n c = 0\r\n for i in range(n):\r\n if t == s[i:i + n]:\r\n c += 1\r\n if not c:\r\n return print(0)\r\n # print(c)\r\n\r\n for _ in range(k):\r\n f, g = (f * (c - 1) + g * c) % MOD, (f * (n - c) + g * (n - c - 1)) % MOD\r\n\r\n print(f)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "class Solution:\r\n def numberOfWays(self, s: str, t: str, k: int) -> int:\r\n mod=10**9+7\r\n n=len(s)\r\n v=self.kmp(s+s,t)\r\n g=[[v-1,v],[n-v,n-1-v]]\r\n f=self.qmi(k,g)\r\n \r\n if s==t:\r\n return f[0][0]\r\n else:\r\n return f[0][1]\r\n def kmp(self,s,p):\r\n n=len(p)\r\n m=len(s)\r\n s=\"#\"+s\r\n p=\"#\"+p\r\n ne=[0]*(n+1)\r\n j=0\r\n for i in range(2,n+1):\r\n while (j>0 and p[i]!=p[j+1]):\r\n j=ne[j]\r\n if p[i]==p[j+1]:\r\n j+=1\r\n ne[i]=j\r\n cnt=0\r\n j=0\r\n for i in range(1,m+1):\r\n while j>0 and s[i]!=p[j+1]:\r\n j=ne[j]\r\n if s[i]==p[j+1]:\r\n j+=1\r\n if j==n:\r\n if i-n+1<=n:\r\n cnt+=1\r\n j=ne[j]\r\n return cnt\r\n def mul(self,a,b):\r\n c=[[0,0],[0,0]]\r\n mod=10**9+7\r\n for i in range(2):\r\n for j in range(2):\r\n for k in range(2):\r\n c[i][k]+=a[i][j]*b[j][k]\r\n c[i][k]%=mod\r\n return c\r\n def qmi(self,k,g):\r\n f=[[1,0],[0,1]]\r\n while k>0:\r\n if k%2:\r\n f=self.mul(f,g)\r\n g=self.mul(g,g)\r\n k//=2\r\n return f \r\ns=input()\r\nt=input()\r\nk=int(input())\r\nprint(Solution().numberOfWays(s,t,k))", "s1=input()\ns2=input()\nk=int(input())\narr=[[0,0] for i in range(k+1)]\nif s1==s2:\n arr[0][0]=1\nelse:\n arr[0][1]=1\ncount=0\nn=len(s1)\nmod=10**9+7\nfor i in range(n):\n count+=s1[i:]+s1[:i]==s2\nfor i in range(1,k+1):\n arr[i][0] = (arr[i - 1][0] * (count - 1) + arr[i - 1][1] * count) % mod\n arr[i][1] = (arr[i - 1][1] * (n - count - 1) + arr[i - 1][0] * (n - count)) % mod\nprint(arr[k][0])# 1698168401.090061", "import sys\r\n\r\n# import itertools\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from collections import *\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\nMOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n s = input()\r\n t = input()\r\n k = sint()\r\n n, m = len(s), 0\r\n for i in range(n):\r\n if s[i:] + s[:i] == t: m += 1\r\n if m == 0:\r\n print(0)\r\n return\r\n dp = [0] * 2\r\n dp[int(s==t)] = 1\r\n l = n - m\r\n for _ in range(k):\r\n dp[0], dp[1] = (dp[0] * (l - 1) + dp[1] * l) % MOD, (dp[0] * m + dp[1] * (m - 1)) % MOD\r\n print(dp[1])\r\n\r\nsolve()", "\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n t = input()\r\n k = int(input())\r\n n = len(s)\r\n MOD = 10 ** 9 + 7\r\n c = 0\r\n ss = s + s \r\n for i in range(n):\r\n if ss[i:i+n] == t: c += 1\r\n \r\n f = 0\r\n if s == t: f = 1\r\n g = f ^ 1\r\n\r\n for i in range(k):\r\n f, g = (f * (c-1) + g * c) % MOD, (f * (n-c) + g * (n-c-1)) % MOD\r\n \r\n print(f)", "import sys \r\nimport math\r\nimport heapq\r\n\r\n# solve stack overflow\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n 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:break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\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 LMII():\r\n return list(map(int, input().split()))\r\n#-------------------head-----------------#\r\n\r\nP = 10 ** 9 + 7\r\ns, t = I(), I()\r\nk = II()\r\nn = len(s)\r\nstr = s + s\r\nok = []\r\nfor i in range(n):\r\n if str[i:i+n] == t:\r\n ok.append(i)\r\ndp = [0] * n\r\ndp[0] = 1\r\nfor i in range(k):\r\n ndp = [0] * n\r\n Sum = sum(dp)\r\n for j in range(n):\r\n ndp[j] = (Sum - dp[j] + P) % P\r\n dp = ndp.copy()\r\nans = 0\r\nfor x in ok:\r\n ans += dp[x]\r\n ans %= P\r\nprint(ans)\r\n\r\n\r\n", "s1=input()\r\ns2=input()\r\nk=int(input())\r\narr=[[0,0] for i in range(k+1)]\r\nif s1==s2:\r\n arr[0][0]=1\r\nelse:\r\n arr[0][1]=1\r\ncount=0\r\nn=len(s1)\r\nmod=10**9+7\r\nfor i in range(n):\r\n count+=s1[i:]+s1[:i]==s2\r\nfor i in range(1,k+1):\r\n arr[i][0] = (arr[i - 1][0] * (count - 1) + arr[i - 1][1] * count) % mod\r\n arr[i][1] = (arr[i - 1][1] * (n - count - 1) + arr[i - 1][0] * (n - count)) % mod\r\nprint(arr[k][0])", "import math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heappush, heappop\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\n\r\nmod = int(1e9 + 7)\r\n\r\n\r\ndef mat_mul(a, b):\r\n I, J, K = len(a), len(b[0]), len(b)\r\n c = [[0] * J for _ in range(I)]\r\n for i in range(I):\r\n for j in range(J):\r\n for k in range(K):\r\n c[i][j] += a[i][k] * b[k][j]\r\n c[i][j] %= mod\r\n return c\r\n\r\n\r\ndef mat_pow(x, n):\r\n y = [[0] * len(x) for _ in range(len(x))]\r\n\r\n for i in range(len(x)):\r\n y[i][i] = 1\r\n\r\n while n > 0:\r\n if n & 1:\r\n y = mat_mul(x, y)\r\n x = mat_mul(x, x)\r\n n //= 2\r\n\r\n return y\r\n\r\n\r\ns = I()\r\nt = I()\r\nn = len(s)\r\nk = ii()\r\nss = s + s\r\ncnt = 0\r\nfor i in range(n):\r\n if ss[i:i + n] == t:\r\n cnt += 1\r\nf = 0\r\nif s == t:\r\n f = 1\r\ng = f ^ 1\r\nres = [[f], [g]]\r\nmatrix = [[cnt - 1, cnt], [n - cnt, n - cnt - 1]]\r\na = mat_pow(matrix, k)\r\nans = mat_mul(a, res)\r\nprint(ans[0][0])\r\n", "s1=input()\r\ns2=input()\r\nK=int(input())\r\n\r\nok=True\r\nposs=False\r\na=0\r\nb=0\r\np=10**9+7\r\n\r\nfor i in range(len(s1)):\r\n k=0\r\n ok=True\r\n for j in range(i,len(s1)):\r\n if s1[j]!=s2[k]:\r\n ok=False\r\n k+=1\r\n for j in range(i):\r\n if s1[j]!=s2[k]:\r\n ok=False\r\n k+=1\r\n\r\n if ok:\r\n a+=1\r\n poss=True\r\n else:\r\n b+=1\r\n\r\nif not poss:\r\n print(0)\r\nelse:\r\n dp1=[0 for i in range(K+1)]\r\n dp2=[0 for i in range(K+1)]\r\n\r\n if s1==s2:\r\n dp1[0]=1\r\n else:\r\n dp2[0]=1\r\n\r\n for i in range(1,K+1):\r\n dp1[i]=(dp1[i-1]*(a-1)+dp2[i-1]*a)%p\r\n dp2[i]=(dp1[i-1]*b+dp2[i-1]*(b-1))%p\r\n\r\n print(dp1[-1])", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n MOD = 10**9 + 7\r\n s = input()[:-1]\r\n t = input()[:-1]\r\n k = int(input())\r\n same_count = 0\r\n different_count = 0\r\n n = len(s)\r\n for i in range(n):\r\n if s[i:] + s[:i] == t:\r\n same_count += 1\r\n else:\r\n different_count += 1\r\n if k == 0:\r\n if s == t:\r\n print(1)\r\n else:\r\n print(0)\r\n else:\r\n if s == t:\r\n same = same_count - 1\r\n different = different_count\r\n else:\r\n same = same_count\r\n different = different_count - 1\r\n for i in range(k - 1):\r\n nxt_same = (same * (same_count - 1) + different * same_count) % MOD\r\n nxt_different = (same * different_count + different * (different_count - 1)) % MOD\r\n same, different = nxt_same, nxt_different\r\n print(same)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import inf\n\ns = input()\nt = input()\nk = int(input())\nn = len(s)\nmark = 0\n\n\ndef check(i) -> bool:\n a = 0\n b = i\n while a < len(s):\n if t[a] != s[b % n]: return False\n a += 1\n b += 1\n return True\n\n\nfor i in range(len(s)):\n if check(i): mark += 1\n\nMOD = 10 ** 9 + 7\nif check(0):\n c0 = 1\n c1 = 0\nelse:\n c1 = 1\n c0 = 0\n\nif mark == 0:\n print(0)\nelse:\n for i in range(k):\n x = c0 * (mark - 1) + c1 * mark\n y = c1 * (n - mark - 1) + c0 * (n - mark)\n c0 = x % MOD\n c1 = y % MOD\n print(c0)\n", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, comb, factorial\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10**9+7\r\n\r\ndef solve():\r\n s, t = I(), I()\r\n k = II()\r\n\r\n ss = s+s\r\n cnt = 0\r\n n = len(s)\r\n for i in range(n):\r\n if ss[i:i+n] == t:\r\n cnt += 1\r\n\r\n f = int(s == t)\r\n g = f^1\r\n for _ in range(k):\r\n f, g = f*(cnt-1)+g*cnt, f*(n-cnt)+g*(n-cnt-1)\r\n f %= MOD\r\n g %= MOD\r\n print(f)\r\n return\r\n\r\nsolve()\r\n", "start,end,k=input(),input(),int(input())\r\nn,mod=len(end),10**9+7\r\ndp=[1,0]\r\npsum=1\r\nfor i in range(k):\r\n\tdp[0]=psum-dp[0]\r\n\tdp[1]=psum-dp[1]\r\n\tpsum=(dp[0]+((n-1)*dp[1])%mod)%mod\r\nans=0\r\nfor i in range(n):\r\n\tif start[i:]+start[:i]==end:\r\n\t\tif i==0:ans+=dp[0]\r\n\t\telse:ans+=dp[1]\r\nprint(ans%mod)", "a = input()\r\nb = input()\r\nk = int(input())\r\nn=len(a)\r\nx,y=(a==b),(a!=b)\r\nb+=b\r\nz=sum(a==b[i:i+n] for i in range(n))\r\nt=n-z\r\nM=10**9+7\r\nfor _ in range(k):\r\n x,y= (x*(z-1)+y*z)%M, (x*t+y*(t-1))%M\r\nprint(int(x))\r\n", "s = input()\r\nt = input()\r\nk = int(input())\r\nn = len(s)\r\nmatch = 0\r\nMod = 10 ** 9 + 7\r\nfor i in range(n):\r\n match += (s[i + 1:] + s[:i + 1] == t)\r\n\r\nf = int(s == t)\r\ng = f ^ 1\r\n\r\nfor _ in range(k):\r\n f, g = (match * g + (match - 1) * f) % Mod, ((n - 1 - match) * g + (n - match) * f) % Mod\r\nprint(f)", "# _ooOoo_\r\n# o8888888o\r\n# 88\" . \"88\r\n# (| -_- |)\r\n# O\\ = /O\r\n# ____/`---'\\____\r\n# .' \\\\| |// `.\r\n# / \\\\||| : |||// \\\r\n# / _||||| -:- |||||- \\\r\n# | | \\\\\\ - /// | |\r\n# | \\_| ''\\---/'' | |\r\n# \\ .-\\__ `-` ___/-. /\r\n# ___`. .' /--.--\\ `. . __\r\n# .\"\" '< `.___\\_<|>_/___.' >'\"\".\r\n# | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\r\n# \\ \\ `-. \\_ __\\ /__ _/ .-` / /\r\n# ======`-.____`-.___\\_____/___.-`____.-'======\r\n# `=---='\r\n# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\r\n# 佛祖保佑 永无BUG\r\n\r\nimport sys\r\n# sys.setrecursionlimit(int(1e9))\r\nimport random\r\nfrom typing import List\r\nfrom copy import deepcopy\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce\r\nfrom itertools import accumulate,product\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\n# from bisect import bisect_left,bisect_right\r\n# from sortedcontainers import *\r\n# input = sys.stdin.buffer.readline\r\nimport re\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef mp(): return list(map(int, input().split()))\r\ndef it(): return int(input())\r\nfrom math import *\r\n\r\nMOD = int(1e9 + 7)\r\nINF = int(1e18)\r\n\r\ndef numberOfWays(s: str, t: str, k: int) -> int:\r\n # f[i][0] = f[i - 1][0] * (c - 1) + f[i - 1][1] * c\r\n # f[i][1] = f[i - 1][0] * (n - c) + f[i - 1][1] * (n - 1 - c)\r\n nxt = []\r\n def builtNxt(p):\r\n nxt.append(0)\r\n x, now = 1, 0\r\n while x < len(p):\r\n if p[now] == p[x]:\r\n now, x = now + 1, x + 1\r\n nxt.append(now)\r\n elif now:\r\n now = nxt[now - 1]\r\n else:\r\n nxt.append(0)\r\n x += 1\r\n def search(p, s):\r\n tar, pos = 0, 0\r\n lenP = len(p)\r\n ret = 0\r\n while tar < len(s):\r\n if s[tar] == p[pos]:\r\n tar, pos = tar + 1, pos + 1\r\n elif pos:\r\n pos = nxt[pos - 1] # 将指针直接移动到无需判断的前缀之后\r\n else:\r\n tar += 1\r\n\r\n if pos == lenP:\r\n if tar - lenP < n:\r\n ret += 1\r\n pos = nxt[pos - 1]\r\n return ret\r\n builtNxt(t)\r\n n = len(s)\r\n mod = 10**9 + 7\r\n cnt = search(t, s + s)\r\n if s == t:\r\n f = [1, 0]\r\n else:\r\n f = [0, 1]\r\n for i in range(k):\r\n a, b = f[0] * (cnt - 1) + f[1] * cnt, f[0] * (n - cnt) + f[1] * (n - 1 - cnt)\r\n f = [a % mod, b % mod]\r\n return f[0]\r\n\r\nif __name__ == '__main__':\r\n \r\n s = input()\r\n t = input()\r\n k = it()\r\n print(numberOfWays(s, t, k))", "P = int(1E9) + 7\r\n\r\ndef z_function(s):\r\n n = len(s)\r\n z = [0] * n\r\n l, r = 0, 0\r\n for i in range(1, n):\r\n z[i] = 0 if i >= r else min(r - i, 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] > r:\r\n l, r = i, i + z[i]\r\n return z\r\n\r\ns = input()\r\nt = input()\r\nk = int(input())\r\nn = len(s)\r\n\r\nz = z_function(t + s + s)\r\ngood = []\r\nfor i in range(n, 2 * n):\r\n if z[i] >= n:\r\n good.append(i - n)\r\n\r\nzero = 1\r\nother = 0\r\nwhile k > 0:\r\n new_zero = (n - 1) * other % P\r\n new_other = (zero + (n - 2) * other) % P\r\n zero, other = new_zero, new_other\r\n k -= 1\r\n\r\nans = sum(zero if x == 0 else other for x in good) % P\r\nprint(ans)", "# LUOGU_RID: 119391689\nMOD = 10**9 + 7\n\ndef count_rotations(a, b):\n n = len(a)\n x = 0\n for i in range(n):\n flag = True\n for j in range(n):\n if a[(i+j) % n] != b[j]:\n flag = False\n break\n if flag:\n x += 1\n\n return x\n\ndef count_ways(a, b, k):\n n = len(a)\n dp = [[0, 0] for _ in range(k + 1)]\n\n if a == b:\n dp[0][0] = 1\n else:\n dp[0][1] = 1\n\n x = count_rotations(a, b)\n\n for i in range(k):\n dp[i+1][0] = (x * dp[i][1] + (x - 1) * dp[i][0]) % MOD\n dp[i+1][1] = ((n - x) * dp[i][0] + (n - x - 1) * dp[i][1]) % MOD\n\n return dp[k][0]\n\nif __name__ == \"__main__\":\n a = input().strip()\n b = input().strip()\n k = int(input().strip())\n\n result = count_ways(a, b, k)\n print(result)\n", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nM = lambda:map(int,input().split())\r\nfrom collections import deque\r\ninf = float('inf')\r\nmod = 10**9+7\r\na = input()\r\na += a\r\nb = input()\r\nn = len(b)\r\nk = int(input())\r\nbo = [0]*n\r\nfor i in range(n):\r\n if a[i:i+n] == b:\r\n bo[i] = 1\r\nres = [0]*n\r\nres[0] = 1\r\nfor i in range(k):\r\n sm = sum(res)%mod\r\n for j in range(n):\r\n res[j] = (sm-res[j])%mod\r\nans = 0\r\nfor i in range(n):\r\n ans += bo[i]*res[i]\r\n ans %= mod\r\nprint(ans)", "s = input()\r\nt = input()\r\nk = int(input())\r\n\r\nmod = 10 ** 9 + 7\r\nn = len(s)\r\nstatus1 = 0\r\nstatus2 = 0\r\nfor i in range(n):\r\n if s[i:] + s[:i] == t: status1 += 1\r\n else: status2 += 1\r\n\r\ndp0, dp1 = (0, 1) if s == t else (1, 0)\r\nfor _ in range(k):\r\n dp0, dp1 = (dp0 + dp1) * status2 % mod - dp0, (dp0 + dp1) * status1 % mod - dp1 \r\nprint(dp1 % mod)", "import math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heappush, heappop\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\nmod = int(1e9 + 7)\r\n\r\ns = I()\r\nt = I()\r\nn = len(s)\r\nk = ii()\r\nss = s + s\r\ncnt = 0\r\nfor i in range(n):\r\n if ss[i:i + n] == t:\r\n cnt += 1\r\nf = 0\r\nif s == t:\r\n f = 1\r\ng = f ^ 1\r\nfor i in range(k):\r\n f,g = (f * (cnt - 1) + g * cnt) % mod,(f * (n - cnt) + g * (n - cnt - 1))% mod\r\nprint(f)\r\n\r\n", "MOD = int(1e9) + 7\r\nif __name__ == \"__main__\":\r\n a = input()\r\n b = input()\r\n k = int(input())\r\n if(len(a) != len(b)):\r\n print(0)\r\n exit()\r\n a = a + a\r\n x = 0\r\n y = 0\r\n for i in range(len(a) // 2):\r\n flag = 1\r\n for j in range(len(b)):\r\n if(a[j + i] != b[j]):\r\n flag = 0\r\n break\r\n if(flag == 1):\r\n x += 1\r\n else:\r\n y += 1\r\n flag = 0\r\n for i in range(len(b)):\r\n if(a[i] != b[i]):\r\n flag = 1\r\n u = 1\r\n v = 0\r\n if(flag == 1):\r\n v = 1\r\n u = 0\r\n for i in range(k):\r\n uu = (u * (x - 1)) % MOD + (v * (x)) % MOD\r\n vv = (u * (y)) % MOD + (v * (y - 1)) % MOD\r\n u = uu % MOD\r\n v = vv % MOD\r\n print(u)\r\n\r\n\r\n", "import sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n mod = 10**9 + 7\r\n s = ac.read_str()\r\n t = ac.read_str()\r\n k = ac.read_int()\r\n n = len(s)\r\n good = 0\r\n for i in range(n):\r\n w = s[i:] + s[:i]\r\n if w == t:\r\n good += 1\r\n if s == t:\r\n f = 1\r\n g = 0\r\n else:\r\n f = 0\r\n g = 1\r\n for i in range(1, k + 1):\r\n f, g = f * (good - 1) + g * good, f * (n - good) + g * (n - good - 1)\r\n f %= mod\r\n g %= mod\r\n ac.st(f)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "MOD = int(1e9) + 7\r\nif __name__ == \"__main__\":\r\n a, b, k = input(), input(), int(input())\r\n x, y = (1, 0) if a == b else (0, 1)\r\n n = len(b)\r\n b += b\r\n same = sum(a == b[i: i + n] for i in range(n))\r\n diff = n - same\r\n for _ in range(k):\r\n x, y = ((x * (same - 1)) % MOD + (y * same) % MOD) % MOD, ((x * (diff)) % MOD + (y * (diff - 1)) % MOD) % MOD\r\n print(x)\r\n" ]

[ "from collections import defaultdict, deque, Counter\r\nimport sys\r\nfrom decimal import *\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nimport random\r\nimport string\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product\r\nfrom operator import mul, itemgetter\r\nfrom functools import reduce, lru_cache\r\nfrom bisect import bisect_left, bisect_right\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n# sys.setrecursionlimit(10000000)\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\ninf = float('inf')\r\neps = 10 ** (-12)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\ndef make_divisors(n):\r\n divisors = []\r\n for i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n # √nで無い数についてもう一個プラス\r\n if i != n // i:\r\n divisors.append(n // i)\r\n return sorted(divisors)\r\n\r\nN = getN()\r\nA = getList()\r\nma = max(A)\r\nL = [0] * (ma + 1)\r\n\r\nfor a in A:\r\n for m in make_divisors(a):\r\n L[m] += 1\r\n\r\nC = [0] * (ma + 1)\r\npo = [1]\r\nfor i in range(N):\r\n po.append((po[-1] * 2) % mod)\r\n\r\nfor g in range(ma, 1, -1):\r\n C[g] += (po[L[g]] - 1) % mod\r\n for j in range(2 * g, ma + 1, g):\r\n C[g] -= C[j]\r\n C[g] %= mod\r\n \r\nprint(((po[N] - 1) - sum(C)) % mod)\r\n", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().rstrip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nceil_ = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\nMint, Mlong, out = 2 ** 30 - 1, 2 ** 62 - 1, []\r\n\r\nmod = 10 ** 9 + 7\r\nadd = lambda a, b: (a % mod + b % mod) % mod\r\nmult = lambda a, b: (a % mod * b % mod) % mod\r\n\r\nfor _ in range(1):\r\n n, a = int(input()), array('i', inp(int))\r\n ans, divs = 0, array('i', [0] * (10 ** 5 + 10))\r\n po = array('i', [1] * (n + 1))\r\n dp = array('i', [0] * (10 ** 5 + 1))\r\n\r\n for i in range(1, n + 1):\r\n po[i] = mult(po[i - 1], 2)\r\n divs[a[i - 1]] += 1\r\n\r\n for g in range(10 ** 5, 0, -1):\r\n ext, cur, num = 0, g * 2, divs[g]\r\n\r\n while cur <= 10 ** 5:\r\n num += divs[cur]\r\n ext = add(ext, dp[cur])\r\n cur += g\r\n\r\n dp[g] = add(po[num] - 1, mult(-1, ext))\r\n\r\n out.append(dp[1])\r\nprint('\\n'.join(map(str, out)))\r\n", "import sys\r\nfrom collections import Counter\r\nreadline=sys.stdin.readline\r\n\r\nclass Prime:\r\n def __init__(self,N):\r\n assert N<=10**8\r\n self.smallest_prime_factor=[None]*(N+1)\r\n for i in range(2,N+1,2):\r\n self.smallest_prime_factor[i]=2\r\n n=int(N**.5)+1\r\n for p in range(3,n,2):\r\n if self.smallest_prime_factor[p]==None:\r\n self.smallest_prime_factor[p]=p\r\n for i in range(p**2,N+1,2*p):\r\n if self.smallest_prime_factor[i]==None:\r\n self.smallest_prime_factor[i]=p\r\n for p in range(n,N+1):\r\n if self.smallest_prime_factor[p]==None:\r\n self.smallest_prime_factor[p]=p\r\n self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]]\r\n\r\n def Factorize(self,N):\r\n assert N>=1\r\n factors=defaultdict(int)\r\n if N<=len(self.smallest_prime_factor)-1:\r\n while N!=1:\r\n factors[self.smallest_prime_factor[N]]+=1\r\n N//=self.smallest_prime_factor[N]\r\n else:\r\n for p in self.primes:\r\n while N%p==0:\r\n N//=p\r\n factors[p]+=1\r\n if N<p*p:\r\n if N!=1:\r\n factors[N]+=1\r\n break\r\n if N<=len(self.smallest_prime_factor)-1:\r\n while N!=1:\r\n factors[self.smallest_prime_factor[N]]+=1\r\n N//=self.smallest_prime_factor[N]\r\n break\r\n else:\r\n if N!=1:\r\n factors[N]+=1\r\n return factors\r\n\r\n def Divisors(self,N):\r\n assert N>0\r\n divisors=[1]\r\n for p,e in self.Factorize(N).items():\r\n A=[1]\r\n for _ in range(e):\r\n A.append(A[-1]*p)\r\n divisors=[i*j for i in divisors for j in A]\r\n return divisors\r\n\r\n def Is_Prime(self,N):\r\n return N==self.smallest_prime_factor[N]\r\n\r\n def Totient(self,N):\r\n for p in self.Factorize(N).keys():\r\n N*=p-1\r\n N//=p\r\n return N\r\n\r\n def Mebius(self,N):\r\n fact=self.Factorize(N)\r\n for e in fact.values():\r\n if e>=2:\r\n return 0\r\n else:\r\n if len(fact)%2==0:\r\n return 1\r\n else:\r\n return -1\r\n\r\nN=int(readline())\r\nM=10**5\r\nmod=10**9+7\r\nP=Prime(M)\r\ncnt=[0]*(M+1)\r\nfor a,c in Counter(map(int,readline().split())).items():\r\n cnt[a]=c\r\nfor p in P.primes:\r\n for i in range(M-M%p,0,-p):\r\n cnt[i//p]+=cnt[i]\r\n cnt[i//p]%=mod\r\nfor i in range(1,M+1):\r\n cnt[i]=pow(2,cnt[i],mod)-1\r\nfor p in P.primes:\r\n for i in range(p,M+1,p):\r\n cnt[i//p]-=cnt[i]\r\n cnt[i//p]%=mod\r\nans=cnt[1]\r\nprint(ans)", "# Problem - F - Codeforces\r\n\r\n# 題意：\r\n# 給 N 個元素的數列 A。問有幾種不同的非空子序列，其最大公因數不為 1。輸出方案數對 1e9 + 7 取模。\r\n\r\n# 制約：\r\n# The first line contains one integer number n (1 ≤ n ≤ 100000).\r\n# The second line contains n integer numbers a1, a2... an (1 ≤ ai ≤ 100000).\r\n\r\n# 解法：\r\n# 看起來就很排容。\r\n# 首先計算：\r\n# mcnt[ i ]: i 的倍數的元素數量。\r\n# mans[ i ]: 最大公因數為 i 的倍數的非空子序列數量。\r\n# mans[ i ] = pow( 2, mcnt[ i ] ) - 1\r\n# ans[ i ]: 最大公因數為 i 的非空子序列數量。\r\n# ans[ i ] = mans[ i ] - ( ans[ j ] for all j that j % i == 0 if j > i )\r\n# 非空的部分要特別注意，一開始就要捨掉，因為它沒有因數倍數的概念。\r\n\r\n# 時間 / 空間複雜度：\r\n# O( MAXA lg MAXA ) / O( MAXA )\r\n\r\nMOD = int( 1e9 ) + 7\r\n\r\nN = int( input() )\r\nA = list( map( int, input().split() ) )\r\n\r\npow2 = [ pow( 2, i, MOD ) for i in range( N + 1 ) ]\r\n\r\nmaxa = max( A )\r\nmcnt = [ 0 for i in range( maxa + 1 ) ]\r\nmans = [ 0 for i in range( maxa + 1 ) ]\r\nfor i in range( N ):\r\n mcnt[ A[ i ] ] += 1\r\nfor i in range( 1, maxa + 1 ):\r\n for j in range( i + i, maxa + 1, i ):\r\n mcnt[ i ] += mcnt[ j ]\r\n mans[ i ] = pow2[ mcnt[ i ] ] - 1\r\nfor i in range( maxa, 0, -1 ):\r\n for j in range( i + i, maxa + 1, i ):\r\n mans[ i ] = ( mans[ i ] - mans[ j ] ) % MOD\r\nprint( mans[ 1 ] + ( mans[ 1 ] < 0 ) * MOD )", "N = 100010\nmod = 10**9 + 7\n\na = [0] * N\ndp = [0] * N\np = [0] * N\n\nn = int(input())\np[0] = 1\nx = list(map(int,input().split()))\nfor i in range(1, n+1):\n p[i] = (p[i - 1] * 2) % mod\n a[x[i-1]] += 1\n\nfor i in range(N - 1, 0, -1):\n sum = 0\n for j in range(i, N, i):\n sum += a[j]\n dp[i] = (p[sum] - 1) % mod\n for j in range(2 * i, N, i):\n dp[i] = (dp[i] - dp[j] + mod) % mod\n\nprint(dp[1])\n\n \t \t\t\t \t\t\t\t \t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nmod = pow(10, 9) + 7\r\na = list(map(int, input().split()))\r\nl = 100000\r\ncnt = [0] * (l + 1)\r\nfor i in a:\r\n cnt[i] += 1\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1] % mod)\r\nans = pow2[n] - 1\r\nx = [-1] * (l + 1)\r\nfor i in range(2, l + 1):\r\n c = cnt[i]\r\n xi = x[i]\r\n for j in range(2 * i, l + 1, i):\r\n c += cnt[j]\r\n x[j] -= xi\r\n ans += xi * (pow2[c] - 1) % mod\r\n ans %= mod\r\nprint(ans)", "n=int(input())\r\nL=list(map(int,input().split(' ')))\r\nD=[0]*101000\r\nmod=10**9+7\r\nitt=[0]*101000\r\np=[0]*100010\r\nD[0]=1\r\nfor i in range(100010):\r\n D[i+1]=(D[i]*2)%mod\r\nfor i in range(n):\r\n itt[L[i]]+=1 \r\n\r\nfor i in range(1,100001):\r\n for j in range(i*2,100001,i):\r\n itt[i]+=itt[j]\r\n p[i]=(D[itt[i]]+mod-1)%mod\r\ni=100000\r\nwhile i>=1:\r\n for j in range(i*2,100001,i):\r\n p[i]-=p[j]\r\n p[i]=(p[i]%mod+mod)%mod\r\n i-=1\r\nprint(p[1])\r\n \r\n", "MOD = int( 1e9 ) + 7\r\n\r\nN = int( input() )\r\nA = list( map( int, input().split() ) )\r\n\r\npow2 = [ pow( 2, i, MOD ) for i in range( N + 1 ) ]\r\n\r\nmaxa = max( A )\r\nmcnt = [ 0 for i in range( maxa + 1 ) ]\r\nmans = [ 0 for i in range( maxa + 1 ) ]\r\nfor i in range( N ):\r\n mcnt[ A[ i ] ] += 1\r\nfor i in range( 1, maxa + 1 ):\r\n for j in range( i + i, maxa + 1, i ):\r\n mcnt[ i ] += mcnt[ j ]\r\n mans[ i ] = pow2[ mcnt[ i ] ] - 1\r\nfor i in range( maxa, 0, -1 ):\r\n for j in range( i + i, maxa + 1, i ):\r\n mans[ i ] = ( mans[ i ] - mans[ j ] ) % MOD\r\nprint( mans[ 1 ] + ( mans[ 1 ] < 0 ) * MOD )\r\n", "import sys\r\n\r\nmod = 10**9 + 7\r\n\r\ndef solve():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n\r\n cnt = [0]*(10**5 + 1)\r\n\r\n for ai in a:\r\n for d in range(1, ai + 1):\r\n if d*d > ai:\r\n break\r\n if ai % d == 0:\r\n if d != ai // d:\r\n cnt[d] += 1\r\n cnt[ai // d] += 1\r\n else:\r\n cnt[d] += 1\r\n\r\n ans = 0\r\n\r\n for i in range(1, 10**5 + 1):\r\n ans += mobius(i) * (pow(2, cnt[i], mod) - 1)\r\n ans %= mod\r\n\r\n print(ans)\r\n\r\ndef mobius(x):\r\n assert x >= 1\r\n\r\n divcnt = 0\r\n\r\n for p in range(2, x + 1):\r\n if p*p > x:\r\n break\r\n if x % p != 0:\r\n continue\r\n\r\n x //= p\r\n\r\n if x % p == 0:\r\n return 0\r\n else:\r\n divcnt ^= 1\r\n\r\n if x > 1:\r\n divcnt ^= 1\r\n\r\n return (-1)**divcnt\r\n\r\nif __name__ == '__main__':\r\n solve()", "M=10**9+7\r\ndef modpow(x, p):\r\n if p==0:\r\n return 1\r\n if p<0:\r\n return modpow(x, (2-M)*p)\r\n y=modpow(x, p//2)\r\n if p%2:\r\n return (y*y*x)%M\r\n return (y*y)%M\r\nR=10**5\r\nn=int(input())\r\na=[0]*(R+1)\r\nfor e in input().split():\r\n a[int(e)]+=1\r\nb=[0]*(R+1)\r\nfor i in range(R, 0, -1):\r\n j=i\r\n while j<=R:\r\n b[i]+=a[j]\r\n b[i]%=M\r\n j+=i\r\nc=[0]*(R+1)\r\nfor i in range(R, 0, -1):\r\n c[i]=modpow(2, b[i])-1\r\n j=2*i\r\n while j<=R:\r\n c[i]-=c[j]\r\n c[i]%=M\r\n j+=i\r\nprint(c[1])", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().rstrip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nceil_ = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\nMint, Mlong, out = 2 ** 30 - 1, 2 ** 62 - 1, []\r\n\r\n\r\ndef mobius(n):\r\n '''Calculate mobius function [0,-1,1]'''\r\n num_prim = array('i', [0] * (n + 1))\r\n vis = array('b', [0] * (n + 1))\r\n\r\n for i in range(2, n + 1):\r\n if not num_prim[i]:\r\n for j in range(i, n + 1, i):\r\n if vis[j]: continue\r\n num_prim[j] += 1\r\n if j % (i ** 2) == 0:\r\n num_prim[j], vis[j] = 0, 1\r\n\r\n for i in range(n + 1):\r\n if not vis[i]:\r\n num_prim[i] = (-1) ** num_prim[i]\r\n\r\n return num_prim\r\n\r\n\r\ndef factorize(n) -> list:\r\n c, ans = 1, []\r\n while (c * c < n):\r\n if n % c == 0:\r\n ans.extend([c, n // c])\r\n c += 1\r\n\r\n if c * c == n: ans.append(c)\r\n return sorted(ans)\r\n\r\n\r\nmod = 10 ** 9 + 7\r\nadd = lambda a, b: (a % mod + b % mod) % mod\r\nmult = lambda a, b: (a % mod * b % mod) % mod\r\n\r\nfor _ in range(1):\r\n n, a = int(input()), array('i', inp(int))\r\n mo = mobius(10 ** 5 + 10)\r\n ans, divs = 0, array('i', [0] * (10 ** 5 + 10))\r\n po = array('i', [1] * (n + 1))\r\n\r\n for i in range(1, n + 1): po[i] = mult(po[i - 1], 2)\r\n\r\n for i in range(n):\r\n for fac in factorize(a[i]):\r\n divs[fac] += 1\r\n\r\n for i in range(1, 10 ** 5 + 1):\r\n ans = add(ans, mult(mo[i], add(po[divs[i]], -1)))\r\n\r\n out.append(ans)\r\nprint('\\n'.join(map(str, out)))\r\n", "\nmod = int(1e9 + 7)\n\nn = int(input())\na = [int(_) for _ in input().split()]\n\nfreq = {i: 0 for i in range(100001)}\npower = {0: 1}\nfor i in range(1, 100001):\n power[i] = (2 * power[i - 1]) % mod\n\nfor v in a:\n freq[v] += 1\n\ndp = {i: 0 for i in range(100001)}\nfor gcd in range(100000, 0, -1):\n mult = 2\n total = freq[gcd]\n complement = 0\n # xy = k, so integral is ln(x)\n while mult * gcd <= 100000:\n total += freq[mult * gcd]\n complement += dp[mult * gcd]\n mult += 1\n dp[gcd] = (power[total] - 1 - complement + mod) % mod\n\nprint(dp[1])", "fact=[1]\r\ntemp=1\r\nMOD=10**9+7\r\nfor i in range(1,10**5+5):\r\n temp*=i\r\n temp%=MOD\r\n fact+=[temp]\r\ndef bino(a,b):\r\n up=fact[a]\r\n down=pow(fact[b]*fact[a-b],MOD-2,MOD)\r\n return (up*down)%MOD\r\n\r\n\r\ndef find(A):\r\n MOD=10**9+7\r\n \r\n \r\n dp=[0]*(10**5+2)\r\n for x in A:\r\n dp[x]+=1\r\n for i in range(2,len(dp)):\r\n for j in range(2,len(dp)):\r\n if i*j>len(dp)-1:\r\n break\r\n dp[i]+=dp[i*j]\r\n for i in range(2,len(dp)):\r\n dp[i]=(pow(2,dp[i],MOD)-1)%MOD\r\n \r\n for i in range(len(dp)-1,1,-1):\r\n for j in range(2,len(dp)):\r\n if i*j>=len(dp):\r\n break\r\n dp[i]-=dp[i*j]\r\n dp[i]%=MOD\r\n \r\n ans=0\r\n for i in range(2,len(dp)):\r\n ans+=dp[i]\r\n ans%=MOD\r\n \r\n return (pow(2,len(A),MOD)-ans-1)%MOD\r\ninput()\r\nprint(find(list(map(int,input().strip().split(' '))))) \r\n \r\n ", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef getMul(x):\r\n a = 1\r\n for xi in x:\r\n a *= xi\r\n return a\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor ai in a:\r\n if ai in d: d[ai] += 1\r\n else: d[ai] = 1\r\n\r\nf = [[] for i in range(max(a)+10)]\r\nfor i in range(1, len(f)):\r\n for j in range(i, len(f), i):\r\n f[j].append(i)\r\n\r\nseq = [0 for i in range(max(a)+10)]\r\nfor ai in d:\r\n for fi in f[ai]:\r\n seq[fi] += d[ai]\r\nfor i in range(len(seq)):\r\n seq[i] = (pow(2, seq[i], MOD) -1 +MOD) % MOD\r\n\r\npf = [[] for i in range(max(a)+10)]\r\npf[0] = None\r\npf[1].append(1)\r\nfor i in range(2, len(f)):\r\n if len(pf[i]) == 0:\r\n for j in range(i, len(pf), i):\r\n pf[j].append(i)\r\nfor i in range(1, len(pf)):\r\n mul = getMul(pf[i])\r\n if mul == i:\r\n if len(pf[i])&1 == 1: pf[i] = -1\r\n else: pf[i] = 1\r\n else:\r\n pf[i] = 0\r\npf[1] = 1\r\n\r\nans = 0\r\nfor i in range(1, len(seq)):\r\n ans += seq[i]*pf[i]\r\n ans = (ans + MOD) % MOD\r\nprint(ans)", "mod = 1000000007\r\n\r\nN = 100001\r\n\r\nis_prime = [True] * N\r\nprimes = []\r\n\r\nmu = [0] * N\r\nmu[1] = 1\r\n\r\npow2 = [0] * N\r\npow2[0] = 1\r\npow2[1] = 2\r\n\r\nfor i in range(2, N):\r\n if is_prime[i]:\r\n primes.append(i)\r\n mu[i] = -1\r\n for p in primes:\r\n t = i * p\r\n if t >= N:\r\n break\r\n is_prime[t] = False\r\n if i % p == 0:\r\n mu[t] = 0\r\n break\r\n mu[t] = -mu[i]\r\n pow2[i] = (pow2[i - 1] << 1) % mod\r\n\r\n\r\nn = int(input())\r\n\r\nmaxa = 0\r\ncnt = [0] * N\r\nfor a in map(int, input().split()):\r\n maxa = max(maxa, a)\r\n cnt[a] += 1\r\n\r\nans = pow2[n] - 1\r\nfor i in range(2, maxa + 1):\r\n if mu[i] == 0:\r\n continue\r\n s = 0\r\n for j in range(i, maxa + 1, i):\r\n s = (s + cnt[j]) % mod\r\n ans = (ans + mu[i] * (pow2[s] - 1)) % mod\r\nprint(ans)", "mod=10**9+7\r\n\r\nn=int(input())\r\nm=10**6+1\r\ncnt=[0]*m\r\nfor i in list(map(int,input().split())):\r\n cnt[i]+=1\r\n\r\nc=[0]*m\r\nfor i in range(1,m):\r\n for j in range(2*i,m,i):\r\n cnt[i]+=cnt[j]\r\n\r\npow2=[1]*m\r\nfor i in range(1,m):\r\n pow2[i]=pow2[i-1]*2%mod\r\n\r\nfor i in range(m):\r\n c[i]=pow2[cnt[i]]-1\r\n\r\nfor i in range(m-1,0,-1):\r\n for j in range(2*i,m,i):\r\n c[i]-=c[j]\r\n c[i]%=mod\r\n\r\nprint(c[1])" ]

[ "\r\nn = int(input())\r\np = [int(i) - 1 for i in input().split()]\r\n\r\nchd = [0] * (n + 2)\r\ndev = 0\r\ndd = 0\r\n\r\nfor i in range(n):\r\n shi = p[i] - i\r\n dev += abs(shi)\r\n if p[i] <= i:\r\n dd += 1\r\n shi = n + shi\r\n chd[shi] += 2\r\n else:\r\n dd -= 1\r\n chd[shi] += 2\r\n\r\nbdev = dev\r\nbsh = 0\r\n\r\nfor i in range(1, n):\r\n dev -= abs(p[-i] - (n - 1))\r\n dev += abs(p[-i] - 0)\r\n dd -= 1\r\n dev += dd\r\n dd -= 1\r\n dd += chd[i]\r\n if dev < bdev:\r\n bsh = i\r\n bdev = dev\r\n\r\nprint(bdev, bsh)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = [0] * 2 * n\r\ns = 0\r\nfor i in range(n):\r\n d = a[i] - i - 1\r\n s += abs(d)\r\n if d > 0: t[d] += 1\r\np = sum(t)\r\nr = (s, 0)\r\nfor i in range(1, n):\r\n d = a[n - i] - 1\r\n s += d - p << 1\r\n t[d + i] += d > 0\r\n p += (d > 0) - t[i]\r\n if s < r[0]: r = (s, i)\r\nprint(*r)", "n = int(input())\r\na = list(map(int,input().split()))\r\nt = [0 for i in range(2*n)]\r\ns = 0\r\nfor i in range(n):\r\n d = a[i] - i - 1\r\n s+=abs(d)\r\n if (d > 0):\r\n t[d]+=1\r\np = sum(t)\r\nr = (s,0)\r\nfor i in range(1,n):\r\n d = a[n-i] - 1\r\n s += 2*(d-p)\r\n t[d + i] += (d > 0)\r\n p += (d > 0) - t[i]\r\n if (r[0] > s):\r\n r = (s,i)\r\nprint(*r)# 1688238572.655826" ]

[ "import collections\nimport heapq\nif __name__ == '__main__':\n n, m = [int(x) for x in input().split()]\n G = collections.defaultdict(list)\n road = []\n for i in range(m):\n s, e, f = [int(x) for x in input().split()]\n road.append((s, e, f))\n G[s].append((e, f))\n G[e].append((s, f))\n def dijkstra(s, e):\n d = [(float('inf'), float('inf')) for _ in range(n + 1)]\n pre = [-1 for _ in range(n + 1)]\n d[s] = (0, 0)\n hq = [(0, 0, s)]\n while hq:\n dis, cost, p = heapq.heappop(hq)\n if d[p] < (dis, cost): continue\n for e, f in G[p]:\n cost_e = cost + (1 if not f else 0)\n dis_e = dis + 1\n if (dis_e, cost_e) < d[e]:\n d[e] = (dis_e, cost_e)\n pre[e] = p\n heapq.heappush(hq, (dis_e, cost_e, e))\n return pre\n pre = dijkstra(1, n)\n q = n\n path = []\n while q != -1:\n path.append(q)\n q = pre[q]\n pairs = set()\n for i in range(len(path) - 1):\n pairs.add((path[i], path[i + 1]))\n k = 0\n ans = []\n for s, e, f in road:\n if ((s, e) in pairs or (e, s) in pairs) and f == 0:\n k += 1\n ans.append((s, e, 1))\n elif ((s, e) not in pairs and (e, s) not in pairs) and f == 1:\n k += 1\n ans.append((s, e, 0))\n print(k)\n for s, e, f in ans:\n print(s, e, f)\n", "from sys import *\r\nfrom collections import *\r\ns = stdin.read().split()\r\nd = list(map(int, s))\r\nn, m = d[:2]\r\ng = [[] for i in range(n + 1)]\r\nfor j in range(m):\r\n i = 3 * j + 2\r\n g[d[i]].append((d[i + 1], d[i + 2], j))\r\n g[d[i + 1]].append((d[i], d[i + 2], j))\r\nu, v = [-1] * n + [0], [1e9] * n + [0]\r\nx, y = [0] * (n + 1), [0] * (n + 1)\r\nq = deque([n])\r\nwhile q:\r\n a = q.popleft()\r\n for b, k, i in g[a]:\r\n if v[b] == 1e9: q.append(b)\r\n if v[b] > v[a] and u[b] < u[a] + k:\r\n v[b] = v[a] + 1\r\n u[b] = u[a] + k\r\n x[b], y[b] = a, i\r\na, t = 1, [0] * m\r\nwhile a != n: t[y[a]], a = 1, x[a]\r\nl = []\r\nfor j in range(m):\r\n i = 3 * j + 2\r\n if d[i + 2] != t[j]:\r\n l.append(' '.join([s[i], s[i + 1], str(t[j])]))\r\nprint(len(l))\r\nprint('\\n'.join(l))" ]

[ "import sys;sc = sys.stdin.readline;out=sys.stdout.write\r\ns=str(sc());n=int(sc());ans=0\r\nfor e in range(n):\r\n ss=str(sc());a,b=0,0\r\n for e in s:\r\n if e==ss[0]:a+=1\r\n elif e==ss[1]:b+=1\r\n else :ans+=min(a,b);a=0;b=0\r\n ans+=min(a,b)\r\nout(str(ans)) ", "s = input()\r\nn = len(s)\r\nk = int(input())\r\narr = [set(input()) for _ in range(k)]\r\n\r\nstart = 0\r\ncnt = 0\r\nd = []\r\nfor i in range(n):\r\n if s[start] == s[i]:\r\n cnt += 1\r\n else:\r\n d.append([s[start], cnt])\r\n cnt = 1\r\n start = i\r\n\r\nif cnt > 0:\r\n d.append([s[start], cnt])\r\n\r\nstart = 0\r\nend = 0\r\ncnt = 0\r\ncnt_first = d[start][1]\r\ncnt_second = 0\r\n\r\nfor i in range(len(d)-1):\r\n\r\n if {d[i][0], d[i + 1][0]} in arr:\r\n end = i + 1\r\n if d[start][0] == d[i+1][0]:\r\n cnt_first += d[i+1][1]\r\n else:\r\n cnt_second += d[i+1][1]\r\n else:\r\n le = end-start+1\r\n cnt += min(cnt_first, cnt_second)\r\n start = i + 1\r\n end = i + 1\r\n cnt_first = d[start][1]\r\n cnt_second = 0\r\n\r\ncnt += min(cnt_first, cnt_second)\r\nprint(cnt)\r\n", "s=input()\nans=0\nfor _ in range(int(input())):\n a,b=0,0\n p=input()\n for x in s:\n if(x==p[0]):a+=1\n elif(x==p[1]):b+=1\n else:\n ans+=min(a,b);\n a,b=0,0\n ans+=min(a,b)\nprint(ans)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = input()\r\nN = len(S)\r\nk = int(input())\r\nsp = set()\r\nfor _ in range(k):\r\n s = input()\r\n sp.add(s)\r\n sp.add(s[::-1])\r\n\r\ndp = [0]*26\r\nfor c in S:\r\n ndp = dp[::]\r\n for i in range(26):\r\n a = chr(ord('a')+i)\r\n if not a+c in sp:\r\n ndp[ord(c)-ord('a')] = max(ndp[ord(c)-ord('a')], dp[i]+1)\r\n \r\n dp = ndp\r\nprint(N-max(dp))", "import sys\r\n#input = sys.stdin.readline\r\nfor _ in range(1):\r\n s=input()\r\n n=len(s)\r\n d={}\r\n for _ in range(int(input())):\r\n a=input()\r\n d[a[0]]=a[1]\r\n d[a[1]]=a[0]\r\n i=0\r\n ans=0\r\n while i<n:\r\n if s[i] in d:\r\n a,b=0,0\r\n while True:\r\n start=i\r\n while i<n and s[i]==s[start]:\r\n a+=1\r\n i+=1\r\n if i<n and s[i]==d[s[start]]:\r\n #b+=1\r\n start=i\r\n while i<n and s[i]==s[start]:\r\n b+=1\r\n i+=1\r\n if i<n and s[i]==d[s[start]]:\r\n continue\r\n else:\r\n ans+=min(a,b)\r\n break\r\n else:\r\n i+=1\r\n print(ans)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nk = int(input())\r\nq = dict()\r\nfor _ in range(k):\r\n x = input()[:-1]\r\n q[x[0]] = x[1]\r\n q[x[1]] = x[0]\r\nc, i = 0, 0\r\nwhile i < len(s)-1:\r\n if s[i] in q and q[s[i]] == s[i+1]:\r\n a = 0\r\n b = 0\r\n for j in range(i, -1, -1):\r\n if s[j] == s[i]:\r\n a += 1\r\n elif s[j] == s[i+1]:\r\n b += 1\r\n else:\r\n break\r\n for j in range(i+1, len(s)):\r\n if s[j] == s[i]:\r\n a += 1\r\n elif s[j] == s[i+1]:\r\n b += 1\r\n else:\r\n f = j\r\n break\r\n else:\r\n f = len(s)\r\n c += min(a, b)\r\n i = f-1\r\n i += 1\r\nprint(c)", "p, t = {}, input()\r\na, n = False, len(t)\r\nx = y = s = 0\r\nq = [input() for i in range(int(input()))]\r\nfor a, b in q: p[a], p[b] = b, a\r\nfor i in t:\r\n if a:\r\n if i == a: x += 1\r\n elif i == b: y += 1\r\n else:\r\n s += min(x, y)\r\n if i in p:\r\n a, b = i, p[i]\r\n x, y = 1, 0\r\n else: a = False\r\n elif i in p: \r\n a, b = i, p[i]\r\n x, y = 1, 0\r\nif a: s += min(x, y)\r\nprint(s)", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n s = input()\r\n k = int(input())\r\n res = 0\r\n for _ in range(0, k):\r\n fp = input()\r\n countFirst = 0\r\n countSecond = 0\r\n for start in range(0, len(s)):\r\n if (s[start] == fp[0]):\r\n countFirst += 1\r\n elif (s[start] == fp[1]):\r\n countSecond += 1\r\n else:\r\n res += min(countFirst,countSecond)\r\n countFirst = 0\r\n countSecond = 0\r\n \r\n if s[len(s)-1] == fp[0] or s[len(s)-1] == fp[1]:\r\n res += min(countFirst,countSecond)\r\n\r\n # print(fp,res)\r\n print(res)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\ns = input().strip()\r\nk = int(input())\r\nans = 0\r\nfor _ in range(k):\r\n t = input().strip()\r\n a = b = 0\r\n for c in s:\r\n if c == t[0]: a += 1\r\n elif c == t[1]: b += 1\r\n else:\r\n ans += min(a, b)\r\n a = b = 0\r\n ans += min(a, b)\r\nprint(ans)\r\n\r\n\r\n# https://blog.51cto.com/u_15303184/3098436", "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\ns = input().rstrip()\r\nk = int(input())\r\nfb = [input().rstrip() for i in range(k)]\r\nans = 0\r\nfor i in range(k):\r\n a = 0\r\n b = 0\r\n flg = 0\r\n for j in range(len(s)):\r\n if s[j] == fb[i][0]:\r\n a += 1\r\n elif s[j] == fb[i][1]:\r\n b += 1\r\n else:\r\n ans += min(a,b)\r\n a = 0\r\n b = 0\r\n ans += min(a,b)\r\n\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\ns=input().rstrip()\r\nk=int(input())\r\ncannot=[input().rstrip() for i in range(k)]\r\nans=0\r\nfor t in cannot:\r\n a,b=0,0\r\n for i in range(len(s)):\r\n if s[i]==t[0]:\r\n a+=1\r\n elif s[i]==t[1]:\r\n b+=1\r\n else:\r\n ans+=min(a,b)\r\n a=b=0\r\n ans+=min(a,b)\r\nprint(ans)", "s = input()\r\nk = int(input())\r\nres = 0\r\nfor _ in range(k):\r\n f = input()\r\n ins = False\r\n first, second = 0, 0\r\n for i in s:\r\n if not ins and i != f[0] and i != f[1]:\r\n continue\r\n if ins and i != f[0] and i != f[1]:\r\n ins = False\r\n MIN = min(first, second)\r\n res += MIN\r\n first, second = 0, 0\r\n elif i == f[0] or i == f[1]:\r\n ins = True\r\n if i == f[0]:\r\n first += 1\r\n elif i == f[1]:\r\n second += 1\r\n if ins:\r\n MIN = min(first, second)\r\n res += MIN\r\nprint(res)# 1691619870.475087", "s = input()\r\nans = 0\r\nfor i in range(int(input())):\r\n\tx = input()\r\n\ta, b = 0, 0\r\n\tfor j in s:\r\n\t\tif j == x[0]:\r\n\t\t\ta += 1\r\n\t\telif j == x[1]:\r\n\t\t\tb += 1\r\n\t\telse:\r\n\t\t\tans += min(a, b)\r\n\t\t\ta, b = 0, 0\r\n\tans += min(a, b)\r\nprint(ans)", "s=input()\r\nans=[]\r\ncount=1\r\nfor i in range(1,len(s)):\r\n if(s[i]==s[i-1]):\r\n count+=1\r\n else:\r\n ans.append([count,s[i-1]])\r\n count=1\r\nans.append([count,s[-1]])\r\ntotal=0\r\nt=int(input())\r\nfor m in range(t):\r\n r=input()\r\n i=0\r\n while(i<len(ans)):\r\n \r\n if(ans[i][1] in r):\r\n \r\n t1=ans[i][0]\r\n t2=0\r\n flag=0\r\n j=i+1\r\n for j in range(i+1,len(ans)):\r\n if(flag==0):\r\n \r\n if(ans[j][1]!=ans[i][1] and ans[j][1] in r):\r\n t2+=ans[j][0]\r\n flag=1\r\n continue;\r\n else:\r\n break;\r\n else:\r\n if(ans[i][1]==ans[j][1]):\r\n t1+=ans[j][0]\r\n flag=0\r\n continue;\r\n else:\r\n break;\r\n \r\n total+=min(t1,t2)\r\n i=j+1\r\n \r\n \r\n else:\r\n i+=1\r\n \r\nprint(total) \r\n \r\n \r\n \r\n", "s = input()\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n\tt = input()\r\n\tj = 0\r\n\ta,b = 0,0\r\n\twhile(j<len(s)):\r\n\t\tif(t[0]==s[j]):\r\n\t\t\ta+=1\r\n\t\telif(t[1]==s[j]):\r\n\t\t\tb+=1\r\n\t\telse:\r\n\t\t\tans+=min(a,b)\r\n\t\t\ta,b=0,0\r\n\t\tj+=1\r\n\tans+=min(a,b)\r\nprint(ans)", "S = input()\r\nM = int( input() )\r\n\r\nbanned = set( input() for i in range( M ) )\r\nbuff = set()\r\nfor s in banned:\r\n if not ( s[ : : -1 ] in banned ):\r\n buff.add( s[ : : -1 ] )\r\nbanned.update( buff )\r\n\r\ndp = [ [ 1e9 for i in range( 26 ) ] for j in range( len( S ) + 1 ) ]\r\nfor i in range( 26 ):\r\n dp[ 0 ][ i ] = 0\r\nfor i in range( len( S ) ):\r\n for j in range( 26 ):\r\n if dp[ i ][ j ] == 1e9: continue\r\n if not ( chr( ord( 'a' ) + j ) + S[ i ] in banned ):\r\n dp[ i + 1 ][ ord( S[ i ] ) - ord( 'a' ) ] = min( dp[ i + 1 ][ ord( S[ i ] ) - ord( 'a' ) ], dp[ i ][ j ] )\r\n dp[ i + 1 ][ j ] = min( dp[ i + 1 ][ j ], dp[ i ][ j ] + 1 )\r\n\r\nprint( min( dp[ len( S ) ] ) )\r\n" ]

[ "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nprint('YES' if a[n-1]<a[n] else 'NO')", "input()\r\n\r\nl = list(map(int, input().split()))\r\nl.sort()\r\n\r\nif l[len(l) // 2] > l[len(l) // 2 - 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na2=sorted(list(map(int,input().split())))\r\nb1=[]\r\nfor i in range(n):\r\n b1.append(a2[len(a2)-1])\r\n a2.remove(a2[len(a2)-1])\r\nif max(a2)<min(b1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nplayers = list(map(int, input().split()))\r\nplayers.sort()\r\nif players[n] > players[n - 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nl = sorted(l)\r\n\r\nif l[n] == l[n-1]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\na = [int(i) for i in input().split()]\na.sort()\nif(a[n] > a[n-1]):\n\tprint('YES')\nelse:\n\tprint('NO')", "n, a = int(input()), list(sorted(map(int, input().split())))\r\nprint(('NO', 'YES')[a[n - 1] != a[n]])\r\n", "n = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\nprint(\"YES\" if nums[n] > nums[n - 1] else \"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nA=[]\r\nB=[]\r\nfor i in range(n):\r\n A.append(a[i])\r\nfor i in range(n,2*n):\r\n B.append(a[i])\r\nif A[n-1]>=B[0]:\r\n print('NO')\r\nelse:\r\n print('YES')", "# n = int(input())\r\n# b1 = list(map(int, input().split()))\r\n# b1.sort()\r\n# countn = 0\r\n# county = 0\r\n# # for i in range(len(b1)):\r\n# if(b1[n]>b1[n-1]):\r\n# print(\"NO\")\r\n# # countn+=1\r\n# else:\r\n# # print(\"YES\")\r\n# # county+=1\r\n# # if(county==(len(b1))//2):\r\n# print(\"YES\")\r\n# # else:\r\n# # print(\"NO\")\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif a[n - 1] < a[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nx = a[:n]\r\ny = a[n:]\r\n\r\nfor i in x[::-1]:\r\n for j in y:\r\n if(i==j):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n = int(input())\r\nn*=2\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nif arr[n//2]>arr[n//2-1]:print(\"YES\")\r\nelse: print(\"NO\")", "while 1:\n try:\n n = int(input())\n a = [int(x) for x in input().split()]\n print(\"YES\" if sorted(a)[n] > sorted(a)[n-1] else \"NO\")\n except EOFError:\n break\n", "import sys, math\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations\r\nINF=int(1e9)+7\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n data.sort()\r\n if data[n-1]==data[n]: print(\"NO\")\r\n else: print(\"YES\")\r\n \r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "import sys\nn = int(input())\nl = list(map(int, input().split()))\n\nl.sort()\nif l[n-1] < l[n]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\narr = []\r\nmaxes = []\r\nstring = input()\r\narr = [int(x) for x in string.split(\" \")]\r\nfor x in range(n):\r\n\tmaxes.append(arr[arr.index(max(arr))])\r\n\tdel arr[arr.index(max(arr))]\r\nfor each in maxes:\r\n\tif (each < max(arr)) or (each == max(arr)):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\nprint(\"YES\")", "n = int(input())\n\na = sorted(map(int, input().split()))\n\nprint('YES' if a[n] > a[n-1] else 'NO')\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nst = 'YES'\r\nif a[n-1] == a[n]:\r\n st='NO'\r\nprint(st)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\n# print(a[n//2],a[n//2-1],(n//2)-1)\r\nif a[n]>a[n-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nm = [int(i) for i in input().split()]\r\nm = sorted(m)\r\nif m[len(m)//2-1] == m[len(m)//2]:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nb = a[:n]\r\nc = a[n:]\r\nif min(c) > max(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pairs = int(input())\r\nelo_input = input()\r\nelo_list = []\r\n\r\nelo_list = elo_input.split(\" \")\r\n\r\nfor k in range(0, len(elo_list)):\r\n elo_list[k] = int(elo_list[k])\r\n\r\nelo_list.sort()\r\n\r\nteam1 = elo_list[pairs::]\r\nteam2 = elo_list[:pairs][::-1]\r\n\r\nif team1[0] == team2[0]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\nk = list(map(int, input().split(' ')))\nk.sort()\na , k = k[0:n], k[n:]\nfor i in k:\n if i in a:\n print('NO')\n exit()\nprint('YES')\n", "n = int(input())\r\na = [int(s) for s in input().split()]\r\na.sort()\r\nif a[n-1] == a[n]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def insertionSort(a):\r\n for i in range(1, len(a)):\r\n key = a[i]\r\n j = i-1\r\n while j>=0 and key<a[j] :\r\n a[j+1] = a[j]\r\n j -= 1\r\n a[j+1] = key\r\n return a\r\na=int(input())\r\nb=input()+' '\r\nx=''\r\nc=[]\r\nfor i in range(len(b)):\r\n if b[i]==' ':\r\n c=c+[int(x)]\r\n x=''\r\n else:\r\n x=x+b[i]\r\nc=insertionSort(c)\r\nif c[len(c)//2]<c[(len(c)//2)-1] or c[len(c)//2]>c[(len(c)//2)-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n =int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif arr[n-1] < arr[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = sorted(list(map(int, input().split())))\n\nif a[n-1] != a[n]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\nl = list(map(int,input().split()))\nl.sort()\nl1 = l[0:n]\nl2 = l[n:2*n]\nk = l1[-1]\n\nif k in l2:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na1=a[:n]\r\na2=a[n:2*n]\r\na2=a2[::-1]\r\nans='T'\r\nfor i in range(n):\r\n if a2[i]<=a[i]:\r\n ans='NO'\r\n break\r\nif ans=='NO':\r\n print(ans)\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nt = False\r\na.sort()\r\nfor i in a[:n]:\r\n for j in a[n:]:\r\n if i >= j:\r\n t = True\r\n if t: break\r\n\r\nif t:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nar = sorted(map(int, input().split()))\r\n#print(ar)\r\n#print(ar[n-1],ar[n])\r\nif ar[n-1]==ar[n]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ni,j=0,2*n-1\r\nwhile i<j:\r\n if arr[j]<=arr[i]:\r\n print(\"NO\")\r\n break\r\n i+=1\r\n j-=1\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nr=[int(w) for w in input().split()]\r\nr.sort()\r\nif r[n]>r[n-1]:\r\n print('yes')\r\nelse:\r\n print('no')", "a=int(input())\r\n\r\n\r\n\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\n\r\nif t[a]>t[a-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\na = list(map(int, input().split()))\nn *= 2\na = sorted(a)\nif a[n//2-1] == a[n//2]:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nif a[n-1]==a[n]:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\na=[int(x) for x in input().split()]\na.sort()\nb=a[:n]\nc=a[n:]\nif(min(c)>max(b)):\n print('YES')\nelse:\n print('NO')\n", "def shahmatisty(lst):\r\n a = sorted(lst)\r\n if a[len(lst) // 2 - 1] == a[len(lst) // 2]:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nn = int(input())\r\nb = [int(j) for j in input().split()]\r\nprint(shahmatisty(b))\r\n", "#\"from dust i have come, dust i will be\"\r\n\r\nn=int(input())\r\na=list(map(int,input().split()));\r\n\r\na.sort(reverse=True)\r\nx=[]\r\ny=[]\r\n\r\nfor i in range(n):\r\n x.append(a[i])\r\n\r\nfor i in range(n,n*2):\r\n y.append(a[i])\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i]==y[j]:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n\r\n\r\n", "#coded by gautham on 29/5/2021\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nk=0\r\na=l[:n]\r\nb=l[n:]\r\nfor i in a:\r\n if i in b:\r\n k=1\r\n break\r\nif k==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ndef Count_Sort(l,m):\r\n t=[]\r\n n=[]\r\n for i in range (m):\r\n if i<len(l):\r\n n.append(0)\r\n t.append(0)\r\n for i in l:\r\n t[i-1]+=1\r\n for i in range(1,m):\r\n t[i]+=t[i-1]\r\n for i in range(len(l)-1,-1,-1):\r\n n[t[l[i]-1]-1]=l[i]\r\n t[l[i]-1]-=1\r\n return n\r\nl=input()\r\nl=l.split()\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\nl=Count_Sort(l,1000)\r\nif l[n-1]<l[n]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\nl.sort(reverse=True)\r\nprint( (l[n -1] > l[n])*\"YES\" + (not(l[n -1] > l[n]))*\"NO\" )", "import sys\r\ninput = sys.stdin\r\nn = int(input.readline())\r\nA = list(map(int, input.read().split()))\r\nif sorted(A)[n] > sorted(A)[n-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\na = int(input())\r\nb = sorted(list(map(int,input().split())))\r\nprint('YES' if b[a - 1] < b[a] else 'NO')", "M=int(input())\r\nx=[int(i) for i in input().split()]\r\nx.sort()\r\nif x[M]==x[M-1]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\nif li[n-1]!=li[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor el in range(2 * n):\r\n for i in range(2 * n - el - 1):\r\n if a[i] > a[i + 1]:\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\nk1 = []\r\nk2 = []\r\nfor el in range(n):\r\n k1.append(a[el])\r\nfor el in range(n, n * 2):\r\n k2.append(a[el])\r\nfor el1 in k1:\r\n for el2 in k2:\r\n if el2 <= el1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = input()\r\na = sorted([int(x) for x in input().split()])\r\n\r\nif a[len(a) // 2 - 1] < a[len(a) // 2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "#http://codeforces.com/problemset/problem/845/A\nn = int(input())\nplayers = list(map(int, input().split()))\nans = 0\nteam1 = []\nfor x in range(n):\n\tbig = max(players)\n\tans += big\n\tteam1.append(big)\n\tplayers.remove(big)\nif( ans > sum(players) and max(players)<min(team1)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "import sys\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nprint('YES' if a[n-1] < a[n] else 'NO')\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nx=b[:len(b)//2]\r\ny=b[len(b)//2:]\r\nif x[-1]<y[0]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\n\nif a[n] > a[n-1]:\n\tprint('YES')\nelse:\n\tprint('NO')", "a = []\r\nn = int(input())\r\na = input().split()\r\nfor i in range(n*2):\r\n a[i] = int(a[i])\r\na.sort()\r\n##print(a[n-1], a[n])\r\nif(a[n-1] == a[n]):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from sys import stdin\r\n\r\nn = int(input())\r\nl = list(map(int, stdin.readline().split()))\r\nl.sort()\r\nflag = 0\r\nfor i in range(n):\r\n if l[n - i - 1] == l[n + i]:\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 100288399\nn, a = int(input()), []\r\nt = input().split()\r\n\r\nfor x in t: a.append(int(x))\r\na.sort()\r\n\r\nif a[n] > a[n - 1]: print(\"YES\")\r\nelse: print(\"NO\")", "# LUOGU_RID: 114908305\nn=int(input())\r\nalist=list(map(int,input().split()))\r\nalist.sort()\r\nif alist[n]>alist[n-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ins(s):\r\n for i in range(1, len(s)):\r\n val = s[i]\r\n j = i - 1\r\n while s[j] > val and j>=0:\r\n s[j+1] = s[j]\r\n j = j - 1\r\n s[j+1] = val\r\n return(s)\r\nn=int(input())\r\nb=input()\r\nnb=[]\r\nx=''\r\nfor i in range(len(b)):\r\n if b[i]!=' ' :\r\n x=x+b[i]\r\n else:\r\n nb.append(int(x))\r\n x=''\r\nif x!='':\r\n nb.append(int(x))\r\nb=nb\r\nb=ins(b)\r\nif b[n]>b[n-1] :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nif arr[n-1] == arr[n]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nrating = sorted(int(i) for i in input().split())\r\n\r\n\r\nans = 'YES' if rating[n] > rating[n-1] else 'NO'\r\n\r\nprint(ans)", "n=int(input())\r\na=list(map(int, input().split(\" \")))\r\na=sorted(a)\r\nprint(\"YES\") if (a[n-1]<a[n]) else print(\"NO\")", "\n\nn = int(input())\n\nA = sorted([int(x) for x in input().split()])\n\nprint(\"YES\" if A[len(A) // 2 - 1] != A[len(A) // 2] else \"NO\")\n", "a=int(input())\nl=input().split()\nm=[]\nfor i in range(len(l)):\n\tm+=[int(l[i])]\n\t\n\nm.sort()\n#print(m)\nif m[a-1]<m[a]:\n\tprint('YES')\nelse:\n\tprint('NO')\n\n", "n = int(input())\r\nraiting = list(map(int, input().split()))\r\nraiting.sort()\r\nif raiting[n] > raiting[n - 1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ns = sorted(map(int,input().split()))\r\nprint('NO' if s[n] == s[n-1] else 'YES')", "def prog():\r\n n = int(input())\r\n mas = list(map(int,input().split()))\r\n mas.sort()\r\n if mas[n-1]==mas[n]:\r\n print('NO')\r\n else:\r\n print('YES')\r\nprog()", "#codeforces\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n if a[n-1]==a[n]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n=int(input())\r\na=[int(g) for g in input().split()]\r\nx=[0]*1001\r\nfor i in range (2*n):\r\n x[a[i]]+=1\r\n#print(x)\r\ns=0\r\ni=0\r\nwhile s<n:\r\n i+=1\r\n s+=x[i]\r\nif s==n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n = int(input())*2\r\na = sorted([int(x) for x in input().split()])\r\nprint('YNEOS'[not(min(a[n//2:]) > max(a[:n//2]))::2])\r\n", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\nimport sys\ninput=sys.stdin.readline\nn = int(input())\na = sorted(list(map(int,input().split())))\nprint(\"YES\" if a[n-1] < a[n] else \"NO\")\n\n", "# A. Шахматный турнир\n\nn = int(input())\narr = list(map(int, input().split()))\n\nn = n * 2\nfor i in range(n):\n\tfor j in range(n-1,0,-1):\n\t\tif arr[j] > arr[j-1]:\n\t\t\tarr[j], arr[j-1] = arr[j-1], arr[j]\n\nn = int(n/2)\nif (arr[n-1]) <= arr[n]:\n\tprint(\"NO\")\n\t# break\nelse:\n\tprint(\"YES\")\n\t# break\n\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nprint('YES' if a[n] > a[n - 1] else 'NO')\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\nb=True\nfor i in range((2*n)-1,n-1,-1):\n\tfor j in range(n):\n\t\tif not l[i]>l[j]:\n\t\t\tb=False\n\t\t\tbreak\n\t\tif not b:\n\t\t\tbreak\nif b:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n = int(input())\na = [int(i) for i in input().split()]\na.sort()\nif a[n - 1] < a[n]:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nls=[int(x) for x in input().split()]\r\nls.sort()\r\nl1=ls[0:n]\r\nl2=ls[n:]\r\nif l1[-1]<l2[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\n\r\nprint(('NO', 'YES')[a[n] > a[n - 1]])\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\nt=t[::-1]\r\nif t[n]<t[n-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nc = list(sorted(map(int, input().split()),reverse=True))\r\nteam1 = min(c[:n])\r\nteam2 = max(c[n:])\r\nif team1>team2:\r\n print('YES')\r\nelse: \r\n print('NO')\r\n\n# Sun Dec 26 2021 13:35:17 GMT+0000 (Coordinated Universal Time)\n", "n = int(input())\r\n\r\nr = input()\r\n\r\nratings =[]\r\n\r\nint_ratings =[]\r\n\r\ncounter = 0\r\n\r\nfor x in r:\r\n if x == \" \":\r\n ratings.append(r[0:r.index(x)])\r\n r = r.replace(r[0:r.index(x)+1], \"\", 1)\r\n\r\nratings.append(r)\r\n\r\nfor x in ratings:\r\n int_ratings.append(int(x))\r\n\r\nint_ratings.sort()\r\n\r\nfor x in int_ratings[0:n]:\r\n if int_ratings[n] > x:\r\n counter += 1\r\n \r\nif counter == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "'''\n21st august 2017 monday\ncodeforces 845a\n'''\nn = int(input())\na = [int(x) for x in input().split(' ')]\n\na.sort()\nout = \"NO\"\n#print(a, i, j)\nif max(a[:n]) < min(a[n:]):\n out = \"YES\"\nprint(out)\n", "# http://codeforces.com/problemset/problem/845/A\r\nn=int(input())\r\nget=lambda:list(map(int,input().split()))\r\nl=get()\r\nl.sort() \r\nif l[n-1]<l[n]:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "n = int(input(''))\na = input('').split()\nc = list()\nfor b in a:\n b = int(b)\n c.append(b)\nc.sort()\nif c[n-1] < c[n]:\n print('YES')\nelse:\n print('NO')\n", "# A. Chess Tourney\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif a[n-1]<a[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nif (a[n-1]<a[n]):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def main():\n\tn = int(input())\n\tratings = list(map(int,input().split()))\n\tratings.sort()\n\t\n\tif ratings[n] > ratings[n-1]:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\n\nif __name__ == \"__main__\":\n\tmain()\t\t\t\n", "def main():\r\n n = int(input())\r\n data = input().split(' ')\r\n rates = [int(i) for i in data]\r\n print(distribution(n, rates))\r\n\r\n\r\ndef distribution(count, rates):\r\n rates.sort(reverse=True)\r\n if rates[count - 1] > rates[count]:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nmain()", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nlose = arr[0:n]\r\nwin = arr[n::]\r\nif win[0] > lose[-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\na=input().split()\na=[int(i) for i in a]\nc=0\nfor i in range(1,2*n):\n\tkey=a[i]\n\tj=i-1\n\t#print(\"hello\")\n\t#print(key,a[j])\n\twhile (j>=0) and key<a[j]:\n\t\ta[j+1]=a[j]\n\t\tj-=1\n\ta[j+1]=key\n#print (a)\n\nif a[n-1] >= a[n]:\n\tprint(\"NO\")\nelse :\n\tprint(\"YES\")\n", "import sys, math\r\n\r\nn = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\narr.sort(reverse=True)\r\nfirst = []\r\nsecond = []\r\nfor i in range(len(arr) // 2):\r\n first.append(arr[i])\r\nfor i in range(len(arr) // 2, len(arr)):\r\n second.append(arr[i])\r\ncan = True\r\nfor i in first:\r\n if can:\r\n for j in second:\r\n if i == j:\r\n can = False\r\n break\r\nprint('YES' if can else 'NO')", "n = int(input())\r\nM1 = list(map(int, input().split()))\r\nM1.sort()\r\nM2 = M1[n:]\r\nM1 = M1[:n]\r\nif max(M1) < min(M2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nx=[int(q) for q in input().split()]\r\n\r\ny=sorted(x)\r\na=y[:n]\r\nb=y[n:]\r\n\r\nu=0\r\nfor i in a:\r\n if i in b:\r\n u+=1\r\n break\r\n \r\nif u==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\nl=sorted(list(map(int,input().split())))\r\ni,j=0,2*n-1\r\nf=1\r\nwhile(i<j):\r\n if l[i]>=l[j]:\r\n f=0\r\n break\r\n i+=1\r\n j-=1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif a[n-1]==a[n]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nfirst_max = max(lst[:n])\r\nsecond_min = min(lst[n:])\r\n\r\nif first_max >= second_min:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def Main():\r\n n = int(input())\r\n a = sorted(map(int, input().split()))\r\n\r\n if a[n-1] < a[n]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n Main()", "n = int(input())\r\narray = list(map(int, input().split()))\r\narray.sort()\r\n\r\nif (array[n-1] < array[n]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nls = sorted(list(map(int, input().split(' '))))\r\nprint('YES') if ls[n] > ls[n - 1] else print('NO')\r\n", "n = int(input())\r\nranks = [int(x) for x in input().split()]\r\nranks.sort()\r\nif ranks[n-1] == ranks[n]:\r\n print('NO')\r\nelse:\r\n print('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\nif w[n] == w[n-1]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nc=input().split(' ')\r\nfor i in range(len(c)):\r\n for j in range(len(c)-i-1):\r\n if (int(c[j])<int(c[j+1])):\r\n t=c[j]\r\n c[j]=c[j+1]\r\n c[j+1]=t\r\nif (c[n-1]==c[n]):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\na=[int(c) for c in input().split()]\r\na.sort()\r\nif a[int(len(a)/2)]>a[int(len(a)/2)-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nmid = l[n]\r\nr = True\r\nfor i in range(n):\r\n if l[i] >= mid:\r\n r = False\r\n break\r\nif r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nlist = sorted(map(int,input().split()))\r\nif list[n-1] < list[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nl = list(map(int,input().split(' ')))\nl.sort()\nif l[n] > l[n-1] :\n print(\"YES\")\nelse :\n print(\"NO\")", "n = int(input())\na = input()\na = a.split(' ')\na = list(map(int, a))\n\na.sort()\nif a[n-1] < a[n]:\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nnum.sort()\r\nnum1 = num[:n:]\r\nnum2 = num[n::]\r\nif num1[-1] < num2[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\narr = [int(i) for i in input().strip().split()]\r\narr.sort(reverse = True)\r\nprint('NO' if arr[n-1] == arr[n] else 'YES')", "n = int(input())\nline = input()\nnums = [int(s) for s in line.split()]\nnums.sort()\nif nums[n] > nums[n-1]:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort(reverse=True)\r\na = arr[0:n]\r\nb = arr[n:]\r\nans = True\r\nfor x in a:\r\n if x in b:\r\n ans = False\r\n break\r\nif ans: print(\"YES\")\r\nelse: print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(['NO','YES'][a[n-1]!=a[n]])\r\n", "#!/usr/bin/env python3\r\nfrom sys import stdin,stdout\r\n\r\ndef ri():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\np = list(ri())\r\np.sort()\r\nif p[n-1] != p[n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\na=list(map(int, input().split()))\na.sort()\nif a[n]>a[n-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", "n = int(input())\r\np = sorted(list(map(int,input().split())))\r\nprint(('NO','YES')[p[n]>p[n-1]])", "if __name__ == '__main__':\r\n\tn = int(input())\r\n\tl = list(map(int, input().split()))\r\n\tl.sort()\r\n\twins = 1\r\n\tj = (2*n)-1\r\n\tif l[n-1] != l[n]:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n", "import math\r\nimport sys\r\n\r\n\r\ndef scan():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solution():\r\n # for _ in range(int(input())):\r\n n = int(input())\r\n a = scan()\r\n a.sort()\r\n b = a[:n]\r\n a = a[n:]\r\n # print(a, b, n//2)\r\n a = set(a).intersection(set(b))\r\n if len(a) > 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nft = a[:n]\r\nst = a[n:]\r\nst.reverse()\r\nif ft[-1] != st[-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nl1 = []\r\nl2 = []\r\nfor index, i in enumerate(l):\r\n if index < len(l) // 2:\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif l1[len(l1) - 1] < l2[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\na = sorted(a)\r\ni,j = 0,2*n-1\r\nwhile(i < j):\r\n\tif a[j] <= a[i]:\r\n\t\tbreak\r\n\ti += 1\r\n\tj -= 1\r\nif i > j:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "n=int(input())\r\na=list(input().split(' '))\r\na=[int(i) for i in a]\r\na.sort()\r\nif a[n-1]<a[n]:\r\n print('YES')\r\nelif a[n-1]==a[n]:\r\n print('NO')\r\n \r\n", "n, a = int(input()), sorted(map(int, input().split()))\r\nprint('YES' if a[n] > a[n - 1] else 'NO')", "n=int(input())\ninf=[int(i) for i in input().split()]\ninf.sort()\nif inf[n]>max(inf[:n]):\n print(\"YES\")\nelse: print(\"NO\")\n", "import math\r\n\r\na = []\r\n\r\nn = input()\r\nn = int(n)\r\n\r\ns = input().split()\r\n\r\nfor i in range(0, 2 * n):\r\n a.append(int(s[i]))\r\n\r\na.sort()\r\n\r\nif (a[n] == a[n - 1]):\r\n print (\"NO\\n\")\r\nelse:\r\n print (\"YES\\n\")\r\n", "n = int(input())\r\na = []\r\na= input().split()\r\nfor i in range(0,n*2):\r\n a[i] = int(a[i])\r\na.sort()\r\nfirst = []\r\nsecond = []\r\nfor i in range(0,n):\r\n first.append(a[i])\r\nfor i in range(n,n*2):\r\n second.append(a[i])\r\nif min(second) > max(first):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input()) \r\na = sorted([int(i) for i in input().split()], reverse = True) \r\nA, B = a[:n], a[n:] \r\nif A[-1] == B[0] : print(\"NO\") \r\nelse : print(\"YES\") \r\n", "n = int(input())\nx = list(map(int, input().split()))\nx.sort()\nif x[n] > x[n - 1]:\n print('YES')\nelse:\n print('NO')\n", "n=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nif(max(l[:n])<min(l[n:])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nratings = [int(i) for i in input().split(\" \")]\n\nratings = sorted(ratings)\n\ngroup1 = ratings[:n]\ngroup2 = ratings[n:]\n\n\nif (group1[-1] < group2[0]): print(\"YES\")\nelse: print(\"NO\")", "def main():\r\n\tn = int(input())\r\n\tL = [int(x) for x in input().split()]\r\n\tprint(solver(n, L))\r\n\r\ndef solver(n, L):\r\n\tL.sort()\r\n\tif L[n-1] != L[n]:\r\n\t\treturn \"YES\"\r\n\telse:\r\n\t\treturn \"NO\"\r\n\r\nmain()\r\n", "n=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nif r[n-1]==r[n]:\r\n print('NO')\r\nelse:\r\n print('YES')", "def lol(a):\r\n\tmid = len(a)//2\r\n\treturn a[mid-1]<a[mid]\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\nprint(\"YES\" if lol(a) else \"NO\")", "n = int(input())\r\na = [int(i)for i in input().split()]\r\na.sort()\r\nflag = False\r\ng = []\r\nh = []\r\nfor i in range(n):\r\n g.append(a[i])\r\na.reverse()\r\nfor i in range(n):\r\n h.append(a[i])\r\nfor i in range(len(g)):\r\n for i in range(len(h)):\r\n if g[i] == h[i]:\r\n print('NO')\r\n flag = True\r\n break\r\n if flag == True:\r\n break\r\nif flag == False:\r\n print('Yes')", "n=int(input())\r\nu=[int(x) for x in input().split()]\r\nu.sort()\r\nk2=u[:n]\r\nk1=u[n:2*n]\r\nif k2[n-1]==k1[0]:\r\n print('NO')\r\nelse:\r\n print('YES')" ]

[ "n = int(input())\r\ndata = list(input().split())\r\nnumbers_list = list(map(int, data))\r\nnumbers = sorted(numbers_list)\r\n\r\ni = 0\r\nj = 1\r\n\r\nwhile i != n - 1:\r\n if numbers[i] + numbers[j] not in numbers:\r\n if i == n - 2:\r\n print(\"-1\")\r\n break\r\n if j != n - 1:\r\n j += 1\r\n else:\r\n i += 1\r\n j = i + 1\r\n\r\n else:\r\n target = numbers[i] + numbers[j]\r\n if numbers[i] != numbers[j]:\r\n first = numbers[i]\r\n second = numbers[j]\r\n print(f\"{numbers_list.index(target) + 1} {numbers_list.index(second) + 1} {numbers_list.index(first) + 1}\")\r\n break\r\n else:\r\n twin = numbers[i]\r\n first = [i for i, n in enumerate(numbers) if n == twin][0]\r\n second = [i for i, n in enumerate(numbers) if n == twin][1]\r\n print(f\"{numbers_list.index(target) + 1} {second + 1} {first + 1}\")\r\n break", "# complexity O(n^3) ?!, I believe that there is a better way to solve it in O(n^2).\r\n\r\nn = int(input())\r\n\r\nlist1 = list(map(int,input().strip().split()))[:n]\r\n\r\n\r\ndef foo(list1):\r\n list2 = []\r\n for i in range(0,len(list1) - 2):\r\n for j in range(1,len(list1) - 1):\r\n for k in range(2, len(list1)):\r\n if list1[i] == list1[k] + list1[j]:\r\n list2.append(i+1)\r\n list2.append(k+1)\r\n list2.append(j+1)\r\n return list2\r\n elif list1[j] == list1[k] + list1[i]:\r\n list2.append(j + 1)\r\n list2.append(k + 1)\r\n list2.append(i + 1)\r\n return list2\r\n elif list1[k] == list1[j] + list1[i]:\r\n list2.append(k + 1)\r\n list2.append(j + 1)\r\n list2.append(i + 1)\r\n return list2\r\n\r\nlist3 = foo(list1)\r\nif list3:\r\n list3 = list(dict.fromkeys(list3))\r\n for i in list3:\r\n print(i,end=\" \")\r\nelif not list3:\r\n print(-1)\r\n", "'''input\n5\n1 2 3 5 7\n'''\nn = int(input())\na = list(map(int, input().split()))\nfor x in range(n):\n\tfor y in range(x+1, n):\n\t\tif a[x] + a[y] in a:\n\t\t\tprint(a.index(a[x]+a[y])+1, x+1, y+1)\n\t\t\tquit()\nprint(-1)", "def main(n, a):\n for i in range(n):\n for j in range(n):\n for k in range(n):\n if i != j and j != k and i != k:\n if a[j] + a[k] == a[i]:\n return '{} {} {}'.format(i + 1, k + 1, j + 1)\n return -1\n\nprint(main(int(input()), list(map(int, input().split(' ')))))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]+a[j] in a and i!=j!=a.index(a[i]+a[j]):\r\n print(a.index(a[i]+a[j])+1,i+1,j+1)\r\n exit()\r\nprint(-1)", "n = int(input())\r\nl = list(map(int, input().split(\" \")))\r\ntest = False\r\nlast = []\r\n\r\n\r\ncount = 0\r\nst =\"\"\r\nt = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j :\r\n continue\r\n for k in range(n):\r\n if k==j:\r\n continue\r\n if i!=j and i!=k and j!=k and l[i]==l[k]+l[j]:\r\n st = str(i+1)+\" \"+str(k+1)+\" \"+str(j+1)\r\n t = True\r\n break\r\n if t :\r\n break\r\n if t :\r\n break\r\n\r\nif t :\r\n print(st)\r\nelse:\r\n print(-1)", "def main():\r\n n = int(input())\r\n worms = [int(c) for c in input().split()]\r\n\r\n for k, target in enumerate(worms, 1):\r\n d = {}\r\n for i, w in enumerate(worms, 1):\r\n if i == k:\r\n continue\r\n \r\n if w in d:\r\n print(k, i, d[w])\r\n return\r\n else:\r\n d[target - w] = i\r\n\r\n print(-1)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "i, l, aa = input(), [0] * 2001, list(enumerate(map(int, input().split()), 1))\nfor i, a in aa:\n l[a] = i\nwhile aa:\n i, a = aa.pop()\n for j, b in aa:\n if l[a + b]:\n print(l[a + b], i, j)\n exit(0)\nprint(-1)", "#Author:A_S_M_M@sud_P@rvez\r\n\r\nfrom math import *\r\n \r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i] + a[j] in a:\r\n print(a.index(a[i]+a[j])+1,i+1,j+1)\r\n exit(0)\r\nprint(-1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if j != k and l[j] + l[k] == l[i]:\r\n print(i + 1, j + 1, k + 1)\r\n exit()\r\nprint(-1)", "_ = input(); s = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n for k in range(len(s)):\r\n if j == i or k == j or i == k: continue\r\n if s[i] == s[j] + s[k]: print(i+1, j+1, k+1), exit()\r\nprint(-1)", "import math\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n for first in range(n):\n for second in range(n):\n for third in range(second+1, n):\n if first != second and second != third:\n if a[first] == a[second] + a[third]:\n print(first+1, second+1, third+1)\n return\n print(-1)\n\nsolve()", "def main():\r\n n = int(input())\r\n ara = [int(i) for i in input().split(\" \")]\r\n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if (ara[i] == ara[j]+ara[k]):\r\n print(i+1, j+1, k+1)\r\n return\r\n elif (ara[j] == ara[i]+ara[k]):\r\n print(j+1, i+1, k+1)\r\n return\r\n elif (ara[k] == ara[i]+ara[j]):\r\n print(k+1, i+1, j+1)\r\n return\r\n print(-1)\r\n\r\nmain()", "n = int(input())\narr = [int(i) for i in input().split()]\n\nfor i in range(len(arr)):\n for j in range(len(arr)):\n if i == j:\n continue\n for k in range(len(arr)):\n if i!=k and j!=k and arr[i] + arr[j] == arr[k]:\n print(k+1 ,j+1, i+1)\n exit()\nprint(-1)\n\t \t\t \t\t\t\t\t \t \t \t \t\t\t\t\t\t", "def twonums(n,l):\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n t= l[i]+l[j]\r\n if t in l:\r\n return [l.index(t)+1,j+1, i+1]\r\n \r\n return [-1]\r\n\r\nn= int(input())\r\nl= list(map(int , input().split()))\r\n\r\nprint(*twonums(n,l))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nk=0\r\nfor i in range(n-1):\r\n if(k==1):\r\n break\r\n for j in range(i+1,n):\r\n if((a[i]+a[j]) in a):\r\n print(a.index(a[i]+a[j])+1,j+1,i+1)\r\n k=1\r\n break\r\nif(k==0):\r\n print(-1)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(0,n-1):\r\n for j in range(1,n):\r\n a = int(l[i] + l[j])\r\n if a in l:\r\n print(l.index(a)+1,i+1,j+1)\r\n exit()\r\nprint(-1)", "n = int(input())\na = [int(x) for x in input().split()]\ni,j,k = 0,0,0\nisvalid = False\nfor z in range(n):\n if z != n-1:\n for zz in range(z+1,n):\n if a[z] + a[zz] in a:\n i = a.index(a[z] + a[zz]) + 1\n j = z + 1\n k = zz + 1\n isvalid = True\n break\n if isvalid:\n break\nprint(i,k,j) if isvalid else print(-1)\n", "def find_three_worm_satisfied(worm_quantity, length_sequence):\r\n for i in range(worm_quantity):\r\n for j in range(i+1, worm_quantity):\r\n sum_two_length = length_sequence[i] + length_sequence[j]\r\n for sum_i_j_index in range(worm_quantity):\r\n if length_sequence[sum_i_j_index] == sum_two_length:\r\n three_worm_satisfied = f'{sum_i_j_index+1} {i+1} {j+1}'\r\n return three_worm_satisfied\r\n\r\n return -1\r\n\r\n\r\nworm_quantity = int(input())\r\nlength_sequence = list(map(int, input().split()))\r\nthree_worm_satisfied = ''\r\nprint(find_three_worm_satisfied(worm_quantity, length_sequence))", "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 for k in range(n):\r\n if i != j and i != k and j != k and A[i] == A[j] + A[k]:\r\n return [i, j, k]\r\n return None\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 if ans == None:\r\n print(-1)\r\n else:\r\n print(' '.join(list(str(a + 1) for a in ans)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nans = 0\r\nok = 1\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n ans = a[i] + a[j];\r\n if(ans in a):\r\n print(a.index(ans)+1,i+1,j+1)\r\n ok = 0\r\n exit()\r\n\r\nif ok:\r\n print(\"-1\")\r\n", "def solve(n,l):\r\n for i in range(n):\r\n for j in range(n):\r\n if j!=i:\r\n for k in range(n):\r\n if k!=j and k!=i:\r\n if(l[i]==l[j]+l[k]):\r\n print(i+1,j+1,k+1)\r\n return\r\n print(\"-1\")\r\n return\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nsolve(n,l)\r\n", "def solution(n,a):\r\n for j in range(n):\r\n # print(j,end=' ')\r\n for k in range(j+1,n):\r\n # print(k,end=' ')\r\n for i in range(n):\r\n # print('{} {} {}',j,k,i)\r\n if i==j or i==k:\r\n continue\r\n\r\n if a[i]==a[j]+a[k]:\r\n print(i+1,k+1,j+1)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\nn=int(input(''))\r\na=list(map(int,input('').split()))\r\nsolution(n,a)", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i!=j and i!=k and j!=k and A[i]==A[j]+A[k]:\r\n print(i+1,j+1,k+1)\r\n exit()\r\n\r\nprint(-1)\r\n", "import sys\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n continue\r\n a=l[i]+l[j]\r\n if(a in l):\r\n print(l.index(a)+1,i+1,j+1)\r\n sys.exit()\r\nprint(\"-1\")", "n = int(input())\na = list(map(int, input().split(' ')))\nfound = False\nfor i in range(n):\n for j in range(n):\n if i == j:\n continue\n for k in range(n):\n if k == i or k == j:\n continue\n if a[i] == a[j] + a[k]:\n print(i + 1, j + 1, k + 1)\n found = True\n break\n if found:\n break\n if found:\n break\nif not found:\n print(-1)\n", "n = int(input())\r\ns = map(int,input().split())\r\ns = list(s)\r\nc = True\r\nfor i in range(len(s)-1):\r\n if c == False:\r\n break\r\n else:\r\n for j in range(i+1,len(s)):\r\n q = (s[i] + s[j])\r\n if q in s:\r\n print(s.index(q)+1,i+1,j+1)\r\n c = False\r\n break\r\n \r\nif c == True:\r\n print(-1)", "n= int(input())\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i]+a[j] in a:\r\n print(a.index(a[i]+a[j])+1,i+1,j+1)\r\n exit()\r\n \r\n \r\nprint(-1)", "amount_of_forms = int(input())\r\nlengths_of_worms = list(map(int,input().split()))\r\n\r\nfor leng in range(0,amount_of_forms-1):\r\n for leng2 in lengths_of_worms[leng+1:]:\r\n if int(lengths_of_worms[leng]+leng2) in lengths_of_worms:\r\n for i in range(amount_of_forms-1):\r\n if lengths_of_worms[i] == leng2 and i != lengths_of_worms.index(leng2):\r\n final = i+1\r\n try:\r\n print(lengths_of_worms.index(lengths_of_worms[leng]+leng2)+1,final,leng+1)\r\n except:\r\n print(lengths_of_worms.index(lengths_of_worms[leng]+leng2)+1,lengths_of_worms.index(leng2)+1,leng+1)\r\n quit()\r\nprint(-1)\r\n", "n=int(input())\na=list(map(int,input().split()))\nf=0\nfor j in range(n):\n\tfor k in range(n):\n\t\tif j!=k:\n\t\t\tif a[j]+a[k] in a:\n\t\t\t\tprint(a.index(a[j]+a[k])+1,j+1,k+1)\n\t\t\t\tf=1\n\t\t\t\tbreak\n\tif f==1:\n\t\tbreak\nif f==0:\n\tprint(-1)\n \t \t \t\t \t\t\t \t\t \t\t\t\t\t\t \t\t \t\t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd={}\r\nans=[]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n a,b,c=arr[i],arr[j],arr[k]\r\n if a==b+c:\r\n ans.append((i+1,j+1,k+1))\r\n elif b==a+c:\r\n ans.append((j+1,i+1,k+1))\r\n elif c==a+b:\r\n ans.append((k+1,i+1,j+1))\r\nif not len(ans):\r\n print(-1)\r\nelse :\r\n print(*(ans[0]))", "n=int(input())\r\ncont=[int(item) for item in input().split()]\r\nans,neadBreak='-1',False\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n continue\r\n for k in range(n):\r\n if j==k or i==k:\r\n continue\r\n if cont[i]==cont[j]+cont[k]:\r\n ans='{} {} {}'.format(i+1,j+1,k+1)\r\n neadBreak=True\r\n break\r\n if neadBreak:\r\n break\r\n if neadBreak:\r\n break\r\n \r\nprint(ans)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i):\r\n if l[i]+l[j] in l:\r\n print (l.index(l[i]+l[j])+1,i+1,j+1)\r\n exit()\r\nprint(-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n for k in range(len(l)):\r\n if l[i] == l[j] + l[k] and j!=k:\r\n print(i+1, j+1, k+1)\r\n exit()\r\n \r\nprint(-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nc3=0\r\n\r\nfor i in range(len(a)):\r\n x=a[i]\r\n for j in range(i+1,len(a)):\r\n y=a[j]\r\n for k in range(j+1,len(a)):\r\n z=a[k]\r\n if(x==y+z):\r\n print(i+1,j+1,k+1)\r\n c1=1\r\n break\r\n elif(y==x+z):\r\n print(j+1,i+1,k+1)\r\n c2=1\r\n break\r\n elif(z==x+y):\r\n print(k+1,i+1,j+1)\r\n c3=1\r\n break\r\n \r\n if(c1==1 or c2==1 or c3==1):\r\n break\r\n if(c1==1 or c2==1 or c3==1):\r\n break\r\n\r\nif(c1==0 and c2==0 and c3==0):\r\n print(-1)", "import sys,math,string,bisect\nfrom itertools import *\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())\nS=lambda :input().strip()\nimport math,time\nn=I()\nl=L()\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if(l[i]==l[j]+l[k] and i!=j and j!=k and k!=i):\n \n print(i+1,j+1,k+1)\n exit()\nprint(-1)\n", "n = int(input())\r\nA = [*map(int, input().split())]\r\nX = set(A)\r\n\r\nfor i in range(n):\r\n\tfor j in range(i):\r\n\t\tif A[i]+A[j] in X:\r\n\t\t\tprint(A.index(A[i]+A[j])+1, i+1, j+1)\r\n\t\t\texit()\r\n\r\nprint(-1)", "n = int(input())\na = [int(i) for i in input().split()]\n\nfor i in range(n):\n for j in range(n):\n if j == i: continue\n\n for k in range(n):\n if k == j or k == i: continue\n\n if a[i] == a[j] + a[k]:\n print(i+1, j+1, k+1)\n exit(0)\n\nprint(-1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(n):\r\n ai=arr[i]\r\n for j in range(n):\r\n if i!=j:\r\n aj=arr[j]\r\n ak=ai-aj\r\n if arr.count(ak)>0:\r\n ind=arr.index(ak)\r\n if ind!=j:\r\n flag=1\r\n print(i+1,j+1,ind+1)\r\n break\r\n if flag==1:\r\n break\r\nif flag==0:\r\n print(-1)\r\n \r\n", "n = int(input())\r\narr = tuple(map(int, input().strip().split(' ')))\r\nmilon = {}\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n k = arr[i] + arr[j]\r\n if k not in milon:\r\n milon[k] = (i, j)\r\nfor i in range(n):\r\n if arr[i] in milon:\r\n v = milon[arr[i]]\r\n print('{} {} {}'.format(i+1, v[0]+1, v[1]+1))\r\n exit()\r\nprint(-1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfound = False\r\nfor i, x in enumerate(lst):\r\n for j in range(i+1, n):\r\n y = lst[j]\r\n for k in range(j+1, n):\r\n z = lst[k]\r\n s = x+y+z\r\n if s % 2 == 0 and s // 2 in [x,y,z]:\r\n if x + y == z: a,b,c = k,i,j\r\n elif y + z == x: a,b,c = i,j,k\r\n else: a,b,c = j,i,k\r\n print(f'{a+1} {b+1} {c+1}')\r\n found = True\r\n break\r\n if found: break\r\n if found: break\r\nelse:\r\n print(-1)", "n=int(input())\r\nl=list(map(int, input().split()))[:n]\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if l[j]+l[k]==l[i] and j!=k:\r\n print(i+1, k+1 , j+1)\r\n exit()\r\n \r\nelse:\r\n print(\"-1\")\r\n", "\r\nn = int(input())\r\ndatos = input().split()\r\nformas_original = []\r\nfor num in datos:\r\n formas_original.append(int(num)) \r\nformas = formas_original\r\n\r\nhay = False\r\n\r\ni = 0\r\nwhile i<n and not hay:\r\n j = 0\r\n while j<n and not hay:\r\n k = 0\r\n while k<n and not hay:\r\n if i != j and j != k:\r\n if formas[i] + formas[j] == formas[k]:\r\n print(k+1,j+1,i+1)\r\n hay = True\r\n k = k+1\r\n j = j+1\r\n i = i+1\r\nif not hay:\r\n print(-1)", "# Love you atreyee. Stay happy, keep me happy dear\nn = int(input())\na = list(map(int, input().rstrip().split()))\nflag=0\nfor i in range(n):\n w = a[i]\n for j in range(n):\n x = a[j]\n for k in range(n):\n y = a[k]\n # # print(i, j, k)\n # if i == 3 and j == 2 and k == 1:\n # print(w,x,y)\n if w == x + y and (i != j) and (j != k) and (k != i):\n flag = 1\n # print(i,j,k)\n break\n if flag == 1:\n break\n if flag == 1:\n break\nif flag == 1:\n print(i+1, j+1, k+1)\nelse:\n print(-1)", "n = int(input())\r\nl=[*map(int,input().split())]\r\nfor x in range(n):\r\n for y in range(n):\r\n if(x!=y and (l[x]+l[y] in l)):print(l.index((l[x]+l[y]))+1,x+1,y+1);exit()\r\nprint(-1)", "def main(n, nums):\r\n\tfor i in range(n-2):\r\n\t\tfor j in range(i+1,n-1):\r\n\t\t\tfor k in range(j+1,n):\r\n\t\t\t\tx = nums[i]\r\n\t\t\t\ty = nums[j]\r\n\t\t\t\tz = nums[k]\r\n\t\t\t\tif x==y+z:\r\n\t\t\t\t\treturn '{} {} {}'.format(i+1,j+1,k+1)\r\n\t\t\t\telif y==x+z:\r\n\t\t\t\t\treturn '{} {} {}'.format(j+1,i+1,k+1)\r\n\t\t\t\telif z==x+y:\r\n\t\t\t\t\treturn '{} {} {}'.format(k+1,i+1,j+1)\r\n\treturn -1\r\n\r\ndef init():\r\n\tn = int(input())\r\n\tnums = list(map(int, input().split()))\r\n\r\n\tprint(main(n, nums))\r\n\r\ninit()", "import sys\r\nn=int(input())\r\nf=0\r\nlist1=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if(list1[i]+list1[j] in list1):\r\n print(list1.index(list1[i]+list1[j])+1,i+1,j+1)\r\n f=1\r\n sys.exit()\r\n \r\nprint(-1)", "n=int(input())\nlength=[*map(int,input().split())]\nfor i in range(n):\n for j in range(i):\n diff=length[i]+length[j]\n if diff in length:\n print(length.index(diff)+1,i+1,j+1)\n exit()\nprint(-1)\n\n", "from collections import Counter\r\nfrom itertools import combinations\r\n\r\nif __name__ == '__main__':\r\n cin = input\r\n n = int(cin())\r\n a = [int(i) for i in input().split()]\r\n b = list(combinations(range(n), 2))\r\n for i in range(n):\r\n for c in b:\r\n if a[i] == a[c[0]] + a[c[1]]:\r\n print(\"%s %s %s\" % (i + 1, c[0] + 1, c[1] + 1))\r\n exit()\r\n else:\r\n print(-1)", "n = int(input())\r\nyes = 0\r\na = [int(_) for _ in input().split()]\r\nfor i in range(len(a)):\r\n if yes == 1:\r\n break\r\n for _ in range(i + 1, len(a)):\r\n if yes == 1:\r\n break\r\n for j in range(_ + 1, len(a)):\r\n if a[i] + a[j] == a[_]:\r\n print(_ + 1, i + 1, j + 1)\r\n yes = 1\r\n break\r\n elif a[i] + a[_] == a[j]:\r\n print(j + 1, i + 1, _ + 1)\r\n yes = 1\r\n break\r\n elif a[_] + a[j] == a[i]:\r\n print(i + 1, _ + 1, j + 1)\r\n yes = 1\r\n break\r\nprint(-1 if yes == 0 else '')", "n = int(input())\nlst = list(map(int, input().split()))\nchecker = 0\n\nfor i in range(n):\n for j in range(n):\n if i != j:\n for q in range(n):\n if q!= j and lst[i] == lst[j] + lst[q]:\n print(i + 1, j + 1, q + 1)\n checker = 1\n break\n if checker == 1:\n break\n if checker == 1:\n break\nif checker == 0:\n print(\"-1\")\n\t\t\t \t\t\t\t \t\t\t\t\t\t \t \t\t\t \t \t \t\t", "\nn = int(input())\n\nA = [int(x) for x in input().split()]\n\nfound = False\n\n\nfor i in range(n):\n for j in range(i):\n if A.count(A[i] + A[j]) > 0:\n found = True\n a, b, c = i + 1, j + 1, A.index(A[i] + A[j]) + 1\n break\n\nif found:\n print(c, b, a)\nelse:\n print(-1)\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for k in range(j + 1, n):\r\n lst = [(arr[i], i + 1), (arr[j], j + 1), (arr[k], k + 1)]\r\n lst.sort()\r\n if lst[0][0] + lst[1][0] == lst[2][0]:\r\n print(lst[2][1], lst[1][1], lst[0][1])\r\n exit(0)\r\nprint(-1)\r\n", "n=int(input())\r\na=map(int,input().split())\r\na=list(a)\r\ni=0\r\nwhile i<n:\r\n j=0\r\n while j<n:\r\n k=0\r\n while k<n:\r\n if i!=j and i!=k and j!=k:\r\n if a[i]+a[j]==a[k] or a[j]+a[k]==a[i] or a[k]+a[i]==a[j]:\r\n b=[a[i],a[j],a[k]]\r\n b.sort(reverse=True)\r\n mx=0\r\n if b[0]==a[i]: mx=i+1\r\n elif b[0]==a[j]: mx=j+1\r\n else: mx=k+1\r\n c=[i+1,j+1,k+1]\r\n print(mx,end=\" \")\r\n for it in c:\r\n if it!=mx: print(it,end=\" \")\r\n exit()\r\n k+=1\r\n j+=1\r\n i+=1\r\nprint(-1)", "d = int(input())\r\nn = 1\r\nx = [int(_) for _ in input().split()]\r\nfor i in range(d):\r\n for j in range(d):\r\n for p in range(d):\r\n if x[i] == x[j]+x[p]:\r\n if j!=p and n==1:\r\n print(i+1,j+1,p+1) \r\n n = 0\r\nif n!=0:\r\n print('-1')\r\n \r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nf = False\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n if arr[i]+arr[j]==arr[k]:\r\n f = True\r\n print(k+1,i+1,j+1)\r\n elif arr[i]+arr[k]==arr[j]:\r\n f = True\r\n print(j+1,i+1,k+1) \r\n elif arr[j]+arr[k]==arr[i]:\r\n f = True\r\n print(i+1,j+1,k+1)\r\n if f :\r\n break\r\n if f :\r\n break\r\n if f:\r\n break\r\nif not f:\r\n print(-1)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if arr[i]+arr[j] in arr:\r\n print(arr.index(arr[i]+arr[j])+1, i+1,j+1)\r\n exit()\r\nprint(-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nflag=0\r\njav=[]\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if a[i]+a[j] in a:\r\n jav+=[i,j]\r\n flag=1\r\n break\r\n if i == n-2 and j ==n-1:\r\n print(-1)\r\n if flag==1:\r\n break\r\nif flag==1:\r\n for i in range(n):\r\n if a[jav[0]]+a[jav[1]]==a[i]:\r\n print(i+1,jav[0]+1,jav[1]+1)\r\n break", "def main():\n i, l, aa = input(), [0] * 2001, []\n for i, a in enumerate(map(int, input().split()), 1):\n l[a] = i\n aa.append((i, a))\n while aa:\n i, a = aa.pop()\n for j, b in aa:\n if l[a + b]:\n return print(l[a + b], i, j)\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nl = [*map(int,input().split())]\r\ncnt = 0; a = []\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n if(l[i] == (l[j]+l[k])): a.extend([i+1,j+1,k+1]); cnt = 1\r\n elif(l[j] == (l[i]+l[k])): a.extend([j+1,i+1,k+1]); cnt = 1\r\n if(l[k] == (l[j]+l[i])): a.extend([k+1,i+1,j+1]); cnt = 1\r\n if(cnt):break\r\n if(cnt):break\r\n if(cnt):break\r\nif(cnt):print(*a)\r\nelse:print(-1)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\nn = INT()\r\narr = LIST()\r\nans = []\r\nk = 0\r\nwhile k < n :\r\n flag = False\r\n for i in range(n):\r\n f = False\r\n for j in range(n):\r\n if i != j and i != k and j != k and arr[i] + arr[j] == arr[k] :\r\n ans += [arr.index(arr[k]) + 1 , i + 1 , j + 1]\r\n f = True\r\n flag = True\r\n break\r\n if f :\r\n break\r\n if flag:\r\n break\r\n k+=1\r\n\r\nif ans == []:\r\n print('-1')\r\nelse:\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\na = list(map(int,input().split()))\n\nflag = False\nfor i in range(n):\n for j in range(i+1,n):\n if a[i] + a[j] in a:\n print(a.index(a[i]+a[j])+1,j+1,i+1)\n flag = True\n break\n if flag: break\nelse:\n print(-1)\n\n\t \t \t \t\t\t \t\t \t\t \t\t \t", "# LUOGU_RID: 102537600\nn, *a = map(int, open(0).read().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and a[i] + a[j] in a:\r\n exit(print(a.index(a[i] + a[j]) + 1, j + 1, i + 1))\r\nprint(-1)\r\n", "t=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\nfor i in range(t):\r\n for j in range(t):\r\n if(j!=i):\r\n for k in range(t):\r\n if(k!=i and k!=j):\r\n if(l[i]==l[j]+l[k] and e!=1):\r\n print(i+1,j+1,k+1)\r\n e=1\r\n break\r\n \r\n if(e==1):\r\n break\r\nif(e==0):\r\n print(-1)\r\n", "n, t = int(input()), list(map(int, input().split()))\r\ns, p = set(t), -1\r\nfor i in range(n - 1):\r\n x = t[i]\r\n for j in range(i + 1, n):\r\n if x + t[j] in s:\r\n p = ' '.join(map(str, (t.index(x + t[j]) + 1, i + 1, j + 1)))\r\n break\r\nprint(p)", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i != j and a[i]+a[j] in a:\r\n print(a.index(a[i]+a[j])+1,max(i+1,j+1),min(i+1,j+1)); exit()\r\nprint(-1)", "n = int(input())\r\nmyList = list(map(int, input().split()))\r\nans = '-1'\r\nfor i in range(n): # 0\r\n for j in range(n): # 1\r\n if j == i:\r\n continue\r\n for k in range(n):\r\n if j == i or k == j:\r\n continue\r\n if myList[i] + myList[j] == myList[k]:\r\n # ans = '{} {} {}'.format(i+1, j+1, k+1)\r\n ans = f'{k + 1} {j + 1} {i + 1}'\r\n break\r\n if ans != '-1':\r\n break\r\n if ans != '-1':\r\n break\r\nprint(ans)", "from sys import exit\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\np=set(l)\r\nfor i in range(n):\r\n for j in range(i):\r\n if l[i]+l[j] in p:\r\n print(l.index(l[i]+l[j])+1,i+1,j+1)\r\n exit()\r\nprint(\"-1\")\r\n", "n = int(input())\r\nw = [int(i) for i in input().split()]\r\nf = False\r\n\r\nfor i in range(n):\r\n if f:\r\n break\r\n\r\n for j in range(n):\r\n if f:\r\n break\r\n if i == j:\r\n continue\r\n\r\n for k in range(n):\r\n if f:\r\n break\r\n\r\n if k == i or j == k:\r\n continue\r\n\r\n if w[i] == w[j] + w[k]:\r\n a, b, c = i, j, k\r\n f = True\r\n\r\n elif w[j] == w[k] + w[i]:\r\n a, b, c = j, i, k\r\n f = True\r\n\r\n elif w[k] == w[i] + w[j]:\r\n f = True\r\n a, b, c = k, i, j\r\n\r\nif f:\r\n print(a+1, b+1, c+1)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nworm_lengths = list(map(int, input().split()))\r\n\r\n# Iterate through all possible combinations of three worm forms\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i != j and i != k and j != k: # Ensure the three forms are distinct\r\n if worm_lengths[i] == worm_lengths[j] + worm_lengths[k]:\r\n print(i + 1, j + 1, k + 1) # Add 1 to the indices to match 1-based indexing\r\n exit()\r\n\r\n# If no such triple is found, output -1\r\nprint(-1)", "n = int(input())\nx = [int(i) for i in input().split()]\ny = sorted(x, reverse = True)\n\nfor i in range(n):\n\tfor j in range(len(y[i + 1:])):\n\t\tif y[i] - y[i + 1:][j] in y[i + 1:][j + 1:]:\n\t\t\ta = x.index(y[i])\n\t\t\tx[a] = None\n\t\t\tb = x.index(y[i + 1:][j])\n\t\t\tx[b] = None\n\t\t\tc = x.index(y[i + 1:][j + 1:][y[i + 1:][j + 1:].index(y[i] - y[i + 1:][j])])\n\t\t\tprint(a + 1, b + 1, c + 1)\n\t\t\texit()\n\nprint(-1)\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\np = [(t[i] + t[j], i, j) for i in range(n) for j in range(i + 1, n)]\r\ns, ans = set(t), -1\r\nfor x, i, j in p:\r\n if x in s:\r\n ans = ' '.join(map(str, (t.index(x) + 1, i + 1, j + 1)))\r\n break\r\nprint(ans)", "int(input())\r\nres = 0\r\na = [int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for l in range(len(a)):\r\n if sum((a[j], a[l])) == a[i] and i != j and j != l and i != l:\r\n res = (str(x) for x in (i+1, j+1, l+1))\r\nif res: print(' '.join(res))\r\nelse: print(-1)\r\n", "n, a = int(input()), list(map(int, input().split()))\r\ns = set(a)\r\nf = False\r\n\r\nfor i in range(len(a) - 1):\r\n for j in range(i + 1, len(a)):\r\n if a[i] + a[j] in s:\r\n print(a.index(a[i] + a[j]) + 1, i + 1, j + 1)\r\n f = True\r\n break\r\n if f:\r\n break\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\ne = {i for i in s}\r\nc = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i!=j:\r\n\t\t\tif s[i]+s[j] in e:\r\n\t\t\t\tc = [s.index(s[i]+s[j])+1,i+1,j+1]\r\nif c:\r\n\tprint(*c)\r\nelse:\r\n\tprint(-1)", "#ROUNIAAUDI\r\nnum1=int(input())\r\nlist1=list(map(int,input().split()))\r\nd=0\r\ny=True\r\nfor u in range(num1):\r\n for i in range(u+1,num1):\r\n d=list1[u]+list1[i]\r\n if d in list1 and y:\r\n print(list1.index(d)+1,u+1,i+1)\r\n y=False\r\n\r\nif y:\r\n print(-1)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef ok(i, j, k):\r\n print(i + 1, j + 1, k + 1)\r\n exit()\r\n\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for k in range(j + 1, n):\r\n if a[i] == a[j] + a[k]:\r\n ok(i, j, k)\r\n if a[j] == a[i] + a[k]:\r\n ok(j, i, k)\r\n if a[k] == a[i] + a[j]:\r\n ok(k, i, j)\r\nprint(-1)\r\n", "#Cypher\r\n#Indian Institute of Technology, Jodhpur\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef binary_search(arr, low, high, x): # Time complexity = log(n)\r\n if high >= low:\r\n mid = (high + low) // 2\r\n if arr[mid] == x: return mid\r\n elif arr[mid] > x: return binary_search(arr, low, mid - 1, x)\r\n else: return binary_search(arr, mid + 1, high, x)\r\n else: return -1\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=sorted(a)\r\nb=[]\r\nindi=0\r\nfor i in a:\r\n b.append((i,indi))\r\n indi+=1\r\nb.sort(key=lambda x:x[0])\r\n# print(b)\r\nans=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n temp=b[i][0]+b[j][0]\r\n if binary_search(c,0,len(a)-1,temp):\r\n ans=binary_search(c,0,len(a)-1,temp)\r\n if ans!=-1:\r\n print(b[ans][1]+1,b[i][1]+1,b[j][1]+1)\r\n # print(a[ans],a[i],a[4])\r\n # print(temp)\r\n exit()\r\nprint(-1)\r\n\r\n", "import sys\r\nn=int(input())\r\nnum=list(map(int,input().split()))\r\nflag=[1 for i in range(0,2100)]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n temp=num[i] + num[j]\r\n if(flag[temp] and num.count(temp)):\r\n print(num.index(temp)+1,i+1,j+1)\r\n sys.exit(0)\r\n else: flag[temp]=0\r\nprint('-1')\r\n", "from collections import Counter\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\ncnt=Counter()\r\nfor i in range(n):\r\n cnt[x[i]]=i+1\r\nk=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if cnt[x[i]+x[j]]!=0:\r\n k=[cnt[x[i]+x[j]],j+1,i+1]\r\nif k!=0:\r\n for i in k:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = rr()\r\narr = list(enumerate(arr, 1))\r\narr.sort(key=lambda x: x[1], reverse=True)\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for k in range(j + 1, n):\r\n if arr[i][1] == arr[j][1] + arr[k][1]:\r\n print(arr[i][0], arr[j][0], arr[k][0])\r\n exit()\r\n\r\nprint(-1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for k in range(n):\r\n if i != k and j != k and a[i] + a[j] == a[k]:\r\n print(k + 1, i + 1, j + 1)\r\n exit(0)\r\nprint(-1)# 1698319511.6480844", "n = int(input())\r\nls = list(map(int,input().split()))\r\nflag = False\r\nfor i in range (n) :\r\n for j in range(n) :\r\n if j == i :\r\n continue\r\n for k in range(n) :\r\n if k == i or k == j :\r\n continue\r\n if ls[i] + ls[j] == ls[k] :\r\n print(k+1,j+1,i+1)\r\n flag = True\r\n break\r\n if flag :\r\n break\r\n if flag :\r\n break\r\nelse :\r\n print(-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n for k in range(n):\r\n if i!=k and j!=k and a[i]==a[j]+a[k]:\r\n z=1\r\n print(i+1,j+1,k+1)\r\n break\r\n if z==1:\r\n break\r\n if z==1:\r\n break\r\nif z==0:\r\n print(-1)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\na = [int(s) for s in sys.stdin.readline().split()]\r\n\r\nh = {}\r\nfor i in range(0, n):\r\n h[a[i]] = i\r\n\r\nfor i in range(0, n):\r\n for j in range(i + 1, n):\r\n if (a[i] + a[j]) in h:\r\n print(\"%d %d %d\" % (h[a[i] + a[j]] + 1, i + 1, j + 1))\r\n exit(0)\r\n\r\nprint(-1)", "\r\nn = int(input())\r\na = []\r\nmp = map(int,input().split())\r\nfor k in mp:\r\n a.append(k)\r\nfound = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n for k in range(n):\r\n if i!=k and j!=k and a[i]==a[j]+a[k]:\r\n print((i+1),(j+1),(k+1))\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)", "n = int(input())\r\nl = list((map(int,input().split())))\r\n\r\n\r\nfor i in range(n):\r\n target = l[i]\r\n for j in range(n):\r\n for k in range(n):\r\n if j != k and l[j] + l[k] == target:\r\n \r\n print(i+1,k+1,j+1)\r\n exit()\r\nprint(-1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nflag=False\r\ndef fun():\r\n\tfor i in range(len(arr)):\r\n\t\tfor j in range(i+1,len(arr)):\r\n\t\t\ts=arr[i]+arr[j]\r\n\t\t\tfor k in range(len(arr)):\r\n\t\t\t\tif s==arr[k]:\r\n\t\t\t\t\tprint(k+1,j+1,i+1)\r\n\t\t\t\t\treturn True\r\n\r\n\t\t\t\r\n\t\t\t\r\n\t\r\nif(fun()):\r\n\tpass\r\nelse:\r\n\tprint(-1)", "import math\r\nimport itertools\r\nimport collections\r\n\r\ndef getdict(n):\r\n d = {}\r\n if type(n) is list:\r\n for i in n:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n else:\r\n for i in range(n):\r\n t = ii()\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\n return d\r\ndef cdiv(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a*b) // math.gcd(a, b)\r\n\r\nn = ii()\r\na = li()\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if a[i] == a[j] + a[k] and i != j and j != k and i != k:\r\n print(i + 1, j + 1, k + 1)\r\n exit()\r\nprint(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = [-1]\r\nfor j in range(n):\r\n for k in range(n):\r\n if not j ^ k:\r\n continue\r\n s = a[j] + a[k]\r\n for i in range(n):\r\n if not i ^ j or not i ^ k:\r\n continue\r\n if not s ^ a[i]:\r\n ans = [i + 1, j + 1, k + 1]\r\n break\r\n if ans[0] ^ -1:\r\n break\r\n if ans[0] ^ -1:\r\n break\r\nprint(*ans)", "from itertools import permutations\nn=int(input())\nl=list(map(int,input().split()))\nfor i ,j ,k in permutations(range(n),3):\n if l[i]==l[j]+l[k]:\n print (i+1 ,j+1,k+1)\n break\nelse:\n print(-1)\n \n\n\t\t \t\t \t\t \t \t \t \t\t \t \t\t\t\t\t", "def evolution():\n n = int(input())\n worms = list(map(int, input().split()))\n \n for i in range(n - 1):\n for j in range(1, n):\n for k in range(n):\n \n if worms[i] + worms[j] == worms[k]:\n print(k + 1, i + 1, j + 1)\n return 0\n \n \n return 1\n\n\ndef main():\n if evolution():\n print(\"-1\")\n \nmain()\n \t \t \t\t\t\t \t\t\t\t \t\t\t\t", "n=int(input())\r\ncontainer = list(map(int, input().split()))\r\nans=\"-1\"\r\nneedbreak=False\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if j==i:\r\n continue\r\n for k in range(0,n):\r\n if k==i or k==j:\r\n continue\r\n if container[i]==container[j]+container[k]:\r\n ans=str(i+1)+' '+str(j+1)+' '+str(k+1)\r\n needbreak=True\r\n break\r\n if needbreak==True:\r\n break\r\n if needbreak==True:\r\n break\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=0\r\nfor i in range(0,n):\r\n\tfor j in range(0,n):\r\n\t\tif(((a[i]+a[j]) in a)and i!=j):\r\n\t\t\tprint(a.index(a[i]+a[j])+1,i+1,j+1)\r\n\t\t\tf=1\r\n\t\t\tbreak\r\n\tif(f==1):\r\n\t\tbreak\r\nif(f==0):\r\n\tprint(-1)", "n=int(input())\r\na=[[int(j),i] for i,j in enumerate(input().split(' '))]\r\nb=sorted(a)[::-1]\r\ns='-1'\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n if b[i][0]==b[j][0]+b[k][0]:\r\n s=str(b[i][1]+1)+' '+str(b[j][1]+1)+' '+str(b[k][1]+1)\r\nprint(s)\r\n ", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nd1={}\r\nfor i in range(n):\r\n d1[l1[i]]=i\r\nimport sys\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if l1[i]+l1[j] in d1:\r\n print (d1[l1[i]+l1[j]]+1,i+1,j+1)\r\n sys.exit()\r\nprint(-1)", "a=int(input())\nb=input()\nc=b.split()\nfor i in range(len(c)):\n c[i]=int(c[i])\nfor i in range(len(c)):\n for o in range(len(c)):\n c[o]=int(c[o])\n if o==i:\n continue\n for x in range(len(c)):\n c[x]=int(c[x])\n if c[x]!=c[o] and c[x]!=c[i] and c[x]==c[i]+c[o]:\n print(x+1,o+1,i+1)\n exit()\nprint(-1)\n\t \t\t\t \t \t\t \t \t \t\t \t \t\t\t", "# author: violist\n# created: 04.04.2022 19:46:23\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if (i != j and i != k and j != k):\n if (a[j] < a[i] > a[k] and a[j] + a[k] == a[i]):\n print(i + 1, j + 1, k + 1)\n sys.exit()\n elif (a[i] < a[j] > a[k] and a[i] + a[k] == a[j]):\n print(j + 1, i + 1, k + 1)\n sys.exit()\n elif (a[i] < a[k] > a[j] and a[i] + a[j] == a[k]):\n print(k + 1, i + 1 , j + 1)\n sys.exit()\nprint(-1)\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nflag=0\r\nfor i in range(n):\r\n for j in range(0,n-1):\r\n for k in range(j+1,n) :\r\n if(list[i]==(list[k]+list[j])):\r\n p=i+1\r\n q=k+1\r\n r=j+1\r\n print(p,q,r)\r\n exit()\r\nprint(\"-1\")", "n = int(input())\r\nlengths = list(map(int, input().split()))\r\nindex = [-1]\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n sum = lengths[i] + lengths[j]\r\n if sum in lengths:\r\n if -1 in index:\r\n index.remove(-1)\r\n index.append(lengths.index(sum)+1)\r\n index.append(i+1)\r\n index.append(j+1)\r\n \r\nif len(index) > 2: \r\n print(str(index[0]) + \" \" + str(index[1]) + \" \" + str(index[2]))\r\nelse:\r\n print(index[0])", "n = int(input())\r\nlis=list(map(int,input().split()))\r\nhas=[0]*2002\r\nfor i in range(n):\r\n has[lis[i]]=i+1 \r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if has[lis[i]+lis[j]]:\r\n print(has[lis[i]+lis[j]],i+1,j+1)\r\n exit() \r\nprint(\"-1\") \r\n", "n = int(input())\r\nline = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if line[i] + line[j] in line:\r\n print(line.index(line[i] + line[j])+1, i+1, j+1)\r\n exit(0)\r\nprint('-1')", "n=int(input())\r\na=(list(map(int,input().split())))\r\nb=[]\r\nfor i in range(n):\r\n b.append([a[i],i])\r\nb.sort()\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if b[k][0]==(b[i][0]+b[j][0]):\r\n exit(print(b[k][1]+1,b[j][1]+1,b[i][1]+1))\r\nprint(-1)", "n = int(input())\r\ns = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\t\r\nmid = 0\r\nfor i in range(len(a)-1):\r\n\tfor j in range(i+1,len(a)):\r\n\t\tif (a[i]+a[j]) in a:\r\n\t\t\tprint(a.index(a[i]+a[j])+1, end = ' ')\r\n\t\t\tprint(j+1, end = ' ')\r\n\t\t\tprint(i+1)\r\n\t\t\tmid += 1\r\n\t\t\tbreak\r\n\tif mid != 0: \r\n\t\tbreak\r\nif mid == 0:\r\n\tprint(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 19 15:10:56 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nx = sorted(s)\r\nindice =[]\r\nfor i in range(n-1,-1,-1):\r\n if len(indice)==3:\r\n break\r\n for k in range(i):\r\n if len(indice)==3:\r\n break\r\n if x[i]-x[k] in x:\r\n indice.append(s.index(x[i]))\r\n indice.append(s.index(x[k]))\r\n if s.index(x[i]-x[k])==s.index(x[k]):\r\n if s[s.index(x[k])+1]!=x[k]:\r\n break\r\n else:\r\n indice.append(s.index(x[k])+1)\r\n else:\r\n indice.append(s.index(x[i]-x[k]))\r\n \r\nif len(indice)==3:\r\n print(f'{indice[0]+1} {indice[1]+1} {indice[2]+1}')\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = ''\r\ndef check(a):\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i]+a[j] in a and i != j:\r\n return str(a.index(a[i]+a[j])+1)+' '+str(j+1)+' '+str(i+1)\r\n return -1\r\nprint(check(a))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n\tfor j in range(i):\r\n\t\tif a[i] + a[j] in a:\r\n\t\t\tprint(a.index(a[i] + a[j]) + 1, i + 1, j + 1)\r\n\t\t\texit()\r\nprint(-1)", "def wrapper():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n \r\n for i, _1 in enumerate(a):\r\n for j, _2 in enumerate(a):\r\n if i == j:\r\n continue\r\n if _1+_2 in a:\r\n print(a.index(_1+_2)+1, i+1, j+1)\r\n return\r\n print(-1)\r\nwrapper() ", "import math\r\ndef ans(l,n):\r\n l1=[]\r\n x=0\r\n y=0\r\n z=0\r\n for i in range(0,len(l),1):\r\n for j in range(i+1,len(l),1):\r\n if(l[i]+l[j]==n):\r\n l1.append(i)\r\n l1.append(j)\r\n l1.append(n)\r\n if(l1):\r\n return l1\r\n \r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\np=0\r\nfor i in range(0,len(l),1):\r\n f=ans(l,l[i])\r\n if(f):\r\n k=f\r\n p=1\r\n break\r\n else:\r\n p=0\r\nif(p==0):\r\n print(-1)\r\nelse:\r\n n=0\r\n g=len(k)\r\n h=k[g-1]\r\n for i in range(0,len(l),1):\r\n if(l[i]==h):\r\n n=i\r\n break\r\n \r\n k.reverse()\r\n print(n+1,end=' ')\r\n for i in range(1,g,1):\r\n print(int(k[i])+1,end=' ')\r\n print()\r\n \r\n\r\n\r\n \r\n\r\n \r\n", "n=int(input())\narr=[int(i) for i in input().split()]\nansi=-1\nansj=-1\nansk=-1\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if arr[i]== arr[j]+ arr[k]and j!=k:\n ansi= i\n ansj= j\n ansk= k\nif ansi==-1:\n print(-1)\nelse:\n print(ansi+1,ansj+1,ansk+1)\n\n\n\n \t \t\t\t \t \t \t \t\t \t\t \t \t \t \t", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if j != k and a[j] + a[k] == a[i]:\n print(i + 1, j + 1, k + 1)\n exit()\nprint(-1)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(a):\r\n for j in range(a):\r\n for k in range(a):\r\n if(i!=j!=k):\r\n if(b[i]==b[j]+b[k]):\r\n print(i+1,j+1,k+1)\r\n exit()\r\nprint(-1)\r\n# CodeBy: RAHUL MAHAJAN\r\n# A2OJ: rahulmahajan\r\n# CC: anonymous0201\r\n# CF: rahulmahajan\r\n# CSES: rahulmahajan", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n):\n for j in range(i + 1 , n):\n for k in range(j + 1 , n):\n x = -1;y = -1;z = -1\n if a[i] + a[j] == a[k]:\n x, y, z = k, i, j\n elif a[k] + a[j] == a[i]:\n x, y, z = i, k, j\n elif a[i] + a[k] == a[j]:\n x, y, z = j, i, k\n if x != -1 and y != -1 and z != -1:\n print(str(x + 1) + \" \" + str(y + 1) + \" \" + str(z + 1))\n exit(0)\nprint(-1)\n", "input()\r\ncont = [int(item) for item in input().split()]\r\nans, contLen, needBreak = '-1', len(cont), False\r\nfor i in range(contLen):\r\n for j in range(contLen):\r\n if i == j:\r\n continue\r\n for k in range(contLen):\r\n if k == i or k == j:\r\n continue\r\n if cont[i] == cont[j] + cont[k]:\r\n ans = '{} {} {}'.format(i + 1, j + 1, k + 1)\r\n needBreak = True\r\n break\r\n if needBreak:\r\n break\r\n if needBreak:\r\n break\r\n\r\nprint(ans)\r\n", "input()\r\na = [int(a) for a in input().split()]\r\nfor k in range(len(a)):\r\n for i in range(len(a)):\r\n if i==k:\r\n continue\r\n for j in range(len(a)):\r\n if i==j or j==k :\r\n continue\r\n if a[k]==a[i]+a[j]:\r\n print(k+1,i+1,j+1)\r\n exit()\r\nprint(-1)", "l = int(input());arr = list(map(int,input().split()))\r\nans = \"-1\"\r\nflag1 = False\r\nflag2 = False\r\nfor i in range(l):\r\n if flag1: break\r\n for j in range(l):\r\n if flag2: break\r\n for k in range(l):\r\n if arr[i] == arr[j]+arr[k] and (i!= j != k):\r\n ans = str(i+1)+' '+str(j+1)+' '+str(k+1)\r\n flag1 = True\r\n flag2 = True\r\n break\r\nprint(ans)\r\n", "from itertools import permutations\r\nn = int(input())\r\nl = [*([i,int(x)] for i,x in enumerate(input().split(),1))]\r\na = [*permutations(l,3)]\r\ncnt = 1\r\nfor x in a:\r\n if(x[0][1]==x[1][1]+x[2][1]):cnt = 0;print(x[0][0],x[1][0],x[2][0]);break\r\nif(cnt):print(-1)", "x = int(input())\narr = [int(i) for i in input().split()]\nfor i in range(len(arr)):\n for j in range(len(arr)):\n if i==j:\n continue\n for k in range(len(arr)):\n if arr[k]!=arr[j] and arr[k]!=arr[i] and arr[k]==arr[j]+arr[i]:\n print(k+1,j+1,i+1)\n exit()\nprint(-1)\n\n\n \n \t \t\t \t\t\t \t \t", "x = int(input())\r\nls = list(map(int, input().split()))\r\nans = []\r\nfor i in range(x) : \r\n for j in range(x) : \r\n if i == j : \r\n continue\r\n sum = ls[i] + ls[j]\r\n # print(sum)\r\n if sum in ls : \r\n ans.append(i + 1)\r\n ans.append(j + 1)\r\n ans.append(ls.index(sum) + 1)\r\n break\r\n if len(ans) > 0 : \r\n break\r\n\r\n\r\nif (len(ans) >= 1) : \r\n print(ans[2], ans[1], ans[0])\r\n\r\nelse : print(-1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n for k in range(n):\r\n if i == k or j == k:\r\n continue\r\n if l[i] == l[j] + l[k]:\r\n print(i + 1, j + 1, k + 1)\r\n exit(0)\r\nprint(-1)\r\n", "import sys, collections, heapq, math\r\nreadline = sys.stdin.readline\r\n\r\n\"\"\"\r\nA + B = C\r\n\r\n\r\n\r\n\"\"\"\r\n\r\ndef solve(A):\r\n\r\n for i, k in enumerate(A):\r\n seen = {}\r\n for j, val in enumerate(A):\r\n if i == j: continue\r\n if k - val in seen:\r\n print(i + 1, j + 1, seen[k - val])\r\n return\r\n seen[val] = j + 1\r\n print(-1)\r\n return \r\n\r\n\r\n\r\n\r\n\r\nn = int(readline())\r\nsolve(list(map(int, readline().split())))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i!=j!=k and a[i]==a[j]+a[k]:\r\n print(i+1,j+1,k+1)\r\n exit()\r\nprint(-1)\r\n", "n = int(input())\na = sorted(map(lambda t: (int(t[1]), t[0] + 1), enumerate(input().split())))\nfor i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n if a[i][0] + a[j][0] == a[k][0]:\n print(a[k][1], a[i][1], a[j][1])\n import sys; sys.exit()\nprint(-1)\n", "n = int(input())\nworm_lengths = list(map(int, input().split()))\n\nfor i in range(n):\n for j in range(n):\n if i != j:\n for k in range(n):\n if k != i and k != j:\n if worm_lengths[i] == worm_lengths[j] + worm_lengths[k]:\n print(i + 1, j + 1, k + 1)\n exit(0)\n\n# If no valid triplet is found, print -1\nprint(-1)\n\n \t \t\t \t \t\t\t \t \t\t \t \t\t \t \t\t\t\t", "n = int(input())\r\nans = '-1'\r\ntempArr = [int(item) for item in input().split(' ')]\r\n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if j == i: continue\r\n if tempArr[i] + tempArr[j] in tempArr:\r\n k = tempArr.index(tempArr[i] + tempArr[j])\r\n ans = str(k + 1) + ' ' + str(i + 1) + ' ' + str(j + 1)\r\n if ans != '-1': break\r\n if ans != '-1': break\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=0\r\nd=[]\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n s=l[i]+l[j]\r\n if(s in l):\r\n x=l.index(s)\r\n if(x!=i and x!=j):\r\n d=[x+1,i+1,j+1]\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\nif(f==1):\r\n print(*d)\r\nelse:\r\n print(-1)\r\n", "from math import *\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (a[i] + a[j]) in a:\r\n print(a.index(a[i]+a[j])+1,i+1,j+1)\r\n exit(0)\r\nprint(-1)", "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\n# def solve():\r\n\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = int_arr()\r\nout = []\r\nd = {}\r\ndind = {}\r\nans = []\r\n\r\nfor i in range(n):\r\n if arr[i] in d:\r\n d[arr[i]] += 1\r\n dind[arr[i]].append(i)\r\n else:\r\n d[arr[i]] = 1\r\n dind[arr[i]] = [i]\r\n\r\nfg = 1\r\nfor i in range(n):\r\n if not fg:\r\n break\r\n for j in range(n):\r\n if i != j:\r\n if arr[i]-arr[j] in arr:\r\n out = [arr[i],arr[j],arr[i]-arr[j]]\r\n if len(set(out)) < 3:\r\n out.sort()\r\n if out[0] == out[1] and d[out[1]] > 1:\r\n ans = [ [ dind[out[0]][0],out[0] ], [dind[out[0]][1],out[1]], [dind[out[2]][0],out[2]] ]\r\n fg = 0\r\n break\r\n elif out[1] == out[2] and d[out[1]] > 1:\r\n ans = [ [ dind[out[0]][0],out[0] ], [dind[out[1]][1],out[1]], [dind[out[2]][0],out[2]] ]\r\n fg = 0\r\n break\r\n else:\r\n out = []\r\n ans = []\r\n else:\r\n ans = [ [ dind[out[0]][0],out[0] ], [dind[out[1]][0],out[1]], [dind[out[2]][0],out[2]] ]\r\n fg = 0\r\n break\r\n\r\nif ans != []:\r\n ans.sort(key = lambda x:x[1])\r\n res = []\r\n for i in ans:\r\n res.append(i[0]+1)\r\n print(*res[::-1])\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = sorted(a,reverse=True)\r\nf = 0\r\nfor i in range(n):\r\n s, e = i+1, n-1\r\n while s<e:\r\n if l[s]+l[e]==l[i]:\r\n f = 1\r\n t1, t2 = a.index(l[s]), a.index(l[e])\r\n if t1==t2:\r\n t2 = a.index(l[e], t1+1)\r\n print(a.index(l[i])+1, t1+1, t2+1)\r\n break\r\n elif l[s]+l[e]>l[i]:\r\n s+=1\r\n else:\r\n e-=1\r\n if f==1:\r\n break\r\nif f==0:\r\n print(-1)", "import sys\r\nn = int(input())\r\nlens = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if lens[i]+lens[j] in lens:\r\n print(lens.index(lens[i]+lens[j])+1, i+1, j+1)\r\n sys.exit(0)\r\nprint(-1)", "n = int(input())\r\nworms = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n continue\r\n for k in range(n):\r\n if i==k or j==k:\r\n continue\r\n if worms[i]+worms[j]==worms[k]:\r\n print(k+1, j+1, i+1)\r\n exit()\r\nprint(-1)\r\n" ]

[ "# HEY STALKER\r\nn, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nk = []\r\nfor t in range(m):\r\n x, y = map(int, input().split())\r\n while len(k) > 0 and k[-1][1] < y:\r\n k.pop()\r\n k.append([x, y])\r\na = 0\r\nb = k[0][1] - 1\r\nk.append([0, 0])\r\nsr = sorted(l[:b+1])\r\nfor i in range(1, len(k)):\r\n for j in range(k[i-1][1], k[i][1], -1):\r\n if k[i-1][0] == 1:\r\n l[j-1] = sr[b]\r\n b -= 1\r\n else:\r\n l[j-1] = sr[a]\r\n a += 1\r\nprint(*l)", "a,b=[int(i) for i in input().split()]\r\nq=[int(i) for i in input().split()]\r\ns=[]\r\nfor p in range(b):\r\n s+=[[int(i) for i in input().split()]]\r\nS=[]\r\nk=0\r\nfor p in range(b-1,-1,-1):\r\n if s[p][1]>k:\r\n S+=[s[p]]\r\n k=s[p][1]\r\nQ1=sorted(q[:S[-1][1]])\r\nx,y=0,S[-1][1]-1\r\nS=[[0,0]]+S\r\nl=1\r\nfor j in range(S[-1][1]-1,-1,-1):\r\n if x>y:break\r\n if j<S[-l][1]:\r\n k=S[-l][0]\r\n l+=1\r\n if k==1:\r\n q[j]=Q1[y]\r\n y-=1\r\n if k==2:\r\n q[j]=Q1[x]\r\n x+=1\r\nprint(' '.join(list(map(str,q))))\r\n", "from collections import deque\r\nn,k = map(int,input().split())\r\narr = [int(x) for x in input().split()]\r\nquery = []\r\nfor i in range(k):\r\n a,b = map(int,input().split())\r\n if(query):\r\n if(b >= query[-1][1]):\r\n while(query and b >= query[-1][1]):\r\n query.pop()\r\n query.append([a,b])\r\n else:\r\n query.append([a,b])\r\n else:\r\n query.append([a,b])\r\ndeq = deque(sorted(arr[:query[0][1]]))\r\nfor i in range(len(query)-1):\r\n ty,b = query[i][0],query[i][1]\r\n nex = query[i+1][1]\r\n if(ty == 1):\r\n # Ascending\r\n # from b to nex\r\n for idx in range(b-1, nex-1,-1):\r\n arr[idx] = deq[-1]\r\n deq.pop()\r\n else:\r\n # Descending\r\n for idx in range(b-1, nex-1,-1):\r\n arr[idx] = deq[0]\r\n deq.popleft()\r\nfor i in range(query[-1][1]-1, -1, -1):\r\n if(query[-1][0] == 1):\r\n arr[i] = deq[-1]\r\n deq.pop()\r\n else:\r\n arr[i]= deq[0]\r\n deq.popleft()\r\nprint(*arr)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = []\r\n\r\nfor i in range(m):\r\n s, r = map(int, input().split())\r\n while t and r >= t[-1][1]:\r\n t.pop()\r\n t.append([s, r])\r\nt.append([0, 0])\r\n\r\nx, y = 0, t[0][1] - 1\r\nres = sorted(a[:t[0][1]])\r\nfor i in range(1, len(t)):\r\n for j in range(t[i-1][1], t[i][1], -1):\r\n if t[i-1][0] == 1:\r\n a[j-1] = res[y]\r\n y -= 1 \r\n else:\r\n a[j-1] = res[x]\r\n x += 1\r\nprint(*a)\r\n", "import sys, os.path\r\nfrom collections import*\r\nfrom copy import*\r\nimport math\r\nmod=10**9+7\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=[]\r\nb=[]\r\nfor i in range(m):\r\n x,r=map(int,input().split())\r\n while(len(t)>0 and r>=t[-1][1]):\r\n t.pop()\r\n t.append([x,r])\r\nx=0\r\ny=t[0][1]-1\r\nt.append([0,0])\r\nb=sorted(a[:y+1])\r\nfor i in range(1,len(t)):\r\n for j in range(t[i-1][1],t[i][1],-1):\r\n if(t[i-1][0]==1):\r\n a[j-1]=b[y]\r\n y-=1\r\n else:\r\n a[j-1]=b[x]\r\n x+=1\r\nprint(*a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "n,m = map(int,input().split())\nrs = list(map(int,input().split()))\nstk = []\nfor _ in range(m):\n r,t = map(int,input().split())\n while stk and stk[-1][0] <= t:\n stk.pop()\n stk.append((t,r))\n\nstk.append((0,0))\nli = 0\nri = stk[0][0]\nsrs = sorted(rs[:ri])\n\nfor i in range(len(stk)-1):\n t,r = stk[i]\n l,_ = stk[i+1]\n df = t-l\n if r == 1:\n rs[l:t] = srs[ri-df:ri]\n ri -= df\n else:\n rs[l:t] = srs[li:li+df][::-1]\n li += df\n\n\nprint(*rs)", "\r\nn,m=[int(i) for i in input().split()]\r\n\r\n_report=[int(i) for i in input().split()]\r\n\r\nworking=[]\r\nfor i in range(m):\r\n x,y=map(int,input().split()) \r\n while len(working)!=0 and y>=working[-1][1]:\r\n working.pop()\r\n working.append([x,y])\r\nP=working[0][1]\r\n\r\nsample=_report[:P]\r\nsample.sort()\r\nx=0\r\ny=P-1\r\n\r\nworking.append([0,0])\r\nfor i in range(len(working)-1):\r\n for j in range(working[i][1],working[i+1][1],-1):\r\n if working[i][0]==1:\r\n _report[j-1]=sample[y]\r\n y-=1\r\n if working[i][0]==2:\r\n _report[j-1]=sample[x]\r\n x+=1\r\nprint(' '.join(map(str,_report)))\r\n\r\n\r\n\r\n", "n,m = [int(i) for i in input().split()]\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(m):\r\n t,r = [int(x) for x in input().split()]\r\n while len(b) > 0 and r >= b[-1][1]:\r\n b.pop()\r\n b.append([t,r])\r\nt,r = 0, b[0][1]\r\nb.append([0,0])\r\nf = sorted(a[:r])\r\nfor i in range(1,len(b)):\r\n for y in range(b[i-1][1],b[i][1],-1):\r\n if b[i-1][0] == 1:\r\n a[y-1] = f[r-1]\r\n r -= 1\r\n else:\r\n a[y-1] = f[t]\r\n t += 1\r\nprint (' '.join(list(str(i) for i in a)))\r\n", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nlst = list()\r\nfor i in range(m):\r\n t, r = map(int, stdin.readline().split())\r\n while lst and lst[-1][1] < r:\r\n x = lst.pop()\r\n if t == 2: t = -1\r\n lst.append((t, r))\r\nlst.append((0, 0))\r\nb = sorted(a[:lst[0][1]])\r\nl = 0\r\nr = len(b)-1\r\nfor i in range(len(lst)-1):\r\n for j in range(lst[i][1]-1, lst[i+1][1]-1, -1):\r\n if (lst[i][0] == -1):\r\n a[j] = b[l]\r\n l += 1\r\n else:\r\n a[j] = b[r]\r\n r -= 1\r\nprint(\" \".join([str(x) for x in a]))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nma=[]\r\np=0\r\ns=input().split()\r\nfor i in range(n):\r\n s[i]=int(s[i])\r\nfor i in range(m):\r\n t=[int(j) for j in input().split()]\r\n ma.append(t)\r\n j=len(ma)-1\r\n while j>0 and len(ma)>1:\r\n if ma[j][1] > ma[j-1][1]:\r\n del(ma[j-1])\r\n j -= 1\r\n else: break\r\ntemp=s[ma[0][1]:]\r\ntemp.reverse()\r\nresult=temp\r\ndel(s[ma[0][1]:])\r\ns.sort()\r\nlm=len(ma)\r\nl,r=0,0\r\nfor i in range(lm):\r\n if i<lm-1:\r\n if ma[i][0]==1:\r\n for j in range(ma[i][1]-ma[i+1][1]):\r\n result.append(s[-(1+r)])\r\n r+=1\r\n elif ma[i][0]==2:\r\n for j in range(ma[i][1]-ma[i+1][1]):\r\n result.append(s[l])\r\n l+=1\r\n else:\r\n if r!=0:\r\n tem=s[l:-r]\r\n else:\r\n tem=s[l:]\r\n if ma[i][0]==1:\r\n tem.reverse()\r\n result.extend(tem)\r\n elif ma[i][0] == 2:\r\n result.extend(tem)\r\nresult.reverse()\r\nprint(' '.join(str(i) for i in result))", "#!/usr/bin/env python3\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = []\r\n\r\nfor i in range(m):\r\n d, r = map(int, input().split())\r\n while t and t[-1][1] <= r:\r\n t.pop()\r\n t.append([d, r])\r\nt.append([0, 0])\r\n\r\nx = 0\r\ny = t[0][1] - 1\r\nsor = sorted(a[:t[0][1]])\r\n\r\nfor i in range(1, len(t)):\r\n for j in range(t[i-1][1], t[i][1], -1):\r\n if t[i-1][0] == 1:\r\n a[j-1] = sor[y]\r\n y -= 1\r\n else:\r\n a[j-1] = sor[x]\r\n x += 1\r\n\r\nprint(*a)\r\n\r\n", "from sys import stdin, stdout\r\nn, m = map(int,stdin.readline().split())\r\nb = list(map(int,stdin.readline().split()))\r\na = []\r\nfor i in range(m):\r\n a.append(tuple(map(int, stdin.readline().split())))\r\na = a[::-1]\r\nr = [a[0]]\r\nnow = a[0]\r\nf = 0\r\nfor i in range(m):\r\n if a[i][1] > now[1]:\r\n if now[0] == a[i][0] and f: \r\n r.remove(now)\r\n r.append(a[i])\r\n now = a[i]\r\n f = 1\r\nmaxi = r[-1]\r\nvos = sorted(b[0:maxi[1]])\r\nub = vos[::-1]\r\nu = maxi[1]-1\r\nv = maxi[1]-1\r\nl = len(r)\r\nr = [(0,0)]+r\r\nres = [0]*n\r\npr = [0]*n\r\nfor i in range(len(r)-1):\r\n for j in range(r[i][1], r[i+1][1]):\r\n pr[j] = r[i+1][0]\r\nfor i in range(n-1,-1,-1):\r\n if pr[i] == 1:\r\n res[i] = vos[v]\r\n v-=1\r\n elif pr[i] == 2:\r\n #print(ub[u],u,i)\r\n res[i] = ub[u]\r\n u-=1\r\n else: res[i] = b[i]\r\n\r\nres = list(map(str, res))\r\nstdout.write(' '.join(res))", "n, m = map(int,input().split())\na = list(map(int,input().split()))\nt = list()\nb = list()\n\nfor i in range(m):\n\tx, y = map(int,input().split())\n\twhile len(t) > 0 and y >= t[-1][1]: \n\t\tt.pop()\n\tt.append([x, y])\n\nx, y = 0, t[0][1] - 1\nt.append([0, 0])\nb = sorted(a[: y + 1])\n\nfor i in range(1, len(t)):\n\t\tfor j in range(t[i - 1][1], t[i][1], -1):\n\t\t\tif t[i - 1][0] == 1:\n\t\t\t\ta[j - 1] = b[y]\n\t\t\t\ty -= 1 \n\t\t\telse:\n\t\t\t\ta[j - 1] = b[x]\n\t\t\t\tx += 1\n\nprint (\" \".join(list(str(i) for i in a)))\n", "from collections import deque\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntr = [tuple(map(int, input().split())) for _ in range(m)]\r\nma = 0\r\nx = [[] for _ in range(n + 1)]\r\nfor i in range(m):\r\n t, r = tr[i]\r\n x[r].append(i)\r\n ma = max(ma, r)\r\nans = []\r\nfor i in range(n, ma, -1):\r\n ans.append(a[i - 1])\r\na = a[:ma]\r\na.sort()\r\nq = deque(a)\r\nk = -1\r\nfor i in range(ma, 0, -1):\r\n for j in x[i]:\r\n k = max(j, k)\r\n ans.append(q.pop() if tr[k][0] == 1 else q.popleft())\r\nsys.stdout.write(\" \".join(map(str, ans[::-1])))", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = list(read())\r\nt = []\r\nfor i in range(m):\r\n x, r = read()\r\n while len(t) and r >= t[-1][1]:\r\n t.pop()\r\n t.append((x, r))\r\nx, r = 0, t[0][1] - 1\r\nt.append((0, 0))\r\nb = sorted(a[:r + 1])\r\nfor i in range(1, len(t)):\r\n for j in range(t[i - 1][1], t[i][1], -1):\r\n if t[i - 1][0] == 1:\r\n a[j - 1] = b[r]\r\n r -= 1\r\n else:\r\n a[j - 1] = b[x]\r\n x += 1\r\nprint(*a)\r\n", "\r\n\r\ndef main():\r\n n, m = input().strip().split()\r\n n, m = int(n), int(m)\r\n initial = list(map(int, input().strip().split()))\r\n\r\n max_r = 0\r\n reports = [None] * n\r\n for i in range(m):\r\n order, last_rep = input().strip().split()\r\n last_rep = int(last_rep)\r\n max_r = max(max_r, last_rep)\r\n reports[last_rep-1] = (i, order)\r\n\r\n\r\n prev = None\r\n for i in reversed(range(n)):\r\n if reports[i] is None and prev is None:\r\n continue\r\n elif reports[i] is not None and prev is None:\r\n prev = reports[i]\r\n continue\r\n\r\n if reports[i] is None:\r\n reports[i] = prev\r\n continue\r\n\r\n if reports[i][0] < prev[0]:\r\n reports[i] = prev\r\n else:\r\n prev = reports[i]\r\n \r\n reports = list(map(lambda pair: pair[1] if pair is not None else None, reports))\r\n \r\n result = []\r\n for i in reversed(range(n)):\r\n if i == max_r - 1:\r\n break\r\n result.append(initial[i])\r\n\r\n begin = 0\r\n end = max_r - 1\r\n arr = initial[begin:max_r]\r\n arr.sort()\r\n for i in reversed(range(max_r)): \r\n if reports[i] == '2':\r\n target = begin\r\n begin += 1\r\n elif reports[i] == '1':\r\n target = end\r\n end -= 1\r\n \r\n result.append(arr[target])\r\n \r\n result.reverse()\r\n print(*result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn,m = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\n\r\ns = []\r\nfor i in range(m):\r\n t,r = map(int,input().split())\r\n t -= 1\r\n r -= 1\r\n\r\n while s and s[-1][1] <= r: # operation will get overwritten so remove it\r\n s.pop()\r\n\r\n s.append([t,r])\r\ns.append([-1,-1]) # dummy operation\r\n\r\nsorted_slice = sorted(a[:s[0][1]+1])\r\n# pointers for active part of slice\r\nl = 0\r\nr = s[0][1]\r\n\r\nfor i in range(len(s)-1):\r\n if s[i][0]:\r\n for j in range(s[i][1], s[i+1][1], -1):\r\n a[j] = sorted_slice[l]\r\n l += 1\r\n else:\r\n for j in range(s[i][1], s[i+1][1], -1):\r\n a[j] = sorted_slice[r]\r\n r -= 1\r\n\r\nprint(*a)", "# You lost the game.\nn, m = map(int, input().split())\nA = list(map(int, input().split()))\nM = [list(map(int, input().split())) for _ in range(m)]\n\nj = m-1\nx = 2\nh = -1\nB = [-1 for _ in range(n+1)]\nwhile h < n and j >= 0:\n h = M[j][1]\n if h >= x:\n B[h] = j\n x = h+1\n j -= 1\n\nO = [0 for _ in range(n)]\n\nfor i in range(n-1,x-2,-1):\n O[i] = A[i]\n del A[i]\n\nn2 = len(A)\n \nR = A[:]\nR.sort()\n \nd = 0\nf = n2-1\n\n\nc = 0\nfor i in range(n2-1,-1,-1):\n j = B[i+1]\n if j >= 0:\n c = M[j][0]\n if c == 1:\n O[i] = R[f]\n f -= 1\n else:\n O[i] = R[d]\n d += 1\n\n \nfor i in range(n):\n print(O[i],end=\" \")\n \n \n \n", "a, b = (int(i) for i in input().split())\r\nf = list(map(int,input().split()))\r\nd = []\r\nfor i in range(b):\r\n c, e = (int(t) for t in input().split())\r\n while len(d) > 0 and e > d[-1][1]:\r\n d.pop()\r\n d.append([c, e])\r\nc, e = 0, d[0][1]\r\nd.append([0, 0])\r\ng = sorted(f[:e])\r\nfor i in range(1,len(d)):\r\n for y in range(d[i - 1][1], d[i][1], -1):\r\n if d[i - 1][0] == 1:\r\n f[y - 1] = g[e - 1]\r\n e -= 1\r\n else:\r\n f[y - 1] = g[c]\r\n c += 1\r\nfor i in range(len(f)):\r\n print(f[i],end = ' ')\r\n", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n while len(q)>0 and b>=q[-1][1]:\r\n q.pop()\r\n q.append([a,b]) \r\na,b=0,q[0][1]-1\r\nq.append([0,0])\r\naa=sorted(lis[:b+1])\r\nfor i in range(1,len(q)):\r\n for j in range(q[i-1][1],q[i][1],-1):\r\n if q[i-1][0]==1:\r\n lis[j-1]=aa[b]\r\n b-=1\r\n else:\r\n lis[j-1]=aa[a]\r\n a+=1\r\nprint(*lis) \r\n\r\n\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(m):\r\n t,r=[int(i) for i in input().split()]\r\n while len(l)>0 and r>=l[-1][1]:\r\n l.pop()\r\n l.append([t,r])\r\n\r\n\r\n\r\nx,y=0,l[0][1]-1\r\nl.append([0,0])\r\nb=sorted(a[:y+1])\r\n\r\nfor i in range(1,len(l)):\r\n for j in range(l[i-1][1],l[i][1],-1):\r\n if l[i-1][0]==1:\r\n a[j-1]=b[y]\r\n y-=1\r\n else:\r\n a[j-1]=b[x]\r\n x+=1\r\n\r\nprint(' '.join(str(i) for i in a))\r\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nml = []\r\nfor i in range(m):\r\n t, r = input().split()\r\n r = int(r)\r\n while len(ml) > 0 and r >= ml[-1][1]:\r\n ml.pop()\r\n ml.append([t, r])\r\n\r\nx, y = 0, ml[0][1] - 1\r\nml.append([0, 0])\r\nb = sorted(l[: y + 1])\r\n\r\nfor i in range(1, len(ml)):\r\n for j in range(ml[i - 1][1], ml[i][1], -1):\r\n if ml[i - 1][0] == '1':\r\n l[j - 1] = b[y]\r\n y -= 1\r\n else:\r\n l[j - 1] = b[x]\r\n x += 1\r\n\r\nprint(' '.join(map(str, l)))", "from sys import stdin,stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nfor _ in range(1):#nmbr():\r\n n,m=lst()\r\n a=lst()\r\n l=[lst() for _ in range(m)]\r\n suf=[0]*(1+m)\r\n suf[m-1]=l[m-1][1]\r\n for i in range(m-2,-1,-1):\r\n suf[i]=max(suf[i+1],l[i][1])\r\n # ans=a.copy()\r\n chng=[]\r\n for i in range(m):\r\n if suf[i]==l[i][1]:\r\n if not chng or l[i][0]!=chng[-1][0]:\r\n chng+=[[l[i][0],l[i][1]]]\r\n if chng[0][0]==1:\r\n pos=chng[0][1]-1\r\n ans=sorted(a[:pos+1])+a[pos+1:]\r\n next=1\r\n else:\r\n pos=chng[0][1]-1\r\n ans=sorted(a[:pos+1],reverse=True)+a[pos+1:]\r\n next=1\r\n # print(ans)\r\n ln=len(chng)\r\n c=0\r\n if ln>=2:c=chng[1][1]-1\r\n start,end=0,c\r\n # print(chng)\r\n a=ans.copy()\r\n for i in range(1,ln):\r\n if next&1:\r\n diff=chng[i][1]-(0 if i+1>=ln else chng[i+1][1])\r\n while diff>0:\r\n ans[c]=a[start]\r\n c-=1\r\n start+=1\r\n diff-=1\r\n else:\r\n diff = chng[i][1] - (0 if i+1>=ln else chng[i+1][1])\r\n while diff > 0:\r\n ans[c] = a[end]\r\n c -= 1\r\n end-=1\r\n diff -= 1\r\n next+=1\r\n print(*ans)\r\n\r\n'''\r\n8 3\r\n1 2 3 4 5 6 7 8\r\n2 7\r\n1 5\r\n2 3\r\n'''", "n,m = [int(i) for i in input().split()]\r\nnl = [int(i) for i in input().split()]\r\nml = []\r\nfor i in range(m):\r\n t,r = [int(k) for k in input().split()]\r\n ml.append((t,r))\r\n\r\nmll = [(0,0)]\r\nfor i in range(m-1,-1,-1):\r\n if i == m-1:\r\n mll.append(ml[i])\r\n elif i != m-1 and ml[i][1] > mll[-1][1]:\r\n mll.append(ml[i])\r\n #print(mll)\r\n\r\n\r\ntemp = sorted(nl[:mll[len(mll)-1][1]])\r\nx,y = 0,len(temp)-1\r\nfor i in range(len(mll)-1,0,-1):\r\n t,r = mll[i]\r\n for j in range(r-1,mll[i-1][1]-1,-1):\r\n if t == 1:\r\n nl[j] = temp[y]\r\n y -= 1\r\n elif t == 2:\r\n nl[j] = temp[x]\r\n x += 1\r\n\r\nfor i in range(n):\r\n nl[i] = str(nl[i])\r\nprint(' '.join(nl))\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nrevenue=[int(i) for i in input().split()]\r\nmanager=[0 for i in range(n)]\r\noperate=[0 for i in range(n)]\r\nans=[0 for i in range(n)]\r\nfor i in range(m):\r\n operations=[int(j) for j in input().split()]\r\n manager[operations[1]-1]=i\r\n operate[operations[1]-1]=operations[0]\r\nfor i in range(n-1,-1,-1):\r\n if operate[i]==0:\r\n ans[i]=revenue[i]\r\n else:\r\n max=i\r\n break\r\nb=revenue[0:max+1]\r\nb.sort()\r\nmanagernow=manager[max]\r\noperatenow=operate[max]\r\ns1=max\r\ns2=0\r\nfor i in range(max,-1,-1):\r\n if manager[i]>managernow and operatenow!=0:\r\n managernow=manager[i]\r\n operatenow=operate[i]\r\n if operatenow==1:\r\n ans[i]=b[s1]\r\n s1-=1\r\n else:\r\n ans[i]=b[s2]\r\n s2+=1\r\nfor i in range(n-1):\r\n print(ans[i],end=\" \")\r\nprint(ans[-1])", "\"\"\"\nProblem 4, Report\nSizhang Zhao 1200011770\nThe current version is confronted with time limit problems in 26th test\nI will try to make it later\nThank you ^^\n\"\"\"\nn, m = [int(i) for i in input().split()]\nrev = [int(i) for i in input().split()]\nleng = len(rev)\nresult = list()\nmark = list()\n\nwhile m > 0:\n\tt, r = [int(i) for i in input().split()]\n\twhile len(mark) > 0 and r >= mark[-1][1]:\n\t\tmark.pop()\n\tmark.append([t, r])\n\tm -= 1\nmark.append([0, 0])\nlength = len(mark)\n \nstart = mark[0][1]\nseq = mark[0][0]\nx, y = 0, start - 1\nresult = sorted(rev[: start])\n\nfor i in range(1, length):\n\tfor j in range(mark[i-1][1], mark[i][1], -1):\n\t\tif mark[i-1][0] == 1:\n\t\t\trev[j - 1] = result[y]\n\t\t\ty -= 1\n\t\telse:\n\t\t\trev[j - 1] = result[x]\n\t\t\tx += 1\n\nfor i in range(0, leng):\n\tprint(rev[i], sep = ' ', end = ' ')\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ndeq = []\nfor i in range(0,m):\n\tt, r = map(int, input().split())\n\twhile deq and deq[-1][1] < r:\n\t\tdeq.pop(-1)\n\tdeq.append((t, r))\nb = sorted(a[0: deq[0][1]])\nseq = []\nfor t, r in deq:\n\tif seq:\n\t\tit = (t, ) + ((seq[-1][2] - r, seq[-1][2]) if seq[-1][0] == 2 else (seq[-1][1], seq[-1][1] + r))\n\t\tseq[-1] = (seq[-1][0], ) + ((seq[-1][1], seq[-1][2] - r) if seq[-1][0] == 2 else (seq[-1][1] + r, seq[-1][2]))\n\t\tseq.append(it)\n\telse:\n\t\tseq.append((t, 0, r))\nc = []\nfor t, l, r in reversed(seq):\n\tc.extend((lambda x: x if t == 1 else reversed(x))(b[l: r]))\nc.extend(a[deq[0][1]: ])\nprint(' '.join(map(str, c)))\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nmanagers=[]\r\nfor i in range (m):\r\n managers+=[list(map(int,input().split()))]\r\neffective=[]\r\nmx=0\r\nfor i in range (m-1,-1,-1):\r\n if managers[i][1]>mx:\r\n effective+=[managers[i]]\r\n mx=managers[i][1]\r\n\r\nA=sorted(a[:effective[-1][1]])\r\nx=0;y=effective[-1][1]-1\r\neffective=[[0,0]]+effective\r\n#print(effective);print(A)\r\nfor i in range (len(effective)-1,-1,-1):\r\n for j in range (effective[i][1],effective[i-1][1],-1):\r\n if x>y: break\r\n if effective[i][0]==1:\r\n a[j-1]=A[y]\r\n y-=1\r\n elif effective[i][0]==2:\r\n a[j-1]=A[x]\r\n x+=1\r\n\r\nprint(' '.join(list(map(str,a))))\r\n", "from collections import deque\r\nimport os,io, sys\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nnum_of_products, num_of_managers = map(int, input().split())\r\nrevenue_report = list(map(int, input().split()))\r\nmanager_actions = [tuple(map(int, input().split())) for _ in range(num_of_managers)]\r\nmax_index = 0\r\nmanagers_sorting = [[] for _ in range(num_of_products + 1)]\r\nfor i in range(num_of_managers):\r\n action_type, sorting_limit = manager_actions[i]\r\n managers_sorting[sorting_limit].append(i)\r\n max_index = max(max_index, sorting_limit)\r\nfinal_report = []\r\nfor i in range(num_of_products, max_index, -1):\r\n final_report.append(revenue_report[i - 1])\r\nrevenue_report = revenue_report[:max_index]\r\nrevenue_report.sort()\r\nqueue = deque(revenue_report)\r\nmanager_index = -1\r\nfor i in range(max_index, 0, -1):\r\n for j in managers_sorting[i]:\r\n manager_index = max(j, manager_index)\r\n if manager_actions[manager_index][0] == 1:\r\n final_report.append(queue.pop())\r\n else:\r\n final_report.append(queue.popleft())\r\nsys.stdout.write(\" \".join(map(str, final_report[::-1])))# 1698151059.9904087" ]

[ "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = [int(x) for x in stdin.readline().split()]\r\na = sorted([(a[x], x) for x in range(n*2)])\r\n\r\ngroup = {}\r\n\r\nfor x,ind in a:\r\n if x in group:\r\n group[x].append(ind)\r\n else:\r\n group[x] = [ind]\r\n\r\ng2 = []\r\n\r\nfor x in group:\r\n g2.append([len(group[x]), group[x]])\r\n\r\ng2.sort()\r\n\r\nleft = 0\r\nright = 0\r\n\r\nboard = [0 for x in range(n*2)]\r\n\r\nind = 0\r\nfor x,l in g2:\r\n if x == 1:\r\n ind += 1\r\n if left <= right:\r\n left += 1\r\n board[l[0]] = '1'\r\n else:\r\n right += 1\r\n board[l[0]] = '2'\r\n else:\r\n break\r\n\r\nif right > left:\r\n turn = True\r\nelse:\r\n turn = False\r\n\r\nfor x,l in g2[ind:]:\r\n left += 1\r\n right += 1\r\n\r\n if x%2 == 1:\r\n last = l.pop()\r\n if turn:\r\n board[last] = '1'\r\n else:\r\n board[last] = '2'\r\n turn = not turn\r\n for n in l[::2]:\r\n board[n] = '1'\r\n for n in l[1::2]:\r\n board[n] = '2'\r\nprint(left*right)\r\nprint(' '.join(board))\r\n \r\n", "from collections import *\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nc = Counter(a)\r\nfor i in range(2*n):\r\n\ta[i] = [a[i],i]\r\na.sort()\r\nans = [0 for i in range(2*n)]\r\nda, db = {}, {}\r\nf = 0\r\nfor i in range(2*n):\r\n\tif(c[a[i][0]] == 1): continue\r\n\tans[a[i][1]] = f + 1\r\n\tif(f&1):\r\n\t\tda[a[i][0]] = 1\r\n\telse:\r\n\t\tdb[a[i][0]] = 1\r\n\tf ^= 1\r\nfor i in range(2*n):\r\n\tif(ans[a[i][1]] != 0): continue\r\n\tans[a[i][1]] = f+1\r\n\tif(f&1):\r\n\t\tda[a[i][0]] = 1\r\n\telse:\r\n\t\tdb[a[i][0]] = 1\r\n\tf ^= 1\r\nprint(len(da)*len(db))\r\nprint(*ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nR = range(100)\r\nc = [[] for _ in [0]*100]\r\nfor i in range(n*2):\r\n\tc[a[i]].append(i)\r\nd = [0]*200\r\nheap = 1\r\nz = [0, 0, 0]\r\nfor i in R:\r\n\tif len(c[i]) == 1:\r\n\t\tz[heap]+=1\r\n\t\td[c[i][0]] = heap\r\n\t\theap = 3 - heap;\r\nfor i in R:\r\n\tif len(c[i]) > 1:\r\n\t\tz[1]+=1\r\n\t\tz[2]+=1\r\n\t\twhile len(c[i]):\r\n\t\t\td[c[i].pop()] = heap\r\n\t\t\theap = 3 - heap\r\n\r\nprint(z[1]*z[2])\r\nprint(' '.join(map(str, d[:n*2])))", "n=int(input())\r\narr=list(map(int,input().split()))\r\ng=[[] for i in range(100)]\r\nfor i in range(2*n):\r\n g[arr[i]].append(i)\r\nx=0\r\ny=0\r\ncurr=1\r\nr=[]\r\nfor i in range(10,100):\r\n if len(g[i])==1:\r\n arr[g[i][0]]=curr\r\n if curr==1:\r\n x+=1\r\n else:\r\n y+=1\r\n curr=3-curr\r\n if len(g[i])>1:\r\n arr[g[i][0]]=1\r\n arr[g[i][1]]=2\r\n x+=1\r\n y+=1\r\n for j in range(2,len(g[i])):\r\n r.append(g[i][j])\r\nfor i in range(len(r)):\r\n arr[r[i]]=2-(i%2)\r\nprint(x*y)\r\nprint(*arr)", "def s():\r\n\tinput()\r\n\tl = [[]for _ in range(100)]\r\n\ta = list(map(int,input().split()))\r\n\tfor i,v in enumerate(a):\r\n\t\tl[v].append(i)\r\n\tc = 0\r\n\tcc = 0\r\n\tfs = [0,0]\r\n\tfor i in l:\r\n\t\tif len(i) == 0:\r\n\t\t\tcontinue\r\n\t\tif len(i) == 1:\r\n\t\t\ta[i[0]] = c+1\r\n\t\t\tfs[c]+=1\r\n\t\t\tc = 1 - c\r\n\t\t\tcontinue\r\n\t\tfs[c] += 1\r\n\t\tfs[c-1] += 1\r\n\t\tfor e in i[:len(i)//2]:\r\n\t\t\ta[e] = 1 + cc\r\n\t\tfor e in i[len(i)//2:]:\r\n\t\t\ta[e] = 2 - cc\r\n\t\tif len(i) % 2 == 1:\r\n\t\t\tcc = 1 - cc\r\n\tprint(fs[0]*fs[1])\r\n\tprint(*a)\r\ns()", "n = int(input())\na = list(map(int, input().split()))\nproc = sorted([ (a.count(i), i) for i in range(10, 100) if a.count(i) > 0 ])\nleft, right = [], []\nfor cnt, val in proc:\n half = cnt // 2\n left.extend([val] * half)\n right.extend([val] * half)\n if cnt % 2 == 1:\n if len(left) < len(right):\n left.append(val)\n else:\n right.append(val)\nprint(len(set(left)) * len(set(right)))\ncnt = [0 for i in range(100)]\nfor i in range(2 * n):\n if left.count(a[i]) == cnt[a[i]]:\n print('2', end = ' ')\n else:\n print('1', end = ' ')\n cnt[a[i]] += 1\n", "R,P=lambda:map(int,input().split()),print;n,=R();n*=2;a=[*R()]\r\nc,C,z=[0]*100,[0,0],[0]*n\r\nfor x in a:c[x]+=1\r\nfor v in c:\r\n if v:C[v==1]+=1\r\ntar1=C[1]//2;P((C[0]+tar1)*(C[0]+C[1]-tar1))\r\ns=sorted([(c[x],x,i)for i,x in enumerate(a)])\r\nfor i,v in enumerate(s):z[v[2]]=[1,2][i&1>0]\r\nP(*z)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nadj = [[] for i in range(100)]\r\nfor i in range(2*n):\r\n\tadj[arr[i]].append(i)\r\nres = [0] * (2 * n)\r\nmul, curr = [], 1\r\nx = [0, 0]\r\nfor i in range(10, 100):\r\n\tif len(adj[i]) == 1 :\r\n\t\tres[adj[i][0]] = curr\r\n\t\tx[curr-1] += 1\r\n\t\tcurr = 3 - curr\r\n\tif len(adj[i]) > 1: \r\n\t\tres[adj[i][0]] = 1\r\n\t\tres[adj[i][1]] = 2\r\n\t\tx[0] += 1\r\n\t\tx[1] += 1\r\n\t\tfor j in range(2, len(adj[i])):\r\n\t\t\tmul.append(adj[i][j])\r\nfor i in range(len(mul)):\r\n\tres[mul[i]] = curr\r\n\tcurr = 3 - curr\r\nprint(x[0] * x[1])\r\nprint(*res)\r\n", "n = int(input())\na = list(map(int, input().split()))\nR = range(100)\nc = [[] for _ in [0]*100]\nfor i in range(n*2):\n\tc[a[i]].append(i)\nd = [0]*200\nheap = 1\nz = [0, 0, 0]\nfor i in R:\n\tif len(c[i]) == 1:\n\t\tz[heap]+=1\n\t\td[c[i][0]] = heap\n\t\theap = 3 - heap;\nfor i in R:\n\tif len(c[i]) > 1:\n\t\tz[1]+=1\n\t\tz[2]+=1\n\t\twhile len(c[i]):\n\t\t\td[c[i].pop()] = heap\n\t\t\theap = 3 - heap\n\nprint(z[1]*z[2])\nprint(' '.join(map(str, d[:n*2])))\n\n\n\n# Made By Mostafa_Khaled" ]

[ "a,b=map(int,input().split())\r\nans=1;mod=1000000009;gh=pow(2,b,mod)\r\nfor i in range(1,1+a):ans=(ans*(gh-i))%mod\r\nprint(ans)", "MOD = int(1e9+9)\r\n\r\ndef fast_power(b, e):\r\n res = 1\r\n while e:\r\n if e % 2 == 1:\r\n res = res * b % MOD\r\n b = b * b % MOD \r\n e >>= 1\r\n return res\r\n\r\nn, m = map(int, input().split())\r\na = fast_power(2, m) - 1\r\na = (a + MOD) % MOD\r\nb = a - 1\r\nb = (b + MOD) % MOD \r\nfor i in range(1, n):\r\n a = a * b % MOD\r\n b = (b - 1 + MOD) % MOD\r\nprint(a)\r\n", "n, m = map(int, input().split())\r\nMOD = 10 ** 9 + 9\r\nout = 1\r\ncurr = pow(2, m, MOD) - 1\r\nfor i in range(n):\r\n out *= curr\r\n curr -= 1\r\n out %= MOD\r\nprint(out)", "n, m = map(int, input().split())\r\ns, d = 1, 1000000009\r\nk = pow(2, m, d) - 1\r\nfor i in range(n): s, k = (s * k) % d, k - 1\r\nprint(s)", "n,m=map(int,input().split());MOD=1000000009;o=1;m=pow(2,m,MOD)-1\n\nfor i in range(n):o=o*(m-i)%MOD\n\nprint(o)", "a,b=map(int,input().split())\r\nans=1;mod=1000000009;gh=pow(2,b,mod)\r\nfor i in range(1,1+a):ans=pow(ans*(gh-i),1,mod)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\ndef inp(): #int input\r\n return(int(input()))\r\ndef inlt(): #int list input\r\n return(list(map(int,input().split())))\r\ndef insr(): #string input (list of chars)\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): #space separated ints\r\n return(map(int,input().split()))\r\ndef printlst(lst):\r\n print(\" \".join(list(map(str,lst))))\r\n\r\nmod = 1000000009\r\nt = 1\r\nfor _ in range(t):\r\n\tn, m = invr()\r\n\ttotals = [(2 ** m) % mod]\r\n\tq = (1 << m) % mod\r\n\tfor i in range(1, n):\r\n\t\ttotals += [(totals[-1] * q) % mod]\r\n\t\r\n\tc = [[1, (2 ** m - 1) % mod]]\r\n\tfor i in range(1, n):\r\n\t\tw, nw = 0, 0\r\n\t\tw = (((c[-1][0] * q) % mod) + c[-1][1] + (c[-1][1] * i) % mod) % mod\r\n\t\tnw = (totals[i] - w) % mod\r\n\t\tc += [[w, nw]]\r\n\tprint(c[-1][1])", "e=10**9+9\r\nn,m=map(int,input().split())\r\nt=pow(2,m,e)\r\nr=1\r\nfor i in range(n):r=(r*(t-i-1))%e\r\nprint(r)" ]

[ "import sys\n\nN = 0\nA = [] # gas of a station\nB = [] # dist to next station\nresult = []\n\ndef read_input():\n global N, A, B, result\n readline = sys.stdin.readline\n N = int(readline().strip())\n A = [int(w) for w in readline().split()]\n B = [int(w) for w in readline().split()]\n result = [False] * N\n\n\ndef solve():\n gap, min_gap = 0, 0\n for i in range(N):\n gap = gap + A[i] - B[i]\n min_gap = min(gap, min_gap)\n result[0] |= min_gap >= 0\n for i in range(1, N):\n min_gap += - A[i - 1] + B[i - 1] \n if min_gap >= 0:\n result[i] = True\n # print(result)\n gap, min_gap = 0, 0\n C = B[-1:] + B[:-1]\n for i in range(N - 1, -1, -1):\n gap = gap + A[i] - C[i]\n min_gap = min(gap, min_gap)\n\n result[-1] |= min_gap >= 0\n # print(C)\n for i in range(N - 2, -1, -1):\n min_gap += C[i + 1] - A[i + 1]\n if min_gap >= 0:\n result[i] = True\n # print(result)\ndef write_output():\n buf = [i + 1 for i in range(N) if result[i]]\n print(len(buf))\n print(*buf)\n\n\nread_input()\nsolve()\nwrite_output()\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmi, x = 0, 0\r\nfor i, j in zip(a, b):\r\n x += i - j\r\n mi = min(mi, x)\r\nu, x = [0] * (n + 1), 0\r\nfor i in range(n):\r\n if x == mi:\r\n u[i + 1] = 1\r\n x += a[i] - b[i]\r\na.reverse()\r\nb.reverse()\r\nb = b[1:] + [b[0]]\r\nmi, x = 0, 0\r\nfor i, j in zip(a, b):\r\n x += i - j\r\n mi = min(mi, x)\r\nfor i in range(n):\r\n if x == mi:\r\n u[n - i] = 1\r\n x += a[i] - b[i]\r\nans = []\r\nfor i in range(1, n + 1):\r\n if u[i]:\r\n ans.append(i)\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n, m = map(int, input().split())\r\n \r\ncovers_all = set(range(1, n+1))\r\n \r\nin_there = set([])\r\n \r\noccurred = set([])\r\nminus_delete_candidates = set([])\r\nplus_delete_candidates = set([])\r\n \r\nfor i in range(m):\r\n\ta, b = input().split()\r\n\tb = int(b)\r\n\tif a == '+':\r\n\t\tin_there.add(b)\r\n\t\tcovers_all -= (plus_delete_candidates - in_there)\r\n\t\tplus_delete_candidates = set([])\r\n\t\tif occurred and b not in occurred:\r\n\t\t\tcovers_all.discard(b)\r\n\telse:\r\n\t\tif b in in_there:\r\n\t\t\tin_there.remove(b)\r\n\t\telse:\r\n\t\t\tcovers_all -= minus_delete_candidates\r\n\t\t\tminus_delete_candidates = set([])\r\n\t\tif in_there:\r\n\t\t\tcovers_all.discard(b)\r\n\t\telse:\r\n\t\t\tplus_delete_candidates.add(b)\r\n\toccurred.add(b)\r\n\tif b in covers_all:\r\n\t\tminus_delete_candidates.add(b)\r\nprint(len(covers_all))\r\nif covers_all:\r\n\tprint(' '.join(map(str, sorted(list(covers_all)))))" ]

[ "import collections\n\ns = collections.Counter(sorted(list(input())))\nodds = [c for c in s if s[c] % 2]\n\nlength = len(odds)\nfor i in range(length // 2):\n s[odds[i]] += 1\n s[odds[length - i - 1]] -= 1\n\ninfix = odds[length // 2] if length % 2 else \"\"\nprefix = \"\".join([c * (s[c] // 2) for c in s])\n\nprint(prefix + infix + prefix[::-1])\n", "s = input()\r\na = [0] * 26\r\nfor c in s:\r\n a[ord(c)-ord('a')] += 1\r\n\r\ni, j = 0, 25\r\nwhile i < j:\r\n while i < j and a[i] % 2 == 0:\r\n i += 1\r\n while i < j and a[j] % 2 == 0:\r\n j -= 1\r\n if i < j:\r\n a[i] += 1\r\n a[j] -= 1\r\n i += 1\r\n j -= 1\r\n\r\nmiddle = ''\r\nr = ''\r\nfor i in range(0, 26):\r\n c = chr(i + ord('a'))\r\n r += c * (a[i] // 2)\r\n if a[i] % 2 > 0:\r\n middle = c\r\n\r\nprint(r + middle + r[::-1])\r\n", "def process(S):\r\n n = len(S)\r\n d = {}\r\n for c in S:\r\n if c not in d:\r\n d[c] = 0\r\n d[c]+=1\r\n even = []\r\n odd = []\r\n for c in d:\r\n if d[c] % 2==0:\r\n even.append(c)\r\n else:\r\n odd.append(c)\r\n if n % 2==0:\r\n odd = sorted(odd)\r\n m = len(odd)\r\n i1 = 0\r\n i2 = m-1\r\n while i1 < i2:\r\n c1 = odd[i1]\r\n c2 = odd[i2]\r\n d[c1]+=1\r\n d[c2]-=1\r\n i1+=1\r\n i2-=1\r\n answer = []\r\n for c in sorted(d):\r\n for i in range(d[c]//2):\r\n answer.append(c)\r\n for i in range(n//2):\r\n answer.append(answer[n//2-i-1])\r\n return ''.join(answer)\r\n else:\r\n odd = sorted(odd)\r\n m = len(odd)\r\n i1 = 0\r\n i2 = m-1\r\n while i1 < i2:\r\n c1 = odd[i1]\r\n c2 = odd[i2]\r\n d[c1]+=1\r\n d[c2]-=1\r\n i1+=1\r\n i2-=1\r\n middle = odd[i1]\r\n answer = []\r\n for c in sorted(d):\r\n for i in range(d[c]//2):\r\n answer.append(c)\r\n answer.append(middle)\r\n for i in range(n//2):\r\n answer.append(answer[n//2-i-1])\r\n return ''.join(answer)\r\n \r\nS = input()\r\nprint(process(S))", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n s=rs()\r\n cnt=[0]*26\r\n for c in s:\r\n cnt[ord(c)-97]+=1\r\n od=ev=0\r\n for i in range(26):\r\n od+=cnt[i]%2==1\r\n ev+=cnt[i]%2==0\r\n cur=0\r\n for i in range(26):\r\n if cnt[i]%2==0: continue\r\n if cur<(od//2): cnt[i]+=1\r\n elif cur>=((od+1)//2): cnt[i]-=1\r\n cur+=1\r\n ans=[]\r\n if od%2==0:\r\n for i in range(26):\r\n ans.append(chr(i+97)*(cnt[i]//2))\r\n for i in range(25,-1,-1):\r\n ans.append(chr(i+97)*(cnt[i]//2))\r\n \r\n else:\r\n for i in range(26):\r\n ans.append(chr(i+97)*(cnt[i]//2))\r\n for i in range(26):\r\n if cnt[i]%2==1: ans.append(chr(i+97))\r\n for i in range(25,-1,-1):\r\n ans.append(chr(i+97)*(cnt[i]//2))\r\n\r\n return \"\".join(ans)\r\n\r\n\r\nprint(main())", "\r\ndef solve():\r\n s = input()\r\n cnt = [0]*26\r\n for i in s: cnt[ord(i)-97] += 1\r\n odd, even = 0, 0\r\n for i in cnt:\r\n if i%2==0: even += 1\r\n else: odd += 1\r\n for i in range(26):\r\n if cnt[i]%2 == 1:\r\n for j in range(25, i, -1):\r\n if cnt[j]%2 == 1:\r\n cnt[i] += 1\r\n cnt[j] -= 1\r\n break\r\n ans, ex = \"\", -1\r\n for i in range(26):\r\n ans += chr(i+97)*(cnt[i]//2)\r\n if cnt[i]%2 == 1: ex = i\r\n print(ans+('' if ex==-1 else chr(ex+97))+ans[::-1])\r\n \r\ntest = 1\r\n# test = int(input())\r\nwhile test:\r\n solve()\r\n test -= 1\r\n", "from collections import Counter\r\nimport string\r\n\r\ns = input()\r\noccs = Counter(list(s))\r\n\r\neven = []\r\nodd = []\r\nfor k in occs:\r\n if occs[k] % 2 == 1:\r\n odd.append(k)\r\nodd.sort()\r\n\r\nif len(s) % 2 == 0:\r\n for i in range(len(odd) // 2, len(odd)):\r\n occs[odd[i]] -= 1\r\n for i in range(0, len(odd) // 2):\r\n occs[odd[i]] += 1\r\nelse:\r\n for i in range(len(odd) // 2 + 1, len(odd)):\r\n occs[odd[i]] -= 1\r\n for i in range(0, len(odd) // 2):\r\n occs[odd[i]] += 1\r\n\r\n\r\nans = []\r\nfor ch in string.ascii_lowercase:\r\n if ch in occs:\r\n if occs[ch] % 2 == 0:\r\n ans.append(ch * (occs[ch] // 2))\r\n else:\r\n ans.append(ch * ((occs[ch] - 1) // 2))\r\nif len(s) % 2 == 1:\r\n ans.append(odd[len(odd) // 2])\r\n\r\nfor ch in reversed(string.ascii_lowercase):\r\n if ch in occs:\r\n if occs[ch] % 2 == 0:\r\n ans.append(ch * (occs[ch] // 2))\r\n else:\r\n ans.append(ch * ((occs[ch] - 1) // 2))\r\nprint(\"\".join(ans))\r\n\r\n", "\r\ndef solve():\r\n s = input()\r\n cnt = [0]*26\r\n for i in s: cnt[ord(i)-97] += 1\r\n odd, even = 0, 0\r\n for i in cnt:\r\n if i%2==0: even += 1\r\n else: odd += 1\r\n if len(s) % 2 == 0 and odd >= 2:\r\n for i in range(26):\r\n if cnt[i]%2 == 1:\r\n for j in range(25, i, -1):\r\n if cnt[j]%2 == 1:\r\n cnt[i] += 1\r\n cnt[j] -= 1\r\n break\r\n if len(s) % 2 == 1 and odd >= 3:\r\n for i in range(26):\r\n if cnt[i]%2 == 1:\r\n for j in range(25, i, -1):\r\n if cnt[j]%2 == 1:\r\n cnt[i] += 1\r\n cnt[j] -= 1\r\n break\r\n ans = \"\"\r\n for i in range(26): ans += chr(i+97)*(cnt[i]//2)\r\n for i in range(26): \r\n if cnt[i]%2 == 1:\r\n print(ans+chr(i+97)+ans[::-1])\r\n return\r\n print(ans+ans[::-1])\r\n \r\ntest = 1\r\n# test = int(input())\r\nwhile test:\r\n solve()\r\n test -= 1\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**6)\r\nfrom queue import PriorityQueue\r\nfrom math import gcd\r\nfrom math import log\r\nfrom math import ceil\r\nfrom math import pi\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 10**9 + 7\r\n\r\ns = ip()\r\n\r\nch = [0 for i in range (26)]\r\n\r\nfor i in s :\r\n ch[ord(i) - 97] += 1\r\n\r\nl = 0\r\nh = 25\r\n\r\nwhile (l<h) :\r\n\r\n while (l<h) and (ch[l]%2 == 0) :\r\n l += 1\r\n while (l<h) and (ch[h]%2 == 0) :\r\n h -= 1\r\n\r\n if (l<h) :\r\n ch[l] += 1\r\n ch[h] -= 1\r\n l += 1\r\n h -= 1\r\n\r\nans = \"\"\r\nm = \"\"\r\n\r\nfor i in range (26) :\r\n c = chr(97 + i)\r\n\r\n ans += c*(ch[i]//2)\r\n\r\n if (ch[i]%2 == 1) :\r\n m = c\r\n\r\nprint(ans + m + ans[::-1])\r\n", "s = str(input())\r\nn = len(s)\r\nC = [0]*26\r\n\r\nfor c in s:\r\n C[ord(c)-ord('a')] += 1\r\n\r\nodd = [i for i in range(26) if C[i]%2 == 1]\r\nfrom collections import deque\r\nodd = deque(odd)\r\nif n%2 == 1:\r\n while len(odd) > 1:\r\n C[odd[-1]] -= 1\r\n C[odd[0]] += 1\r\n odd.pop()\r\n odd.popleft()\r\nelse:\r\n while len(odd) > 0:\r\n C[odd[-1]] -= 1\r\n C[odd[0]] += 1\r\n odd.pop()\r\n odd.popleft()\r\n\r\nans = []\r\nfor i in range(26):\r\n t = chr(i+ord('a'))*(C[i]//2)\r\n ans.append(t)\r\n\r\nif odd:\r\n mid = [chr(odd[0]+ord('a'))]\r\nelse:\r\n mid = []\r\nans = ans+mid+list(reversed(ans))\r\nprint(''.join(ans))\r\n", "from collections import defaultdict\r\n \r\ndef main():\r\n s = input()\r\n l = defaultdict(int)\r\n for c in s:\r\n l[c] += 1\r\n \r\n u = sorted(list(filter(lambda x: l[x] % 2, l.keys())))\r\n \r\n for i in range(0, int(len(u) / 2)):\r\n l[u[i]] += 1\r\n l[u[-i-1]] -= 1\r\n \r\n r = \"\"\r\n for c in sorted(l.keys()):\r\n r += c * int(l[c] / 2)\r\n \r\n c = u[int(len(u) / 2)] if len(u) % 2 else \"\"\r\n \r\n print(r + c + r[::-1])\r\n \r\nmain()", "s,l,p,z,x,k=input(),[0]*27,0,\"\",\"\",\"\"\r\nfor i in s:l[ord(i)-97]+=1\r\nfor i in l:\r\n if i%2:p+=1\r\np//=2\r\nfor i in range(26,-1,-1):\r\n if l[i]%2 and p:\r\n p-=1\r\n l[i]-=1\r\n for j in range(26):\r\n if l[j]%2:\r\n l[j]+=1\r\n break\r\nfor j in range(26):\r\n o=chr(j+97)*(l[j]//2)\r\n z+=o\r\n x=o+x\r\n if l[j]%2:k=chr(j+97)\r\nprint(z+k+x)", "from collections import Counter\r\n\r\ns = Counter(sorted(list(input())))\r\nodds = [key for key in s if s[key]%2]\r\n\r\nl = len(odds)\r\nfor i in range(l//2):\r\n s[odds[i]] += 1\r\n s[odds[l-i-1]] -= 1\r\n\r\nmid = odds[l//2] if l%2 else \"\"\r\nans = \"\".join([key*(s[key]//2) for key in s])\r\n\r\nprint(ans + mid + ans[::-1])", "s = input()\r\nfrom collections import Counter\r\nc = Counter(s)\r\nans = ''\r\nfor i in range(26):\r\n ch = chr(97 + i)\r\n if c[ch]%2:\r\n for j in range(25,i,- 1):\r\n if c[chr(97 + j)]%2:\r\n c[chr(97 + j)] -= 1\r\n c[ch] += 1\r\n break\r\n else:\r\n one = ch\r\n ans += c[ch]//2 * ch\r\nif len(s)%2:\r\n print(ans + one + ans[::-1])\r\nelse:\r\n print(ans + ans[::-1])", "#https://codeforces.com/contest/600\r\n\r\n#problem C: make palindrome\r\n#change the minimal number of letters and permute to make the lexigraphically\r\n#smallest palindrome\r\n\r\n#make sure there are even # of every letter (except if odd length, 1 other)\r\n#if odd length, make the middle letter the smallest odd one\r\n#if multiple odd ones, change one of each to an a\r\n\r\ns = input()\r\n#count the number of each letter in s\r\nls = [0] * 26\r\nfor i in range(len(s)):\r\n ls[ord(s[i]) - ord('a')] += 1\r\nodds = []\r\nfor i in range(26):\r\n if ls[i]%2 == 1:\r\n odds.append(i)\r\nodds = odds[::-1] #prioritize getting rid of higher ones first\r\nend = len(odds)-1\r\nfor i in range(0,len(odds)//2):\r\n if i >= end:\r\n break\r\n ls[odds[i]] -= 1\r\n ls[odds[end]] += 1\r\n end -= 1\r\nremainingOdd = '' if len(s)%2 == 0 else chr(odds[end]+ord('a'))\r\n\r\n#now greedily add the smallest letters and then reverse\r\n\r\nres = ''\r\nfor i in range(26):\r\n for j in range(ls[i]//2):\r\n res += chr(i+ord('a'))\r\nrRes = res + remainingOdd + res[::-1]\r\nprint(rRes)", "# Problem: C. Make Palindrome\r\n# Contest: Codeforces - Educational Codeforces Round 2\r\n# URL: https://codeforces.com/problemset/problem/600/C\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/600/C\r\n\r\n输入字符串 s，长度不超过 2e5，由小写字母组成。\r\n\r\n你可以修改多个 s[i]，使得修改后的 s，通过重新排列，可以得到回文串。\r\n设最少修改 x 次。输出修改 x 次且重排后字典序最小的回文串。\r\n输入 aabc\r\n输出 abba\r\n\r\n输入 aabcd\r\n输出 abcba\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n s, = RS()\r\n n = len(s)\r\n cnt = [0] * 26\r\n for c in s:\r\n cnt[ord(c) - ord('a')] += 1\r\n l, r = 0, 25\r\n while l < r:\r\n while l < r and cnt[l] % 2 == 0:\r\n l += 1\r\n while l < r and cnt[r] % 2 == 0:\r\n r -= 1\r\n if l < r:\r\n cnt[l] += 1\r\n cnt[r] -= 1\r\n l += 1\r\n r -= 1\r\n mid = ''\r\n if cnt[l] & 1:\r\n mid = chr(ord('a') + l)\r\n ans = []\r\n for i, v in enumerate(cnt):\r\n ans.extend([chr(ord('a') + i)] * (v // 2))\r\n ans = ''.join(ans)\r\n ans += mid + ans[::-1]\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from collections import Counter\r\ns = input()\r\nn = len(s)\r\ncnt = [0]*26\r\nl, r = 0, 25\r\nfor c in s:\r\n cnt[ord(c)-ord('a')] += 1\r\nwhile l<r:\r\n while l<r and cnt[l]%2 == 0:\r\n l += 1\r\n while l<r and cnt[r]%2 == 0:\r\n r -= 1\r\n if l<r:\r\n cnt[l] += 1\r\n cnt[r] -= 1\r\n l += 1\r\n r -= 1\r\nmid = []\r\nif cnt[l]&1:\r\n mid = [l]\r\n#res = list([i]*(x//2) for i, x in enumerate(cnt))\r\nres = []\r\nfor i, x in enumerate(cnt):\r\n res.extend([i]*(x//2))\r\nres += mid+res[::-1]\r\n#print(res)\r\nprint(''.join(chr(i+ord('a')) for i in res))\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 13/06/2023 15:26:13 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom collections import Counter\r\n\r\ns = input()\r\nn = len(s)\r\na = Counter(sorted(s))\r\n\r\nodd = [[x, a[x]] for x in a if a[x] & 1]\r\nx = len(odd)\r\nfor i in range(x // 2):\r\n a[odd[i][0]] += 1\r\n a[odd[x-i-1][0]] -= 1\r\n\r\ncodd = ''\r\ns = ''\r\nfor x in a:\r\n if a[x] & 1:\r\n codd = x\r\n s += x * (a[x] // 2)\r\n\r\nprint(s + codd + s[::-1])", "s = input()\r\nfrq = [0]*26\r\ns1=0\r\nfor i in s:\r\n c = ord(i)-ord('a')\r\n frq[c]+=1\r\nchars = [chr(i+ord('a')) for i in range(26) if frq[i]&1]\r\nfor i in range(len(chars)//2):\r\n char = ord(chars[i])-ord('a')\r\n inv_char = ord(chars[len(chars)-1-i])-ord('a')\r\n frq[char]+=1\r\n frq[inv_char]-=1\r\nnew_s = \"\"\r\nfor i in range(26):\r\n new_s += chr(i+ord('a'))*(frq[i]//2)\r\nrev=new_s[::-1]\r\nif len(s)&1:\r\n new_s+= chars[len(chars)//2]\r\nprint(new_s+rev)", "import sys\r\n\r\nout = lambda a : sys.stdout.write(str(a)+'\\n')\r\n\r\ns = input()\r\n\r\n# count number of occurrences for each, store in list a\r\na = [0 for i in range(26)]\r\nfor el in s:\r\n a[ord(el)-97] += 1\r\n\r\n# list b contains all odd's\r\n# list c contains their indices, in order\r\n\r\nb = []\r\nc = []\r\nfor i,el in enumerate(a):\r\n if el % 2 == 1:\r\n b.append(el)\r\n c.append(i)\r\n\r\nl = len(b)\r\n\r\nl_hib = l//2\r\nr_lob = l//2\r\n\r\nodd_length = False\r\nif l % 2 == 1:\r\n l_hib = (l-1)//2\r\n r_lob = (l+1)//2\r\n odd_length = True\r\n\r\nfor i,el in enumerate(b[:l_hib]):\r\n b[i] += 1\r\n\r\nfor i,el in enumerate(b[r_lob:],r_lob):\r\n b[i] -= 1\r\n\r\nfor i,el in enumerate(b):\r\n a[c[i]] = el\r\n\r\nans = ''\r\n# assume first there's no odd\r\nfor i,el in enumerate(a):\r\n ans += chr(i+97) * (el//2)\r\n\r\nif odd_length:\r\n ans += chr(c[l//2]+97)\r\n ans += ans[-2::-1]\r\nelse:\r\n ans += ans[::-1]\r\nout(ans)", "'''\r\nSingle odd value in center is possible\r\n\r\nIf odd length:\r\n\t-take largest odd value (ties broken by ord(c)) and stick\r\n\tone value in the middle of the string\r\n\r\n\tleft + f + right\r\n\r\n\r\nNow both are even cases\r\n\r\nAll evens should not be changed in amount/fixed number already\r\n\r\nOdds need to be swapped with another odd or otherwise\r\n\r\nFilter out to chars with odd counts\r\nsort by letter\r\ntake from the right end and update left end, there must be even\r\namounts at this point\r\n\r\nmerge all into one array called p\r\n\r\nif odd:\r\n\tp[:len(s)//2] + [chosen] + p[len(s)//2+1:]\r\n\r\nprint(''.join(p))\r\n\r\n\r\n'''\r\nfrom collections import Counter, deque\r\n\r\ns = input().strip()\r\nn = len(s)\r\nc = Counter(s)\r\nchosen = ''\r\n\r\n# Filter out odds\r\nodds = []\r\nevens = []\r\nfor l, f in c.items():\r\n\tif f&1:\r\n\t\todds.append([l, f])\r\n\telse:\r\n\t\tevens.append([l, f])\r\n\r\n# Sort by Letter\r\nodds.sort()\r\n\r\n# Take from right end and update left\r\nleft = 0\r\nright = len(odds) - 1\r\nwhile left < right:\r\n\todds[right][1] -= 1\r\n\todds[left][1] += 1\r\n\tleft += 1\r\n\tright -= 1\r\n\r\nif n&1:\r\n\tmx = -1\r\n\tfor _, f in odds:\r\n\t\tif f & 1 and f > mx:\r\n\t\t\tmx = f\r\n\r\n\tfor l, f in odds:\r\n\t\tif f == mx and l > chosen:\r\n\t\t\tchosen = l\r\n\tc[chosen] -= 1\r\n\r\n\tfor i in range(len(odds)):\r\n\t\tif odds[i][0] == chosen:\r\n\t\t\todds[i][1] -= 1\r\n\r\nchars = sorted(odds + evens, reverse=True)\r\n# print(c, odds, evens, chars)\r\n\r\n# Construct p\r\np = deque()\r\nif n&1:\r\n\tp.append(chosen)\r\n\r\nfor l, f in chars:\r\n\tif f&1 or f == 0:\r\n\t\tcontinue\r\n\twhile f > 0:\r\n\t\tp.appendleft(l)\r\n\t\tp.append(l)\r\n\t\tf -= 2\r\n\r\n\r\nprint(''.join(p))", "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\ns = input().rstrip()\r\n\r\nd = defaultdict(int)\r\nfor c in s:\r\n d[c] += 1\r\n\r\nleft = []\r\nfor i in range(26):\r\n if d[chr(i+ord(\"a\"))] % 2 == 1:\r\n left.append(i)\r\n d[chr(i+ord(\"a\"))] -= 1\r\n\r\nleft = deque(left)\r\nwhile len(left)>= 2:\r\n mn = left.popleft()\r\n mx = left.pop()\r\n d[chr(mn+ord(\"a\"))] += 2\r\n\r\n\r\nans = [0]*len(s)\r\nnow = 0\r\nfor i in range(26):\r\n while d[chr(i + ord(\"a\"))] != 0:\r\n ans[now] = chr(i + ord(\"a\"))\r\n ans[-now-1] = chr(i + ord(\"a\"))\r\n d[chr(i + ord(\"a\"))] -= 2\r\n now += 1\r\n\r\nif left:\r\n ans[now] = chr(left.pop() + ord(\"a\"))\r\n\r\nprint(\"\".join(ans))", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nfrom collections import Counter\r\n\r\ncnt = Counter(sorted(input()))\r\nodd = [c for c, i in zip(cnt.keys(), cnt.values()) if i % 2]\r\nn = len(odd)\r\nfor i in range(n // 2):\r\n cnt[odd[i]] += 1\r\n cnt[odd[n - 1 - i]] -= 1\r\noddc = odd[n // 2] if n % 2 else ''\r\nans = ''.join([c * (i // 2) for c, i in zip(cnt.keys(), cnt.values())])\r\nprint(ans + oddc + ans[::-1])\r\n\t \t\t\t\t \t", "def solve():\r\n s = input()\r\n a = [0] * 26\r\n for c in s:\r\n a[ord(c)-ord('a')] += 1\r\n \r\n l, r = 0, 25\r\n while l < r:\r\n if a[l] & 1 and a[r] & 1:\r\n a[l] += 1\r\n a[r] -= 1\r\n l += 1\r\n r -= 1\r\n elif a[l] & 1 == 0:\r\n l += 1\r\n elif a[r] & 1 == 0:\r\n r -= 1\r\n \r\n \r\n ans = ''\r\n mid = ''\r\n for i, cnt in enumerate(a):\r\n ans += chr(i+ord('a')) * (cnt // 2)\r\n if cnt & 1:\r\n mid = chr(i+ord('a'))\r\n \r\n print(ans+mid+ans[::-1])\r\n \r\nif __name__ == \"__main__\":\r\n solve()", "s = input()\n\nlista = [0]*26\n\nfor i in s:\n lista[ord(i)-ord('a')] += 1\n\nimpar=[]\nfor i in range(len(lista)):\n if lista[i] % 2:\n impar.append(i)\n\n\nfor i in range(len(impar)//2):\n meio=-(i+1)\n\n lista[impar[i]] += 1\n lista[impar[meio]] -= 1\n\nlistaNew=[]\n\nfor i in range(len(lista)):\n if lista[i] % 2:\n listaNew.append(chr(i+ord('a')))\n lista[i] -= 1\n\np=[]\nfor i in range(26):\n while lista[i] > 0:\n p.append(chr(i+ord('a')))\n lista[i] -= 2\n\nprint(''.join(p)+''.join(listaNew)+''.join(reversed(p)))\n\n\t \t\t\t\t\t \t\t\t \t \t \t \t\t \t \t", "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\nimport bisect\r\n# input = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n s = rs()\r\n n = len(s)\r\n f = [0]*26\r\n\r\n for i in s:\r\n f[ord(i)-ord('a')] += 1\r\n\r\n o = [i for i in range(26) if f[i] & 1]\r\n while len(o) > n & 1:\r\n f[o[-1]] -= 1\r\n f[o[0]] += 1\r\n o.pop(0)\r\n o.pop()\r\n res = ''\r\n for i in range(26):\r\n res += (chr(ord('a')+i)*(f[i]//2))\r\n m = chr(ord('a')+o[0]) if o else ''\r\n print(res+m+res[::-1])\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import sys\r\nfrom collections import deque, Counter\r\nfrom string import ascii_lowercase\r\ninf = float(\"inf\")\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n # n = int(input())\r\n # a = list(read_ints())\r\n pass\r\n s = input()\r\n cnt = Counter(s)\r\n\r\n # check if s is a p\r\n ok = 0\r\n for ch in ascii_lowercase:\r\n if cnt[ch] & 1:\r\n ok += 1\r\n if ok > 1:\r\n # wa can replace a worst char to a best char\r\n i, j = 0, 25\r\n while ok > 1:\r\n while cnt[ascii_lowercase[i]] & 1 == 0:\r\n i += 1\r\n while cnt[ascii_lowercase[j]] & 1 == 0:\r\n j -= 1\r\n cnt[ascii_lowercase[i]] += 1\r\n cnt[ascii_lowercase[j]] -= 1\r\n ok -= 2\r\n i += 1\r\n j -= 1\r\n res = \"\"\r\n mid = \"\"\r\n for ch in ascii_lowercase:\r\n if cnt[ch] >> 1:\r\n res += ch * (cnt[ch] >> 1)\r\n if cnt[ch] & 1:\r\n mid = ch\r\n if ok == 1:\r\n res = res + mid + res[::-1]\r\n else:\r\n res += res[::-1]\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "s=input()\r\na=[]\r\ncnt=[0]*26\r\n\r\nfor i in s:\r\n si=ord(i)-97\r\n if cnt[si]==1:\r\n a.append(i)\r\n cnt[si]=0\r\n else:\r\n cnt[si]=1\r\n\r\nfrom collections import deque\r\nrem=deque()\r\nfor i in range(26):\r\n if cnt[i]==1:\r\n rem.append(chr(i+97))\r\n\r\nwhile len(rem)>=2:\r\n x=rem.popleft()\r\n y=rem.pop()\r\n a.append(x)\r\n\r\na.sort()\r\nif rem:\r\n x=[rem[0]]\r\n print(''.join(a+x+a[::-1]))\r\nelse:\r\n print(''.join(a+a[::-1]))", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n \r\n\r\ndef solve(): # 123456\r\n cache=[0]*26\r\n s=input().rstrip()\r\n n=len(s)\r\n for i in s:\r\n cache[ord(i)-97]+=1\r\n if n%2==0:\r\n data=[]\r\n for i in range(26):\r\n if cache[i]%2==1: data.append(i)\r\n result=''\r\n k=len(data)\r\n for i in range(k//2):\r\n cache[data[i]]+=1\r\n cache[data[-1-i]]-=1\r\n for i in range(26):\r\n result+=(cache[i]//2)*chr(97+i)\r\n print(result+result[::-1])\r\n else:\r\n data=[]\r\n for i in range(26):\r\n if cache[i]%2==1: data.append(i)\r\n result=''\r\n mid=''\r\n k=len(data)\r\n for i in range(k//2):\r\n cache[data[i]]+=1\r\n cache[data[-1-i]]-=1\r\n for i in range(26):\r\n result+=chr(97+i)*(cache[i]//2)\r\n if cache[i]%2==1: mid=chr(97+i)\r\n print(result+mid+result[::-1])\r\n \r\n \r\n\r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "s = input()\n\nmochila = [0]*26\n\nfor i in s:\n mochila[ord(i)-ord('a')] += 1\n\nimpar=[]\nfor i in range(len(mochila)):\n if mochila[i] % 2:\n impar.append(i)\n \n\nfor i in range(len(impar)//2):\n mid=-(i+1)\n \n mochila[impar[i]] += 1\n mochila[impar[mid]] -= 1\n \nlistaNew=[]\n\nfor i in range(len(mochila)):\n if mochila[i] % 2:\n listaNew.append(chr(i+ord('a')))\n mochila[i] -= 1\n\np=[]\nfor i in range(26):\n while mochila[i] > 0:\n p.append(chr(i+ord('a')))\n mochila[i] -= 2\n\nprint(''.join(p)+''.join(listaNew)+''.join(reversed(p)))\n\n\n\t\t \t\t\t\t \t \t \t\t \t\t \t", "from collections import defaultdict\r\n# import sys\r\n# input = sys.stdin.readline\r\n\r\narr = [0] * 26\r\ns = input()\r\nk = ord('a')\r\ncnt = 0\r\nres = ''\r\nl = []\r\nfor c in s:\r\n arr[ord(c)-k] += 1\r\n\r\nfor i, v in enumerate(arr):\r\n if v & 1:\r\n l.append(i)\r\n\r\nfor i in range(len(l) // 2):\r\n arr[l[i]] += 1\r\n arr[l[-1-i]] -= 1\r\n\r\nfor i in range(26):\r\n if arr[i] == 0:\r\n continue\r\n res += chr(i+k) * (arr[i]//2)\r\n\r\nc = chr(l[len(l)//2]+k) if len(l) & 1 else \"\"\r\n\r\nprint(res + c + res[::-1])\r\n\r\n\r\n", "import sys\r\nfrom array import array\r\nfrom collections import Counter\r\nfrom string import ascii_lowercase as asc\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil_ = lambda a, b: (a + b - 1) // b\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nMint, Mlong, out = 2 ** 31 - 1, 2 ** 63 - 1, []\r\n\r\nfor _ in range(1):\r\n mem = Counter(input())\r\n\r\n n = odds = be = 0\r\n\r\n for ch in asc:\r\n odds += mem[ch] & 1\r\n n += mem[ch]\r\n\r\n while be < 26 and odds > 1:\r\n if mem[asc[be]] & 1:\r\n mem[asc[be]] += 1\r\n odds -= 2\r\n\r\n for en in range(25, -1, -1):\r\n if mem[asc[en]] & 1:\r\n mem[asc[en]] -= 1\r\n break\r\n\r\n be += 1\r\n\r\n ans, be = [''] * n, 0\r\n for ch in asc:\r\n for i in range(mem[ch] >> 1):\r\n ans[be] = ans[-be - 1] = ch\r\n be += 1\r\n\r\n for ch in asc:\r\n for i in range(mem[ch]&1):\r\n ans[be] = ans[-be - 1] = ch\r\n be += 1\r\n\r\n out.append(''.join(ans))\r\nprint('\\n'.join(map(str, out)))\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n# 加快读入速度, 但是注意后面的换行符(\\n)\r\n# 如果是使用 input().split() 或者 int(input()) 之类的, 换行符就去掉了\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n s = input()[:-1]\r\n dic = Counter()\r\n for c in s:\r\n dic[c] += 1\r\n L = [0] * 26\r\n odd_L = []\r\n for key, value in dic.items():\r\n L[ord(key) - ord(\"a\")] = value\r\n if value % 2 != 0:\r\n odd_L.append(key)\r\n odd_L.sort()\r\n odd_L = deque(odd_L)\r\n ans = [\"\"] * len(s)\r\n if len(s) % 2 != 0:\r\n while len(odd_L) > 1:\r\n left = odd_L.popleft()\r\n right = odd_L.pop()\r\n L[ord(left) - ord(\"a\")] += 1\r\n L[ord(right) - ord(\"a\")] -= 1\r\n L[ord(odd_L[0]) - ord(\"a\")] -= 1\r\n ans[len(s) // 2] = odd_L[0]\r\n else:\r\n while len(odd_L) > 0:\r\n left = odd_L.popleft()\r\n right = odd_L.pop()\r\n L[ord(left) - ord(\"a\")] += 1\r\n L[ord(right) - ord(\"a\")] -= 1\r\n i = 0\r\n j = len(ans) - 1\r\n k = 0\r\n while i < j:\r\n while k < len(L) and L[k] == 0:\r\n k += 1\r\n ans[i] = chr(k + ord(\"a\"))\r\n ans[j] = chr(k + ord(\"a\"))\r\n i += 1\r\n j -= 1\r\n L[k] -= 2\r\n print(\"\".join(ans))\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "n,k,p,x,y=map(int,input().split())\r\nq=list(map(int,input().split()))\r\ncy,cx=0,0\r\nfor i in q: cy+=(i<y)\r\nif cy>(n-1)//2: print(-1)\r\nelse:\r\n w=[]\r\n for i in range(min(n-k,n//2-cy)): w.append(1)\r\n while len(w)<n-k: w.append(y)\r\n if sum(q)+sum(w)>x: print(-1)\r\n else: print(*w)", "n, k, p, x, y = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nm = (n + 2 - 1) // 2\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] < y:\r\n count += 1\r\nans = []\r\nif n - k > m - count - 1:\r\n ans += (m - count - 1) * [1]\r\n if 0 < n - len(ans) - len(s):\r\n ans += (n - len(ans) - len(s)) * [y]\r\nelse:\r\n ans += (n - k) * [1]\r\n if 0 < n - len(ans) - len(s):\r\n ans += (n - len(ans) - len(s)) * [y]\r\np = sorted(s + ans)\r\nif sum(s) + sum(ans) > x or p[m - 1] < y:\r\n print(-1)\r\nelse:\r\n print(*ans)", "n, k, p, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nstart_sum = sum(a)\r\nmajor = 0\r\nfor i in range(k):\r\n if a[i] >= y:\r\n major += 1\r\n\r\ncount_max = (n + 1) // 2 - major\r\nif k - major > n // 2:\r\n print(-1)\r\nelse:\r\n cnt_mx = (n + 1) // 2 - major # кол-во макс оценок которые осталось дописать\r\n if cnt_mx <= 0:\r\n cnt_mx = 0\r\n optim = x - start_sum - cnt_mx * y - (n - k - cnt_mx)\r\n if optim < 0:\r\n print(-1)\r\n else:\r\n print(cnt_mx * (str(y) + ' ') + '1 ' * (n - k - cnt_mx))\r\n\r\n# cur_min = 1\r\n# count_min = n // 2 - minor\r\n#\r\n# if count_min < 0:\r\n# print(-1)\r\n# else:\r\n# optim = count_min * cur_min + (n - k - count_min) * y\r\n# if optim > sum_marks:\r\n# print(-1)\r\n# else:\r\n# print('1 ' * count_min + (str(y) + ' ') * (n - k - count_min))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, p, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [0] * 2\r\nfor i in a:\r\n cnt[min(i // y, 1)] += 1\r\nif cnt[0] > n // 2:\r\n ans = [-1]\r\nelse:\r\n ans = []\r\n for _ in range(max(n // 2 + 1 - cnt[1], 0)):\r\n ans.append(y)\r\n while len(ans) ^ (n - k):\r\n ans.append(1)\r\n if sum(ans) + sum(a) > x:\r\n ans = [-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int, input().split()))\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n,k,p,x,y=map(int,input().split())\r\n arr=list(map(int, input().split()))\r\n ct=0\r\n curr=0\r\n for i in range(k):\r\n if(arr[i]<y):\r\n ct+=1\r\n curr+=arr[i]\r\n if(ct>(n-1)//2 or curr>x):\r\n print(-1)\r\n return\r\n tot=k\r\n g=0\r\n while(tot!=n and ct!=(n-1)//2):\r\n ct+=1\r\n curr+=1\r\n tot+=1\r\n g+=1\r\n if(curr>x):\r\n print(-1)\r\n return\r\n ct2=0\r\n while(tot!=n):\r\n ct2+=1\r\n curr+=y\r\n tot+=1\r\n if(curr>x):\r\n print(-1)\r\n return\r\n ans=[-1]*(n-k)\r\n for i in range(n-k):\r\n if(i<g):\r\n ans[i]=1\r\n else:\r\n ans[i]=y\r\n print(*ans)\r\nmain()", "n,k,p,x,y=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ntot=sum(a)\r\nif (n-k)+tot>x:\r\n print(-1)\r\nelse:\r\n a.sort()\r\n pre,post=0,0\r\n for i in range(k):\r\n if a[i]>=y:\r\n post+=1\r\n else:\r\n pre+=1\r\n req=n-k\r\n lim=n//2\r\n if pre>lim:\r\n print(-1)\r\n else:\r\n rem=lim-pre\r\n ans=[]\r\n for i in range(min(req,rem)):\r\n ans.append(1)\r\n if req>rem:\r\n for i in range(req-rem):\r\n ans.append(y)\r\n if sum(ans)+tot>x:\r\n print(-1)\r\n else:\r\n print(*ans)", "n,k,p,x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk1=0\r\nfor x1 in l :\r\n if x1>=y :\r\n k1+=1\r\nt=(n)//2+1\r\nif k1>t :\r\n t=0\r\nelse :\r\n t=abs(t-k1)\r\n\r\nif sum(l)+t*y+abs(n-k-t)>x or p<y or (n-k)<t :\r\n print(-1)\r\n quit()\r\nans=[y]*t+[1]*(n-k-t)\r\nprint(*ans)" ]

[ "n, d = map(int, input().split())\r\np, v = 0, 0\r\nfor b in map(int, input().split()):\r\n if b <= p:\r\n c = (p + d - b) // d\r\n v += c\r\n b += c * d\r\n p = b\r\nprint(v)", "from math import ceil\r\na=input().split()\r\nb=input().split()\r\nc=0\r\nfor i in range (1,int(a[0])):\r\n if int(b[i])<=int(b[i-1]):\r\n d=ceil((int(b[i-1])-int(b[i])+1)/int(a[1]))\r\n c+=d\r\n b[i]=int(b[i])+int(a[1])*d\r\nprint(c)\r\n", "n, d = map(int, input().split())\r\nb, dem = list(map(int, input().split())), 0\r\nfor x in range(n - 1):\r\n if b[x] >= b[x + 1]: dem, b[x + 1] = dem + (b[x] - b[x + 1]) // d + 1, b[x + 1] + ((b[x] - b[x + 1]) // d + 1) * d\r\nprint(dem)", "import math\nn, d = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\nmoves = 0\nbench = 0\n\nfor i in range(1, len(b)):\n if b[i] < b[i - 1]:\n bench = math.ceil((b[i - 1] - b[i]) / d)\n b[i] += (d * bench)\n moves += bench\n if b[i] == b[i - 1]:\n b[i] += d\n moves += 1\n \nprint(moves)\n", "arr = input().split()\nn = int(arr[0])\nd = int(arr[1])\n\na = input().split()\nans = int(0)\n\npre = int(-1)\n\n# a.sort()\n\nfor i in a:\n i = int(i)\n # print(i, end = ', ')\n x = 0\n if i <= pre:\n x = (pre-i + d) // d\n ans = ans + x\n pre = i + x*d\n # print(pre, end = '\\n')\n\nprint(ans)\n \t \t \t \t\t \t \t \t\t \t\t\t \t \t", "n,d = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nnum = 0\nfor i in range(1, len(a)):\n if a[i] < a[i-1]:\n num += (a[i - 1] - a[i]) // d + 1\n a[i] += d * ((a[i - 1] - a[i]) // d + 1)\n elif a[i] == a[i-1]:\n a[i] += d\n num += 1\nprint(num)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nco=0\r\nfor i in range(1,n):\r\n\tif a[i]<=a[i-1]:\r\n\t\tl=a[i-1]-a[i]\r\n\t\tp=l//k+1\r\n\t\ta[i]+=p*k\r\n\t\tco+=p\r\nprint(co)\r\n \r\n", "n, k = input().split()\nn = int(n)\nk = int(k)\n\na = list(map(int, input().split()))\ncount = 0\n\nfor i in range(1, n):\n if(a[i] <= a[i-1]):\n val = ((a[i-1]-a[i])//k)+1\n a[i] += k*val\n count += val\n\nprint(count)\n \t\t \t\t\t \t \t\t \t\t\t\t \t\t \t\t \t \t", "a = []\r\nn = input().split(' ')\r\nd = int(n[1])\r\nn = int(n[0])\r\nx = input().split(' ')\r\nk=0\r\nfor i in range(n):\r\n a.append(int(x[i]))\r\n if (i>0 and a[i-1] >= a[i]):\r\n k += ((a[i - 1] - a[i]) // d) + 1\r\n a[i] += ((a[i - 1] - a[i]) // d) * d + d\r\nprint(k)\r\n", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n if(l[i]<=l[i-1]):\r\n a = l[i-1]-l[i]\r\n\r\n l[i]+=(a//d+1)*d\r\n c+=a//d+1\r\n\r\nprint(c)\r\n \r\n ", "useless, d = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nresult = 0\r\nfor i in range(0, len(array) - 1):\r\n if array[i] >= array[i + 1]:\r\n result += (array[i] - array[i + 1]) // d + 1\r\n array[i + 1] += ((array[i] - array[i + 1]) // d)*d + d\r\n\r\nprint(result)\r\n", "y=input().split()\r\nn=int(y[0])\r\nk=int(y[1])\r\nspisok = [int(x) for x in input().split()]\r\ns=0\r\nfor i in range(n-1):\r\n\tif spisok[i+1] <= spisok[i]:\r\n\t\tr=spisok[i]-spisok[i+1]\r\n\t\td=(r//k)+1\r\n\t\tspisok[i+1]+=d*k\r\n\t\ts+=d\r\nprint(s)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nfrom math import ceil\r\n\r\nlength, delta = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\n# can add delta to an element in 1 move \r\n# find min moves to make strictly increasing \r\n\r\nans = 0 \r\nprev = float(\"-inf\")\r\n\r\n# left to right sweep\r\n\r\nfor x in arr:\r\n if x <= prev:\r\n target = prev + 1\r\n dif = target - x \r\n num_steps = ceil(dif / delta)\r\n ans += num_steps\r\n prev = x + num_steps * delta\r\n else:\r\n prev = x \r\n\r\nprint(ans)\r\n ", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n-1):\r\n\tif l[i] >= l[i+1]:\r\n\t\tx = ((l[i]-l[i+1])//d)+1\r\n\t\tans += x\r\n\t\tl[i+1] += d*x\r\nprint(ans)", "import math\r\nn, d = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\nm = 0\r\nfor i in range(1, n):\r\n if b[i - 1] < b[i]:\r\n c = 0\r\n else:\r\n c = math.ceil((b[i - 1] + 1 - b[i]) / d)\r\n m += c\r\n b[i] += d * c\r\nprint(m)", "n,d=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nimport math\r\n\r\nc=0\r\n\r\nfor i in range(n-1):\r\n\r\n if l[i]>=l[i+1]:\r\n\r\n c+=int((l[i]-l[i+1])/d)+1\r\n\r\n l[i+1]+=d*(int((l[i]-l[i+1])/d)+1)\r\n\r\nprint(c)", "import math\r\n\r\nn, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1, n):\r\n if a[i] <= a[i-1]:\r\n b = math.ceil((a[i-1]+1 - a[i]) / d)\r\n count += b\r\n a[i] = a[i] + b*d\r\nprint(count)", "n, d = list(map(int, input().split()))\nvs = list(map(int, input().split()))\nans = 0\n\nfor i in range(1, n):\n if vs[i - 1] >= vs[i]:\n t = (vs[i - 1] - vs[i]) // d + 1\n vs[i] += (t * d)\n ans += t\n\nprint(ans)\n\t\t \t \t \t\t\t \t\t\t \t \t \t \t \t", "[n, d] = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1,n):\r\n\tif (b[i] <= b[i-1]):\r\n\t\tk = (b[i-1] - b[i] + d) // d\r\n\t\tans += k\r\n\t\tb[i] += k * d\r\nprint(ans)", "n, d = map(int, input().split())\r\nl = list(map(int,input().split()))\r\nm = 0\r\nfor x in range(1, n):\r\n if l[x] <= l[x-1]:\r\n m += (l[x-1]-l[x])//d+1\r\n l[x] += d*((l[x-1]-l[x])//d+1)\r\nprint(m)", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nt = 0\r\nfor i in range(1,n):\r\n\tk = 0\r\n\tif l[i-1] >= l[i]:\r\n\t\tk = (l[i-1] - l[i])//d\r\n\t\tl[i] = l[i] + (k+1)*d\r\n\t\tk = k + 1\r\n\tt = t + k\r\nprint(t)", "import math\r\n\r\nn, d = [int(i) for i in input().split(' ')]\r\na = input().split(' ')\r\na = list(map(int, a))\r\n\r\nans = 0\r\nfor i in range(1, len(a)):\r\n delta = a[i-1] - a[i] + 1\r\n if delta >= 0:\r\n delta = math.ceil(delta/d)\r\n a[i] += delta*d\r\n ans += delta\r\n\r\nprint(ans)", "from math import ceil\r\nn,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n if b[i]>=b[i+1]:\r\n x=ceil((b[i]-b[i+1]+1)/d)\r\n c+=x\r\n b[i+1]+=x*d\r\nprint(c)\r\n \r\n\r\n", "n, d = map(int, input().split())\narray = list(map(int, input().split()))\n\ncount = 0\nfor i in range(1, n):\n if array[i] <= array[i - 1]:\n temp = int((array[i - 1] - array[i] + d) / d)\n array[i] = array[i] + temp * d\n count += temp\nprint(count)\n", "import sys\r\ninput = sys.stdin.readline\r\nn,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-1):\r\n if a[i+1] <= a[i]:\r\n ans += (-a[i+1]+a[i]+d)//d\r\n a[i+1] += ((-a[i+1]+a[i]+d)//d)*d\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, n):\r\n if arr[i] <= arr[i - 1]:\r\n l, r = 0, 10 ** 8\r\n while (r - l) > 1:\r\n mid = (r + l) // 2\r\n \r\n k = mid * d\r\n \r\n if (arr[i] + k) > arr[i - 1]:\r\n r = mid\r\n else:\r\n l = mid\r\n \r\n arr[i] += r * d\r\n ans += r\r\n \r\nprint(ans)", "n,d=map(int,input().split())\r\nliste=list(map(int,input().split()))\r\nj=0\r\n\r\nfor i in range(0,len(liste)-1):\r\n if liste[i]>=liste[i+1]:\r\n j+=((liste[i]-liste[i+1])//d)+1\r\n liste[i+1]+=d*((liste[i]-liste[i+1])//d)+d\r\n \r\n \r\nprint(j) ", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nr=0\r\nfor i in range(n-1):\r\n if(l[i]>=l[i+1]):\r\n r=(abs(l[i+1]-l[i])//d)+1\r\n l[i+1]+=r*d\r\n c+=r\r\nprint(c)", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef listring(l): return ' '.join([str(x) for x in l])\r\ndef printlist(l): print(' '.join([str(x) for x in l]))\r\n \r\nn,d = mp()\r\na = lt()\r\nb = 0\r\nc = 0\r\nfor i in range(1,len(a)):\r\n if a[i] <= a[i-1]+d*b:\r\n b = (a[i-1]+d*b-a[i])//d + 1\r\n c += b\r\n else:\r\n b = 0\r\nprint(c)\r\n \r\n \r\n \r\n ", "n, d = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nmoves = 0\r\nfor i in range(n-1):\r\n if l[i]>=l[i+1] :\r\n moves += 1 + (l[i] - l[i+1])//d\r\n l[i+1] += d * (1 + (l[i] - l[i+1])//d)\r\n \r\nprint(moves)", "def count_moves_to_increase_sequence(n, d, sequence):\r\n moves = 0\r\n\r\n for i in range(1, n):\r\n if sequence[i] <= sequence[i - 1]:\r\n diff = (sequence[i - 1] - sequence[i]) // d + 1\r\n sequence[i] += diff * d\r\n moves += diff\r\n\r\n return moves\r\n\r\nn, d = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nresult = count_moves_to_increase_sequence(n, d, sequence)\r\nprint(result)\r\n", "import math\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nc=a[-1]\r\nn=0\r\nfor i in range(len(b)-1):\r\n\tif b[i]>b[i+1]:\r\n\t\td=math.ceil((b[i]-b[i+1])/c)\r\n\t\tn+=d\r\n\t\tb[i+1]+=d*c\r\n\tif b[i]==b[i+1]:\r\n\t\td=1\r\n\t\tn+=1\r\n\t\tb[i+1]+=c\r\nprint(n)\r\n", "import math\r\nn, d =list(map(int,input().split()))\r\ninp=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n if(inp[i+1]<=inp[i]):\r\n z=inp[i]-inp[i+1]+1\r\n k=math.ceil(z/d)\r\n ans+=k\r\n inp[i+1]=k*d + inp[i+1]\r\nprint(ans) ", "n, d = map(int, input().split())\r\ns = list(map(int, input().split()))\r\no=0\r\nfor i in range(n-1):\r\n a=s[i]\r\n b=s[i+1]\r\n if a>=b:\r\n if (a-b+1)%d==0:\r\n o+=(a-b+1)//d\r\n s[i+1]+=(a-b+1)//d*d\r\n else:\r\n o+=(a-b+1)//d+1\r\n s[i+1]+=((a-b+1)//d+1)*d\r\nprint(o)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nimport math\r\nc=0\r\nfor i in range(n-1):\r\n if l[i]>=l[i+1]:\r\n c+=int((l[i]-l[i+1])/d)+1\r\n l[i+1]+=d*(int((l[i]-l[i+1])/d)+1)\r\nprint(c)", "import math\r\nk1=input()\r\nm=k1.split(\" \")\r\nm=list(map(int,m))\r\nk2=input()\r\nn=k2.split(\" \")\r\nn=list(map(int,n))\r\ncount=0\r\ni=0\r\nwhile (i<(m[0]-1)):\r\n if (n[i+1]-n[i])<0:\r\n # print(\"1 if\")\r\n c=math.ceil((n[i]-n[i+1])/m[1])\r\n n[i+1]=n[i+1]+c*m[1]\r\n count=count+c\r\n if (n[i+1]-n[i])==0:\r\n n[i+1]=n[i+1]+m[1]\r\n # print(\"2 if\")\r\n count=count+1\r\n # print(count) \r\n \r\n i=i+1\r\nprint(count) ", "import math\r\n\r\ndef nik(n,d,rud):\r\n s=rud[0]\r\n res=0\r\n for i in rud[1:]:\r\n l=0\r\n if i<=s:\r\n l+=math.floor((s-i)/d+1)\r\n res+=l\r\n s=i+(l*d)\r\n print(res)\r\nn,d=map(int,input().split())\r\nrud=list(map(int, input().split()))\r\nnik(n,d,rud)", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\n\r\nn,d=map(int,input().split())\r\n*arr,=map(int,input().split())\r\nans=0\r\nfor i in range(1,n):\r\n if arr[i]<=arr[i-1]:\r\n icr=(arr[i-1]-arr[i])//d+1 \r\n ans+=icr;arr[i]+=icr*d\r\nprint(ans) ", "import sys\r\nfrom math import sqrt, floor, factorial, gcd\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\tn, d = read()\r\n\tarr = read(); curr = arr[0]\r\n\tcount = 0\r\n\tfor i in range(1, n):\r\n\t\t# print(curr, arr[i], i, count)\r\n\t\tif curr >= arr[i]:\r\n\t\t\tdiff = curr-arr[i]\r\n\t\t\tarr[i] += d*(diff//d)\r\n\t\t\tcount += (diff//d)\r\n\t\t\tif curr >= arr[i]:\r\n\t\t\t\tarr[i] += d\r\n\t\t\t\tcount += 1\r\n\t\tcurr = arr[i]\r\n\tprint(count)\r\n\r\n\r\n\r\n\r\n# def solve():\r\n# \tans = \"\"\r\n# \tfor _ in range(int(inp())):\r\n# \t\tn, c = read(); arr = []\r\n# \t\tfor i in range(n): arr.append(int(inp()))\r\n# \t\tarr.sort()\r\n# \t\tmax_ans = 1\r\n# \t\tlow = arr[0]; high = arr[-1]\r\n# \t\twhile low < high:\r\n# \t\t\tmid = (low+high)//2\r\n# \t\t\t# print(low, high, mid, \"**\")\r\n# \t\t\tcount = 1; left = arr[0]\r\n# \t\t\tfor i in range(1, n):\r\n# \t\t\t\tright = arr[i]\r\n# \t\t\t\tif right-left >= mid:\r\n# \t\t\t\t\t# print(right-left, mid)\r\n# \t\t\t\t\tcount += 1\r\n# \t\t\t\t\tleft = right\r\n# \t\t\t# print(count)\r\n# \t\t\tif count >= c:\r\n# \t\t\t\tlow = mid+1\r\n# \t\t\t\tmax_ans = max(max_ans, mid)\r\n# \t\t\telse:\r\n# \t\t\t\thigh = mid-1\r\n\t\t\t\r\n# \t\tans += str(max_ans)+\"\\n\"\r\n# \treturn(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n\t# print(solve())", "n,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\ni=1\r\nc=0\r\nfor i in range(1,n):\r\n if(b[i]<=b[i-1]):\r\n c+=((b[i-1]-b[i])//d+1);\r\n b[i]+=((b[i-1]-b[i])//d+1)*d\r\nprint(c)", "n, d = map(int, input().split())\r\nlist1 = map(int, input().split())\r\nlist1=list(list1)\r\n\r\nres=0\r\nfor i in range(0, n, 1):\r\n if i!=0 and list1[i]<list1[i-1]:\r\n x=((list1[i-1]-list1[i])//d)+1\r\n res+=x\r\n list1[i]+=d*x\r\n elif i!=0 and list1[i]==list1[i-1]:\r\n res+=1\r\n list1[i]+=d\r\n\r\n\r\nprint(res)", "import math\r\n\r\nn,d = map(int, input().split())\r\nb = [int(i) for i in input().split()]\r\n\r\nk = 0\r\nfor i in range(n-1):\r\n if b[i] < b[i+1]:\r\n continue\r\n elif b[i] == b[i+1]:\r\n b[i+1] += d\r\n k += 1\r\n continue\r\n else:\r\n if (b[i]-b[i+1]) % d == 0:\r\n t = math.ceil((b[i]-b[i+1])/d) + 1\r\n b[i+1] += t*d\r\n k += t\r\n else:\r\n t = math.ceil((b[i] - b[i + 1]) / d)\r\n b[i+1] += t*d\r\n k += t\r\n\r\nprint(k)", "import math\r\nn,d = map(int, input().split())\r\nlista = input().split()\r\ncount = 0\r\n\r\nfor i in range(n-1):\r\n w = int(lista[i+1]) - int(lista[i])\r\n if w < 0 and w%d !=0:\r\n c = math.ceil(-w / d)\r\n lista[i+1] = int(lista[i+1]) + d*c\r\n count += c\r\n \r\n elif w < 0 and w%d ==0:\r\n c = math.ceil(-w / d)\r\n lista[i+1] = int(lista[i+1]) + d*(c+1)\r\n count += c+1\r\n \r\n elif w == 0:\r\n lista[i+1] = int(lista[i+1]) + d\r\n count += 1\r\n \r\nprint (count)", "# 获取输入的数据\r\nn, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\n\r\n# 初始化移动次数和当前最大值\r\nmoves = 0\r\nmax_val = b[0]\r\n\r\n# 遍历序列，更新最大值和移动次数\r\nfor i in range(1, n):\r\n if b[i] <= max_val:\r\n diff = (max_val - b[i]) // d + 1\r\n moves += diff\r\n max_val = b[i] + diff * d\r\n else:\r\n max_val = b[i]\r\n\r\n# 输出移动次数\r\nprint(moves)", "n,d=map(int,input().split())\r\nx=[]\r\nm=0\r\nq=0\r\nx=input().split()\r\nfor i in range(len(x)):\r\n x[i]=int(x[i])\r\nfor a in range(len(x)-1):\r\n if x[a]>=x[a+1]:\r\n q=int((x[a]-x[a+1])/d+1)\r\n m=m+q\r\n x[a+1]=x[a+1]+q*d\r\nprint(m)", "import math\r\nn,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nchecks = {}\r\nans = 0\r\nfor i in range(1,n):\r\n checks[i] = l[i-1] - l[i] + 1\r\nchecks[n] = -math.inf\r\nfor i in range(1,n):\r\n if checks[i] > 0:\r\n ans += math.ceil(checks[i]/d)\r\n checks[i+1] += d * math.ceil(checks[i]/d)\r\n\r\nprint(ans) ", "n, d = map(int,input().split())\na = [int(x) for x in input().split()]\ncount=0\nfor i in range(n):\n try:\n if(a[i] >= a[i+1]):\n x = int((a[i]-a[i+1])/d)+1\n count+=x\n a[i+1]+=x*d\n except:\n continue\nprint(count)\n\n\t \t\t \t\t\t\t \t \t\t \t \t \t", "from math import ceil\r\ndef number_of_operations():\r\n # n is the number of terms in sequence\r\n # d is the number to be added to elements in order to make increasing sequence\r\n n, d = map(int, input().strip().split())\r\n\r\n sequence = list(map(int, input().strip().split()))\r\n\r\n count = 0\r\n\r\n for term_index in range(n - 1):\r\n # if next term is smaller than previous\r\n if sequence[term_index + 1] < sequence[term_index]:\r\n # add nr of operations\r\n count += ceil((sequence[term_index] - sequence[term_index + 1]) / d)\r\n # give new value to next term\r\n sequence[term_index + 1] += ceil((sequence[term_index] - sequence[term_index + 1]) / d) * d\r\n # if next term is equal to previous\r\n if sequence[term_index + 1] == sequence[term_index]:\r\n # nr of operations is 1\r\n count += 1\r\n sequence[term_index + 1] += d\r\n return count\r\n\r\n\r\nprint(number_of_operations())", "n,d=map(int,input().split())\na=list(map(int,input().split()))\nans=0\nfor i in range(1,n):\n if a[i]<=a[i-1]:\n ans +=(a[i-1]-a[i]+d)//d\n a[i]+=((a[i-1]-a[i]+d)//d)*d\n #print(ans)\nprint(ans)\n\t\t\t\t \t \t \t \t \t \t \t\t\t\t \t\t\t", "import sys\r\nfrom os import path\r\nif(path.exists('Input.txt')):\r\n sys.stdin = open(\"Input.txt\",\"r\")\r\n sys.stdout = open(\"Output.txt\",\"w\")\r\n \r\nfrom math import gcd,floor,sqrt,log,ceil\r\nimport math\r\nfrom collections import deque\r\nread=lambda: int(input())\r\nli=lambda: list(map(int,input().split()))\r\nread2=lambda: map(int,input().split())\r\nM = 1000000007\r\nyes, no = \"YES\", \"NO\"\r\nimport operator as op\r\nfrom functools import reduce\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom\r\ndef fact(n):\r\n\treturn math.factorial(n)\r\ndef perfect(n):\r\n\treturn floor(sqrt(n))==ceil(sqrt(n))\r\ndef expo(n,x,M):\r\n\tfor i in range(1,x):\r\n\t\tn*=n\r\n\t\tn%M\r\n\treturn n\r\ndef isPrime(n):\r\n\tif (n % 2 == 0 and n != 2) or n < 2:\r\n\t return False\r\n\ti = 3\r\n\twhile i * i <= n:\r\n\t if n % i == 0:\r\n\t return False\r\n\t i += 2\r\n\treturn True\r\n\r\ndef solve():\t\t\r\n\tn,d=read2()\r\n\ta=li()\r\n\tans=0\r\n\tfor i in range(1,n):\r\n\t\tif(a[i]<=a[i-1]):\r\n\t\t\tx=a[i-1]+1\r\n\t\t\ty=ceil((x-a[i])/d)\r\n\t\t\ta[i]+=y*d\r\n\t\t\tans+=y\r\n\tprint(ans)\r\n\t\t\r\nfor _ in range(1):\r\n\tsolve()", "n,d= map(int, input().split())\r\nl= list(map(int, input().split()))\r\nx=0\r\ni=0\r\nfor i in range(n-1):\r\n if(l[i]>=l[i+1]):\r\n dif= l[i]- l[i+1]\r\n s= int(dif/d)+1\r\n l[i+1]= l[i+1]+s*d\r\n x= x+s\r\nprint(x)\r\n", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\n\r\nmoves = 0\r\nprev = b[0]\r\n\r\nfor i in range(1, n):\r\n if b[i] <= prev:\r\n diff = (prev - b[i]) // d + 1\r\n moves += diff\r\n prev = b[i] + diff * d\r\n else:\r\n prev = b[i]\r\n\r\nprint(moves)\r\n", "n,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n if s[i]-s[i+1]>=0:\r\n a=(s[i]-s[i+1])//d\r\n s[i+1]=s[i+1]+d*(((s[i]-s[i+1])//d)+1)\r\n c=c+1+a\r\nprint(c)\r\n", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1, n):\r\n if b[i] <= b[i-1]:\r\n diff = (b[i-1] - b[i]) // d + 1\r\n b[i] += diff * d\r\n count += diff\r\nprint(count)", "n,d= list(map(int,input().split()))\na=list(map(int,input().split()))\n\nq=0\nfor ii in range(1,n):\n\tr =a[ii-1]-a[ii]\n\tif r>=0:\n\t\tq+= r//d + 1\n\t\ta[ii]+= (r//d+1)*d\n\t\t\nprint(q)", "'''\r\n\r\nn = 4\r\nd = 2\r\n1\r\n3\r\n3\r\n2\r\n\r\n1\r\n3\r\n3\r\n2\r\n+ +\r\n2\r\n2\r\n--- +\r\n5\r\n2\r\n--\r\n6\r\n** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** *\r\nd=4\r\n10000 60\r\nd=2\r\n10 3\r\n'''\r\n\r\nn, d = [int(item) for item in input().split()]\r\ncont = [int(item) for item in input().split()]\r\nans = 0\r\n'''\r\nfor i in range(n - 1):\r\n if cont[i] >= cont[i + 1]:\r\n while True:\r\n cont[i + 1] += d\r\n ans += 1\r\n if cont[i + 1] > cont[i]:\r\n break\r\nprint(ans)\r\n'''\r\nfor i in range(n - 1):\r\n if cont[i] >= cont[i + 1]:\r\n # item = ((cont[i] - cont[i + 1]) / d + 1)\r\n # cont[i + 1] += d * item\r\n diff = cont[i] - cont[i + 1]\r\n needD = diff // d + 1\r\n cont[i + 1] += needD * d\r\n ans += needD\r\n\r\nprint(ans)\r\n", "n, d = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1,n):\r\n if (b[i] <= b[i-1]):\r\n ans += (((b[i-1] - b[i])//d) + 1)\r\n b[i] += d * (((b[i-1] - b[i])//d) + 1)\r\nprint (ans)", "n,m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,len(l)):\r\n\r\n\r\n if l[i-1]>=l[i]:\r\n\r\n\r\n\r\n c+=(((l[i-1]-l[i])//m))+1\r\n\r\n l[i]+= (((l[i-1]-l[i])//m)+1)*m\r\nprint(c)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(1, n):\r\n if data[i - 1] >= data[i]:\r\n tmp = (data[i - 1] - data[i] + d) // d\r\n cnt += tmp\r\n data[i] = data[i] + tmp * d\r\n\r\nprint(cnt)", "n, d = map(int, input().strip().split())\ndata = map(int, input().strip().split())\na = []\nc = 0\nfor x in data:\n a.append(x)\nfor i in range(1, n):\n if a[i] <= a[i-1]:\n j = (a[i-1] - a[i]) // d + 1\n c += j\n a[i] += j * d\nprint(c)\n", "from math import ceil\r\nn,d = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1,n):\r\n if arr[i]<=arr[i-1]:\r\n diff = abs(arr[i]-arr[i-1])+1\r\n x = ceil(diff/d)\r\n arr[i]+=(x*d)\r\n ans+=x\r\nprint(ans)", "n,d = input().split()\r\n\r\nd = int(d)\r\n\r\ndef inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return a\r\n\r\ns = input()\r\na = inp(s)\r\nc = 0\r\nfor i in range(len(a)-1):\r\n if a[i+1] > a[i]:\r\n continue\r\n else:\r\n t = a[i] - a[i+1]\r\n \r\n if t<d:\r\n a[i+1] = a[i+1] + d\r\n c = c + 1\r\n else:\r\n t = t//d + 1\r\n c = c + t\r\n a[i+1] = a[i+1] + t*d\r\nprint (c)\r\n", "if __name__ == \"__main__\":\n n, d = map(int, input().split())\n seq = list(map(int, input().split()))\n\n result = 0\n for i in range(len(seq) - 1):\n count = (seq[i] - seq[i + 1]) // d + 1\n if count > 0:\n result += count\n seq[i + 1] += d * count\n\n print(result)\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, d = map(int, input().split())\r\n b = map(int, input().split())\r\n last = next(b)\r\n moves = 0\r\n for b_i in b:\r\n if last >= b_i:\r\n count = (last - b_i) // d + 1\r\n moves += count\r\n last = b_i + count * d\r\n else:\r\n last = b_i\r\n print(moves)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "import math\nn,m=input().split()\nn,m=int(n),int(m)\ncount=0\na=list(map(int,input().split()))\nfor i in range(n-1):\n if a[i]>=a[i+1]: \n count+=math.ceil(((a[i]-a[i+1])+1)/m)\n a[i+1]+=m*math.ceil(((a[i]-a[i+1])+1)/m) \nprint(count) \n \n", "def inc_seq(arr, d):\n sum = 0\n i = 1\n while i < len(arr):\n if arr[i] < arr[i-1]:\n change = ((arr[i-1] - arr[i])//d)+1\n arr[i] += change * d\n sum += change\n elif arr[i] == arr[i-1]:\n arr[i] = arr[i-1]+d\n sum += 1\n i+=1\n return sum\n\nn,d = map(int, input().split())\narr = list(map(int, input().split()))\n\nprint(inc_seq(arr, d))", "n, d = [int(item) for item in input().split(' ')]\r\ncont = [int(item) for item in input().split(' ')]\r\nans = 0\r\n\r\nfor i in range(n - 1):\r\n if cont[i] >= cont[i + 1]:\r\n needD = int((cont[i] - cont[i + 1]) / d) + 1\r\n cont[i + 1] += needD * d\r\n ans += needD\r\n\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nresult = 0\r\nfor i in range(n-1):\r\n\tif b[i]>=b[i+1]:\r\n\t\tresult+=((b[i]-b[i+1])//d+1)\r\n\t\tb[i+1]+=(d*((b[i]-b[i+1])//d+1))\r\nprint(result)", "n,d=map(int,input().split())\r\nl1 = list(map(int, input().split()))\r\n\r\nl = l1.copy()\r\nl.reverse()\r\n\r\nc =0\r\n\r\nfor i in range(1,len(l1)):\r\n if l1[i] <= l1[i-1]:\r\n nr_ofSteps = (l1[i-1] - l1[i]) // d+1\r\n l1[i] += nr_ofSteps * d\r\n c += nr_ofSteps\r\nprint(c)\r\n", "[n, d] = map(int, input().split())\nnumlist = list(map(int, input().split()))\nans = 0\nfor i in range(n-1):\n if numlist[i] >= numlist[i+1]:\n n = (numlist[i] - numlist[i+1])//d + 1\n ans += n\n numlist[i+1] += n * d\nprint(ans)", "n, d = input().split()\nn = int(n)\nd = int(d)\na = input().split()\ncount = 0\na[0] = int(a[0])\nfor i in range(1, len(a)):\n a[i] = int(a[i])\n if a[i] <= a[i - 1]:\n count += (a[i - 1] - a[i])//d + 1\n a[i] += ((a[i - 1] - a[i])//d + 1)*d \nprint(count)\n\t\t\t \t\t \t \t \t \t\t \t \t \t", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n\tif a[i]<=a[i-1]:\r\n\t\tx=a[i-1]-a[i]\r\n\t\ta[i]+=d*(x//d+1)\r\n\t\tc+=(x//d+1)\r\nprint(c)\t\t\t\r\n\r\n\r\n", "l1 = [int(x) for x in input().split()]\r\nn,d = l1[0],l1[1]\r\nl2 = [int(x) for x in input().split()]\r\nans0=sum(l2)\r\ni=1\r\nwhile i<len(l2):\r\n difference = l2[i-1]-l2[i]\r\n if difference>0:\r\n l2[i]+=int((l2[i-1]-l2[i])/d)*d\r\n #print(int((l2[i-1]-l2[i])/d),l2[i])\r\n l2[i]+=d\r\n elif difference==0:\r\n l2[i]+=d\r\n i+=1 \r\n#print(l2)\r\n \r\n\r\nprint((sum(l2)-ans0)//d)", "from math import ceil\r\n\r\nn, d = map(int, input().split())\r\n\r\nb = list(map(int, input().split()))\r\n\r\na = 0\r\n\r\nfor i in range(1, n):\r\n\tif b[i] <= b[i - 1]:\r\n\t\tai = ceil((b[i - 1] + 1 - b[i]) / d)\r\n\t\ta += ai\r\n\t\tb[i] += ai * d \r\n\r\nprint(a)\r\n", "import math\r\n\r\nn,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\n\r\nt=0\r\nfor i in range(1,n):\r\n if b[i]<=b[i-1]:\r\n t+=1+(b[i-1]-b[i])//d\r\n b[i]+=d+d*((b[i-1]-b[i])//d)\r\n \r\nprint(t)", "# LUOGU_RID: 123912283\nnd=input().split()\r\nn,d=int(nd[0]),int(nd[1])\r\nline=[int(x) for x in input().split()]\r\nnum=0\r\nSum=0\r\nfor _ in range(n-1):\r\n if line[_]>=line[_+1]:\r\n num=int((line[_]-line[_+1])/d)+1\r\n line[_+1]+=d*num\r\n Sum+=num\r\nprint(Sum)\r\n", "n,d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1,n):\r\n if b[i] <= b[i-1]:\r\n to_increase = b[i-1] + 1 - b[i]\r\n ops = (to_increase + d - 1) // d # to_increase/d round up\r\n b[i] += d * ops\r\n ans += ops\r\nprint(ans)", "def rr(): return input().rstrip()\r\ndef rri(): return int(rr())\r\ndef rrl(): return list(map(int, rr().split()))\r\ndef rrt(): return tuple(map(int, rr().split()))\r\nfrom collections import defaultdict\r\ndef mus(d=lambda: 0): return defaultdict(lambda: defaultdict(d))\r\ndef dd0(d=lambda: 0): return defaultdict(d)\r\ndef ms(x, y, d=0): return [[0]*y for i in range(x)]\r\ndef ar(x, d=0): return [d]*x\r\ndef ppm(m, n=0, x=0, y=0): print(\"\\n\".join((\"\\t\".join((str(m[j][i]) for j in range(y or n))) for i in range(x or n))))\r\ndef ppa(a, n): print(\"\\t\".join(map(str, a[0:n])))\r\ndef ppl(a=0, x=[1]): x[0]=a or (x[0]+1); print(\"-\"+\"- -\"*14+\"-# \"+str(x[0]-2)+\" #-\"+\"- -\"*14+\"-\")\r\ndef fltn(a): (i for sub in a for i in sub)\r\ndef yn(x): return \"YES\" if x else \"NO\"\r\nfrom itertools import accumulate\r\nfrom itertools import groupby\r\ndef grp(x): return ((i, sum(1 for _ in g)) for i, g in groupby(x))\r\nimport math\r\ndef rnar(): return (*rrl(), rrl())\r\ndef rn(): return (*rrl(),)\r\ndef dpp(a, b=\"\"): print(\")#| {} |#(o) ? {} ? (\".format(a, b))\r\n\r\ndef read():\r\n return rnar()\r\n return (0,)\r\n\r\ndef solve(n, d, arr):\r\n \r\n am_of_mvs = 0\r\n for i in range(len(arr)-1):\r\n if arr[i] >= arr[i+1]:\r\n am = (arr[i] - arr[i+1])//d + 1\r\n #print(am)\r\n am_of_mvs += am\r\n arr[i+1] += d*am\r\n ans = am_of_mvs\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n #test_count = rri()\r\n test_count = 1\r\n for _ in range(test_count):\r\n input_data = read()\r\n result = solve(*input_data)\r\n print(result)\r\n", "import math\n\nn, d = tuple(map(int, input().strip().split()))\n\nc = 0\n\na = list(map(int, input().strip().split()))\n\nfor i in range(1, n):\n if a[i] > a[i-1]:\n continue\n\n moves = (a[i-1] - a[i]) // d + 1\n a[i] += moves * d\n c += moves\n\nprint(c)\n", "n, d = map(int,input().split())\r\nB = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(n-1):\r\n x = max(0, (B[i]-B[i+1])//d+1)\r\n B[i+1] += d*x\r\n k += x\r\nprint(k)", "def minimum_operations(b,n,d):\r\n number_of_operations=0\r\n for i in range(1,n):\r\n if b[i]<=b[i-1]:\r\n number_of_operations+=(b[i-1]-b[i])//d+1\r\n b[i]+=((b[i-1]-b[i])//d+1)*d\r\n return number_of_operations\r\n\r\nn,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nprint(minimum_operations(b,n,d))", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = 0;\r\nfor i in range(1, n):\r\n if a[i] <= a[i-1]:\r\n m = (a[i-1]-a[i])//d+1;\r\n cnt += m;\r\n a[i] += m*d;\r\n\r\nprint(cnt)", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\ncount = 0\r\ntemp = 0\r\nfor i in range(n-1):\r\n if arr[i+1] == arr[i]:\r\n count += 1\r\n arr[i+1] += d\r\n if arr[i+1] < arr[i]:\r\n temp = arr[i] - arr[i+1]\r\n count += (temp//d + 1)\r\n arr[i+1] += ((temp//d+1)*d)\r\n\r\nprint(count)", "import math\r\nn, d = map(int, input().split())\r\nss = input()\r\nls = [int(u) for u in ss.split()]\r\ncount = 0\r\nfor i in range(1, len(ls)):\r\n if ls[i] <= ls[i-1]:\r\n count += math.ceil((ls[i - 1]-ls[i]+1)/d)\r\n ls[i] += (d* math.ceil((ls[i - 1]-ls[i]+1)/d))\r\n#print(ls)\r\nprint(count)\r\n", "#!/usr/bin/env python3\n\nn, d = [int(j) for j in input().split(' ')]\na = [int(j) for j in input().split(' ')]\nsteps = 0\nfor i in range(n):\n if (i+1 < n):\n if a[i] >= a[i+1]:\n step = int((a[i] - a[i+1])/d) + 1\n a[i+1] += step*d\n steps += step\n else:\n continue\n else:\n break\n\nprint(steps)\n", "import math\r\n\r\nn,d=(int(x) for x in input().split())\r\na=list(int(x) for x in input().split())\r\nans=0\r\nfor i in range(1,n):\r\n diff=a[i]-a[i-1]\r\n #print(f\"a[i] is {a[i]} and a[i-1] is {a[i-1]} and diff is {diff}\")\r\n if(diff<0):\r\n diff*=-1 \r\n num=math.ceil(diff/d)\r\n #print(\"adding \",num)\r\n ans+=num\r\n a[i]+=num*d\r\n diff-=num*d\r\n if diff==0:\r\n a[i]+=d\r\n ans+=1\r\n #print(a)\r\n #print(\"\\n\")\r\n\r\nprint(ans)\r\n\r\n", "n,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nb0=b[0]\r\nm=0\r\nfor i in range(1,n):\r\n if b[i]<=b0:\r\n x=(b0-b[i])//d +1\r\n m+=x\r\n b0=b[i]+x*d\r\n else:\r\n b0=b[i]\r\nprint(m)", "a,b = map(int,input().split())\n\nd = list(map(int,input().split()))\n\ni = 0\ncount = 0\nd.append(19232931932)\nwhile( i < a ):\n if d[i] < d[i + 1]:\n i += 1\n else:\n num = ((d[i ] - d[i + 1] ) / b ) + 1\n num = int(num)\n count += num\n d[i + 1] += num * b\n i += 1\n\n\n\n\nprint(count)\n\n\n", "def main():\r\n n, d = map(int, input().split())\r\n b = list(map(int, input().split()))\r\n \r\n moves = 0\r\n x = b[0]\r\n for i in range(1, n):\r\n y = b[i]\r\n if y <= x:\r\n b[i] += d * ((x - y) // d + 1)\r\n moves += (x - y) // d + 1\r\n x = b[i]\r\n\r\n print(moves)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nl = []\r\nc = 0 \r\n\r\nn, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(n-1):\r\n\tif l[i+1]<=l[i]:\r\n\t\tc += ((l[i]-l[i+1])//d)+1\r\n\t\tl[i+1] += (((l[i]-l[i+1])//d)+1)*d\r\n\r\nprint(c)", "def readln(): return tuple(map(int, input().split()))\r\n \r\nn, d = readln()\r\nans = 0\r\nb = list(readln())\r\nfor i in range(1, n):\r\n if b[i] <= b[i - 1]:\r\n c = (b[i - 1] - b[i]) // d + 1\r\n ans += c\r\n b[i] += c * d\r\nprint(ans)", "moves = 0\r\nn,d = list(map(int,input().split()))\r\nseq = list(map(int,input().split()))\r\nfor i in range(1,len(seq)):\r\n\tif seq[i] <= seq[i-1]:\r\n\t\tstepmoves = (seq[i-1]-seq[i])//d + 1\r\n\t\tseq[i] += d*stepmoves\r\n\t\tmoves += stepmoves\r\nprint(moves)", "n,k = list(map(int, input().split(' ')))\r\nnums = list(map(int, input().split(' ')))\r\nresult = 0\r\nfor i in range(1,n):\r\n if nums[i] == nums[i-1]:\r\n result += 1\r\n nums[i] += k\r\n elif nums[i] < nums[i-1]:\r\n nk = (nums[i-1] - nums[i]) // k + 1\r\n result += nk\r\n nums[i] += nk * k\r\nprint(result)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=a[0]\r\nans=0\r\nfor i in range(1,n):\r\n if a[i-1]<a[i]:\r\n continue\r\n z=a[i-1]-a[i]\r\n k=z//d+1\r\n a[i]+=k*d\r\n ans+=k\r\nprint(ans) \r\n", "n,d=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n if l[i+1]==l[i]:\r\n c+=1\r\n l[i+1]+=d\r\n elif l[i+1]<l[i]:\r\n x=l[i]-l[i+1]\r\n c+=1+x//d\r\n l[i+1]+=d*(1+x//d)\r\n \r\n \r\nprint(c)", "import sys\r\nimport math\r\n\r\n#sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(1, len(b)):\r\n moves = math.ceil(max(0, (b[i-1]-b[i]+1))/d)\r\n b[i] += moves * d\r\n res += moves\r\n\r\nprint(res)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\ns=0\r\nfor i in range(n):\r\n if a[i]<=k:\r\n p=(k-a[i])//d+1\r\n s+=p\r\n k=a[i]+p*d\r\n else:\r\n k=a[i]\r\nprint(s)\r\n", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\n\r\nmoves = 0\r\nfor i in range(1, n):\r\n if b[i] <= b[i-1]:\r\n diff = b[i-1] - b[i]\r\n num_moves = (diff // d) + 1\r\n moves += num_moves\r\n b[i] += num_moves * d\r\n\r\nprint(moves)", "n, d = map(int, input().split())\nkol = 0\nmas = list(map(int, input().split()))\nfor i in range(1, len(mas)):\n if mas[i] <= mas[i - 1]:\n kol += (mas[i - 1] - mas[i]) // d + 1\n mas[i] += ((mas[i - 1] - mas[i]) // d + 1) * d\nprint(kol)\n", "c = str(input()).split(' ')\r\nc = [int(val) for val in c]\r\nn = c[0]\r\nd = c[-1]\r\np = str(input()).split(' ')\r\np = [int(val) for val in p]\r\ncount = 0\r\nfor i in range(n-1):\r\n if p[i] >= p[i+1]:\r\n count += (1 + (p[i] - p[i + 1])//d)\r\n p[i+1] += (1+(p[i]-p[i+1])//d)*d\r\nprint(count)\r\n", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n \r\nn,d = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nc = 0 \r\nfor i in range(1,n):\r\n ans = -1\r\n if(s[i-1]>=s[i]):\r\n k = abs(s[i-1]-s[i])\r\n ans = k//d + 1\r\n c+=ans\r\n \r\n if(ans!=-1):\r\n s[i]+=d*(ans)\r\n \r\n\r\n \r\nprint(c)\r\n", "from math import ceil\r\nn, d = map(int, input().strip().split())\r\nlst = list(map(int, input().strip().split()))\r\ncount = 0\r\nfor i in range(1, n):\r\n if (lst[i] > lst[i - 1]):\r\n continue\r\n else:\r\n count += ceil((lst[i - 1] -lst[i])/d)\r\n lst[i] += ceil((lst[i - 1] -lst[i])/d)* d\r\n if lst[i]<=lst[i-1]:\r\n lst[i]+=d\r\n count+=1\r\n # while (lst[i - 1] >= lst[i]):\r\nprint(count)\r\n", "def incr(a,b,d):\r\n c=a-b\r\n x=c//d\r\n return x+1\r\nn,d=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nc=0\r\nfor i in range(1,n):\r\n\r\n if l[i-1]>=l[i]:\r\n k=incr(l[i-1],l[i],d)\r\n c+=k\r\n l[i] = l[i]+k*d\r\nprint(c)", "n,d = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\na,b = 0,0\r\nfor i in arr:\r\n if i<=a:\r\n cnt = (a+d-i)//d\r\n b+=cnt\r\n i+=cnt*d\r\n a=i\r\nprint(b)", "\"\"\"\nd = 2\n1 3 3 2\n1 3 (3 + 2 * 1) (2 + 2 * 1)\n\"\"\"\n\n\nn, d = map(int, input().split())\nb = list(map(int, input().split()))\n\ncounter = 0\nfor i in range(1, len(b)):\n diff = b[i] - b[i-1]\n if diff <= 0:\n moves = abs(diff) // d + 1\n counter += moves\n b[i] += moves * d\nprint(counter)\n", "n,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,len(b)):\r\n if b[i-1]>b[i]:\r\n tmp=b[i-1]-b[i]\r\n tmp1=tmp//d\r\n b[i]+=d*(tmp1+1)\r\n c+=tmp1+1\r\n elif b[i-1]==b[i]:\r\n b[i]+=d\r\n c+=1\r\nprint(c)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n):\r\n x = max(b[i - 1] - b[i] + 1, 0)\r\n c = x // d + min(x % d, 1)\r\n ans += c\r\n b[i] += c * d\r\nprint(ans)", "import math\r\n\r\nd = int(input().split(' ')[1])\r\nx = [int(i) for i in input().split(' ')]\r\nmoves = 0\r\nfor i in range(1,len(x)):\r\n if (x[i] <= x[i-1]):\r\n q = math.floor((x[i-1]-x[i])/d)+1\r\n x[i] += q*d\r\n moves += q\r\nprint(moves)\r\n \r\n", "from math import ceil\r\nlena, d = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nresult = 0\r\nfor i in range(1, lena):\r\n if arr[i-1] >= arr[i]:\r\n difference = arr[i-1]-arr[i]+1\r\n d_add = ceil(difference/d)\r\n arr[i] += d_add*d\r\n result += d_add\r\nprint(result)\r\n", "import itertools\r\nimport math\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\n#n = int(input())\r\n\r\nn, d = map(int, input().split(' '))\r\narray = list(map(int, input().split(' ')))\r\ntotal = 0\r\nfor i in range(1, len(array)):\r\n if array[i]<=array[i-1]:\r\n dif = array[i-1]-array[i]+1\r\n q = math.ceil(dif/d)\r\n array[i]+=d*q\r\n total+=q\r\nprint(total)", "n,d = map(int,input().split())\r\n\r\ns = list(map(int,input().split()))\r\nss = []\r\nfor i in range(n-1):\r\n if s[i] >= s[i+1]:\r\n k = (s[i] - s[i+1]) // d\r\n ss.append((k+1)*d)\r\n s[i+1] = s[i+1]+(k+1)*d\r\n else:\r\n continue\r\n \r\n \r\nprint(int(sum(ss)/d))", "k,d=map(int,input().split())\na=list(map(int,input().split()));answer=0;\nfor i in range(1,k):\n\tif a[i]<=a[i-1]:\n\t\tanswer+=(a[i-1]-a[i])//d+1;\n\t\ta[i]+=d*((a[i-1]-a[i])//d+1)\nprint(answer)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nu = 0\r\nd = 0\r\nf = 0\r\nh = [c[0]]\r\nfor i in c:\r\n if d>0:\r\n if u>=i:\r\n f+=(((u-i)//b)+1)\r\n u = i+((((u-i)//b)+1)*b)\r\n h.append(u)\r\n else:\r\n u=i\r\n h.append(u)\r\n u = h[d]\r\n d+=1\r\nprint(f)", "def main():\n n, d = map(int, input().split())\n a = res = 0\n for b in map(int, input().split()):\n if a >= b:\n t = (a - b + d) // d\n res += t\n b += t * d\n a = b\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "#! /usr/bin/env python3\n\nimport itertools\nimport sys\n\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n d, sequence = parse(data)\n output = calc_increase(d, sequence)\n print(output)\n\n\ndef parse(data):\n _, d = tuple(int(s) for s in data[0].split())\n sequence = tuple(int(s) for s in data[1].split())\n return d, sequence\n\n\ndef calc_increase(d, sequence):\n moves = 0\n cur = sequence[0]\n for num in sequence[1:]:\n if num <= cur:\n increases = (cur - num + d) // d\n num += increases * d\n moves += increases\n cur = num\n return moves\n \n\nif __name__ == '__main__':\n main()\n", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\noperations = 0\r\n\r\nfor i in range(1, len(arr)):\r\n diff = arr[i-1] - arr[i]\r\n if diff >= 0:\r\n d_multiples = 1 + diff//d\r\n arr[i] += d*d_multiples\r\n operations += d_multiples\r\n\r\nprint(operations)\r\n", "n, d = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\np = b[0]\nans = 0\nfor i in range(1, n):\n\tif b[i] <= p:\n\t\tdist = p - b[i]\n\t\tans += dist // d + 1\n\t\tb[i] += (dist // d + 1) * d\n\tp = b[i]\nprint(ans)\n", "def main():\r\n n, d = map(int, input().split())\r\n b = [int(c) for c in input().split()]\r\n b.append(float('infinity'))\r\n res = 0\r\n for i in range(len(b) - 1):\r\n curr, prev = b[i+1], b[i]\r\n if curr <= prev:\r\n curr_diff = curr - prev\r\n target_diff = 1\r\n div, mod = divmod(target_diff - curr_diff, d)\r\n moves = div if mod == 0 else div + 1\r\n res += moves\r\n b[i+1] += moves * d\r\n\r\n print(res)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nm = 0\nfor i in range(1, n):\n if a[i] <= a[i-1]:\n x = (a[i-1] - a[i]) // d + 1\n a[i] += x * d\n m += x\n\nprint(m)\n\n\t\t \t \t \t\t \t\t\t\t\t \t \t \t\t\t\t\t\t\t", "import sys\nfrom math import ceil\nimport logging\nlogging.root.setLevel(logging.INFO)\n\nn,k = map(int,sys.stdin.readline().strip().split())\nnums = list(map(int,sys.stdin.readline().strip().split()))\ndeltas = []\ntimes = 0\nfor i in range(1,len(nums)):\n if nums[i-1] >= nums[i]:\n delta = ceil((nums[i-1]+1 - nums[i])/k)\n times += delta\n nums[i] += delta*k\n \nprint(times)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=0\r\ne=0\r\nfor i in range(n) :\r\n if e<l[i] :\r\n e=l[i]\r\n else :\r\n r=(e-l[i])//d+1\r\n k+=r\r\n e=l[i]+d*r\r\n \r\nprint(k)\r\n", "\"\"\"\ncodeforces increasing sequence 11A \n\"\"\"\n\n\na, b = [int(x) for x in input().split()]\nseq = [int(x) for x in input().split()]\n\nmini = 0\n\nif len(seq)>1:\n for i in range(len(seq) - 1):\n if seq[i + 1] <= seq[i]:\n v = (seq[i] - seq[i + 1]) // b + 1\n seq[i + 1] += v * b\n mini += v\n\nprint(mini)\n", "length , increase = list(map(int,input().split()))\r\ncost = 0\r\nnums = list(map(int,input().split()))\r\nfor index in range(1 , length) :\r\n if nums[index - 1] >= nums[index] :\r\n value = nums[index - 1] - nums[index] + 1\r\n count = (value // increase) + 1 if value % increase != 0 else (value // increase)\r\n nums[index] += increase * count \r\n cost += count\r\nprint(cost) ", "\"\"\"n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(len(l)-1):\r\n if(l[i+1]<=l[i]):\r\n l[i+1]+=d\r\n c+=1\r\nprint(c)\"\"\"\r\n\r\nfrom math import ceil\r\nn,d = map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\n\r\nfor i in range(1,n):\r\n if a[i-1] >= a[i]:\r\n w = a[i-1] - a[i]\r\n a[i]+= ceil( (w+1)/d )*d\r\n ans+=ceil( (w+1)/d )\r\nprint(ans)\r\n", "def increasing (b,d):\n m = 0\n for x in range(1,len(b)):\n if b[x] <= b[x-1] :\n dif = b[x-1] - b[x]\n if dif == 0:\n m += 1\n b[x] += d\n else:\n m += dif//d + 1\n b[x] += d*((dif//d)+1)\n \n return m\n\nn,d = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\nprint (increasing(b,d))\n", "n, d = map(int, input().split())\nv = list(map(int, input().split()))\nm = v[0]\nx = 0\nfor i in v:\n if i >= m:\n m = max(m + 1, i + 1)\n else:\n w = 0 - (- (m - i) // d)\n x += w\n m = i + (w * d) + 1\nprint(x)\n", "n,d=[int(x) for x in input().split(\" \")]\r\nl=[int(x) for x in input().split(\" \")]\r\nm=0\r\nfor i in range(1,len(l)):\r\n if l[i]<=l[i-1]:\r\n a=l[i-1]-l[i]+1\r\n if a%d==0:\r\n m+=a//d\r\n l[i]+=a\r\n else:\r\n m+=(a//d)+1\r\n l[i]+=d*((a//d)+1)\r\nprint(m) ", "n,d = map(int,input().split())\narr = list(map(int,input().split()))\npre = arr[0]\nans = 0\nfor i in range(1,n):\n if arr[i]>arr[i-1]:\n continue\n a= (arr[i-1]-arr[i])//d +1\n arr[i] += a*d\n ans+=a\nprint(ans) \n \n \n ", "n, d = map(int,input().split())\r\nb = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(n-1):\r\n x = max(0, (b[i]-b[i+1])//d+1)\r\n b[i+1] += d*x\r\n k += x\r\nprint(k)", "n, d = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\n\r\nmoves = 0\r\nfor i in range(1, n):\r\n if sequence[i] <= sequence[i - 1]:\r\n diff = sequence[i - 1] - sequence[i]\r\n moves += diff // d + 1\r\n sequence[i] += (diff // d + 1) * d\r\n\r\nprint(moves)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,len(c)):\r\n if c[i]<=c[i-1]:\r\n k=(c[i-1]-c[i])//b\r\n k+=1\r\n c[i]+=b*k\r\n count+=k\r\n k=0\r\nprint(count) \r\n \r\n", "n,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1, n):\r\n if b[i] <= b[i - 1]:\r\n x = (b[i - 1] - b[i]) // d + 1\r\n b[i] += x * d\r\n count += x\r\n \r\nprint(count) \r\n\r\n\r\n", "n, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nres, prev = 0, lst[0]\r\nfor b in lst[1:]:\r\n if b <= prev:\r\n tms = -((b - prev - 1)//d)\r\n prev = b + d * tms\r\n res += tms\r\n else:\r\n prev = b\r\nprint(res)", "n,d = [int(i) for i in input().split()]\nmas = [int(i) for i in input().split()]\nans = 0\nfor i in range(1,n):\n if mas[i]<=mas[i-1]:\n ans1=(mas[i-1]-mas[i])//d +1\n ans+=ans1\n mas[i]+=ans1*d\nprint(ans)", "n,d=map(int,input().split())\r\nb=[int(x) for x in input().split()]\r\n\r\ns=0\r\n\r\nfor i in range(1,n):\r\n if b[i] <= b[i-1]:\r\n s += (1-((b[i-1]-b[i])/d)%1)+(b[i-1]-b[i])/d\r\n b[i] += int(((1-((b[i-1]-b[i])/d)%1)+(b[i-1]-b[i])/d)*d)\r\n \r\n\r\nprint(int(s))\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor x in range(n-1):\r\n\tif l[x+1]<l[x]:\r\n\t\tq=abs(l[x+1]-l[x])//k \r\n\t\tcount+=(q)\r\n\t\tl[x+1]+=k*q\r\n\t\tif l[x+1]<=l[x]:\r\n\t\t\tl[x+1]+=k\r\n\t\t\tcount+=1\r\n\telif l[x+1]==l[x]:\r\n\t\tl[x+1]+=k\r\n\t\tcount+=1\r\nprint(count)", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(0,n-1):\r\n\tif arr[i+1]>arr[i]:\r\n\t\tcontinue \r\n\telse:\r\n\t\tx = arr[i]-arr[i+1]\r\n\t\ty = x//d\r\n\t\tz = x%d \r\n\t\tans+=(y+1)\r\n\t\tarr[i+1] += ((y+1)*d)\r\nprint(ans)", "Vxod = \"\"\"\r\n4 2\r\n1 3 3 2\r\n\"\"\"[1:-1].split(\"\\n\")\r\n\r\ndef Gen():\r\n for i in Vxod: yield i\r\nGen = Gen()\r\n#def input():\r\n# return next(Gen)\r\n\r\nN, d = map(int, input().split())\r\nArr = list(map(int, input().split()))\r\nPred = 0\r\nRes = 0\r\nfor i in range(N):\r\n item = Arr[i]\r\n #print(Arr)\r\n if Pred >= item:\r\n Add = Pred - item + 1\r\n ND = (Add + d - 1) // d\r\n Res += ND\r\n item = Arr[i] = Arr[i] + ND * d\r\n #print(Pred, item, \"|\", Add, ND)\r\n Pred = item\r\n#print(Arr)\r\nprint(Res)", "import math\r\nn, k = map(int, input().split(' '))\r\narr = list(map(int, input().split(' ')))\r\nprev = arr[0]\r\nans = 0\r\nfor j in range(1,n):\r\n if arr[j] > arr[j-1]: continue\r\n steps = math.ceil((arr[j-1] + 1 - arr[j]) / k)\r\n arr[j] += steps * k\r\n ans += steps\r\nprint(ans)", "import math\r\n\r\nn, d = map(int, input().split())\r\ndaf = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nfor i in range(n-1):\r\n if daf[i] < daf[i+1]:\r\n continue\r\n sel = daf[i] - daf[i+1]\r\n kali = math.ceil((sel + 1) / d)\r\n daf[i+1] += kali*d\r\n total += kali\r\n\r\nprint(total)\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor q in range(1,n):\r\n r=a[q-1]-a[q]\r\n if(r>=0):\r\n s+=r//d+1\r\n a[q]+=(r//d+1)*d\r\nprint(s)", "# your code goes here\nn,d = map(int,input().split())\na = list(map(int,input().split()))\nans=0\nfor i in range(1,len(a)):\n\tif a[i] <= a[i-1]:\n\t\ttemp = (a[i-1] - a[i])//d + 1\n\t\tans = ans + temp\n\t\ta[i] = a[i] + temp*d\nprint(ans)\n \t\t \t \t \t \t\t\t\t\t \t\t\t\t \t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(1, n):\r\n if b[i] <= b[i - 1]:\r\n t = (b[i - 1] - b[i] + d) // d \r\n res += t\r\n b[i] += d * t\r\nprint(res)", "import math\r\nn, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n):\r\n if b[i] <= b[i - 1]:\r\n cnt = math.ceil((b[i - 1] - b[i] + 1) / d)\r\n b[i] += cnt * d\r\n ans += cnt\r\nprint(ans)", "from math import ceil\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n\tif l[i]>=l[i+1]:\r\n\t\tk=abs(l[i]-l[i+1])+1\r\n\t\ta=ceil(k/d)\r\n\t\tl[i+1]+=a*d\r\n\t\tc+=a\r\nprint(c)", "n,d=map(int,input().split())\r\n*r,=map(int,input().split());oper=0\r\nfor i in range(n-1):oper+=max(0,-((r[i+1]-r[i]-1)//d));r[i+1]+=d*max(0,-((r[i+1]-r[i]-1)//d))\r\nprint(oper)", "def inc_seq(arr,d):\r\n count = 0\r\n for i in range(1,len(arr)):\r\n if arr[i]<=arr[i-1]:\r\n k = arr[i-1]-arr[i]\r\n div = (k//d)+1\r\n arr[i]+=d*div\r\n count+=div\r\n return count\r\n \r\nnd = input().split()\r\nn = int(nd[0])\r\nd = int(nd[1])\r\narr = list(map(int,input().split()))\r\nprint(inc_seq(arr,d))", "n, d = map(int, input().split())\r\ns, t = 0, list(map(int, input().split()))\r\nfor i in range(1, n):\r\n if t[i] > t[i - 1]: continue\r\n k = (t[i - 1] - t[i]) // d + 1\r\n s += k\r\n t[i] += k * d\r\nprint(s)", "from math import ceil\r\nfor Pythonic__Python in range(1):\r\n n,d=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n c,k=0,0\r\n for i in range(n-1):\r\n if a[i]<a[i+1]:\r\n None\r\n else:\r\n k=ceil((a[i]+1-a[i+1])/d)\r\n c+=k\r\n a[i+1]+=k*d\r\n print(c)\r\n ", "import sys\r\n\r\nn,s = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\no = 0\r\nfor i in range(n-1):\r\n if(a[i] >= a[i+1]):\r\n o += (a[i]-a[i+1])//s+1\r\n a[i+1] += ((a[i]-a[i+1])//s+1)*s\r\n \r\nprint(o)\r\n \r\n\r\n", "#import sys\r\n#sys.stdin = open(\"test.in\",\"r\")\r\nN, d = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nmoves = 0\r\nfor i in range (1,N,1):\r\n if sequence[i]<=sequence[i-1]:\r\n diff = sequence[i-1]-sequence[i]\r\n num = diff//d+1\r\n sequence[i] += d*num\r\n moves += num\r\n #print(num)\r\nprint(moves)\r\n", "n,d = map(int, input().split())\narr = list(map(int, input().split()))\n\nops = 0\nfor i in range(1,n):\n if arr[i] <= arr[i-1]:\n increase = arr[i-1] - arr[i]\n p = (increase//d)+1\n arr[i] += d*p\n ops += p\nprint(ops)\n\t \t\t \t \t \t \t \t \t \t \t\t\t \t\t", "#link : https://codeforces.com/problemset/problem/621/A\r\n#author : Mohamed Ibrahim\r\nn,d = map(int,input().split())\r\ncnt = x = 0\r\nlst = list(map(int,input().split()))\r\nfor i in range(1,len(lst)):\r\n if lst[i]<=lst[i-1]:\r\n x = lst[i-1] - lst[i]\r\n lst[i]+= (((x//d)+1)*d)\r\n cnt+=(x//d)+1\r\nprint(cnt)", "n,k=map(int,input().split())\r\nl=[int(c) for c in input().split()]\r\ns=0\r\nfor i in range(1,n):\r\n if l[i-1]==l[i]:\r\n s+=1\r\n l[i]+=k\r\n elif l[i-1]>l[i]:\r\n s+=(l[i-1]-l[i])//k+1\r\n l[i]+=k*((l[i-1]-l[i])//k+1)\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=0\r\nfor i in range(1,n):\r\n if a[i]>a[i-1]:\r\n continue\r\n t=a[i-1]-a[i]\r\n if t%m==0:\r\n r+=((t//m)+1)\r\n a[i]+=(((t//m)+1))*m\r\n else:\r\n r+=(t//m)+1\r\n a[i]+=(((t//m)+1))*m\r\nprint(int(r))\r\n", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\nprev=0\r\ncnt=0\r\ni=0\r\nwhile i<(a):\r\n if prev>=n[i]:\r\n diff=prev-n[i]\r\n cnt=cnt+diff//b\r\n n[i]=n[i]+b*(diff//b)\r\n while prev>=n[i]:\r\n n[i]=n[i]+b\r\n cnt=cnt+1\r\n prev=n[i]\r\n i=i+1\r\n else:\r\n prev=n[i]\r\n i=i+1\r\nprint(cnt)", "n, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nadditions = 0\r\n\r\nfor i in range(len(lst)-1):\r\n while lst[i + 1] <= lst[i]:\r\n difference = abs(lst[i+1]-lst[i])\r\n temp = (difference // d) + 1\r\n lst[i + 1] += temp * d\r\n additions += temp\r\nprint(additions)", "n=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ncount=0\r\ndiff=0\r\nfor i in range(1,n[0]):\r\n if x[i]<=x[i-1]:\r\n diff=x[i-1]-x[i]\r\n if diff<n[1]-1:\r\n count+=1\r\n x[i]+=n[1]\r\n else:\r\n new=diff//n[1]\r\n count+=(new+1)\r\n x[i]+=n[1]*(new+1)\r\n \r\n# print(x)\r\nprint(count)", "n,d=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\nc=0\r\nfor i in range(1,n):\r\n if a[i-1]>=a[i]:\r\n x=(a[i-1]-a[i])//d+1\r\n a[i]+=d*x\r\n c+=x\r\nprint(c)", "n, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nf_ind = a[0]\r\ncount = 0\r\n\r\nfor i in range(1, n):\r\n\tsec_ind = a[i]\r\n\tif (sec_ind <= f_ind):\r\n\t\ta[i] += d * ((f_ind - sec_ind) // d + 1)\r\n\t\tcount += (f_ind - sec_ind) // d + 1\r\n\tf_ind = a[i]\r\n\r\nprint(count)", "n, d = map(int, input().split())\nsequence = list(map(int, input().split()))\ntotal = 0\n\nfor num in range(n - 1):\n s = sequence[num] - sequence[num + 1]\n if s >= 0:\n x = (s // d) + 1\n sequence[num + 1] += d * x\n total += x\n\nprint(total)\n", "'''Author- Akshit Monga'''\r\nimport math\r\nn,d=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\ns=arr[0]\r\nans=0\r\nfor i in arr[1:]:\r\n val=0\r\n if i<=s:\r\n val+=math.floor((s-i)/d+1)\r\n ans+=val\r\n s=i+(val*d)\r\nprint(ans)", "val = input().split()\r\ncln = input().split()\r\n\r\nans = 0\r\ntmp = 0\r\n\r\nfor x in range(0,len(cln)):\r\n\txl = int(cln[x])\r\n\tif(xl <= tmp):\r\n\t\tn = tmp - xl\r\n\t\tn = n // int(val[1])\r\n\t\tn = n + 1\r\n\t\tans = ans + n\r\n\t\txl = xl + (n * int(val[1]))\r\n\t\t\t\r\n\ttmp = xl\r\n\r\nprint(ans)", "[n,d]=[int(x) for x in input().split()];\r\nb=[int(x) for x in input().split()];\r\n\r\nans=0;\r\nfor i in range(1,n):\r\n if b[i]<=b[i-1]:\r\n add=((b[i-1]-b[i])//d)+1;\r\n b[i]+=add*d;\r\n ans+=add;\r\n\r\nprint(ans);\r\n \r\n\r\n", "n,d=map(int,input().split())\r\nA=list(map(int,input().split()))\r\n\r\nANS=0\r\nfor i in range(1,n):\r\n if A[i]<=A[i-1]:\r\n k=(A[i-1]+1+d-1-A[i])//d\r\n ANS+=k\r\n A[i]+=k*d\r\n\r\nprint(ANS)\r\n", "def readln(): return tuple(map(int, input().split()))\n\nn, d = readln()\nans = 0\nb = list(readln())\nfor i in range(1, n):\n if b[i] <= b[i - 1]:\n c = (b[i - 1] - b[i]) // d + 1\n ans += c\n b[i] += c * d\nprint(ans)\n", "a,b=map(int,input().split())\nr=list(map(int,input().split()))\nc=0\nfor i in range(1,a):\n if r[i]<=r[i-1]:\n c+=abs(r[i]-r[i-1])//b+1\n r[i]+=(abs(r[i]-r[i-1])//b+1)*b\nprint(c)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=l[0]\r\nc=0\r\nimport math\r\nfor i in l[1:]:\r\n if f<i:\r\n f=i\r\n continue\r\n s=abs(f-i)+1\r\n p=math.ceil(s/d)\r\n c+=p\r\n \r\n\r\n f=i+(p*d)\r\nprint(c)\r\n \r\n \r\n\r\n", "n,m=map(int,input().split())\r\nentries=[int(i) for i in input().split()]\r\nsteps=0\r\nfor moves in range(1,n):\r\n\tif entries[moves]<=entries[moves-1]:\r\n\t\tsteps+=(entries[moves-1]-entries[moves])//m+1;\r\n\t\tentries[moves]+=m*((entries[moves-1]-entries[moves])//m+1)\r\nprint(steps)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ni=1\r\ncount=0\r\nwhile i<a:\r\n while c[i]<=c[i-1]:\r\n h=abs(c[i]-c[i-1])\r\n if h%b!=0 or h==0:\r\n k=h//b+1\r\n else:\r\n k=h//b\r\n count+=k\r\n c[i]+=b*k\r\n i+=1\r\nprint(count)\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "def q11a():\n\tn, d = tuple([int(num) for num in input().split()])\n\tnum_list = [int(num) for num in input().split()]\n\tcount = 0\n\tfor i in range(1, len(num_list)):\n\t\tif(num_list[i] <= num_list[i-1]):\n\t\t\tmultiple = (num_list[i-1] - num_list[i])//d + 1\n\t\t\tcount += multiple\n\t\t\tnum_list[i] += d * multiple\n\tprint(count)\n\nq11a()", "def solve():\r\n n,d=map(int,input().split());a=list(map(int,input().split()));c=0\r\n for i in range(1,n):\r\n if a[i]>a[i-1]:continue\r\n w=((a[i-1]-a[i]+1)+(d-1))//d;c+=w;a[i]=a[i]+(w*d)\r\n print(c)\r\nsolve()", "n, d = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in range(1, n):\r\n s = (a[i - 1] - a[i])\r\n if s < 0:\r\n continue\r\n n = s // d + 1\r\n k += n\r\n a[i] += n * d\r\nprint(k)\r\n", "# author: violist\n# created: 14.04.2021 15:41:42\nimport sys\ninput = sys.stdin.readline\n\nn, d = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nans = 0\nfor i in range(1, n):\n if a[i] <= a[i - 1]:\n ans += (a[i - 1] - a[i]) // d + 1\n a[i] += d * ((a[i - 1] - a[i]) // d + 1)\nprint(ans)\n", "import math\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntrack, ans = [], 0\r\nfor i in range(len(arr)-1):\r\n if arr[i] >= arr[i+1]:\r\n diff = arr[i] - arr[i+1]\r\n if diff == 0:\r\n arr[i+1] += k\r\n ans += 1\r\n else:\r\n if diff % k == 0:\r\n base = diff // k\r\n arr[i+1] += k * (base + 1)\r\n ans += base + 1\r\n else:\r\n arr[i+1] += math.ceil(diff/k) * k\r\n ans += math.ceil(diff/k)\r\nprint(ans)\r\n\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()));ans=0;\r\nfor i in range(1,n):\r\n\tif a[i]<=a[i-1]:\r\n\t\tans+=(a[i-1]-a[i])//d+1;\r\n\t\ta[i]+=d*((a[i-1]-a[i])//d+1)\r\nprint(ans)\r\n", "n, d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nk=0\r\nfor i in range(1,n):\r\n if arr[i]<=arr[i-1]:\r\n k+=(arr[i-1]-arr[i])//d + 1\r\n arr[i]+=d*((arr[i-1]-arr[i])//d + 1)\r\nprint(k)", "n, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nmoves = 0\r\nfor i in range(1, len(lst)):\r\n if lst[i] <= lst[i - 1]:\r\n x = (lst[i - 1] - lst[i]) // d + 1\r\n lst[i] += x * d\r\n moves += x\r\nprint(moves)\r\n", "info = input().split()\r\nlistlen = int(info[0])\r\naddnum = int(info[1])\r\naddtimes = 0\r\n\r\nlist = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, listlen):\r\n if list[i-1] - list[i] < 0:\r\n continue\r\n addtimes += (list[i-1] - list[i] + addnum) // addnum\r\n list[i] += addnum * ((list[i-1] - list[i] + addnum) // addnum)\r\n\r\nprint(addtimes)\r\n", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\ncnt = 0\r\n\r\nfor i in range(1 , n ):\r\n if arr[i] <= arr[i - 1]:\r\n cnt += (arr[i - 1] - arr[i]) // d + 1\r\n arr[i] += d * ((arr[i - 1] - arr[i]) // d + 1 )\r\n\r\nprint(cnt)\r\n\r\n", "n, user = map(int, input().split())\r\nsequence = list(map(int, input().split())) \r\nmoves = 0\r\n\r\nfor i in range(1, len(sequence)):\r\n # if current element is bigger than previous\r\n if sequence[i] <= sequence[i - 1]:\r\n # times to be added \r\n times = (sequence[i - 1] - sequence[i]) // user + 1\r\n sequence[i] += times * user\r\n # add up moves \r\n moves += times\r\n\t\t\r\nprint(moves)", "# ____ _ _ _ _ _ \r\n# / ___| __ _ _ __ __ _ | | | | __ _ _ __ ___| |__ (_) |_ \r\n# | | _ / _` | '__/ _` |_____| |_| |/ _` | '__/ __| '_ \\| | __|\r\n# | |_| | (_| | | | (_| |_____| _ | (_| | | \\__ \\ | | | | |_ \r\n# \\____|\\__,_|_| \\__, | |_| |_|\\__,_|_| |___/_| |_|_|\\__|\r\n# |___/ \r\n\r\nfrom typing import Counter\r\nimport sys\r\nfrom collections import defaultdict as dd\r\nfrom math import *\r\n\r\ndef vinp():\r\n return map(int,input().split())\r\ndef linp():\r\n return list(map(int,input().split()))\r\ndef sinp():\r\n return input()\r\ndef inp():\r\n return int(input())\r\ndef mod(f):\r\n return f % 1000000007\r\ndef pr(*x):\r\n print(*x)\r\ndef finp():\r\n f=open(\"input.txt\",\"r\")\r\n f=f.read().split(\"\\n\")\r\n return f\r\ndef finp():\r\n f=open(\"input.txt\",\"r\")\r\n f=f.read().split(\"\\n\")\r\n return f\r\ndef fout():\r\n return open(\"output.txt\",\"w\")\r\ndef fpr(f,x):\r\n f.write(x+\"\\n\")\r\ndef csort(c):\r\n sorted(c.items(), key=lambda pair: pair[1], reverse=True)\r\ndef indc(l,n):\r\n c={}\r\n for i in range(n):\r\n c[l[i]]=c.get(l[i],[])+[i+1]\r\n return c\r\n\r\nif __name__ ==\"__main__\":\r\n a,b=vinp()\r\n l=linp()\r\n ans = 0\r\n for i in range(1,a):\r\n if l[i] <= l[i-1]:\r\n temp = (l[i-1] - l[i] + b)//b\r\n l[i] = l[i] + temp*b\r\n ans += temp\r\n pr(ans)", "n, d = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\np = b[0]\r\nans = 0\r\nfor i in range(1, n):\r\n\tif b[i] <= p:\r\n\t\tdist = p - b[i]\r\n\t\tans += dist // d + 1\r\n\t\tb[i] += (dist // d + 1) * d\r\n\tp = b[i]\r\nprint(ans)", "buffer = [int(x) for x in input().split(' ')]\r\nt = buffer[0]\r\nd = buffer[1]\r\nres =0\r\narr = [int(x) for x in input().split(' ')]\r\nfor i in range(1,t):\r\n if(arr[i-1]>=arr[i]):\r\n t = ((arr[i-1]-arr[i])//d)+1\r\n arr[i]+= t*d\r\n res+=t\r\nprint(res)\r\n", "from math import ceil\r\nm,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in range(m-1):\r\n\twhile l[i]>=l[i+1]:\r\n\t\tb=l[i]-l[i+1]\r\n\t\tl[i+1]+=ceil((b+1)/n)*n\r\n\t\ta+=ceil((b+1)/n)\r\nprint(a)\t\r\n", "n, k = map(int, input().split())\r\nara = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(1, n):\r\n if ara[i-1] < ara[i]: continue\r\n nMoves = (ara[i-1]-ara[i]+k)//k\r\n ara[i] += nMoves*k\r\n ans += nMoves\r\n\r\nprint(ans)", "import math\r\ndef getNrOfOperations():\r\n #n is the number of terms in sequence\r\n #d is the number to be added to elements in order to make increasing sequence\r\n n,d =map(int,input().strip().split())\r\n\r\n #get the sequence from input and make it to be a list\r\n sequence = list(map(int,input().strip().split()))\r\n\r\n count = 0\r\n\r\n for termIndex in range(n-1):\r\n # if next term is smaller than previous\r\n if sequence[termIndex+1] < sequence[termIndex]:\r\n #add nr of operations \r\n count += math.ceil((sequence[termIndex]-sequence[termIndex+1])/d)\r\n #give new value to next term\r\n sequence[termIndex+1] += math.ceil((sequence[termIndex]-sequence[termIndex+1])/d)*d\r\n # if next term is equal to previous\r\n if sequence[termIndex+1] == sequence[termIndex]:\r\n #nr of operations is 1\r\n count += 1\r\n sequence[termIndex+1] += d\r\n return count \r\nprint(getNrOfOperations())", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nc=0\r\nfor j in range(1,n):\r\n\tif x[j]>x[j-1]:\r\n\t\tpass\r\n\telse:\r\n\t\ta=x[j-1]+1-x[j]\r\n\t\tif a%d==0:\r\n\t\t\tc+=a//d\r\n\t\t\tx[j]=x[j]+a\r\n\t\telse:\r\n\t\t\tb=(a//d)+1\r\n\t\t\tc+=b\r\n\t\t\tx[j]=x[j]+b*d\r\nprint(c)\r\n\t\t", "n,d=map(int,input().split())\na=list(map(int,input().split()))\nl=0\nfor i in range(len(a)-1):\n if(a[i]-a[i+1]>=0):\n l+=(a[i]-a[i+1])//d+1\n a[i+1]+=d*((a[i]-a[i+1])//d+1)\nprint(l)\n", "# A. Increasing Sequence\r\n\r\nfrom math import floor\r\n\r\nn,d = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nmove = 0\r\nfor i in range(n):\r\n if i<n-1:\r\n x = a[i]-a[i+1]\r\n if x>=0:\r\n move += floor(x/d)+1\r\n# print(move,ceil(x/d))\r\n a[i+1] += d*(floor(x/d)+1)\r\nprint(move)\r\n \r\n ", "n, d = map(int, input().split())\n\nnumMinMovimentos = 0\nnAnterior = 0\n\nelementos = list(map(int, input().split()))\n\nfor i in range(n):\n nAtual = elementos[i]\n \n if nAnterior >= nAtual:\n passosParaAdd = (nAnterior - nAtual + 1) // d\n passosParaAdd += 0 if (nAnterior - nAtual + 1) % d == 0 else 1\n\n nAtual = nAtual + passosParaAdd * d\n numMinMovimentos += passosParaAdd\n \n nAnterior = nAtual\n\nprint(numMinMovimentos)\n\n \t \t\t\t \t\t\t\t \t \t \t\t\t\t\t\t \t\t\t", "n=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nprevval,nextval='',''\r\ncurrentmove,totalmove=0,0\r\nfor index,value in enumerate(d):\r\n if index != len(d) - 1:\r\n nextval = d[index + 1]\r\n if index != 0:\r\n prevval=d[index-1]\r\n if value<=prevval:#or (value<=nextval and index != len(d) - 1):\r\n currentmove = abs(int((prevval - value) / n[1])) + 1\r\n totalmove=totalmove+currentmove\r\n d[index]=(value if value < prevval else prevval) +(currentmove*n[1])\r\n #print(currentmove, totalmove,d[index])\r\nprint(totalmove)", "from math import *\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n if(l[i]>l[i+1]):\r\n d=abs(l[i+1]-l[i])+1\r\n x=ceil(d/k)\r\n c=c+x\r\n l[i+1]=l[i+1]+(x*k)\r\n elif(l[i]==l[i+1]):\r\n c+=1\r\n l[i+1]=l[i]+k\r\nprint(c)\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(n-1):\r\n if a[i]>=a[i+1]:\r\n k=a[i]-a[i+1]+1\r\n if k%d==0:\r\n a[i+1]+=k\r\n res+=k//d\r\n else:\r\n a[i+1]+=d*(k//d+1)\r\n res+=k//d+1\r\nprint(res)\r\n\r\n\r\n\r\n", "import math\r\nn,d=[int(v) for v in input().split()]\r\nsussy=0\r\na=[int(v) for v in input().split()]\r\nfor i in range(n-1):\r\n if a[i]>=a[i+1]: \r\n sussy+=math.ceil(((a[i]-a[i+1])+1)/d)\r\n a[i+1]+=d*math.ceil(((a[i]-a[i+1])+1)/d) \r\nprint(sussy)", "import math\nk=input().split()\nn=int(k[0])\nd=int(k[1])\nc=0\na = list(map(int, input().rstrip().split()))\nb=a[0]\nfor i in range(1,n):\n if a[i]<=b:\n x=(b-a[i])//d+1\n c+=x\n b=a[i]+x*d\n else:\n b=a[i]\nprint(c)\n \n\t \t \t\t \t \t \t \t\t \t\t", "n,d=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n):\r\n if b[i]>b[i-1]:continue\r\n else:\r\n k=(b[i-1]-b[i])//d+1\r\n b[i]+=k*d;ans+=k\r\nprint(ans)", "n,d=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres,ans=a[0],0\r\nfor i in range(1,n):\r\n if a[i]>res:\r\n res=a[i]\r\n else:\r\n if (res-a[i])%d==0:\r\n ans+=(res-a[i])//d+1\r\n res+=d\r\n else:\r\n ans+=(res-a[i])//d+1\r\n res += d - (res - a[i]) % d\r\nprint(ans)", "n, d = map(int,input().split())\nA = list(map(int, input().split()))\n\ndef solve(n,d,A):\n ans = 0\n l = A[0]\n for a in A[1:]:\n if a > l:\n l = a\n else:\n k = int((l-a)/d) + 1\n ans += k\n l = a + k*d \n print(ans)\n\nsolve(n,d,A)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, d = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in range(1, n):\r\n if w[i-1] - w[i] >= 0:\r\n x = (w[i-1] - w[i])//d + 1\r\n c += x\r\n w[i] += x * d\r\nprint(c)", "n,d=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ns=0\r\nimport math \r\nfor i in range(1,n):\r\n if l[i]>l[i-1]: \r\n continue\r\n \r\n diff=l[i-1]-l[i]+1 \r\n \r\n s+=math.ceil(diff/d)\r\n l[i]+=d*math.ceil(diff/d)\r\nprint(s)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nli=[]\r\np=input().split()\r\nfor i in p:\r\n li.append(int(i))\r\ncnt=0\r\nfor i in range(1,n):\r\n if li[i]<=li[i-1]:\r\n p = (li[i-1]-li[i])//k\r\n p=p+1\r\n cnt=cnt+p\r\n li[i]=li[i]+(k*p)\r\n \r\nprint(cnt)\r\n", "n,d = map(int,input().split())\r\nbi = list(map(int,input().split()))\r\nmaxn = bi[0]\r\nans = 0\r\nfor i in range(1,n):\r\n maxn = max(maxn+1,bi[i])\r\n n = (maxn - bi[i])//d + int((maxn - bi[i])% d != 0)\r\n maxn = bi[i] + n * d\r\n ans += n\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\nL=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-1):\r\n if L[i+1]<=L[i]:\r\n x=L[i]-L[i+1]\r\n ans+=x//d +1\r\n L[i+1]+=d*(x//d +1)\r\nprint(ans)", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nmoves = 0\r\n\r\nfor i in range(1, n):\r\n if b[i]<=b[i-1]:\r\n nm = (b[i-1]-b[i])//d + 1\r\n moves+=nm\r\n b[i] += d*nm\r\nprint(moves)", "n, d = [int(i) for i in input().split()]\r\nlst = [int(i) for i in input().split()]\r\ncount1, count2 = 0, 0\r\nfor elem in lst:\r\n if elem <= count1:\r\n c = (count1 + d - elem) // d\r\n count2 += c\r\n elem += c * d\r\n count1 = elem\r\nprint(count2)\r\n", "from math import ceil\r\nn,d=map(int,input().split())\r\np=-1\r\nans=0\r\nfor i in map(int,input().split()):\r\n k=ceil((max(p-i+1,0))/d)\r\n ans+=k\r\n p=i+k*d\r\nprint(ans)", "##codeforces 11A\r\nimport math\r\ndef secuencia(lista,d):\r\n cont=0\r\n for i in range(len(lista)-1):\r\n if lista[i]>=lista[i+1]:\r\n n=math.floor((lista[i]-lista[i+1])/d)+1\r\n lista[i+1]=lista[i+1]+n*d\r\n cont+=n\r\n return cont\r\n\r\nll,d = map(int, input().split(' '))\r\nl = list(map(int, input().split(' ')))\r\n\r\nprint(secuencia(l,d))", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n if l[i-1]>=l[i]:\r\n c=c+1+(l[i-1]-l[i])//d\r\n l[i]=l[i]+d*(1+(l[i-1]-l[i])//d)\r\nprint(c)", "cond = list(map(int,input().split()))\r\nnum = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,cond[0]):\r\n j = num[i]-num[i-1]\r\n if j <= 0:\r\n count += abs(j)//cond[1]+1\r\n num[i] += (abs(j)//cond[1]+1)*cond[1]\r\nprint(count)", "n, d = map(int, input().split())\nb = [int(i) for i in input().split()]\nans = 0\nfor i in range(1, n):\n if b[i-1] >= b[i]:\n k = b[i-1] - b[i] + 1\n if k % d != 0:\n k += d\n k //= d\n b[i] += d * k\n ans += k\nprint(ans)\n", "n, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(1, n):\r\n if a[i] <= a[i - 1]:\r\n ans += (a[i - 1] - a[i]) // d + 1\r\n a[i] += d * ((a[i - 1] - a[i]) // d + 1)\r\nprint(ans)", "I=lambda:map(int,input().split())\nn,d=I()\na=*I(),\nx=a[0]\nr=0\nfor y in a[1:]:\n z=0--(x+1-y)//d\n if z>=0:\n r+=z\n y+=z*d\n x=y\nprint(r)\n \t \t\t\t\t\t\t\t \t\t\t\t\t \t \t \t \t\t", "# Number = input().split()\r\n# List = input().split()\r\n\r\n# # 转换数据类型\r\n# newList = []\r\n# for item in List:\r\n# newList.append(int(item))\r\n\r\n# lines = int(Number[0])\r\n# d = int(Number[1])\r\n\r\n# # 逐个判断\r\n# cont = 0\r\n# for i in range(0, len(newList)-1):\r\n# while(newList[i+1]<= newList[i]):\r\n# newList[i+1] = newList[i+1]+d\r\n# cont+=1\r\n# print(cont)\r\n\r\n#----------------无错误但是超时 ----------------#\r\n\r\n# while 换成 if\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nimport math\r\nc=0\r\nfor i in range(n-1):\r\n if l[i]>=l[i+1]:\r\n c = c + int((l[i]-l[i+1])/d)+1\r\n l[i+1] = l[i+1] + d*(int((l[i]-l[i+1])/d)+1)\r\nprint(c)", "\r\n\r\nimport math\r\n\r\n\r\nn, d = list(map(int, input().split()))\r\n\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nsteps = 0\r\ni = 0\r\nwhile i < len(nums) - 1:\r\n\r\n if nums[i] < nums[i+1]:\r\n i+=1\r\n continue\r\n\r\n diff = nums[i] - nums[i+1]\r\n\r\n if diff%d:\r\n inc = math.ceil(diff/d)\r\n else:\r\n inc = (diff // d) + 1\r\n\r\n nums[i+1] += (d * inc)\r\n steps += inc\r\n i += 1\r\n\r\nprint(steps)", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n):\r\n if arr[i-1]>=arr[i]:\r\n diff=arr[i-1]-arr[i]\r\n ans+=diff // d+1\r\n arr[i] +=((diff//d)+1)*d\r\nprint(ans)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmov=0\r\nfor i in range(1,n):\r\n if l[i-1]>=l[i]:\r\n di=l[i-1]-l[i]\r\n di=(di+d-(di%d))\r\n l[i]+=di\r\n mov+=(di//d)\r\nprint(mov)", "import math\r\nn, d = map (int, input(). split())\r\na = list (map (int, input(). split()))\r\nanswer = 0\r\nfor i in range (1, len(a)):\r\n if (a[i] <= a[i - 1]):\r\n t = math. ceil ((a[i - 1] - a[i] + 1) / d)\r\n answer += t\r\n a[i] += t * d\r\nprint (answer)", "import math\nn,d=map(int,input().split())\na=list(map(int,input().split()))\ncount=0\nfor i in range(1,n):\n if a[i]<=a[i-1]:\n countt=math.ceil((abs(a[i]-a[i-1])+1)/d)\n a[i]+=d*countt\n count+=countt\nprint(count)\n\t\t\t\t\t\t\t \t \t \t \t\t \t\t\t\t\t\t\t\t\t \t", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ntotal=0\r\nfor i in range(1,n):\r\n if (a[i-1] >= a[i]):\r\n ans = a[i - 1] - a[i]\r\n ans = (ans//d) + 1\r\n a[i] += (d*ans)\r\n total+=ans\r\nprint(total)\r\n#5 2 3 2\r\n#2 + 2 + 3 = 7\r\n", "[n, d] = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmoves = 0\r\nfor i in range(n - 1):\r\n if b[i] >= b[i + 1]:\r\n k = (b[i] - b[i + 1]) // d + 1\r\n b[i + 1] += k * d\r\n moves += k\r\nprint(moves)\r\n", "n,d=map(int,input().split())\nb=list(map(int,input().split()))\nmoves=0\nfor i in range(1,n):\n if b[i-1]>=b[i]:\n m=(b[i-1]-b[i])//d+1\n moves+= m\n b[i]+=m*d\nprint(moves)\n\n\t\t \t\t \t \t\t \t\t \t \t\t \t", "n,d=map(int,input().split())\r\ncount,L=0,list(map(int,input().split()))\r\nfor i in range(1,n):\r\n if L[i]<=L[i-1]:\r\n count+=(L[i-1]-L[i])//d+1\r\n L[i]+=d*((L[i-1]-L[i])//d+1)\r\nprint(count)", "# LUOGU_RID: 113743241\ndef min_moves_to_increasing_sequence(n, d, sequence):\n moves = 0\n\n for i in range(1, n):\n if sequence[i] <= sequence[i - 1]:\n diff = sequence[i - 1] - sequence[i]\n num_moves = (diff // d) + 1\n moves += num_moves\n sequence[i] += num_moves * d\n\n return moves\n\n# 读取输入\nn, d = map(int, input().split())\nsequence = list(map(int, input().split()))\n\n# 调用函数计算最少操作次数\nresult = min_moves_to_increasing_sequence(n, d, sequence)\n\n# 输出结果\nprint(result)\n", "I=lambda:map(int,input().split())\r\nn,d=I()\r\na=*I(),\r\nx=a[0]\r\nr=0\r\nfor y in a[1:]:\r\n z=0--(x+1-y)//d\r\n if z>=0:\r\n r+=z\r\n y+=z*d\r\n x=y\r\nprint(r)\r\n", "n,k=map(int,input().split())\r\na=input().split()\r\nlast=0\r\ns=0\r\nfor i in range(n):\r\n now=int(a[i])\r\n d=0\r\n if now<=last:\r\n d=int((last-now+k)/k)\r\n s+=d\r\n last=now+d*k\r\nprint(s)\r\n", "from math import floor\r\na=input()\r\ns=input()\r\na1=a.split(\" \")\r\nn=int(a1[0])\r\nd=int(a1[1])\r\ns1=list(map(int,s.split(\" \")))\r\nc=0\r\nfor i in range(1,n):\r\n r=(s1[i]-s1[i-1])\r\n if r<=0:\r\n add=floor(-r/d)+1\r\n s1[i]+=(add*d)\r\n c+=add\r\nprint(c)", "n, d = map(int, input().split())\r\nmoo = list(map(int, input().split()))\r\nporg = 0\r\nfor i in range(1, n):\r\n if moo[i] <= moo[i-1]:\r\n porg += 1 + (moo[i-1]-moo[i])//d\r\n moo[i] += d*(1 + (moo[i-1]-moo[i])//d)\r\nprint(porg)", "n, d = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, n):\r\n if arr[i]<=arr[i-1]:\r\n diff = abs(arr[i]-arr[i-1])\r\n ans += (diff//d)+1\r\n arr[i]+=d*((diff//d)+1)\r\nprint(ans)\r\n " ]

[ "import sys\r\nn=int(sys.stdin.readline())\r\nsher=list(input())\r\nmon=list(input())\r\nsher.sort()\r\nmon.sort()\r\n#minimum no of flicks Mon will get\r\nc=mon.copy()\r\nd=sher.copy()\r\ni=0\r\nj=0\r\nans1=0\r\nans2=0\r\nwhile(i<n and j<n):\r\n if c[i]>=d[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1 \r\n ans1+=1\r\nprint(ans1) \r\n#max no off flick Mon can hit\r\nc=mon.copy()\r\nd=sher.copy()\r\ni=0\r\nj=0\r\nwhile(i<n and j<n):\r\n if c[i]>d[j]:\r\n ans2+=1 \r\n i+=1 \r\n j+=1 \r\n else:\r\n i+=1 \r\nprint(ans2) \r\n \r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\ns = sorted(input().strip())\nm = sorted(input().strip())\n\nlose, win = 0,0\nfor i in m:\n if i >= s[lose]:\n lose += 1\n if i > s[win]:\n win += 1\n\nprint(n - lose, win, sep = '\\n')", "n = int(input())\r\ns,m = list(input()),list(input())\r\ns.sort()\r\nm.sort()\r\ni,j,c = 0,0,0\r\nwhile(True):\r\n if m[i]>s[j]:\r\n i += 1\r\n j += 1\r\n c += 1\r\n else:\r\n i += 1\r\n if i==len(m):\r\n break\r\n#print(i,j,c)\r\nx = 0\r\nfor i in range(n):\r\n if m[i]>=s[x]:\r\n x += 1\r\nprint(n-x)\r\nprint(c)", "n=int(input())\r\nm_flik=0;s_flik=0;j=0\r\ns1=int(input());s=[]\r\nm1=int(input());m=[]\r\nfor i in range(n):\r\n s.append(s1%10)\r\n s1=s1//10\r\n\r\nfor i in range(n):\r\n m.append(m1%10)\r\n m1=m1//10\r\n\r\ns.sort()\r\nm.sort(reverse=True)\r\n\r\nm_big=m[j]\r\nfor i in range(n-1,-1,-1):\r\n if(m_big>s[i]):\r\n m_flik+=1;j+=1\r\n if(j<n):\r\n m_big=m[j]\r\nj=0\r\nm_big=m[j]\r\nfor i in range(n-1,-1,-1):\r\n if(m_big>=s[i]):\r\n s_flik+=1;j+=1\r\n if(j<n):\r\n m_big=m[j]\r\n\r\nprint(n-s_flik,m_flik)", "def main():\r\n\tn = int(input())\r\n\ta = list(map(int, input()))\r\n\tb = list(map(int, input()))\r\n\tcnt = [0 for i in range(10)]\r\n\tfor i in (b):\r\n\t\tcnt[i] += 1\r\n\tmin_gotten = 0\r\n\tfor i in a:\r\n\t\tfor j in range(i, 10):\r\n\t\t\tif (cnt[j] > 0):\r\n\t\t\t\tcnt[j] -= 1\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tfor j in range(i):\r\n\t\t\t\tif (cnt[j] > 0):\r\n\t\t\t\t\tcnt[j] -= 1\r\n\t\t\t\t\tbreak\r\n\t\t\tmin_gotten += 1\r\n\tprint(min_gotten)\r\n\r\n\tfor i in (b):\r\n\t\tcnt[i] += 1\r\n\tmax_given = 0\r\n\tfor i in a:\r\n\t\tfor j in range(i + 1, 10):\r\n\t\t\tif (cnt[j] > 0):\r\n\t\t\t\tcnt[j] -= 1\r\n\t\t\t\tmax_given += 1\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tfor j in range(i + 1):\r\n\t\t\t\tif (cnt[j] > 0):\r\n\t\t\t\t\tcnt[j] -= 1\r\n\t\t\t\t\tbreak\r\n\tprint(max_given)\r\n\r\nmain()", "numDigit = int(input())\r\ndigitSher = list(map(int, list(input())))\r\ndigitMory = list(map(int, list(input())))\r\n\r\ndigitSher.sort()\r\ndigitMory.sort()\r\n\r\ni,j = numDigit - 1, numDigit - 1\r\nshelban, s = 0, 0\r\nwhile s != j + 1 and i >= 0:\r\n if digitMory[j] < digitSher[i]:\r\n s += 1\r\n shelban += 1\r\n else:\r\n j -= 1\r\n i -= 1\r\n\r\nprint(shelban)\r\n\r\nj,i = 0,0\r\nwhile i < numDigit and j < numDigit:\r\n if digitSher[j] < digitMory[i]:\r\n j += 1\r\n i += 1\r\n \r\nprint(j)", "n=int(input())\r\nsherlock=sorted(input())\r\nmoriarty=sorted(input())\r\nmx=0\r\nmn=0\r\nk=n-1\r\nfor i in range(n-1,-1,-1):\r\n for j in range(k,-1,-1):\r\n if moriarty[i]>=sherlock[j]:\r\n mn+=1\r\n k=j-1\r\n break\r\nk=n-1\r\nfor i in range(n-1,-1,-1):\r\n for j in range(k,-1,-1):\r\n if moriarty[i]>sherlock[j]:\r\n mx+=1\r\n k=j-1\r\n break\r\nprint(n-mn)\r\nprint(mx)", "n = int(input())\r\na = sorted(map(int, input()))\r\nb = sorted(map(int, input()))\r\nwas = [0] * n\r\ncnt1 = cnt2 = 0\r\nfor i in range(n):\r\n mn = 10\r\n ind = -1\r\n for j in range(n):\r\n if not was[j] and a[j] <= b[i] < mn:\r\n mn = a[j]\r\n ind = j\r\n if ind != -1: was[ind] = 1\r\n else: cnt1 += 1\r\nwas = [0] * n\r\nfor i in range(n):\r\n mn = 10\r\n ind = -1\r\n for j in range(n):\r\n if not was[j] and a[j] < b[i] < mn:\r\n mn = a[j]\r\n ind = j\r\n if ind != -1:\r\n was[ind] = 1\r\n cnt2 += 1\r\nprint(cnt1)\r\nprint(cnt2)", "n,s,m,max,j=int(input()),input(),input(),0,0\r\ns,m,min=sorted(s),sorted(m),n\r\nfor i in m:\r\n if i>=s[j]:j,min=j+1,min-1\r\nj=0\r\nfor i in m:\r\n if i>s[j]:max,j=max+1,j+1\r\nprint (min,max,sep=\"\\n\")\r\n", "n = int(input())\r\na = list(input())\r\nb = list(input())\r\na.sort()\r\nb.sort()\r\nj = 0\r\nfor i in b:\r\n if(int(i) >= int(a[j])):\r\n j+=1\r\n\r\nprint(n-j)\r\nj = 0\r\nfor i in b:\r\n if(int(i)> int(a[j])):\r\n j+=1\r\n\r\nprint(j)", "n = int(input())\r\ns = list(map(int, input()))\r\nm = list(map(int, input()))\r\n\r\na, b = s.copy(), m.copy()\r\nc, k = 0, 0\r\n\r\nm.sort()\r\nfor i in range(len(s)):\r\n for j in range(len(m)):\r\n if m[j] >= s[i]:\r\n c += 1\r\n del m[j]\r\n break\r\nprint(n - c)\r\n\r\n\r\nb.sort()\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if b[j] > a[i]:\r\n k += 1\r\n del b[j]\r\n break\r\nprint(k)\r\n", "\r\nn = int(input())\r\na=sorted(input())\r\nb=sorted(input())\r\ni=n-1\r\nj=n-1\r\nwhile(i>=0):\r\n if(a[i]<=b[j]):\r\n i-=1\r\n j-=1\r\n else:\r\n i-=1\r\nprint(j+1)\r\nj=0\r\nfor i in range(n):\r\n if(a[j]<b[i]):\r\n j+=1\r\nprint(j)\r\n\r\n", "n = int(input())\r\ns = input()\r\nm = input()\r\nm1digits = [0] * 10\r\nm2digits = [0] * 10\r\nfor d in m:\r\n m1digits[int(d)] += 1\r\n m2digits[int(d)] += 1\r\nans1 = 0\r\nans2 = 0\r\nfor d in s:\r\n d = int(d)\r\n if m1digits[d] > 0:\r\n m1digits[d] -= 1\r\n else:\r\n k = d\r\n while k < 10 and m1digits[k] == 0:\r\n k += 1\r\n if k == 10:\r\n k = 0\r\n while m1digits[k] == 0:\r\n k += 1\r\n ans1 += 1\r\n m1digits[k] -= 1\r\n t = d + 1\r\n while t < 10 and m2digits[t] == 0:\r\n t += 1\r\n if t == 10:\r\n t = 0\r\n while m2digits[t] == 0:\r\n t += 1\r\n m2digits[t] -= 1\r\n else:\r\n ans2 += 1\r\n m2digits[t] -= 1\r\nprint(ans1)\r\nprint(ans2) ", "#!/usr/bin/env python3\ndef ri():\n return map(int, input().split())\n\nn = int(input())\n\na = input()\nb = input()\n\naa = [int(i) for i in a]\nbb = [int(i) for i in b]\n\naa.sort()\nbb.sort()\n\nj = 0\ncnt = 0\nfor i in range(n):\n while j !=n and aa[i] > bb[j]:\n j+=1\n if j != n:\n cnt+=1\n j+=1\n else:\n break\nprint(n-cnt)\nj = 0\ncnt = 0\nfor i in range(n):\n while j !=n and aa[i] >= bb[j]:\n j+=1\n if j != n:\n cnt+=1\n j+=1\n else:\n break\nprint(cnt)\n", "def f(n, s):\r\n first = s[0]\r\n min_m = 0\r\n max_s = 0\r\n for i in range(n-1):\r\n s[i] = s[i+1]\r\n s[-1] = first\r\n for i in range(n):\r\n if a[i] > s[i]:\r\n min_m += 1\r\n elif s[i] > a[i]:\r\n max_s += 1\r\n return s, min_m, max_s\r\n\r\nn = int(input())\r\na = list(map(int, list(input())))\r\nb = list(map(int, list(input())))\r\nfor i in range(n-1):\r\n for j in range(n-i-1):\r\n if a[j+1] < a[j]:\r\n a[j+1], a[j] = a[j], a[j+1]\r\n if b[j+1] < b[j]:\r\n b[j+1], b[j] = b[j], b[j+1]\r\nd1 = [0] * (n+1)\r\nd2 = [0] * (n+1)\r\nd1[0] = 1000\r\nfor i in range(1, n+1):\r\n b, min_m, max_s = f(n, b)\r\n d1[i] = min(d1[i-1], min_m)\r\n d2[i] = max(d2[i-1], max_s)\r\n\r\nprint(d1[n])\r\nprint(d2[n])", "n=int(input())\r\na=sorted(map(int,input()))\r\nb=sorted(map(int,input()))\r\nnoMorlick = sherlick=0\r\nfor i in range(n):\r\n\tnoMorlick += 1 if b[i] >= a[noMorlick] else 0\r\n\tsherlick += 1 if b[i]>a[sherlick] else 0\r\nprint(n - noMorlick)\r\nprint(sherlick)", "n, a, b = int(input()), sorted(input()), sorted(input())\r\nbi1l, bi1r, v1 = 0, n - 1, 0\r\nbi2, v2 = n - 1, 0\r\nfor x in reversed(a):\r\n if x > b[bi1r]:\r\n bi1l += 1\r\n v1 += 1\r\n else:\r\n bi1r -= 1\r\n if b[bi2] > x:\r\n bi2 -= 1\r\n v2 += 1\r\nprint(v1, v2, sep='\\n')", "n=int(input())\r\na=list(sorted(input()))\r\nb=list(sorted(input()))\r\nj=0\r\nfor i in b:\r\n if i >=a[j]:\r\n j+=1\r\n \r\nprint(len(a)-j)#minimum number of flicks\r\nk=0\r\n\r\nfor i in b:\r\n if i>a[k]:\r\n k+=1\r\nprint(k)#maximum number of flicks", "n=int(input())\r\ns=list(input())\r\nm=list(input())\r\n\r\na=s[::]\r\nb=m[::]\r\ns.sort()\r\nm.sort()\r\nmn=0\r\nsh=0\r\n\r\nj=0\r\ni=0\r\nwhile(i<n and j<n):\r\n if s[i]<m[j]:\r\n sh+=1\r\n i+=1\r\n j+=1\r\n\r\nmx=0\r\n\r\nfor i in a:\r\n for j in range(n):\r\n if m[j]!='?' and m[j]>=i:\r\n m[j]='?'\r\n mx+=1\r\n break\r\n\r\nprint(n-mx)\r\nprint(sh)\r\n ", "n= int(input())\r\na = sorted(list(map(int,input())))\r\nb = sorted(list(map(int,input())))\r\nused = [0]*n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(len(b)):\r\n if(not used[j] and a[i]<=b[j]):\r\n used[j] = 1\r\n break\r\n else:\r\n ans+=1\r\nprint(ans)\r\nused = [0]*n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(len(b)):\r\n if(not used[j] and a[i]<b[j]):\r\n used[j] = 1\r\n break\r\n else:\r\n continue\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\na = sorted(list(map(int,input())))\r\nb = sorted(list(map(int,input())))\r\ni=j=0\r\nq = 0\r\nwhile j<n:\r\n while j<n and b[j]<=a[i]:\r\n j+=1\r\n q += j<n\r\n i+=1\r\n j+=1\r\n\r\ni=j=0\r\n\r\nwhile j<n:\r\n while j<n and b[j]<a[i]:\r\n j+=1\r\n i+=1\r\n j+=1\r\n\r\nw = j-i\r\nprint(w,q,sep='\\n')", "def creditCards(n,sherlock,moriarty):\n\ts = [int(i) for i in sherlock]\n\tm = [int(i) for i in moriarty]\n\n\tmin_flicks_received = 0\n\n\n\t# find min flicks Moriarty can receive\n\tfor i in s:\n\t\tif i in m:\n\t\t\tm.remove(i)\n\t\telif max(m) < i: # if max is smaller than i\n\t\t\tm.remove(min(m))\n\t\t\tmin_flicks_received += 1\n\t\telse:\n\t\t\tm.remove(min(j for j in m if j > i))\n\t\n\tprint(min_flicks_received)\n\n\t# find max flicks Moriarty can give Sherlock\n\tm = [int(i) for i in str(moriarty)]\n\tmax_flicks_given = 0\n\n\tfor i in s:\n\t\tif max(m) <= i: # if max is smaller or equal to i\n\t\t\tm.remove(min(m))\n\t\telse:\n\t\t\tm.remove(min(j for j in m if j > i))\n\t\t\tmax_flicks_given += 1\n\tprint(max_flicks_given)\n\nn = int(input())\nsherlock = input()\nmoriarty = input()\n\ncreditCards(n,sherlock,moriarty)\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn=int(input())\r\np=input()\r\nq=input()\r\np=sorted(p)\r\nq=sorted(q)\r\ni=0\r\nj=0 \r\nwhile(j<len(q)):\r\n if(p[i]<=q[j]):\r\n i+=1 \r\n j+=1 \r\n else:\r\n j+=1 \r\nk=i \r\ni=0 \r\nj=0 \r\nwhile(j<len(q)):\r\n if(p[i]<q[j]):\r\n i+=1 \r\n j+=1 \r\n else:\r\n j+=1 \r\nprint(len(q)-k)\r\nprint(i)\r\n", "import sys\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\ndef solve():\r\n n = int(input())\r\n sn = [0] * 10\r\n mn = sn[:]\r\n\r\n for i in input():\r\n sn[int(i)] += 1\r\n for i in input():\r\n mn[int(i)] += 1\r\n\r\n snc = sn[:]\r\n mnc = mn[:]\r\n for i in range(10):\r\n for j in range(i-1, -1, -1):\r\n if mnc[i] == 0:\r\n break\r\n tmp = min(mnc[i], snc[j])\r\n mnc[i] -= tmp\r\n snc[j] -= tmp\r\n\r\n max_win = n - sum(snc)\r\n\r\n snc = sn[:]\r\n mnc = mn[:]\r\n for i in range(10):\r\n for j in range(i, -1, -1):\r\n if mnc[i] == 0:\r\n break\r\n tmp = min(mnc[i], snc[j])\r\n mnc[i] -= tmp\r\n snc[j] -= tmp\r\n\r\n # debug(snc, locals())\r\n min_lose = sum(snc)\r\n\r\n print(min_lose)\r\n print(max_win)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\ns = [int(i) for i in input()]\nm = [int(i) for i in input()]\n\nsd = [0,0,0,0,0,0,0,0,0,0]\nmd = [0,0,0,0,0,0,0,0,0,0]\n\nfor i in range(n):\n sd[s[i]] += 1\n md[m[i]] += 1\n\nmin_flicks = 0\nrest = 0\n\nfor i in range(9, -1, -1):\n rest += md[i]\n\n if sd[i] <= rest:\n rest -= sd[i]\n else:\n min_flicks += sd[i] - rest\n rest = 0\n\nprint(min_flicks)\n\n\nmax_flicks = 0\nsaved = md[9]\n\nfor i in range(8, -1, -1):\n\n if saved >= sd[i]:\n max_flicks += sd[i]\n saved -= sd[i]\n saved += md[i]\n else:\n max_flicks += saved\n saved = md[i]\n \nprint(max_flicks)\n", "n = int(input())\r\nsh = input()\r\nmor = sorted(input())\r\nmor1 = mor[:]\r\ncnt1 = 0\r\nfor i in range(n):\r\n\tfl = False\r\n\tfor j in range(n):\r\n\t\tif mor1[j] != 'x' and mor1[j] >= sh[i]:\r\n\t\t\tmor1[j] = 'x'\r\n\t\t\tfl = True\r\n\t\t\tbreak\r\n\tif not fl:\r\n\t\tcnt1 += 1\r\ncnt2 = 0\r\nfor i in range(n):\r\n\tfl = False\r\n\tfor j in range(n):\r\n\t\tif mor[j] != 'x' and mor[j] > sh[i]:\r\n\t\t\tfl = True\r\n\t\t\tmor[j] = 'x'\r\n\t\t\tbreak\t\r\n\tif fl:\r\n\t\tcnt2 += 1\r\nprint(cnt1)\r\nprint(cnt2)\r\n\t\t\r\n\t\t\r\n", "n = int(input())\r\ncnt_b = [0]*11\r\ncnt_b1 = cnt_b\r\na=[int(x) for x in input()]\r\nb=[int(x) for x in input()]\r\na.sort()\r\nb.sort()\r\na1,a2=0,0\r\nfor i in range(n):\r\n\tif(b[i]>=a[a1]):\r\n\t\ta1+=1\r\n\tif(b[i]>a[a2]):\r\n\t\ta2+=1\r\nprint(n-a1,a2,sep='\\n')\r\n\r\n", "import bisect\r\nn = int(input())\r\nsherlock = input()\r\nmori = sorted([int(i) for i in input()])\r\nmori2 = mori.copy()\r\nsherlock_hits = 0\r\nmori_hits = 0\r\nfor i in sherlock:\r\n el = int(i)\r\n idx = bisect.bisect(mori, el)\r\n if mori[idx - 1] == el:\r\n mori.remove(mori[idx - 1])\r\n continue\r\n elif idx != len(mori):\r\n mori.remove(mori[idx])\r\n else:\r\n mori_hits += 1\r\n mori.remove(mori[0])\r\n\r\nprint(mori_hits)\r\n\r\nfor i in sherlock:\r\n el = int(i)\r\n idx = bisect.bisect(mori2, el)\r\n\r\n if idx != len(mori2):\r\n mori2.remove(mori2[idx])\r\n sherlock_hits += 1\r\n else:\r\n mori2.remove(mori2[0])\r\nprint(sherlock_hits)\r\n", "n = int(input())\r\nsh = sorted(list(map(int, input())))\r\nmo = sorted(list(map(int, input())))\r\nshflicknum, moflicknum = 0, n-1\r\nfor i in range(n-1, -1, -1):\r\n if mo[moflicknum] >= sh[i]:\r\n moflicknum -= 1\r\nprint(moflicknum + 1)\r\nfor i in range(0, n):\r\n if mo[i] > sh[shflicknum]:\r\n shflicknum += 1\r\nprint(shflicknum)", "n = int(input())\r\nx = list(input())\r\ny = list(input())\r\n\r\nx.sort()\r\ny.sort()\r\nx.reverse()\r\ny.reverse()\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(n):\r\n if y[ans1]>=x[i]:\r\n ans1+=1\r\n if y[ans2]>x[i]:\r\n ans2+=1\r\nprint(n-ans1)\r\nprint(ans2)\r\n", "n=int(input())\r\ns=sorted(input())\r\nm=sorted(input())\r\nj=0\r\nfor i in range(n):\r\n if(m[i]>s[j]):\r\n j=j+1\r\nmx=j\r\nj=n-1\r\nfor i in range(n-1,-1,-1):\r\n if(m[j]>=s[i]):\r\n j=j-1\r\nmn=j+1\r\nprint(mn)\r\nprint(mx)", "n = int(input())\r\na = list(map(int, input()))\r\nb = list(map(int, input()))\r\na.sort()\r\nb.sort()\r\ni = 0\r\nj = 0\r\nwhile 1:\r\n if b[j]<a[i]:\r\n j+=1\r\n else:\r\n j+=1\r\n i+=1\r\n if i == n or j == n:\r\n break\r\nprint(n - i)\r\n\r\ni = 0\r\nj = 0\r\nwhile 1:\r\n if b[j]<=a[i]:\r\n j+=1\r\n else:\r\n j+=1\r\n i+=1\r\n if i == n or j == n:\r\n break\r\nprint(i)", "a=int(input())\r\nb=sorted(input())\r\nc=sorted(input())\r\nx=0\r\nfor i in c:\r\n if i>=b[x]:x+=1\r\ny=0\r\nfor i in c:\r\n if i>b[y]:y+=1\r\nprint(a-x,y)", "# https://codeforces.com/problemset/problem/777/B\n# Problem\n# Big O:\n# Time complexity: O(n log (n)) + 2*(O(n) + O(n))*O(k) = O(n)*O(k)\n# Space complexity: 3*O(n) = O(n)\n\n# Problem\n\n\ndef value_index_greater_or_equal_than(ordered_list, number):\n for i in range(0, len(ordered_list)):\n element = ordered_list[i]\n if element >= number:\n return i\n return -1\n\n\ndef flicks(sherlocks_card, sorted_moriarty_card, prefer_greater_digit):\n moriartys_flicks = 0\n sherlocks_flicks = 0\n\n for sherlocks_digit in sherlocks_card:\n increment = 1 if prefer_greater_digit else 0\n index = value_index_greater_or_equal_than(\n sorted_moriarty_card, sherlocks_digit + increment)\n index = index if index >= 0 else 0\n moriartys_digit = sorted_moriarty_card[index]\n if (moriartys_digit > sherlocks_digit):\n sherlocks_flicks += 1\n elif (moriartys_digit < sherlocks_digit):\n moriartys_flicks += 1\n sorted_moriarty_card.pop(index)\n return moriartys_flicks, sherlocks_flicks\n\n\ndef minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n moriartys_flicks, _ = flicks(sherlocks_card, sorted_moriarty_card, False)\n return moriartys_flicks\n\n\ndef maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n _, sherlocks_flicks = flicks(sherlocks_card, sorted_moriarty_card, True)\n return sherlocks_flicks\n\n# def minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n# moriartys_flicks = 0\n# for digit in sherlocks_card:\n# # guarantees minimum possible number of flicks Moriarty will get\n# index = value_index_greater_or_equal_than(\n# sorted_moriarty_card, digit)\n# if (index >= 0):\n# sorted_moriarty_card.pop(index)\n# else:\n# moriartys_flicks += 1\n# sorted_moriarty_card.pop(0)\n# return moriartys_flicks\n\n\n# def maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n# sherlocks_flicks = 0\n# for digit in sherlocks_card:\n# # guarantees maximum possible number of flicks that Sherlock can get from Moriarty\n# index = value_index_greater_or_equal_than(\n# sorted_moriarty_card, digit + 1)\n# if (index >= 0):\n# sherlocks_flicks += 1\n# sorted_moriarty_card.pop(index)\n# else:\n# sorted_moriarty_card.pop(0)\n# return sherlocks_flicks\n\n\ndef solve(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_card.sort()\n min_moriartys_flicks = minimum_moriartys_flicks(\n sherlocks_card, moriartys_card.copy())\n max_sherlocks_flicks = maximum_sherlocks_flicks(\n sherlocks_card, moriartys_card.copy())\n\n return min_moriartys_flicks, max_sherlocks_flicks\n\n\n# Read input\nnumber_of_digits = int(input())\nsherlocks_card = [int(x) for x in input()]\nmoriartys_card = [int(x) for x in input()]\nmoriartys_flicks, sherlocks_flicks = solve(\n number_of_digits, sherlocks_card, moriartys_card)\nprint(moriartys_flicks)\nprint(sherlocks_flicks)\n", "n,s1,s2,c1,c2=int(input()),input(),input(),0,0\r\na=sorted([int(i) for i in s1])\r\nb=sorted([int(i) for i in s2])\r\nj=0\r\nfor i in a:\r\n while j<n:\r\n j+=1\r\n if b[j-1]>=i:\r\n c1+=1\r\n break\r\nj=0\r\nfor i in a:\r\n while j<n:\r\n j+=1\r\n if b[j-1]>i:\r\n c2+=1\r\n break\r\n \r\nprint(n-c1,c2,sep='\\n')", "n=int(input());\r\ns=input();\r\nt=input();\r\nl=list(s);\r\na=[int(x) for x in l];\r\nl=list(t);\r\nb=[int(x) for x in l];\r\na=sorted(a);\r\nb=sorted(b);\r\n#print(a);\r\n#print(b);\r\n\r\n#print(l2);\r\nvisited=[0 for i in range(n)];\r\nc1=0;\r\nc2=0;\r\nfor i in range(n):\r\n for j in range(n):\r\n if(b[j]>a[i] and not visited[j]):\r\n visited[j]=1;\r\n c2+=1;\r\n break;\r\nvisited=[0 for i in range(n)];\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(b[j]>=a[i] and not visited[j]):\r\n visited[j]=1;\r\n c1=c1+1;\r\n break;\r\n \r\nprint(n-c1);\r\nprint(c2);\r\n\r\n\r\n\r\n", "n = int(input())\ns = sorted(map(int, input()))\nm = sorted(map(int, input()))\n\nminimum = 0\nmaximum = 0\ns_i_mx = 0\ns_i_mn = 0\nfor i in range(n):\n if m[i] >= s[s_i_mn]:\n s_i_mn += 1\n else:\n minimum += 1\n\n if m[i] > s[s_i_mx]:\n maximum += 1\n s_i_mx += 1\n\nprint(minimum)\nprint(maximum)", "n = int(input())\r\ns1 = list(input())\r\ns2 = list(input())\r\ns1.sort()\r\ns2.sort()\r\ncnt = 0\r\nused = [False] * n\r\nind = 0\r\nfor i in range(n):\r\n for j in range(ind, n):\r\n if not used[j] and s2[i] >= s1[j]:\r\n used[j] = True\r\n ind = j + 1\r\n cnt += 1\r\n break\r\nprint(n - cnt)\r\ncnt = 0\r\nused = [False] * n\r\nind = 0\r\nfor i in range(n):\r\n for j in range(ind, n):\r\n if not used[j] and s1[i] < s2[j]:\r\n used[j] = True\r\n ind = j + 1\r\n cnt += 1\r\n break\r\nprint(cnt)", "n = int(input())\r\nsh = []\r\nline = input()\r\nfor i in range(n):\r\n sh.append(int(line[i]))\r\nm = []\r\nline = input()\r\nfor i in range(n):\r\n m.append(int(line[i]))\r\n\r\nsh.sort(reverse=True)\r\nm.sort(reverse=True)\r\n\r\nresFirst = 0\r\ni = 0\r\nj = 0\r\nmLastIndex = len(m) - 1\r\nwhile i < len(sh) and j <= mLastIndex:\r\n if m[j] < sh[i]:\r\n resFirst += 1\r\n i += 1\r\n mLastIndex -= 1\r\n else:\r\n i += 1\r\n j += 1\r\n\r\nprint(resFirst)\r\n\r\nresSecond = 0\r\nsh.sort()\r\nm.sort()\r\ni = 0\r\nj = 0\r\nwhile i < len(sh) and j < len(m):\r\n if sh[i] >= m[j]:\r\n j += 1\r\n else:\r\n resSecond += 1\r\n i += 1\r\n j += 1\r\nprint(resSecond)", "n = int(input())\r\ns, t = list(sorted(input())), list(sorted(input()))\r\nr1, r2 = 0, 0\r\nj = 0\r\nk = 0\r\nfor i in t:\r\n if i > s[j]: \r\n r1 += 1\r\n j += 1\r\n if i >= s[k]:\r\n r2 += 1\r\n k += 1\r\nprint(n-r2)\r\nprint(r1)\r\n", "n = int(input())\nsherlock = [int(ch) for ch in input()]\nmoriarty = [int(ch) for ch in input()]\ndp_min = [0] * 10\ndp_max = [0] * 10\nfor m in moriarty:\n dp_min[m] += 1\n dp_max[m] += 1\n\nmin_moriarty = 0\nmax_sherlock = 0\n\nfor s in sherlock:\n # process min\n mor_a = -1\n i = s\n while (i < 10 and dp_min[i] == 0): i += 1\n if (i < 10): \n mor_a = i\n else:\n min_moriarty += 1\n mor_a = 0\n while (dp_min[mor_a] == 0): mor_a += 1\n dp_min[mor_a] -= 1\n\n # process max\n # process min\n mor_b = -1\n i = s+1\n while (i < 10 and dp_max[i] == 0): i += 1\n if (i < 10): \n mor_b = i\n max_sherlock += 1\n else:\n mor_b = 0\n while (dp_max[mor_b] == 0): mor_b += 1\n dp_max[mor_b] -= 1\n\nprint(min_moriarty)\nprint(max_sherlock)\n", "import sys\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = inp()\r\nsh = \"\".join(insr()).strip()\r\nmo = \"\".join(insr()).strip()\r\n\r\nd = dict(zip([str(i) for i in range(0,10)],[0 for i in range(0,10)]))\r\nfor c in mo:\r\n d[c]+=1\r\nD = d.copy()\r\nt = [0 for i in range(0,len(sh))]\r\nT = t[:]\r\nfound = 0\r\nfinished = 0\r\ncount = 0\r\n# print(d)\r\nwhile finished<len(t):\r\n for i,c in enumerate(sh):\r\n # print(f\"checking {c} + {count} in d\")\r\n if t[i]==1: continue\r\n cur = int(c)+count\r\n if cur > 9:\r\n t[i]=1\r\n finished += 1\r\n continue\r\n if d[str(cur)]>0:\r\n # print(f\"found {cur}\")\r\n d[str(cur)] -= 1\r\n finished += 1\r\n found += 1\r\n t[i] = 1\r\n count += 1\r\n\r\nprint(len(t) - found)\r\n\r\nfound = 0\r\nfinished = 0\r\ncount = 1\r\n# print(d)\r\nwhile finished<len(T):\r\n for i,c in enumerate(sh):\r\n # print(f\"checking {c} + {count} in d\")\r\n if T[i]==1: continue\r\n cur = int(c)+count\r\n if cur > 9:\r\n T[i]=1\r\n finished += 1\r\n continue\r\n if D[str(cur)]>0:\r\n # print(f\"found {cur}\")\r\n D[str(cur)] -= 1\r\n finished += 1\r\n found += 1\r\n T[i] = 1\r\n count += 1\r\n\r\nprint(found)", "n = int(input())\r\ns = input()\r\nm = input()\r\n\r\nml = list(m)\r\nsl = list(s)\r\n\r\nml = list(map(int, ml))\r\nsl = list(map(int, sl))\r\n\r\nf = 0\r\nmi = 10\r\nc = 0\r\np = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if ml[j] - sl[i] < mi and ml[j] >= sl[i]:\r\n mi = ml[j] - sl[i]\r\n p = j\r\n f = 1\r\n if f == 1:\r\n ml[p] = -1\r\n c += 1\r\n mi = 10\r\n f = 0\r\n\r\nprint(n-c)\r\n\r\nf = 0\r\nmi = 10\r\nc = 0\r\np = 0\r\nml = list(m)\r\nsl = list(s)\r\n\r\nml = list(map(int, ml))\r\nsl = list(map(int, sl))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if ml[j] - sl[i] < mi and ml[j] > sl[i]:\r\n mi = ml[j] - sl[i]\r\n p = j\r\n f = 1\r\n if f == 1:\r\n ml[p] = -1\r\n c += 1\r\n mi = 10\r\n f = 0\r\nprint(c)\r\n", "n=int(input())\r\ns=input()\r\ns=list(s)\r\ns=[int(i) for i in s]\r\nm=input()\r\nm=list(m)\r\nm=[int(i) for i in m]\r\n\r\ns.sort()\r\nm.sort()\r\ni=0\r\nj=0\r\nans1=0\r\n# n-ans1 is answer\r\nwhile(i<n and j<n):\r\n if s[i]<m[j]:\r\n i+=1 \r\n j+=1 \r\n elif s[i]==m[j]:\r\n i+=1 \r\n j+=1 \r\n else:\r\n ans1+=1\r\n j+=1 \r\ni=0\r\nj=0\r\nans2=0\r\nwhile(i<n and j<n):\r\n if s[i]<m[j]:\r\n ans2+=1 \r\n i+=1 \r\n j+=1 \r\n\r\n else:\r\n j+=1 \r\n\r\nprint(ans1)\r\nprint(ans2)\r\n\r\n \r\n \r\n \r\n ", "from sys import stdin\r\ninput=lambda : stdin.readline()\r\nfrom math import ceil,sqrt,gcd\r\nn=int(input())\r\nb=list(map(int,list(input().strip())))\r\na=list(map(int,list(input().strip())))\r\nd={}\r\nd1={}\r\na.sort()\r\nb.sort()\r\nfor i in range(n):\r\n\tif a[i] in d:\r\n\t\td[a[i]]+=1\r\n\telse:\r\n\t\td[a[i]]=1\r\n\tif b[i] in d1:\r\n\t\td1[b[i]]+=1\r\n\telse:\r\n\t\td1[b[i]]=1\r\n# for minimum flicks\r\nx=dict(d)\r\ny=dict(d1)\r\ncount=0\r\nfor i in a:\r\n\tfor j in b:\r\n\t\tif i>=j:\r\n\t\t\tt=min(d[i],d1[j])\r\n\t\t\td[i]-=t\r\n\t\t\td1[j]-=t\r\n\t\t\tcount+=t\r\nprint(n-count)\r\n# for maximum wins\r\ncount=0\r\na.reverse()\r\nb.reverse()\r\n# print(x,y)\r\nfor i in a:\r\n\tfor j in b:\r\n\t\tif i>j:\r\n\t\t\tt=min(x[i],y[j])\r\n\t\t\tx[i]-=t\r\n\t\t\ty[j]-=t\r\n\t\t\tcount+=t\r\nprint(count)\r\n", "import math\r\nfrom collections import defaultdict\r\n\r\n\r\na = int(input())\r\nb = list(map(int, input()))\r\nc = list(map(int, input()))\r\n\r\nb.sort()\r\nc.sort()\r\n\r\nx=0\r\nfor i in c:\r\n if i>=b[x]:\r\n x+=1\r\n \r\ny=0\r\nfor i in c:\r\n if i>b[y]:\r\n y+=1\r\n \r\nprint(a-x,y, sep='\\n')\r\n", "n=int(input())\r\na=list(map(int,input()))\r\nb=list(map(int,input()))\r\na.sort()\r\nb.sort()\r\nsher=0\r\nmor=0\r\nfor i in range(0,n):\r\n\tif(b[i]>=a[sher]):\r\n\t\tsher=sher+1\r\n\tif(b[i]>a[mor]):\r\n\t\tmor=mor+1\r\nprint(n-sher)\r\nprint(mor)", "def count_digits(string):\r\n cs = [0] * 10\r\n for e in string:\r\n digit = int(e)\r\n cs[digit] +=1\r\n return cs\r\n\r\ninput()\r\nsher = count_digits(input())\r\nmor = count_digits(input())\r\n\r\ncur_sum = 0\r\nfor i in range(10):\r\n cur_sum += sher[i]\r\n cur_sum -= min(cur_sum, mor[i])\r\nprint(cur_sum)\r\n\r\ncur_sum = 0\r\nmax_noogies = 0\r\nfor i in range(10):\r\n this_time = min(mor[i], cur_sum)\r\n cur_sum -= this_time\r\n max_noogies += this_time\r\n cur_sum += sher[i]\r\nprint(max_noogies)\r\n", "# https://codeforces.com/problemset/problem/777/B\n# Problem\n# Big O:\n# Time complexity: O(n log (n)) + 2*(O(n) + O(n))*O(k) = O(n)*O(k)\n# Space complexity: 3*O(n) = O(n)\n\n# Problem\n\n\ndef get_digits_occurrences(card):\n occurrences = {}\n for digit in card:\n digit_occurrences = occurrences.get(digit, 0)\n occurrences[digit] = digit_occurrences + 1\n return occurrences\n\n\ndef find_greater_or_equal_digit(digit, digit_occurrences):\n for i in range(digit, 10):\n occurrences = digit_occurrences.get(i, -1)\n if occurrences > 0:\n return i\n\n return -1\n\n\ndef find_mimimum_digit(digit_occurrences):\n for i in range(0, 10):\n occurrences = digit_occurrences.get(i, -1)\n if occurrences > 0:\n return i\n return -1\n\n\ndef find_next_moriatys_digit(sherlocks_digit, digit_occurrences):\n # Looks for greater or equal digit\n digit_found = find_greater_or_equal_digit(\n sherlocks_digit, digit_occurrences)\n\n if (digit_found >= 0):\n return digit_found\n\n # Looks for minimum digit, since greater or equal was not found\n return find_mimimum_digit(digit_occurrences)\n\n\ndef find_minimum_moriartys_flicks(sherlocks_card, moriartys_digits_occurrences):\n moriartys_flicks = 0\n for sherlocks_digit in sherlocks_card:\n # looking for a digit greater or queal than sherlocks guarantees minimum possible number of flicks Moriarty will get\n moriartys_digit = find_next_moriatys_digit(\n sherlocks_digit, moriartys_digits_occurrences)\n if (sherlocks_digit > moriartys_digit):\n moriartys_flicks += 1\n moriartys_digits_occurrences[moriartys_digit] = moriartys_digits_occurrences[moriartys_digit] - 1\n return moriartys_flicks\n\n\ndef find_maximum_sherlocks_flicks(sherlocks_card, moriartys_digits_occurrences):\n sherlocks_flicks = 0\n for sherlocks_digit in sherlocks_card:\n # looking for a digit greater than sherlocks guarantees maximum possible number of flicks that Sherlock can get from Moriarty\n moriartys_digit = find_next_moriatys_digit(\n sherlocks_digit + 1, moriartys_digits_occurrences)\n if (moriartys_digit > sherlocks_digit):\n sherlocks_flicks += 1\n moriartys_digits_occurrences[moriartys_digit] = moriartys_digits_occurrences[moriartys_digit] - 1\n return sherlocks_flicks\n\n\ndef solve(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_digits_occurrences = get_digits_occurrences(moriartys_card)\n moriartys_flicks = find_minimum_moriartys_flicks(\n sherlocks_card, moriartys_digits_occurrences.copy())\n sherlocks_flicks = find_maximum_sherlocks_flicks(\n sherlocks_card, moriartys_digits_occurrences.copy())\n return moriartys_flicks, sherlocks_flicks\n\n\n# Read input\nnumber_of_digits = int(input())\nsherlocks_card = [int(x) for x in input()]\nmoriartys_card = [int(x) for x in input()]\nmoriartys_flicks, sherlocks_flicks = solve(\n number_of_digits, sherlocks_card, moriartys_card)\nprint(moriartys_flicks)\nprint(sherlocks_flicks)\n", "n = int(input())\nsc = list(input())\nmc = list(input())\n\n#min flicks mc\n#max flicks sc\n\n#1234567 mc\n#4567899 sc\n\nsc.sort()\nmc.sort()\n\ni = 0\nj = 0\navoided = 0\nwhile i < len(mc) and j < len(sc):\n\tif mc[i] < sc[j]:\n\t\ti += 1\n\telse:\n\t\ti += 1\n\t\tj += 1\n\t\tavoided += 1\nmin_flicks = n - avoided\n\n#123\n#123\ni = 0\nj = 0\nmax_flicks = 0\nwhile i < len(mc) and j < len(sc):\n\tif mc[i] <= sc[j]:\n\t\ti += 1\n\telse:\n\t\ti += 1\n\t\tj += 1\n\t\tmax_flicks += 1\n\nprint(min_flicks)\nprint(max_flicks)\n", "def main():\r\n n = int(input())\r\n sherlock = input()\r\n moriarti = input()\r\n\r\n sherlock_set = [0] * 10\r\n moriarti_set = [0] * 10\r\n\r\n for i in range(n):\r\n sherlock_set[int(sherlock[i])] += 1\r\n moriarti_set[int(moriarti[i])] += 1\r\n\r\n moriarti_min_pizdyuley = n\r\n for i in range(10):\r\n while sherlock_set[i] > 0:\r\n was_changed = False\r\n for j in range(i, 10):\r\n if moriarti_set[j] > 0:\r\n moriarti_set[j] -= 1\r\n sherlock_set[i] -= 1\r\n moriarti_min_pizdyuley -= 1\r\n was_changed = True\r\n break\r\n if not was_changed:\r\n break\r\n\r\n print(moriarti_min_pizdyuley)\r\n\r\n\r\n\r\n sherlock_set = [0] * 10\r\n moriarti_set = [0] * 10\r\n\r\n for i in range(n):\r\n sherlock_set[int(sherlock[i])] += 1\r\n moriarti_set[int(moriarti[i])] += 1\r\n\r\n sherlock_max_pizdyuley = 0\r\n for i in range(10):\r\n while sherlock_set[i] > 0:\r\n was_changed = False\r\n for j in range(i + 1, 10):\r\n if moriarti_set[j] > 0:\r\n moriarti_set[j] -= 1\r\n sherlock_set[i] -= 1\r\n sherlock_max_pizdyuley += 1\r\n was_changed = True\r\n break\r\n if not was_changed:\r\n break\r\n\r\n print(sherlock_max_pizdyuley)\r\n\r\n\r\nmain()", "n = int(input())\nsh = input()\nmo = sorted(input())\n\nused = [False for _ in range(n)]\ncount1 = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif mo[j] > sh[i] and not used[j]:\n\t\t\tused[j] = True\n\t\t\tcount1 += 1\n\t\t\tbreak\n\nused = [False for _ in range(n)]\ncount2 = n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif mo[j] >= sh[i] and not used[j]:\n\t\t\tused[j] = True\n\t\t\tcount2 -= 1\n\t\t\tbreak\n\nprint(count2)\nprint(count1)\n", "n = int(input())\r\nb = sorted(list(map(int, input())))\r\na = sorted(list(map(int, input())))\r\n\r\nj = 0\r\ngood = 0\r\nbad = n\r\nfor i in range(n):\r\n if a[i]>=b[j]:\r\n bad -= 1\r\n j += 1\r\nj = 0\r\nfor i in range(n):\r\n if a[i]>b[j]:\r\n j+=1\r\n good+=1\r\n \r\nprint(bad)\r\nprint(good)", "n = int(input())\na = input()\nb = input()\n\n# For minimum kelani\nx = sorted(list(a))\ny = sorted(list(b))\nminm = 0\nfor i in y:\n for j in range(len(x)):\n if x[j] <= i:\n x.pop(j)\n break\n else:\n minm += 1 #Kelani khelo\nprint(minm) # Minimum kelani\n\n# Maximum sherlock gets\nx = sorted(list(a))\ny = sorted(list(b))\nmaxm = 0\nfor i in x:\n for j in range(len(y)):\n if i < y[j]:\n maxm += 1\n y.pop(j)\n break\nprint(maxm)", "\r\nn=int(input())\r\ns1=sorted(list(input()))\r\ns2=input()\r\ns2=list(sorted(s2))\r\nans1=0\r\nj=0\r\ni=0\r\nwhile i<len(s1) and j<len(s2):\r\n if s1[i]<s2[j]:\r\n i+=1\r\n j+=1\r\n ans1+=1\r\n else :\r\n j+=1\r\nans2=0\r\ni=0\r\nj=0\r\nwhile 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 ans2+=1\r\n j+=1\r\nprint(ans2)\r\n\r\nprint(ans1)\r\n", "n=int(input())\r\ns1=input()\r\ns2=input()\r\nl1=list(s1)\r\nl2=list(s2)\r\nl1.sort()\r\nl2.sort()\r\nl1.append(0)\r\nt=0\r\nx=l1[t]\r\nfor i in l2:\r\n if i>=x:\r\n t+=1\r\n x=l1[t]\r\nprint(n-t)\r\nf=0\r\nx=l1[f]\r\nfor i in l2:\r\n if i>x:\r\n f+=1\r\n x=l1[f]\r\nprint(f)\r\n\r\n", "n = int(input())\r\ns = list(sorted([int(i) for i in input()]))\r\nm = list(sorted([int(i) for i in input()]))\r\nk1 = 0\r\nsi = 0\r\nmi = 0\r\nwhile mi < n:\r\n while mi < n and m[mi] < s[si]:\r\n mi += 1\r\n k1 += 1\r\n mi += 1\r\n si += 1\r\n\r\nprint(k1)\r\n\r\nk2 = 0\r\nsi = 0\r\nmi = 0\r\nwhile mi < n:\r\n while mi < n and m[mi] <= s[si]: mi += 1\r\n if mi < n and m[mi] > s[si]: k2 += 1\r\n mi += 1\r\n si += 1\r\nprint(k2)\r\n", "def solve():\n input()\n x = list(map(int, list(str(input().rstrip()))))\n y = list(map(int, list(str(input().rstrip()))))\n x.sort()\n y.sort()\n count1 = 0\n i1 = 0\n i2 = 0\n while i1 < len(x) and i2 < len(y):\n if x[i1] > y[i2]:\n count1 += 1\n i2 += 1\n else:\n i2 += 1\n i1 += 1\n print(count1)\n count2 = 0\n i1 = 0\n i2 = 0\n while i1 < len(x) and i2 < len(y):\n if x[i1] >= y[i2]:\n i2 += 1\n else:\n count2 += 1\n i2 += 1\n i1 += 1\n print(count2)\n\nif __name__ == '__main__':\n solve()\n", "n = int(input())\r\ns = input()\r\nm = input()\r\nsherlock = []\r\nmority = []\r\n\r\n\r\nfor i in range(len(s)):\r\n sherlock.append(int(s[i]))\r\n\r\nfor i in range(len(m)):\r\n mority.append(int(m[i]))\r\n\r\nreverseCount = [0]*11\r\n\r\nfor i in range(len(sherlock)):\r\n reverseCount[int(mority[i])] += 1\r\n\r\nhits = 0\r\np = sorted(mority)\r\nfor i in range(len(sherlock)):\r\n j = 0\r\n while True:\r\n if int(sherlock[i]) <= int(p[j]):\r\n hits += 1\r\n p[j] = -254\r\n break\r\n\r\n if j < len(p) - 1:\r\n j += 1\r\n else:\r\n break\r\n\r\nprint(len(sherlock) - hits)\r\nreversehits = 0\r\nfor i in range(len(sherlock)):\r\n j = 1\r\n while True:\r\n if reverseCount[int(sherlock[i]) + j] > 0:\r\n reversehits += 1\r\n reverseCount[int(sherlock[i]) + j] -= 1\r\n break\r\n\r\n if int(sherlock[i]) + j < len(reverseCount) - 1:\r\n j += 1\r\n else:\r\n break\r\nprint(reversehits)\r\n\r\n\r\n", "n = int(input())\r\na = list(input())\r\nb = list(input())\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\na = sorted(a)\r\nb = sorted(b)\r\nnum1 = 0\r\ni, j = 0, 0\r\nwhile i < n and j < n:\r\n if a[i] <= b[j]:\r\n num1 += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\ni = n - 1\r\nj = n - 1\r\nnum2 = 0\r\nwhile i >= 0 and j >= 0:\r\n if b[j] > a[i]:\r\n num2 += 1\r\n j -= 1\r\n i -= 1\r\n else:\r\n i -= 1\r\n\r\nprint(n - num1)\r\nprint(num2)\r\n", "n = int(input())\na = sorted(list(input()))\nb = sorted(list(input()))\ny = 0\nx = 0\nj = 0\nt = 0\nfor i in range(n):\n if b[i] >= a[t]:\n t += 1\n x += 1\n if b[i] > a[j]:\n y += 1\n j += 1\nprint(n - x)\nprint(y)\n", "input()\r\ns = sorted([int(i) for i in list(input())])\r\nm = sorted([int(i) for i in list(input())])\r\n\r\nq = 0\r\nj = 0\r\nfor i in range(len(s)):\r\n while j < len(m) and m[j] < s[i]:\r\n q += 1\r\n j += 1\r\n j += 1\r\n\r\nprint(q)\r\n\r\nq = 0\r\nj = 0\r\nfor i in range(len(s)):\r\n while j < len(m) and m[j] <= s[i]:\r\n j += 1\r\n if j < len(m):\r\n j += 1\r\n q += 1\r\n\r\nprint(q)\r\n", "# https://codeforces.com/problemset/problem/777/B\n# Problem\n# Big O:\n# Time complexity: O(n log (n)) + 2*(O(n) + O(n))*O(k) = O(n)*O(k)\n# Space complexity: 3*O(n) = O(n)\n\n# Problem\n\n\ndef value_index_greater_or_equal_than(ordered_list, number):\n for i in range(0, len(ordered_list)):\n element = ordered_list[i]\n if element >= number:\n return i\n return -1\n\n\n# def flicks(sherlocks_card, sorted_moriarty_card, prefer_greater_digit):\n# moriartys_flicks = 0\n# sherlocks_flicks = 0\n\n# for sherlocks_digit in sherlocks_card:\n# increment = 1 if prefer_greater_digit else 0\n# index = value_index_greater_or_equal_than(\n# sorted_moriarty_card, sherlocks_digit + increment)\n# index = index if index >= 0 else 0\n# moriartys_digit = sorted_moriarty_card[index]\n# if (moriartys_digit > sherlocks_digit):\n# sherlocks_flicks += 1\n# elif (moriartys_digit < sherlocks_digit):\n# moriartys_flicks += 1\n# sorted_moriarty_card.pop(index)\n# return moriartys_flicks, sherlocks_flicks\n\n\n# def minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n# moriartys_flicks, _ = flicks(sherlocks_card, sorted_moriarty_card, False)\n# return moriartys_flicks\n\n\n# def maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n# _, sherlocks_flicks = flicks(sherlocks_card, sorted_moriarty_card, True)\n# return sherlocks_flicks\n\n\ndef minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n moriartys_flicks = 0\n for digit in sherlocks_card:\n # guarantees minimum possible number of flicks Moriarty will get\n index = value_index_greater_or_equal_than(\n sorted_moriarty_card, digit)\n if (index >= 0):\n sorted_moriarty_card.pop(index)\n else:\n moriartys_flicks += 1\n sorted_moriarty_card.pop(0)\n return moriartys_flicks\n\n\ndef maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n sherlocks_flicks = 0\n for digit in sherlocks_card:\n # guarantees maximum possible number of flicks that Sherlock can get from Moriarty\n index = value_index_greater_or_equal_than(\n sorted_moriarty_card, digit + 1)\n if (index >= 0):\n sherlocks_flicks += 1\n sorted_moriarty_card.pop(index)\n else:\n sorted_moriarty_card.pop(0)\n return sherlocks_flicks\n\n\ndef solve_old(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_card.sort()\n min_moriartys_flicks = minimum_moriartys_flicks(\n sherlocks_card, moriartys_card.copy())\n max_sherlocks_flicks = maximum_sherlocks_flicks(\n sherlocks_card, moriartys_card.copy())\n\n return min_moriartys_flicks, max_sherlocks_flicks\n\n\ndef get_digits_occurrences(card):\n occurrences = {}\n for digit in card:\n digit_occurrences = occurrences.get(digit, 0)\n occurrences[digit] = digit_occurrences + 1\n return occurrences\n\n\ndef find_greater_or_equal_digit(digit, digit_occurrences):\n for i in range(digit, 10):\n occurrences = digit_occurrences.get(i, -1)\n if occurrences > 0:\n return i\n\n return -1\n\n\ndef find_mimimum_digit(digit_occurrences):\n for i in range(0, 10):\n occurrences = digit_occurrences.get(i, -1)\n if occurrences > 0:\n return i\n return -1\n\n\ndef find_next_moriatys_digit(sherlocks_digit, digit_occurrences):\n # Looks for greater or equal digit\n digit_found = find_greater_or_equal_digit(\n sherlocks_digit, digit_occurrences)\n\n if (digit_found >= 0):\n return digit_found\n\n # Looks for minimum digit, since greater or equal was not found\n return find_mimimum_digit(digit_occurrences)\n\n\ndef find_minimum_moriartys_flicks(sherlocks_card, moriartys_digits_occurrences):\n moriartys_flicks = 0\n for sherlocks_digit in sherlocks_card:\n # looking for a digit greater or queal than sherlocks guarantees minimum possible number of flicks Moriarty will get\n moriartys_digit = find_next_moriatys_digit(\n sherlocks_digit, moriartys_digits_occurrences)\n if (sherlocks_digit > moriartys_digit):\n moriartys_flicks += 1\n moriartys_digits_occurrences[moriartys_digit] = moriartys_digits_occurrences[moriartys_digit] - 1\n return moriartys_flicks\n\n\ndef find_maximum_sherlocks_flicks(sherlocks_card, moriartys_digits_occurrences):\n sherlocks_flicks = 0\n for sherlocks_digit in sherlocks_card:\n # looking for a digit greater than sherlocks guarantees maximum possible number of flicks that Sherlock can get from Moriarty\n moriartys_digit = find_next_moriatys_digit(\n sherlocks_digit + 1, moriartys_digits_occurrences)\n if (moriartys_digit > sherlocks_digit):\n sherlocks_flicks += 1\n moriartys_digits_occurrences[moriartys_digit] = moriartys_digits_occurrences[moriartys_digit] - 1\n return sherlocks_flicks\n\n\ndef solve(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_digits_occurrences = get_digits_occurrences(moriartys_card)\n moriartys_flicks = find_minimum_moriartys_flicks(\n sherlocks_card, moriartys_digits_occurrences.copy())\n sherlocks_flicks = find_maximum_sherlocks_flicks(\n sherlocks_card, moriartys_digits_occurrences.copy())\n return moriartys_flicks, sherlocks_flicks\n\n\n# Read input\nnumber_of_digits = int(input())\nsherlocks_card = [int(x) for x in input()]\nmoriartys_card = [int(x) for x in input()]\nmoriartys_flicks, sherlocks_flicks = solve(\n number_of_digits, sherlocks_card, moriartys_card)\nprint(moriartys_flicks)\nprint(sherlocks_flicks)\n", "n = int(input())\ns = sorted(input())\nm = sorted(input())\n\ncnt1 = n\ncnt2 = 0\n\ni = 0\nj = 0\nwhile i < n and j < n:\n if s[i] <= m[j]:\n cnt1 -= 1\n i += 1\n j += 1\n else:\n j += 1\n\ni = 0\nj = 0\nwhile i < n and j < n:\n if s[i] < m[j]:\n cnt2 += 1\n i += 1\n j += 1\n else:\n j += 1\nprint(cnt1)\nprint(cnt2)", "#for _ in range(int(input())):\r\n #n,k= map(int, input().split())\r\n#from collections import Counter\r\nn=input()\r\na=list(sorted(input()))\r\nb=list(sorted(input()))\r\nj=0\r\nfor c in b:\r\n if c>=a[j]:\r\n j+=1\r\nprint(len(a)-j)\r\nj=0\r\nfor c in b:\r\n if c>a[j]:\r\n j+=1\r\nprint(j)", "n = int(input())\r\nsher = [int(x) for i,x in enumerate(input())]\r\nmor = [int(x) for i,x in enumerate(input())]\r\nsher.sort()\r\nmor.sort()\r\nk,res=0,0\r\nfor i,x in enumerate(mor):\r\n if x<sher[k]:\r\n res+=1\r\n else:\r\n k+=1\r\nres2,k=0,0\r\nfor i,x in enumerate(mor):\r\n if x>sher[k]:\r\n res2+=1\r\n k+=1\r\nprint(res)\r\nprint(res2)", "n = int(input())\n\ns = list(map(int,list(input())))\nm = list(map(int,list(input())))\n\ns.sort(reverse=True)\nm.sort(reverse=True)\n\ni=0\nj=0\n\nmaxWinMor=0\nwhile(i<n and j<n):\n if(m[j]>=s[i]):\n j += 1\n i += 1\n maxWinMor += 1\n else:\n i += 1\n\ni=n-1\nj=n-1\nmaxSlapsSher = 0\nwhile(i>-1 and j>-1):\n if(m[j]>s[i]):\n maxSlapsSher += 1\n i -= 1\n j -= 1\n else:\n j -= 1\n\nprint(n-maxWinMor)\nprint(maxSlapsSher)\n", "n = int(input())\r\nmass1 = list(map(int, list(input())))\r\nmass2 = list(map(int, list(input())))\r\nmass3 = mass2[:]\r\nkol1 = 0\r\nkol2 = n\r\nfor i in range(0, len(mass1)):\r\n now = mass1[i]\r\n mass_dif1 = []\r\n mass_dif2 = []\r\n for j in range(0, len(mass2)):\r\n if mass2[j] != -1 and mass2[j]-now > 0:\r\n mass_dif1.append([mass2[j]-now, j])\r\n if mass3[j] != -1 and mass3[j]-now >= 0:\r\n mass_dif2.append([mass3[j]-now, j])\r\n mass_dif1.sort()\r\n mass_dif2.sort()\r\n if len(mass_dif1) > 0:\r\n mass2[mass_dif1[0][1]] = -1\r\n kol1 += 1\r\n if len(mass_dif2) > 0:\r\n mass3[mass_dif2[0][1]] = -1\r\n kol2 -= 1\r\nprint(kol2)\r\nprint(kol1)", "input()\r\na=sorted(input())\r\nb=sorted(input())\r\nj=0\r\nfor i in b:\r\n if(i>=a[j]):\r\n j+=1\r\nprint(len(a)-j)\r\nj=0\r\nfor i in b:\r\n if(i>a[j]):\r\n j+=1\r\nprint(j)\r\n", "\r\nn = int(input()) #1000\r\nil = [int(c) for c in input()]\r\njl = [int(c) for c in input()]\r\n\r\nil.sort()\r\njl.sort()\r\ni = 0\r\nj = 0\r\nlc = 0\r\nwhile j<n:\r\n if jl[j]>=il[i]:\r\n i += 1\r\n else:\r\n lc += 1\r\n j += 1\r\nprint(lc) #min # of lose\r\ni = 0\r\nj = 0\r\nwc = 0\r\nwhile j<n:\r\n if jl[j]>il[i]:\r\n i += 1\r\n wc += 1\r\n j += 1\r\nprint(wc) #max # of win\r\n\r\n", "n = int(input())\r\ns1 = input()\r\ns2 = input()\r\nl1 = [int(i) for i in s1]\r\nl2 = [int(i) for i in s2]\r\nl2.sort()\r\nl22 = l2.copy()\r\ncmi = 0\r\nfor i in l1:\r\n for j in l2:\r\n if j>=i:\r\n l2.remove(j)\r\n break\r\n else:\r\n cmi = cmi + 1\r\ncma = 0\r\nfor i in l1:\r\n for j in l22:\r\n if j>i:\r\n l22.remove(j)\r\n cma = cma + 1\r\n break\r\n\r\nprint(cmi)\r\nprint(cma)\r\n", "n = int(input())\r\ns = list(map(int, input()))\r\nm = list(map(int, input()))\r\n\r\n# moriarty\r\nmor_s = sorted(s)\r\nmor_m = sorted(m)\r\n\r\nmoriarty = 0\r\nfor i in range(n):\r\n number = mor_s[i]\r\n for j in range(n):\r\n if mor_m[j] != \"used\" and mor_m[j] >= number:\r\n mor_m[j] = \"used\"\r\n moriarty += 1\r\n break\r\n\r\nprint(n - moriarty)\r\n\r\n# sherlock\r\nshe_s = sorted(s)\r\nshe_m = sorted(m)\r\n\r\nsherlock = 0\r\nshe_s = she_s[::-1]\r\nfor i in range(n):\r\n if she_s[i] < she_m[-1]:\r\n sherlock += 1\r\n she_m.pop(-1)\r\n\r\nprint(sherlock)", "n=int(input())\na=input()\na=[int(i) for i in a]\nb=input()\nb=[int(i) for i in b]\na.sort()\nb.sort()\ni=j=ma=mi=0\nwhile i<n and j<n:\n\tif b[j]>a[i]:\n\t\tma+=1\n\t\tj+=1\n\t\ti+=1\n\telse:\n\t\tj+=1\ni=j=0\nwhile i<n and j<n:\n\tif b[j]>=a[i]:\n\t\tmi+=1\n\t\tj+=1\n\t\ti+=1\n\telse:\n\t\tj+=1\nprint(n-mi)\nprint(ma)\n", "a = int(input())\r\nb = sorted(input())\r\nc = sorted(input())\r\nx = 0\r\nfor i in c:\r\n if i >= b[x]:\r\n x += 1\r\ny = 0\r\nfor i in c:\r\n if i > b[y]:\r\n y += 1\r\nprint(a-x, y)\r\n", "from bisect import bisect_right,bisect_left\r\n#sys.setrecursionlimit(10**9)\r\n#threading.stack_size(10**8)\r\n\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\ns=si()\r\nw=si()\r\n\r\nmins=list(map(int,sorted(s)))\r\nminw=list(map(int,sorted(w)))\r\nminc=0\r\nmaxw=minw.copy()\r\n\r\nfor i in mins:\r\n rr=bisect_left(minw,i,0,len(minw))\r\n if rr==len(minw):\r\n minw.pop()\r\n minc+=1\r\n \r\n else:\r\n minw.pop(rr)\r\n \r\n\r\nmaxc=0\r\n\r\nfor i in mins:\r\n ll=bisect_right(maxw,i,0,len(maxw))\r\n if ll==len(maxw):\r\n maxw.pop()\r\n \r\n else:\r\n maxw.pop(ll)\r\n maxc+=1\r\n \r\nprint(minc)\r\nprint(maxc)\r\n \r\n\r\n ", "from collections import Counter\r\n\r\n\r\ndef flicks(a, b, mx=False):\r\n a_counter = Counter(a)\r\n b_counter = Counter(b)\r\n res = 0\r\n for i in a:\r\n for j in range(i+mx, 10):\r\n if j in b_counter and b_counter[j] > 0:\r\n b_counter[j] -= 1\r\n res += 1\r\n break\r\n if not mx:\r\n return len(a) - res\r\n return res\r\n\r\n\r\n_ = input()\r\na = [int(i) for i in input()]\r\nb = [int(i) for i in input()]\r\na.sort()\r\nb.sort()\r\nprint(flicks(a, b))\r\nprint(flicks(a, b, True))\r\n", "#!/usr/bin/env python3\n# -*- coding='utf-8' -*-\n\nn = int(input())\na = list(map(int, list(input())))\nb = list(map(int, list(input())))\n\ncnt1 = 10*[0]\ncnt2 = 10*[0]\nb.sort()\n\nfor i in range(10):\n cnt1[i] = a.count(i) if i == 0 else a.count(i) + cnt1[i - 1]\n cnt2[9 - i] = a.count(9 - i) if i == 0 else a.count(9 - i) + cnt2[10 - i]\n\nans1 = ans2 = 0\nfor num in b:\n if cnt1[num] - ans1 > 0:\n ans1 += 1\n if num and cnt1[num - 1] - ans2 > 0:\n ans2 += 1\n\n\nprint(n - ans1)\nprint(ans2)\n", "N = int(input())\r\ncard1 = sorted(str(input()))\r\ncard2 = sorted(str(input()))\r\n\r\np1 = N - 1\r\np2 = N - 1\r\ncount_max = 0\r\nfor i in range(0, N):\r\n if card2[p2] > card1[p1]:\r\n p2 -= 1\r\n count_max += 1\r\n p1 -= 1\r\n \r\np1 = 0\r\np2 = 0\r\ncount_min = 0\r\nfor i in range (0, N):\r\n if card2[p2] >= card1[p1]:\r\n p1 += 1\r\n else:\r\n count_min += 1\r\n p2 += 1\r\n \r\nprint(count_min, count_max, sep = \"\\n\")", "n=int(input())\r\na=[]\r\nb=[]\r\nx=input()\r\ny=input()\r\nfor i in range(n):\r\n\ta.append(int(x[i]))\r\nfor i in range(n):\r\n\tb.append(int(y[i]))\r\ni=0\r\nj=0\r\na.sort()\r\nb.sort()\r\nc=0\r\nd=0\r\nwhile(i<n and j<n):\r\n\tif(a[i]<=b[j]):\r\n\t\tc+=1\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telse:\r\n\t\tj+=1\r\ni=0\r\nj=0\r\nwhile(i<n and j<n):\r\n\tif(a[i]<b[j]):\r\n\t\td+=1\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telse:\r\n\t\tj+=1\r\nprint (n-c)\r\nprint (d)", "n=int(input())\r\ns=input()\r\ns=[s[i] for i in range(n)]\r\nm=input()\r\nm=[m[i] for i in range(n)]\r\ns.sort(reverse=True)\r\nm.sort(reverse=True)\r\ni=0\r\nj=0\r\na=0\r\nwhile i<n and j<n:\r\n if(s[i]>m[j]):\r\n i+=1\r\n a+=1\r\n else:\r\n i+=1\r\n j+=1\r\nprint(a)\r\ni=0\r\nj=0\r\nb=0\r\nwhile i<n and j<n:\r\n if(m[j]>s[i]):\r\n i+=1\r\n j+=1\r\n b+=1\r\n else:\r\n i+=1\r\nprint(b)", "n=int(input())\r\na=list(map(int,input()))\r\nb=list(map(int,input()))\r\na.sort()\r\nb.sort()\r\nx,y=0,0\r\n#print(*a,*b)\r\nfor i in range(0,n):\r\n if b[i]>=a[x]:\r\n x+=1\r\n if b[i]>a[y]:\r\n y+=1\r\nprint(n-x)\r\nprint(y)\r\n", "N = int( input() )\r\nA = list( int( v ) for v in list( input() ) )\r\nB = list( int( v ) for v in list( input() ) )\r\n\r\nmin_hit = 0\r\ncnt = [ 0 for i in range( 10 ) ]\r\nfor v in B:\r\n cnt[ v ] += 1\r\nfor v in A:\r\n ok = False\r\n for i in range( v, 10 ):\r\n if cnt[ i ] > 0:\r\n ok = True\r\n cnt[ i ] -= 1\r\n break\r\n if not ok:\r\n min_hit += 1\r\n for i in range( 0, 10 ):\r\n if cnt[ i ] > 0:\r\n cnt[ i ] -= 1\r\n break\r\n\r\nmax_hit = 0\r\ncnt = [ 0 for i in range( 10 ) ]\r\nfor v in B:\r\n cnt[ v ] += 1\r\nfor v in A:\r\n ok = False\r\n for i in range( v + 1, 10 ):\r\n if cnt[ i ] > 0:\r\n ok = True\r\n max_hit += 1\r\n cnt[ i ] -= 1\r\n break\r\n if not ok:\r\n for i in range( 0, 10 ):\r\n if cnt[ i ] > 0:\r\n cnt[ i ] -= 1\r\n break\r\n\r\nprint( min_hit, max_hit, sep = '\\n' )\r\n", "##f = open(\"A.in\")\r\n##g = open(\"B.out\",'w')\r\nN = int(input())##int(f.readline())\r\nA = [0]*10\r\nB = [0]*10\r\n\r\nfor i in range(2):\r\n st = input()##f.readline()\r\n \r\n for j in st:\r\n ##print(j)\r\n if (i == 0) & (j!='\\n'):\r\n A[int(j)] += 1\r\n elif (j!='\\n'):\r\n B[int(j)] += 1\r\n##print(A,B)\r\nAm = A[:]\r\nBm = B[:]\r\ni = 0\r\nj = 0\r\nSum = 0\r\n##print(Bm,Am)\r\nwhile (i<10)&(j<10):\r\n while i<10:\r\n if Am[i] == 0:\r\n i += 1\r\n else:\r\n break\r\n j = i+1\r\n while j<10:\r\n if Bm[j] == 0:\r\n j += 1\r\n else:\r\n break\r\n if (j>=10)|(i>=10):\r\n break\r\n if Am[i]>Bm[j]:\r\n Sum+=Bm[j]\r\n Am[i] -= Bm[j]\r\n Bm[j] = 0\r\n elif Am[i]<=Bm[j]:\r\n Sum+=Am[i]\r\n Bm[j] -= Am[i]\r\n Am[i] = 0\r\n##print(A,B)\r\nmi = 0\r\ni = 9\r\nj = 9\r\nwhile i>=0:\r\n while i>=0:\r\n if A[i] == 0:\r\n i -= 1\r\n else:\r\n break\r\n j = i\r\n while j<10:\r\n if B[j] == 0:\r\n j += 1\r\n else:\r\n break\r\n if j == 10:\r\n mi = mi + A[i]\r\n i = i - 1\r\n elif A[i]>B[j]:\r\n A[i] -= B[j]\r\n B[j] = 0\r\n elif A[i]<=B[j]:\r\n B[j] -= A[i]\r\n A[i] = 0\r\nprint(mi)##,file=g)\r\nprint(Sum)##,file=g)\r\n##g.close()\r\n##f.close()\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\na = input()\r\nb = input()\r\nhb = [0 for i in range(10)]\r\n\r\nfor i in range(n):\r\n hb[ord(b[i])-ord('0')] += 1\r\n\r\nh = list(hb)\r\n\r\nfmin = 0\r\nfor i in range(n):\r\n x = ord(a[i])-ord('0')\r\n for i in range(10):\r\n y = (x+i)%10\r\n if h[y] > 0:\r\n h[y] -= 1\r\n if x > y:\r\n fmin += 1\r\n break\r\n\r\nh = list(hb)\r\nfmax = 0\r\nfor i in range(n):\r\n x = ord(a[i])-ord('0')\r\n for i in range(10):\r\n y = (x+i+1)%10\r\n if h[y] > 0:\r\n h[y] -= 1\r\n if x < y:\r\n fmax += 1\r\n break\r\nprint(fmin)\r\nprint(fmax)\r\n", "sherlock = [0]*10\nmoriarty = [0]*10\ntotal = int(input())\nfor x in input():\n sherlock[int(x)]+=1\n\nfor x in input():\n moriarty[int(x)]+=1\n\nmaximum = 0\nc=[0]*10\n\ndef maximum(s,m):\n sc,mc = s[:],m[:]\n m = 0\n for x in range(9):\n val = sc[x]\n while val != 0:\n if x == 9:\n break\n cpy = mc[(x+1) % 10]\n mc[( x + 1 ) % 10] = max(0, cpy - val)\n val = max(0, val - cpy)\n x += 1\n print(total - sum(mc))\n\ndef minimum(s,m):\n sc,mc = s[:],m[:]\n m = 0\n for x in range(10):\n val = sc[x]\n while val != 0:\n if x == 10:\n break\n cpy = mc[x]\n mc[x] = max(0, cpy - val)\n val = max(0, val - cpy)\n x += 1\n print(sum(mc))\n\nminimum(sherlock, moriarty)\nmaximum(sherlock,moriarty)\n", "n = int(input())\r\ns = input()\r\nm = input()\r\ns = list(map(int,s))\r\nm = list(map(int,m))\r\nm.sort()\r\ns.sort()\r\nm.reverse()\r\ns.reverse()\r\npi , pj , count = 0,0,0\r\nwhile(pi < n and pj < n):\r\n if m[pj] < s[pi]:\r\n count += 1\r\n pi += 1\r\n #pj += 1\r\n elif m[pj] == s[pi]:\r\n pi += 1\r\n pj += 1\r\n else:\r\n pi += 1\r\n pj += 1\r\nprint(count)\r\npi , pj , count = 0,0,0\r\nwhile(pi < n and pj < n):\r\n if m[pj] < s[pi]:\r\n #count += 1\r\n pi += 1\r\n #pj += 1\r\n elif m[pj] == s[pi]:\r\n pi += 1\r\n #pj += 1\r\n else:\r\n pi += 1\r\n pj += 1\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\n\r\nc = [int(x) for x in list(input())]\r\nd = [int(x) for x in list(input())]\r\n\r\nc.sort()\r\nd.sort()\r\n\r\ni, j, k = 0, 0, 0\r\nwhile i < n and j < n:\r\n #print(i, j)\r\n if c[i] <= d[j]: i += 1\r\n else: k += 1\r\n j += 1\r\n\r\nprint(k)\r\ni, j, k = 0, 0, 0\r\nwhile i < n and j < n:\r\n #print(i, j)\r\n if c[i] < d[j]: k += 1; i += 1\r\n j += 1\r\nprint(k)", "n = int(input())\r\naa = list(map(int, input()))\r\nbb = list(map(int, input()))\r\n\r\naa.sort(reverse=True)\r\nbb.sort(reverse=True)\r\n\r\n\r\ndef solve1():\r\n a = aa\r\n b = bb.copy()\r\n\r\n ans = 0\r\n\r\n for aj in a:\r\n if aj > b[0]:\r\n ans += 1\r\n b.pop(-1)\r\n else:\r\n i = 0\r\n for j in range(1, len(b)):\r\n if aj <= b[j]:\r\n i = j\r\n else:\r\n break\r\n b.pop(i)\r\n\r\n return ans\r\n\r\n\r\ndef solve2():\r\n a = aa\r\n b = bb.copy()\r\n\r\n ans = 0\r\n\r\n for aj in a:\r\n i = -1\r\n for j in range(len(b)):\r\n if aj < b[j]:\r\n i = j\r\n else:\r\n break\r\n\r\n if i >= 0:\r\n ans += 1\r\n b.pop(i)\r\n else:\r\n b.pop(-1)\r\n\r\n return ans\r\n\r\n\r\nprint(solve1())\r\nprint(solve2())\r\n", "n = int(input())\r\ns = sorted(list(map(int,list(input()))))\r\nm = list(map(int,list(input())))\r\nm.sort()\r\nm1 = 0\r\nm2 = 0\r\nfor i in range(n):\r\n if s[m1]<=m[i]:\r\n m1+=1\r\n if s[m2]<m[i]:\r\n m2+=1\r\nprint(n-m1)\r\nprint(m2)", "n = int(input())\r\nfirst_card = input()\r\nsecond_card = input()\r\nfirst_card = [int(value) for value in first_card]\r\nsecond_card = [int(value) for value in second_card]\r\n\r\nfirst_card = sorted(first_card)\r\nsecond_card = sorted(second_card)\r\n\r\nans_got = 0\r\nans_give = 0\r\nj = 0\r\nk = 0\r\n\r\nfor i in range(n):\r\n\tif second_card[i] < first_card[j]: \r\n\t\tans_got += 1\r\n\telse:\r\n\t\tj += 1\r\n\r\n\tif second_card[i] > first_card[k]:\r\n\t\tans_give += 1\r\n\t\tk += 1\r\n\telse:\r\n\t\tcontinue\r\n\r\nprint(ans_got)\r\nprint(ans_give)", "input()\r\na=list(input())\r\nb=list(input())\r\na.sort()\r\nb.sort()\r\ni,j=0,0\r\ncnt=0\r\nwhile(True):\r\n if b[i]>a[j]:\r\n i+=1\r\n j+=1\r\n cnt+=1\r\n else:\r\n i+=1\r\n if i==len(b):\r\n break\r\nx=0\r\nfor i in range(len(a)):\r\n if b[i]>=a[x]:\r\n x+=1\r\nprint(len(a)-x)\r\nprint(cnt)\r\n", "I = input\r\n\r\nx, y, n, A, B = 0, 0, int(I()), sorted(I()), sorted(I())\r\n\r\nfor i in range(n):\r\n if A[x] <= B[i]:\r\n x += 1\r\n if A[y] < B[i]:\r\n y += 1\r\n\r\nprint(n - x, y, sep='\\n')", "n=int(input())\r\nc=input()\r\nd=input()\r\na=sorted(c)\r\nb=sorted(d)\r\nj=0\r\nfor i in range(n):\r\n if(b[i]>a[j]):\r\n j=j+1\r\nq=j\r\nj=n-1\r\nfor i in range(n-1,-1,-1):\r\n if(b[j]>=a[i]):\r\n j=j-1\r\np=j+1\r\nprint(p)\r\nprint(q)\r\n", "import copy\r\nn = int(input())\r\nsherlok1 = input()\r\nmoriarti1 = input()\r\nsherlok = []\r\nmoriarti = []\r\nfor i in range(n):\r\n sherlok.append(sherlok1[i])\r\n moriarti.append(moriarti1[i])\r\ndef bubbleSort(array):\r\n swapped = False\r\n for i in range(len(array)-1,0,-1):\r\n for j in range(i):\r\n if array[j][0]>array[j+1][0]:\r\n array[j], array[j+1] = array[j+1], array[j]\r\n swapped = True\r\n if swapped:\r\n swapped = False\r\n else:\r\n break\r\n return array\r\nsherlok = bubbleSort(sherlok)\r\nmoriarti = bubbleSort(moriarti)\r\nmoriarti2 = copy.deepcopy(moriarti)\r\nmoriarti3 = copy.deepcopy(moriarti)\r\nk = 0\r\notvet = 0\r\notvet1 = 0\r\nk1 = 0\r\nfor i in range(n):\r\n if moriarti2[i-k] < sherlok[i-k]:\r\n otvet += 1\r\n nichego = moriarti2.pop(i-k)\r\n moriarti2.append(nichego)\r\n k += 1\r\n if moriarti3[i - k1] <= sherlok[i - k1]:\r\n nichego1 = moriarti3.pop(i - k1)\r\n moriarti3.append(nichego1)\r\n k1 += 1\r\n else:\r\n otvet1 += 1\r\nprint(otvet)\r\nprint(otvet1)", "n=int(input())\r\nS=input()\r\nS1=input()\r\nS=sorted(S)\r\nS1=sorted(S1)\r\nk=n\r\nk1=0\r\np=0\r\nfor i in range(n) :\r\n if S1[i]>=S[p] :\r\n k=k-1\r\n p=p+1\r\nv=-1\r\nv1=-1\r\nmi=10000000000\r\nfor i in range(n) :\r\n v=-1\r\n for j in range(n) :\r\n if int(S[i])<int(S1[j]) and abs(int(S[i])-int(S1[j]))<mi and S[i]!=-1 and S1[j]!=-1 :\r\n mi=abs(int(S[i])-int(S1[j]))\r\n v=i\r\n v1=j\r\n if v!=-1 :\r\n S[v]=-1\r\n S1[v1]=-1\r\n mi=10000000000000000\r\n k1=k1+1\r\nprint(k)\r\nprint(k1)\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "from collections import defaultdict\r\nn=int(input())\r\na=input()\r\nb=input()\r\ncount=defaultdict(lambda:0)\r\nfor i in b:\r\n count[int(i)]+=1\r\nans1=0\r\nfor i in a:\r\n for j in range(int(i),int(i)+10):\r\n if(count[j%10]>0):\r\n if(j%10<int(i)):\r\n ans1+=1\r\n count[j%10]-=1\r\n # print(i,j)\r\n break\r\n \r\ncount=defaultdict(lambda:0)\r\nfor i in b:\r\n count[int(i)]+=1\r\nans2=0\r\nfor i in a:\r\n for j in range(int(i)+1,int(i)+11):\r\n if(count[j%10]>0):\r\n if(j%10>int(i)):\r\n ans2+=1\r\n count[j%10]-=1\r\n break\r\n \r\nprint(ans1)\r\nprint(ans2)", "n = int(input())\r\n\r\nSherlock = list(input())\r\nMoriarty = sorted(list(input()))\r\n\r\ncopySherlock = [ digit for digit in Sherlock ]\r\ncopyMoriarty = [ digit for digit in Moriarty ]\r\n\r\nminHits = 0\r\nmaxHits = 0\r\n\r\n\r\n#count minHits\r\nfor i in range(n):\r\n for j in range(n):\r\n if Moriarty[j] == -1:\r\n continue\r\n \r\n if Moriarty[j] >= Sherlock[i]:\r\n Moriarty[j] = -1\r\n Sherlock[i] = -1\r\n break\r\n\r\nfor i in range(n):\r\n if Moriarty[i] != -1:\r\n minHits += 1\r\n\r\n#cout maxHits\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if copyMoriarty[j] == -1:\r\n continue\r\n if copyMoriarty[j] > copySherlock[i]:\r\n maxHits += 1\r\n copyMoriarty[j] = -1\r\n break\r\n\r\nprint( minHits )\r\nprint( maxHits )\r\n\r\n# print( Sherlock )\r\n# print( Moriarty )\r\n\r\n# print( copySherlock )\r\n# print( copyMoriarty )", "n = int(input())\r\na = list(sorted(input()))\r\nb = list(sorted(input()))\r\nans1 = ans2 = 0\r\nfor i in range(n):\r\n if b[i] >= a[ans1]:\r\n ans1 += 1\r\n if b[i] > a[ans2]:\r\n ans2 += 1\r\nprint(n - ans1)\r\nprint(ans2)", "n = int(input())\r\na = input()\r\nb = input()\r\n\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\nb_arr = []\r\nb_map = {}\r\nb_map_2 = {}\r\n\r\nfor i in range(0, len(b)):\r\n if b[i] in b_map:\r\n b_map[b[i]]+=1\r\n b_map_2[b[i]]+=1\r\n else:\r\n b_arr.append(b[i])\r\n b_map[b[i]] = 1\r\n b_map_2[b[i]] = 1\r\n\r\nb_index = 0\r\n\r\nres_1 = 0\r\n\r\nfor i in range(0, len(a)):\r\n while b_index < len(b_arr) and b_arr[b_index] < a[i]:\r\n b_index+=1\r\n\r\n while b_index < len(b_arr) and b_map[b_arr[b_index]] == 0:\r\n b_index+=1\r\n \r\n if b_index < len(b_arr):\r\n res_1+=1\r\n b_map[b_arr[b_index]]-=1\r\n\r\nb_index = 0\r\nres_2 = 0\r\n\r\nfor i in range(0, len(a)):\r\n while b_index < len(b_arr) and b_arr[b_index] <= a[i]:\r\n b_index+=1\r\n\r\n while b_index < len(b_arr) and b_map_2[b_arr[b_index]] == 0:\r\n b_index+=1\r\n \r\n if b_index < len(b_arr):\r\n res_2+=1\r\n b_map_2[b_arr[b_index]]-=1\r\n\r\n\r\nprint(n - res_1)\r\nprint(res_2)\r\n", "n = int(input())\r\nsh = list(input())\r\nmor = list(input())\r\nde = 0\r\nof = 0\r\np = 0\r\nfor i in range(n):\r\n sh[i] = int(sh[i])\r\n mor[i] = int(mor[i])\r\nsh.sort()\r\nmor.sort()\r\nmor1 = mor[:]\r\nfor i in range(n):\r\n while p < n and mor[p] < sh[i]:\r\n p += 1\r\n if p < n:\r\n de += 1\r\n p += 1\r\nde = n - de\r\np = 0\r\nfor i in range(n):\r\n while p < n and mor1[p] <= sh[i]:\r\n p += 1\r\n if p < n:\r\n of += 1\r\n p += 1\r\nprint(de)\r\nprint(of)", "import sys \r\ninput = sys.stdin.readline\r\nn=int(input())\r\nsher=input()\r\nmor=input()\r\nsher = [int(ch) for ch in sher[0:n]]\r\nmor = [(ch) for ch in mor[0:n]]\r\nsher.sort()\r\nmor.sort()\r\nx,y=0,0\r\nfor i in range(0,n):\r\n if int(mor[i])>=int(sher[x]):\r\n x+=1\r\n if int(mor[i])>int(sher[y]):\r\n y+=1\r\nprint(n-x)\r\nprint(y)", "n = int(input())\r\na = sorted(list(input()))\r\nb = sorted(list(input()), reverse = True)\r\ncnt1 = [0] * 10\r\ncnt2 = [0] * 10\r\nfor i in range(n):\r\n cnt1[ord(b[i])-48]+=1\r\n cnt2[ord(a[i])-48]+=1\r\nA = 0\r\nB = n\r\nfor i in range(n):\r\n k = ord(a[i])-48\r\n for j in range(k + 1, 10):\r\n if cnt1[j] > 0:\r\n A+=1\r\n cnt1[j]-=1\r\n break\r\n\r\nfor i in range(n):\r\n k = ord(b[i])-48\r\n for j in range(k, -1, -1):\r\n if cnt2[j] > 0:\r\n B-=1\r\n cnt2[j]-=1\r\n break\r\nprint(B) \r\nprint(A)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 16 10:08:20 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn = int(input())\r\nsl = input()\r\nmor = input()\r\narr = [0]*10\r\narr2 = [0]*10\r\nfor i in range(n):\r\n arr[int(mor[i])]+=1\r\n arr2[int(mor[i])]+=1\r\nk = 0\r\nfor i in range(n):\r\n a = int(sl[i])\r\n t = False\r\n for j in range(a,10):\r\n if arr[j] > 0:\r\n arr[j]-=1;t= True\r\n break\r\n if t == False:\r\n k+=1\r\nans = 0\r\nfor i in range(n):\r\n a = int(sl[i])\r\n for j in range(a+1,10):\r\n if arr2[j]>0:\r\n arr2[j] -= 1\r\n ans+=1\r\n break\r\nprint(k);print(ans)\r\n", "import sys\r\n#inf = float(\"inf\")\r\n#mod = 10**9+7\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\r\n#from bisect import bisect_left,bisect_right\r\n#from decimal import *,threading\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\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\nn=int(input())\r\nArr1=list(input())\r\nArr2=list(input())\r\n# solve case one ...minimum no. of punches I get\r\nfirst=sorted(Arr1)\r\nsecond=sorted(Arr2)\r\ni=0;j=0\r\ncount=0\r\nwhile i<n and j<n:\r\n if first[i]<=second[j]:\r\n count+=1\r\n i+=1;j+=1\r\n else:\r\n j+=1\r\nprint(n-count)\r\n# solve case two ...maximum no. of punches I wil give u\r\ni=0;j=0;count=0\r\nwhile i<n and j<n:\r\n if second[j]>first[i]:\r\n count+=1\r\n i+=1;j+=1\r\n else:\r\n j+=1\r\nprint(count)\r\n", "n = int(input())\r\na, b = sorted(map(int, input())), sorted(map(int, input()))\r\nb1 = b[:]\r\nres1 = j = 0\r\nfor i in range(n):\r\n while j < n and b1[j] < a[i]:\r\n j += 1\r\n if j < n:\r\n b1[i], b1[j] = b1[j], b1[i]\r\n res1 += a[i] > b1[i]\r\n\r\nb1 = b[:]\r\nres2 = j = 0\r\nfor i in range(n):\r\n while j < n and b1[j] <= a[i]:\r\n j += 1\r\n if j < n:\r\n b1[i], b1[j] = b1[j], b1[i]\r\n res2 += b1[i] > a[i]\r\nprint(res1)\r\nprint(res2)", "n = int(input())\r\ns = sorted([int(c) for c in input()])\r\nm = sorted([int(c) for c in input()])\r\n\r\ndef maximize(s,m):\r\n\ti, ans = 0, 0\r\n\tfor j in range(len(m)):\r\n\t\tif s[i] < m[j]:\r\n\t\t\ti += 1\r\n\t\t\tans += 1\r\n\treturn ans\r\ndef minimize(s,m):\r\n\tj, ans = len(m)-1, 0\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tif s[i] <= m[j]:\r\n\t\t\tj -= 1\r\n\t\telse:\r\n\t\t\tans += 1\r\n\treturn ans\r\nprint(minimize(s,m))\r\nprint(maximize(s,m))", "n = int(input())\r\ns1 = input()\r\ns2 = input()\r\n\r\nd = {}\r\nfor i in range(10):\r\n\td[i] = 0\r\nfor c in s2:\r\n\td[int(c)] += 1\r\n\r\n# min flicks\r\nflicks_saved = 0\r\nfor c in s1:\r\n\tdigit = int(c)\r\n\tfor i in range(digit,10):\r\n\t\tif d[i] > 0:\r\n\t\t\tflicks_saved += 1\r\n\t\t\td[i] -= 1\r\n\t\t\tbreak\r\nprint(n-flicks_saved)\r\n\r\n\r\nd = {}\r\nfor i in range(10):\r\n\td[i] = 0\r\nfor c in s2:\r\n\td[int(c)] += 1\r\n\r\n# max flicks \r\nflicks_inflicted = 0\r\nfor c in s1:\r\n\tdigit = int(c)\r\n\tfor i in range(digit + 1, 10):\r\n\t\tif d[i] > 0:\r\n\t\t\tflicks_inflicted += 1\r\n\t\t\td[i] -= 1\r\n\t\t\tbreak\r\nprint(flicks_inflicted)\r\n", "n = int(input())\r\ns = [int(i) for i in input()]\r\nm = [int(i) for i in input()]\r\ns.sort()\r\nm.sort()\r\nmin_ans = n\r\ncur = 0\r\nfor i in range(n):\r\n if m[i]>=s[cur]:\r\n cur+=1 \r\n min_ans-=1\r\nprint(min_ans) \r\ncur = 0\r\nmax_ans = 0\r\nfor i in range(n):\r\n if m[i]>s[cur]:\r\n cur+=1\r\n max_ans+=1\r\nprint(max_ans)", "class var:\r\n moriarty, sherlock = None, None\r\nn = int(input())\r\nsherlock, moriarty = sorted(list(str(input()))), sorted(list(str(input())))\r\nfor j in range(n):\r\n p_s, p_m = 0, j\r\n sher, mor = 0, 0\r\n for k in range(n):\r\n if sherlock[p_s] > moriarty[p_m]:\r\n mor += 1\r\n elif sherlock[p_s] < moriarty[p_m]:\r\n sher += 1\r\n p_s += 1\r\n p_m += 1\r\n p_m %= n\r\n if var.moriarty == None:\r\n var.moriarty = mor\r\n else:\r\n var.moriarty = min(var.moriarty, mor)\r\n if var.sherlock == None:\r\n var.sherlock = sher\r\n else:\r\n var.sherlock = max(var.sherlock, sher)\r\nprint(var.moriarty)\r\nprint(var.sherlock)\r\n", "def solution():\r\n n = int(input())\r\n arr1 = sorted(map(int, list(input())))\r\n arr2 = sorted(map(int, list(input())))\r\n i = j = 0\r\n mi = ma = 0\r\n for u in arr1:\r\n while i < n:\r\n if arr2[i] > u:\r\n ma += 1\r\n i += 1\r\n break\r\n i += 1\r\n while j < n:\r\n if arr2[j] < u:\r\n j += 1\r\n else:\r\n j += 1\r\n mi += 1\r\n break\r\n print(n-mi)\r\n print(ma)\r\n\r\n\r\ndef main():\r\n solution()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "a=int(input())\nb=sorted(input())\nc=sorted(input())\nx=0\nfor i in c:\n if i>=b[x]:x+=1\ny=0\nfor i in c:\n if i>b[y]:y+=1\nprint(a-x,y)\n \t \t\t \t \t \t \t \t \t \t \t\t\t", "def cards(lst1, lst2):\r\n j, lst1, lst2, result = len(lst1) - 1, sorted(lst1), sorted(lst2), list()\r\n for x in range(len(lst1) - 1, -1, -1):\r\n if lst1[x] <= lst2[j]:\r\n j -= 1\r\n result.append(j + 1)\r\n j = 0\r\n for x in range(len(lst1)):\r\n if lst2[x] > lst1[j]:\r\n j += 1\r\n result.append(j)\r\n return result\r\n\r\n\r\nn = int(input())\r\na = list(input())\r\nb = list(input())\r\nprint(*cards(a, b), sep='\\n')\r\n", "n=int(input())\r\ns1=input()\r\ns2=input()\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n l1.append(int(s1[i]))\r\n l2.append(int(s2[i]))\r\nl1.sort()\r\nl2.sort()\r\np1=0\r\np2=0\r\ndraw=0\r\nwhile(p1<n and p2<n):\r\n if(l1[p1]<=l2[p2]):\r\n draw+=1\r\n p1+=1\r\n p2+=1\r\n else:\r\n p2+=1\r\nprint(n-draw)\r\np1=0\r\np2=0\r\nwins=0\r\nwhile(p1<n and p2<n):\r\n if(l1[p1]<l2[p2]):\r\n wins+=1\r\n p1+=1\r\n p2+=1\r\n else:\r\n p2+=1\r\nprint(wins)\r\n", "n = int(input())\r\nsherlok = sorted(list(map(int,input())))\r\nmoriarti = sorted(list(map(int,input())))\r\ndefensiveAnswer = 0\r\noffensiveAnswer = 0\r\nmoriartiDefense = 0\r\nmoriartiAttack = 0\r\nfor i in sherlok:\r\n while moriartiDefense<n and i>moriarti[moriartiDefense]:\r\n moriartiDefense+=1\r\n defensiveAnswer+=1\r\n while moriartiAttack<n and i>=moriarti[moriartiAttack]:\r\n moriartiAttack+=1\r\n offensiveAnswer+=1\r\n moriartiAttack+=1\r\n moriartiDefense+=1\r\nprint(defensiveAnswer)\r\nprint(n-offensiveAnswer)\r\n \r\n\r\n", "n=int(input())\na=list(map(int,input()))\nb=list(map(int,input()))\na.sort()\nb.sort()\nsher=0\nmor=0\nfor i in range(0,n):\n\tif(b[i]>=a[sher]):\n\t\tsher=sher+1\n\tif(b[i]>a[mor]):\n\t\tmor=mor+1\nprint(n-sher)\nprint(mor)", "def main():\r\n n=int(input())\r\n string1=input()\r\n L1= [int(char) for char in string1]\r\n string2=input()\r\n L2= [int(char) for char in string2]\r\n m=0\r\n L1.sort()\r\n L2.sort()\r\n lost=0\r\n for i in range(n):\r\n for j in range(lost,n):\r\n if L2[j]>=L1[i]:\r\n m+=1\r\n lost=j+1\r\n break\r\n M=0\r\n last=0\r\n for i in range(n):\r\n for j in range(last,n):\r\n if L2[j]>L1[i]:\r\n M+=1\r\n last=j+1\r\n break\r\n print(n-m)\r\n print(M)\r\n\r\nmain()", "n=int(input())\r\nSh=sorted(input())\r\nMr=sorted(input())\r\nSh1=[]\r\nfor i in range(n):\r\n Sh1.append(Sh[i])\r\nmin=n\r\nmax=0\r\nfor i in range(n):\r\n for j in range(len(Sh1)):\r\n if Mr[i]>=Sh1[j]:\r\n min-=1\r\n Sh1.remove(Sh1[j])\r\n break\r\nfor i in range(n):\r\n for j in range(len(Sh)):\r\n if Mr[i]>Sh[j]:\r\n max+=1\r\n Sh.remove(Sh[j])\r\n break\r\nprint(min)\r\nprint(max)\r\n", "n=int(input())\r\ns=sorted(list(map(int,input())))\r\nm=sorted(list(map(int,input())))\r\n\r\nj=0\r\nmin=n\r\nfor i in m:\r\n if i>=s[j]:\r\n j,min=j+1,min-1\r\nj=0\r\nmax=0\r\nfor i in m:\r\n if i>s[j]:\r\n max,j=max+1,j+1\r\nprint(min)\r\nprint(max)", "n = int(input())\r\na = sorted(input())\r\nb = sorted(input())\r\nx, y = 0, 0\r\nfor i in b:\r\n if i >= a[x]:\r\n x += 1\r\n if i > a[y]:\r\n y += 1\r\nprint(n - x, y)", "n = int(input())\r\n\r\ns = [int(i) for i in input()]\r\nm = [int(i) for i in input()]\r\n\r\ns.sort(reverse = True)\r\nm.sort(reverse = True)\r\n\r\nkmin, kmax = 0, n-1\r\nres_min, res_max = 0, 0\r\n\r\nfor i in range(n):\r\n\tif s[i] > m[kmin]:\r\n\t\tres_min += 1\r\n\telse:\r\n\t\tkmin += 1\r\n\r\nfor i in range(n-1, -1, -1):\r\n\tif m[i] > s[kmax]:\r\n\t\tres_max += 1\r\n\t\tkmax -= 1\r\n\r\nprint(f\"{res_min}\\n{res_max}\")", "# https://codeforces.com/problemset/problem/777/B\n# Problem\n# Big O:\n# Time complexity: O(n log (n)) + 2*(O(n) + O(n))*O(k) = O(n)*O(k)\n# Space complexity: 3*O(n) = O(n)\n\n# Problem\n\n\ndef value_index_greater_or_equal_than(ordered_list, number):\n for i in range(0, len(ordered_list)):\n element = ordered_list[i]\n if element >= number:\n return i\n return -1\n\n\n# def flicks(sherlocks_card, sorted_moriarty_card, prefer_greater_digit):\n# moriartys_flicks = 0\n# sherlocks_flicks = 0\n\n# for sherlocks_digit in sherlocks_card:\n# increment = 1 if prefer_greater_digit else 0\n# index = value_index_greater_or_equal_than(\n# sorted_moriarty_card, sherlocks_digit + increment)\n# index = index if index >= 0 else 0\n# moriartys_digit = sorted_moriarty_card[index]\n# if (moriartys_digit > sherlocks_digit):\n# sherlocks_flicks += 1\n# elif (moriartys_digit < sherlocks_digit):\n# moriartys_flicks += 1\n# sorted_moriarty_card.pop(index)\n# return moriartys_flicks, sherlocks_flicks\n\n\n# def minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n# moriartys_flicks, _ = flicks(sherlocks_card, sorted_moriarty_card, False)\n# return moriartys_flicks\n\n\n# def maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n# _, sherlocks_flicks = flicks(sherlocks_card, sorted_moriarty_card, True)\n# return sherlocks_flicks\n\n\ndef minimum_moriartys_flicks(sherlocks_card, sorted_moriarty_card):\n moriartys_flicks = 0\n for digit in sherlocks_card:\n # guarantees minimum possible number of flicks Moriarty will get\n index = value_index_greater_or_equal_than(\n sorted_moriarty_card, digit)\n if (index >= 0):\n sorted_moriarty_card.pop(index)\n else:\n moriartys_flicks += 1\n sorted_moriarty_card.pop(0)\n return moriartys_flicks\n\n\ndef maximum_sherlocks_flicks(sherlocks_card, sorted_moriarty_card):\n sherlocks_flicks = 0\n for digit in sherlocks_card:\n # guarantees maximum possible number of flicks that Sherlock can get from Moriarty\n index = value_index_greater_or_equal_than(\n sorted_moriarty_card, digit + 1)\n if (index >= 0):\n sherlocks_flicks += 1\n sorted_moriarty_card.pop(index)\n else:\n sorted_moriarty_card.pop(0)\n return sherlocks_flicks\n\n\ndef solve_old(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_card.sort()\n min_moriartys_flicks = minimum_moriartys_flicks(\n sherlocks_card, moriartys_card.copy())\n max_sherlocks_flicks = maximum_sherlocks_flicks(\n sherlocks_card, moriartys_card.copy())\n\n return min_moriartys_flicks, max_sherlocks_flicks\n\n\ndef get_digits_occurrences(card):\n occurrences = {}\n for digit in card:\n digit_occurrences = occurrences.get(digit, 0)\n occurrences[digit] = digit_occurrences + 1\n return occurrences\n\n\ndef find_greater_or_equal_value(digit, digit_occurrences):\n for i in range(digit, 10):\n occurrences = digit_occurrences.get(i, -1)\n if occurrences > 0:\n return i\n\n for j in range(0, 10):\n occurrences = digit_occurrences.get(j, -1)\n if occurrences > 0:\n return j\n\n return -1\n\n\ndef find_minimum_moriartys_flicks(sherlocks_card, moriartys_digits_occurrences_original):\n moriartys_digits_occurrences = moriartys_digits_occurrences_original.copy()\n moriartys_flicks = 0\n for digit in sherlocks_card:\n value = find_greater_or_equal_value(\n digit, moriartys_digits_occurrences)\n if (digit > value):\n moriartys_flicks += 1\n moriartys_digits_occurrences[value] = moriartys_digits_occurrences[value] - 1\n return moriartys_flicks\n\n\ndef find_maximum_sherlocks_flicks(sherlocks_card, moriartys_digits_occurrences_original):\n moriartys_digits_occurrences = moriartys_digits_occurrences_original.copy()\n sherlocks_flicks = 0\n for digit in sherlocks_card:\n value = find_greater_or_equal_value(\n digit + 1, moriartys_digits_occurrences)\n if (value > digit):\n sherlocks_flicks += 1\n moriartys_digits_occurrences[value] = moriartys_digits_occurrences[value] - 1\n return sherlocks_flicks\n\n\ndef solve(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_digits_occurrences = get_digits_occurrences(moriartys_card)\n moriartys_flicks = find_minimum_moriartys_flicks(\n sherlocks_card, moriartys_digits_occurrences)\n sherlocks_flicks = find_maximum_sherlocks_flicks(\n sherlocks_card, moriartys_digits_occurrences)\n return moriartys_flicks, sherlocks_flicks\n\n\n# Read input\nnumber_of_digits = int(input())\nsherlocks_card = [int(x) for x in input()]\nmoriartys_card = [int(x) for x in input()]\nmoriartys_flicks, sherlocks_flicks = solve(\n number_of_digits, sherlocks_card, moriartys_card)\nprint(moriartys_flicks)\nprint(sherlocks_flicks)\n", "def solution2():\r\n n = int(input())\r\n arr1 = sorted([int(x) for x in input()])\r\n arr2 = sorted([int(x) for x in input()])\r\n p1 = p2 = 0\r\n for i in range(n):\r\n if arr2[i] > arr1[p1]:\r\n p1 += 1\r\n if arr2[i] >= arr1[p2]:\r\n p2 += 1\r\n print(n-p2, p1, sep=\"\\n\")\r\n\r\n\r\ndef main():\r\n solution2()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nq=input()\r\nz=input()\r\na=[]\r\nc=[]\r\nfor r in range(n):\r\n c.append(int(z[r]))\r\n a.append(int(q[r]))\r\na=sorted(a)\r\nc=sorted(c)\r\ne=0\r\npp=n-1\r\nfor i in range(n):\r\n if a[n-1-i]>c[pp]:\r\n e+=1\r\n else:\r\n pp-=1\r\nprint(e)\r\np=n-1\r\no=0\r\nfor i in range(n):\r\n if a[n-1-i]<c[p]:\r\n p-=1\r\n o+=1\r\nprint(o)", "n = int(input())\na = sorted(map(int, list(input())))\nb = sorted(map(int, list(input())))\n\n\nused1 = [0 for i in range(n)]\nused2 = [0 for i in range(n)]\nans1 = 0\nans2 = 0\nfor i in range(n):\n j = 0\n while (j < n and (used1[j] == 1 or b[j] <= a[i])):\n j += 1\n if (j != n):\n used1[j] = 1\n ans1 += 1\n j = 0\n while (j < n and (used2[j] == 1 or b[j] < a[i])):\n j += 1\n if (j != n):\n used2[j] = 1\n ans2 += 1\nprint(n - ans2)\nprint(ans1)\n", "def main():\r\n n = int(input())\r\n sherlock = list(input())\r\n moriarti = list(input())\r\n\r\n sherlock_asc = sorted(sherlock)\r\n sherlock_desc = sorted(sherlock, reverse=True)\r\n moriarti_asc = sorted(moriarti)\r\n moriarti_desc = sorted(moriarti, reverse=True)\r\n\r\n moriarti_min_pizdyuley = n\r\n for i in range(n):\r\n for j in range(n):\r\n if moriarti_asc[j] != -1 and moriarti_asc[j] >= sherlock_asc[i]:\r\n moriarti_min_pizdyuley -= 1\r\n moriarti_asc[j] = -1\r\n break\r\n\r\n print(moriarti_min_pizdyuley)\r\n\r\n moriarti_asc = sorted(moriarti)\r\n sherlock_max_pizdyuley = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if moriarti_asc[j] != -1 and moriarti_asc[j] > sherlock_asc[i]:\r\n sherlock_max_pizdyuley += 1\r\n moriarti_asc[j] = -1\r\n break\r\n\r\n print(sherlock_max_pizdyuley)\r\n\r\n\r\nmain()", "import copy\r\nn = int(input().strip())\r\n\r\n# minimum he gets\r\ndef init(n, v):\r\n s = input().strip()\r\n\r\n for i in range(n):\r\n v[int(s[i])] += 1\r\n\r\ndef solve1(n, S, M):\r\n S = copy.deepcopy(S)\r\n M = copy.deepcopy(M)\r\n for i in range(10):\r\n mi = min(S[i], M[i])\r\n S[i] -= mi\r\n M[i] -= mi\r\n\r\n current = 0\r\n ans = 0\r\n\r\n for i in reversed(range(10)) :\r\n if S[i] > 0 :\r\n if current >= S[i] :\r\n current -= S[i]\r\n else :\r\n ans += S[i] - current\r\n current = 0\r\n\r\n else:\r\n current += M[i]\r\n\r\n print(ans)\r\n \r\n \r\n# maximum he gives\r\ndef solve2(n, S, M) :\r\n current = 0\r\n ans = 0\r\n\r\n for i in reversed(range(10)):\r\n if current >= S[i]:\r\n ans += S[i]\r\n current -= S[i]\r\n else:\r\n ans += current\r\n current = 0\r\n current += M[i]\r\n\r\n print(ans)\r\n\r\nS = {}\r\nM = {}\r\n\r\nfor i in range(10):\r\n S[i] = 0\r\n M[i] = 0\r\n\r\ninit(n, S)\r\ninit(n,M)\r\n\r\nsolve1(n, S, M)\r\nsolve2(n, S, M)\r\n\r\n\r\n\r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\nt = input()\r\nm = 10\r\na_base = [0] * m\r\nb_base = [0] * m\r\nfor i in s:\r\n a_base[ord(i) - ord(\"0\")] += 1\r\nfor i in t:\r\n b_base[ord(i) - ord(\"0\")] += 1\r\n\r\n# part 1\r\na = a_base[:]\r\nb = b_base[:]\r\ncount_min = 0\r\nfor t in range(m):\r\n x = min(a[t], b[t])\r\n a[t] -= x\r\n b[t] -= x\r\nfor i in range(m):\r\n if a[i] == 0:\r\n continue\r\n for j in range(i + 1, m):\r\n if b[j] == 0:\r\n continue\r\n if b[j] >= a[i]:\r\n b[j] -= a[i]\r\n a[i] = 0\r\n else:\r\n a[i] -= b[j]\r\n b[j] = 0\r\n if a[i] > 0:\r\n for j in range(i, m):\r\n count_min += a[j]\r\n break\r\n\r\n# part 2\r\na = a_base[:]\r\nb = b_base[:]\r\ncount_max = 0\r\nfor i in range(m):\r\n if a[i] == 0:\r\n continue\r\n for j in range(i + 1, m):\r\n if b[j] == 0:\r\n continue\r\n if b[j] >= a[i]:\r\n b[j] -= a[i]\r\n count_max += a[i]\r\n a[i] = 0\r\n else:\r\n a[i] -= b[j]\r\n count_max += b[j]\r\n b[j] = 0\r\n if a[i] > 0:\r\n break\r\n\r\nprint(count_min)\r\nprint(count_max)", "n = int(input())\r\nsh = list(map(int, list(input())))\r\nm = list(map(int, list(input())))\r\nml1 = [0]*10\r\nml2 = [0]*10\r\nans1 = 0\r\nans2 = 0\r\nfor i in m:\r\n ml1[i] += 1\r\n ml2[i] += 1\r\nfor i in sh:\r\n for j in range(i, 10):\r\n if ml1[j] != 0:\r\n ml1[j] -= 1\r\n break\r\n else:\r\n for j in range(10):\r\n if ml1[j] != 0:\r\n ml1[j] -= 1\r\n ans1 += 1\r\n break\r\n for j in range(i+1, 10):\r\n if ml2[j] != 0:\r\n ml2[j] -= 1\r\n ans2 += 1\r\n break\r\n else:\r\n for j in range(10):\r\n if ml2[j] != 0:\r\n ml2[j] -= 1\r\n break\r\nprint(ans1)\r\nprint(ans2)", "input()\r\na = list(input())\r\nb = list(input())\r\na.sort()\r\nb.sort()\r\ni,j = 0,0\r\ncount = 0\r\nwhile(True):\r\n if b[i] > a[j]:\r\n i += 1\r\n j += 1\r\n count += 1\r\n else:\r\n i += 1\r\n if i == len(b):\r\n break\r\nx = 0\r\nfor i in range(len(a)):\r\n if b[i] >= a[x]:\r\n x += 1\r\nprint(len(a)-x)\r\nprint(count)", "n = int(input())\r\na = input()\r\nb = input()\r\nmasa = []\r\nmasb = []\r\nfor i in range(n):\r\n masa += [int(a[i])]\r\n masb += [int(b[i])]\r\n\r\nmasa.sort()\r\nmasb.sort()\r\nl = 0\r\nr = 0\r\nvic = 0\r\nfail = 0\r\nwhile r < n and l < n:\r\n if masb[l] >= masa[r]:\r\n \r\n fail += 1\r\n \r\n \r\n r += 1\r\n l += 1 \r\n else:\r\n \r\n l += 1 \r\nprint(n - fail)\r\nr = 0\r\nl = 0\r\nwhile r < n and l < n :\r\n if masb[l] > masa[r]:\r\n vic += 1\r\n \r\n \r\n r += 1\r\n l += 1\r\n else:\r\n\r\n l += 1\r\nprint(vic)", "n = int(input())\r\na = input()\r\na = [int(i) for i in a]\r\nb = input()\r\nb = [int(i) for i in b]\r\na.sort()\r\nb.sort()\r\ni = j = ma = mi = 0\r\nwhile i < n and j < n : \r\n\tif b[j] > a[i]:\r\n\t\tma += 1\r\n\t\tj += 1\r\n\t\ti += 1 \r\n\telse:\r\n\t\tj += 1\r\ni = j = 0\r\nwhile i < n and j < n :\r\n\tif b[j] >= a[i]:\r\n\t\tmi += 1\r\n\t\tj += 1\r\n\t\ti += 1\r\n\telse:\r\n\t\tj += 1\r\nprint(n - mi)\r\nprint(ma)", "n = int(input())\r\na = input()\r\nb = input()\r\nm1 = []\r\nm2 = []\r\nfor i in range(n):\r\n m1.append(int(a[i]))\r\n m2.append(int(b[i]))\r\ni = 0\r\nj = 0\r\nm1.sort()\r\nm2.sort()\r\ncount = 0\r\ncount1 = 0\r\nwhile i != n and j != n :\r\n if m1[i] <= m2[j]:\r\n count += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\ni = 0\r\nj = 0\r\nwhile i != n and j != n :\r\n if m1[i] < m2[j]:\r\n count1 += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nprint(n - count)\r\nprint(count1)\r\n\r\n\r\n", "from copy import copy\nn = int(input())\nsh = input()\nmo = input()\n\nshf = [0] * 10\nmof = [0] * 10\nfor c in sh:\n shf[int(c)] += 1 \nfor c in mo:\n mof[int(c)] += 1 \n\noshf = copy(shf)\nomof = copy(mof)\n\nsav = 0\nhit = 0\nfor i in range(9, -1, -1):\n m = min(shf[i], mof[i])\n shf[i] -= m\n mof[i] -= m\n\n m = min(sav, shf[i])\n sav -= m\n shf[i] -= m\n\n hit += shf[i]\n sav += mof[i]\n for j in range(10):\n m = min(mof[j], shf[i])\n mof[j] -= m\n shf[i] -= m\n \nminhit = hit\nshf = oshf\nmof = omof\n\nfor i in range(10):\n m = min(mof[i], shf[9])\n mof[i] -= m\n shf[9] -= m\n\nmaxhit = 0\nsav = mof[9]\nfor i in range(8, -1, -1):\n m = min(shf[i], sav)\n maxhit += m\n shf[i] -= m\n sav -= m\n\n sav += mof[i]\n\nprint(minhit)\nprint(maxhit)\n", "n = int(input())\r\nstr_sher = str(input())\r\nstr_mor = str(input())\r\n\r\nnum_sher = [0] * 10\r\nnum_mor = [0] * 10\r\nnum_sher.append(-1)\r\nnum_mor.append(-1)\r\n\r\nfor s in str_sher:\r\n num_sher[ord(s) - ord('0')]+=1\r\n\r\nfor s in str_mor:\r\n num_mor[ord(s) - ord('0')]+=1\r\n\r\ndef next_value(nums, p):\r\n if (p > 10): return p\r\n while (nums[p] == 0):\r\n p += 1\r\n nums[p] -= 1\r\n return p\r\n\r\ndef calc_hits(num_sher, num_mor, is_min_strategy):\r\n shift = 0\r\n if (not is_min_strategy):\r\n shift = 1\r\n p_sher = 0\r\n num = 0\r\n p_sher = next_value(num_sher, p_sher)\r\n p_mor = next_value(num_mor, p_sher + shift)\r\n\r\n while (p_sher < 10 and p_mor < 10):\r\n num += (p_sher <= p_mor)\r\n p_sher = next_value(num_sher, p_sher)\r\n p_mor = next_value(num_mor, p_sher + shift)\r\n\r\n if (is_min_strategy):\r\n return n - num\r\n else:\r\n return num\r\n\r\nprint(calc_hits(num_sher.copy(), num_mor.copy(), True))\r\nprint(calc_hits(num_sher.copy(), num_mor.copy(), False))", "n=int(input())\na=list(map(int,list(input())))\nb=list(map(int,list(input())))\nc=[0]*11\nfor i in b:c[i]+=1\nd=list(c)\ns1=0\nfor i in a:\n for j in range(i+1,11):\n if c[j]>0:c[j]-=1;s1+=1;break\ns2=0\nfor i in a:\n for j in range(i,11):\n if d[j]>0:d[j]-=1;break\n elif j==9:s2+=1\nprint(s2)\nprint(s1)\n", "def solve(b1,b2):\r\n if len(b1)!=len(b2):\r\n return -1\r\n for i in b1:\r\n if not i in \"0123456789\":\r\n return -1\r\n for i in b2:\r\n if not i in \"0123456789\":\r\n return -1\r\n v1=[int(i) for i in b1]\r\n v2=[int(i) for i in b2]\r\n v1.sort()\r\n #v1.append(0)\r\n v2.sort()\r\n a,b=0,0\r\n tmp=0\r\n ln=len(b1)\r\n ans=\"\"\r\n while b<ln:\r\n if v1[a]>v2[b]:\r\n tmp+=1\r\n else:\r\n a+=1\r\n b+=1\r\n ans+=str(tmp)+\"\\n\"\r\n a,b=0,0\r\n tmp=0\r\n ln=len(v1)\r\n while a<ln:\r\n while b<ln and v1[a]>=v2[b]:\r\n b+=1\r\n if b<ln:\r\n tmp+=1\r\n b+=1\r\n a+=1\r\n ans+=str(tmp)\r\n return ans\r\n \r\ndef doc(lst):\r\n fn=[]\r\n for i in lst:\r\n b1,b2=i[0],i[1]\r\n fn.append(solve(b1,b2))\r\n return fn\r\n\r\nn=int(input())\r\nb1=input()\r\nb2=input()\r\nprint(solve(b1,b2))", "def solve(n,sher,mori) :\r\n minimum = 0\r\n maximum = 0\r\n moriDig = [0]*10\r\n \r\n for d in mori :\r\n moriDig[d] += 1\r\n \r\n dup = moriDig.copy()\r\n \r\n for i in sher :\r\n notDone = True\r\n \r\n for x in range(i,10) :\r\n if moriDig[x] > 0 :\r\n notDone = False\r\n moriDig[x] -= 1\r\n break\r\n \r\n if notDone :\r\n minimum += 1\r\n for x in range(0,i) :\r\n if moriDig[x] > 0 :\r\n moriDig[x] -= 1\r\n break\r\n \r\n \r\n for i in sher :\r\n notDone = True \r\n for x in range(i+1,10) :\r\n if dup[x] > 0 :\r\n maximum += 1\r\n dup[x] -= 1\r\n notDone = False\r\n break\r\n \r\n if notDone :\r\n for x in range(0,i) :\r\n if dup[x] > 0 :\r\n dup[x] -= 1\r\n break\r\n \r\n print (minimum)\r\n print (maximum)\r\n \r\nn = int(input())\r\ns = list(map(int,list(input())))\r\nm = list(map(int,list(input())))\r\nsolve(n,s,m)\r\n ", "n = int(input())\r\nhis = [int(x) for x in input()]\r\nmine = [int(x) for x in input()]\r\n\r\n\r\nhis.sort()\r\nmine.sort()\r\nmax_flick = 0\r\ni = j = 0\r\nwhile i < n:\r\n while j < n:\r\n if his[i] < mine[j]:\r\n max_flick += 1\r\n i += 1\r\n j += 1\r\n break\r\n\r\nhis.sort(reverse=True)\r\nmine.sort(reverse=True)\r\nmin_flick = 0\r\ni = j = 0\r\nwhile i < n:\r\n while j < n:\r\n if mine[i] >= his[j]:\r\n i += 1\r\n else:\r\n min_flick += 1\r\n j += 1\r\n break\r\nprint(min_flick)\r\nprint(max_flick)\r\n", "# h,w = map(int, input().split(' '))\r\n# r = list(map(int, input().split(' ')))\r\n# c = list(map(int, input().split(' ')))\r\n# l,r = map(int, input().split(' '))\r\n# for i in range(l, r+1):\r\n# if len(str(i)) == len(list(set(str(i)))):\r\n# print(i)\r\n# exit()\r\n# print(-1)\r\nn = int(input())\r\nsherlock = list(map(int, input()))\r\nmoriarty = list(map(int, input()))\r\nmoriarty.sort()\r\nres = 0\r\nx = 0\r\nvar = moriarty[:]\r\nfor i in sherlock:\r\n for j in moriarty:\r\n if j > i:\r\n moriarty.remove(j)\r\n res += 1\r\n break\r\nfor i in sherlock:\r\n y = True\r\n for j in var:\r\n if i == j or j > i:\r\n var.remove(j)\r\n y = False\r\n break\r\n if y:\r\n x += 1\r\nprint(x)\r\nprint(res)", "import copy\nn = int(input())\nsherlok1 = input()\nmoriarti1 = input()\nsherlok = []\nmoriarti = []\nfor i in range(n):\n sherlok.append(sherlok1[i])\n moriarti.append(moriarti1[i])\ndef bubbleSort(array):\n swapped = False\n for i in range(len(array)-1,0,-1):\n for j in range(i):\n if array[j][0]>array[j+1][0]:\n array[j], array[j+1] = array[j+1], array[j]\n swapped = True\n if swapped:\n swapped = False\n else:\n break\n return array\nsherlok = bubbleSort(sherlok)\nmoriarti = bubbleSort(moriarti)\nmoriarti2 = copy.deepcopy(moriarti)\nmoriarti3 = copy.deepcopy(moriarti)\nk = 0\notvet = 0\notvet1 = 0\nk1 = 0\nfor i in range(n):\n if moriarti2[i-k] < sherlok[i-k]:\n otvet += 1\n nichego = moriarti2.pop(i-k)\n moriarti2.append(nichego)\n k += 1\n if moriarti3[i - k1] <= sherlok[i - k1]:\n nichego1 = moriarti3.pop(i - k1)\n moriarti3.append(nichego1)\n k1 += 1\n else:\n otvet1 += 1\nprint(otvet)\nprint(otvet1)", "# Description of the problem can be found at http://codeforces.com/contest/777/problem/B\n\ncard_len = int(input()) - 1\nsherlock_card = sorted(input())\nmoriarty_card = sorted(input())\n\nsherlock_flicked = 0\nmoriarty_flicked = 0\n\nsherlock_index = card_len\nmoriarty_index = 0\n\nfor index in range(len(moriarty_card)):\n while moriarty_index <= card_len and sherlock_card[index] > moriarty_card[moriarty_index]:\n moriarty_index += 1\n \n if moriarty_index > card_len and moriarty_flicked == 0:\n moriarty_flicked = card_len - index + 1\n \n moriarty_index += 1\n \n while sherlock_index >= 0 and sherlock_card[sherlock_index] >= moriarty_card[card_len - index]:\n sherlock_index -= 1\n\n if sherlock_index >= 0:\n sherlock_flicked += 1\n sherlock_index -= 1\n\nprint(moriarty_flicked)\nprint(sherlock_flicked)\n \t \t \t \t \t \t \t \t\t\t \t\t \t\t", "from bisect import bisect_left, bisect_right\r\n\r\n\r\nn = int(input())\r\na = input().strip()\r\na = [int(i) for i in a]\r\nb = input().strip()\r\nb = [int(i) for i in b]\r\na.sort(reverse=True)\r\nb.sort()\r\nget = 0\r\ngive = 0\r\naa = a.copy()\r\nbb = b.copy()\r\nwhile a:\r\n x = a[-1]\r\n a.pop()\r\n k = bisect_right(b, x)\r\n if k == len(b):\r\n y = b[-1]\r\n b.pop()\r\n else:\r\n y = b[k]\r\n b.pop(k)\r\n if x < y:\r\n give += 1\r\nwhile aa:\r\n x = aa[-1]\r\n aa.pop()\r\n k = bisect_left(bb, x)\r\n if k == len(bb):\r\n y = bb[-1]\r\n bb.pop()\r\n else:\r\n y = bb[k]\r\n bb.pop(k)\r\n if x > y:\r\n get += 1\r\nprint(get)\r\nprint(give)\r\n", "from collections import Counter\r\ndef losemin(s,m):\r\n\tsd=Counter(s)\r\n\tmd=Counter(m)\r\n\tfor i in range(10):\r\n\t\tif str(i) in md:\r\n\t\t\t#print(i,\"in sd\")\r\n\t\t\tfor j in range(i+1):\r\n\t\t\t\tif str(j) in sd and sd[str(j)]>0 and md[str(i)]>0:\r\n\t\t\t\t\tif sd[str(j)]>md[str(i)]:\r\n\t\t\t\t\t\tsd[str(j)]=sd[str(j)]-md[str(i)]\r\n\t\t\t\t\t\tmd[str(i)]=0\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tmd[str(i)]=md[str(i)]-sd[str(j)]\r\n\t\t\t\t\t\tsd[str(j)]=0\r\n\tprint(sum(sd.values()))\r\n\r\ndef winmax(s,m):\r\n\tsd=Counter(s)\r\n\tmd=Counter(m)\r\n\tt1=sum(md.values())\r\n\tfor i in range(10):\r\n\t\tif str(i) in md:\r\n\t\t\t#print(i,\"in sd\")\r\n\t\t\tfor j in range(i):\r\n\t\t\t\tif str(j) in sd and sd[str(j)]>0 and md[str(i)]>0:\r\n\t\t\t\t\tif sd[str(j)]>md[str(i)]:\r\n\t\t\t\t\t\tsd[str(j)]=sd[str(j)]-md[str(i)]\r\n\t\t\t\t\t\tmd[str(i)]=0\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tmd[str(i)]=md[str(i)]-sd[str(j)]\r\n\t\t\t\t\t\tsd[str(j)]=0\r\n\tprint(t1-sum(md.values()))\r\n\r\n\r\nn=int(input())\r\nsh=input()\r\nmo=input()\r\nlosemin(sh,mo)\r\nwinmax(sh,mo)\r\n", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\nn = int(inp())\nsherlock = list(inp()[:-1])\nmoriarty = list(inp()[:-1])\n\nmoriarty_freq_min = [0] * 11\nmoriarty_freq_max = [0] * 11\n\nfor i in range(n):\n moriarty_freq_min[int(moriarty[i])] += 1\n moriarty_freq_max[int(moriarty[i])] += 1\n\nmoriarty_min = 0\nsherlock_max = 0\n\nfor i in sherlock:\n i = int(i)\n\n j = i\n found = False\n while j < 11:\n if moriarty_freq_min[j]:\n moriarty_freq_min[j] -= 1\n found = True\n break\n j += 1\n if not found:\n moriarty_min += 1\n\n j = i + 1\n found = False\n while j < 11:\n if moriarty_freq_max[j]:\n moriarty_freq_max[j] -= 1\n found = True\n break\n j += 1\n if found:\n sherlock_max += 1\n\nprint(moriarty_min)\nprint(sherlock_max)\n", "n = int(input())\r\ns_n = list(map(int, input()))\r\nm_n = list(map(int, input()))\r\ns_n.sort()\r\nm_n.sort()\r\ni,j = n-1,n-1\r\nwhile i>=0 :\r\n if s_n[i] <= m_n[j]:\r\n j = j-1\r\n i=i-1\r\nprint(j+1)\r\ni,j = 0,0\r\nwhile i<n:\r\n if m_n[i] >s_n[j]:\r\n j = j+1\r\n i = i+1\r\nprint(j)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(input())\r\nb = list(input())\r\n\r\na = sorted([int(a[i]) for i in range(n)])\r\nb = sorted([int(b[i]) for i in range(n)], reverse=True)\r\n\r\nmaxb = b[0]\r\ncount1 = 0\r\ncount2 = 0\r\nq = 0\r\nfor i in range(n):\r\n if a[n - i - 1] > b[q]:\r\n count1 += 1\r\n else:\r\n q += 1\r\n\r\nb = b[::-1]\r\nfor i in range(n):\r\n for j in range(len(a)):\r\n if b[i] > a[j]:\r\n count2 += 1\r\n del a[j]\r\n break\r\n\r\nprint(count1, count2, sep='\\n')", "\r\ndef BinarySearch(arr , left, right, X) :\r\n while (right - left > 1) :\r\n mid = (left + right)//2\r\n if arr[mid] > X :\r\n right = mid \r\n else :\r\n left = mid\r\n if (arr[left] > X) :\r\n return left\r\n elif (arr[right] > X) :\r\n return right\r\n else :\r\n return 0 \r\n\r\ndef BinarySearch2(arr , left, right, X) :\r\n while (right - left > 1) :\r\n mid = (left + right)//2\r\n if arr[mid] >= X :\r\n right = mid \r\n else :\r\n left = mid\r\n if (arr[left] >= X) :\r\n return left\r\n elif (arr[right] >= X) :\r\n return right\r\n else :\r\n return 0 \r\n\r\n\r\nif __name__ == \"__main__\" : \r\n N = int(input()) \r\n A = list(map(int, input()))\r\n B = list(map(int, input()))\r\n B.sort()\r\n C = B.copy()\r\n minimum = 0\r\n maximum = 0\r\n for i in range(N) :\r\n x = B.pop(BinarySearch(B , 0 ,N - i - 1, A[i]))\r\n if (x > A[i]) :\r\n maximum += 1\r\n #print(x , A[i]) \r\n \r\n for i in range(N) : \r\n x = C.pop(BinarySearch2(C , 0 ,N - i - 1, A[i]))\r\n if (x < A[i]) :\r\n minimum += 1\r\n \r\n print(minimum) \r\n print(maximum)", "import sys, collections\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\ndef solve():\r\n n = inp()\r\n sherlock = list(map(int,insr()))\r\n moriarty = list(map(int,insr()))\r\n \r\n minimum = 0\r\n morCounter = collections.defaultdict(int)\r\n \r\n for dig in moriarty:\r\n morCounter[dig]+=1\r\n \r\n for dig in sherlock:\r\n cDig = dig\r\n while cDig < 10 and morCounter[cDig] == 0:\r\n cDig+=1\r\n if cDig == 10:\r\n minimum+=1\r\n else:\r\n morCounter[cDig] -=1\r\n \r\n maximum = 0\r\n \r\n morCounter = collections.defaultdict(int)\r\n \r\n for dig in moriarty:\r\n morCounter[dig]+=1\r\n \r\n for dig in sherlock:\r\n cDig =dig +1\r\n while cDig < 10 and morCounter[cDig] == 0:\r\n cDig+=1\r\n if cDig < 10:\r\n morCounter[cDig] -=1\r\n maximum += 1\r\n print(minimum)\r\n print(maximum)\r\n \r\nsolve()\r\n", "#Imports\r\nfrom collections import defaultdict as dc\r\nimport sys\r\nimport math\r\nmod=10**9 +7\r\n# How to sort a list using two compare :\r\n# instead of defining a function define class as a key\r\n# class key(str):\r\n# def __lt__(x,y):# return int(x+y)>int(y+x)\r\n\r\ndef sinp():\r\n p=str(sys.stdin.readline())\r\n return p\r\n\r\ndef seive(n):\r\n p=[0]*(n+1)\r\n for i in range(2,n): \r\n for j in range(2*i,n+1,i):\r\n p[i]=1\r\n return p\r\n\r\ndef inp(): \r\n p=int(sys.stdin.readline())\r\n return p\r\n\r\ndef line():\r\n p=list(map(int,sys.stdin.readline().split()))\r\n return p\r\n\r\ndef read_mat():\r\n n=inp()\r\n a=[]\r\n for i in range(n):\r\n a.append(line())\r\n return a\r\n\r\ndef ind(a):\r\n return ord(a)-ord('A')\r\n\r\ndef solve(t):\r\n n=inp()\r\n s=list(map(int,input()))\r\n m=list(map(int,input()))\r\n m.sort()\r\n s.sort()\r\n i,j=0,0\r\n mort=n\r\n while i<n and j<n:\r\n if(s[i]>m[j]):\r\n j+=1\r\n else:\r\n i+=1\r\n j+=1\r\n mort-=1\r\n sher=0\r\n i,j=0,0\r\n while i<n and j<n:\r\n if(s[i]>=m[j]):\r\n j+=1\r\n else:\r\n i+=1\r\n j+=1\r\n sher+=1\r\n print(mort)\r\n print(sher)\r\n\r\n\r\nt=1\r\n# t=inp()\r\nfor _ in range(t):\r\n solve(t)", "import math\r\nfrom decimal import *\r\nimport random\r\n\r\nn =int(input())\r\na = list(input())\r\nb = list(input())\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\na =sorted(a)\r\nb = sorted(b)\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(n-1, -1, -1):\r\n if(b[n-1-ans1] > a[i]):\r\n ans1+=1\r\nfor i in range(n):\r\n for j in range(n):\r\n if(b[i] >= a[j]):\r\n a[j] = 10\r\n ans2+=1\r\n break\r\nprint(n - ans2)\r\nprint(ans1)\r\n", "n = int(input())\r\ninp = lambda : sorted([*map(int, list(input()))])\r\na, b = inp(), inp()\r\nans = ans1 = 0\r\nfor i in range(n):\r\n if b[i] >= a[ans]:\r\n ans += 1\r\n if b[i] > a[ans1]:\r\n ans1 += 1\r\nprint(n - ans)\r\nprint(ans1)\r\n\r\n\r\n", "n = int(input())\na = input()\nb = input()\n\nc = []\nc1 = []\nfor i in a:\n c.append(int(i))\n c1.append(int(i))\n\nd = []\nd1 = []\nfor i in b:\n d.append(int(i))\n d1.append(int(i))\n\nc1 = sorted(c1)\nd1 = sorted(d1)\nc = sorted(c)\nd = sorted(d)\n\nans = 0\nwhile d:\n if c[0] <= d[0]:\n c.pop(0)\n d.pop(0)\n else:\n d.pop(0)\nans = len(c)\n\n\nans_s = 0\nwhile c1 and d1:\n if d1[len(d1)-1] > c1[len(c1)-1]:\n ans_s += 1\n d1.pop()\n c1.pop()\n\n\nprint(ans)\nprint(ans_s)\n", "import bisect\nn = int(input())\n\ns = list(input())\nt = list(input())\n\ns1 = ''\nt1 = ''\n\nfor i in range(len(s)):\n s1+=s[i]\n t1+=t[i]\n\nfor i in range(len(s)):\n s[i] = int(s[i])\n t[i] = int(t[i])\ns = sorted(s)\nt = sorted(t)\ns1 = sorted(s1)\nt1 = sorted(t1)\nwin = 0\ni = 0\nwhile i<len(s):\n j = 0\n while(j<len(t)):\n if t[j]>s[i]:\n win+=1\n del t[j]\n break\n else:\n j+=1\n i+=1\nmark = 0\nfor i in range(len(t1)):\n k = bisect.bisect_right(s1,t1[i])\n if k-1>=0:\n if t1[i] >= s1[k-1]:\n mark+=1\n del s1[k-1]\n\nprint(len(s1))\nprint(win)", "import math\r\nimport sys\r\n\r\nn=int(input())\r\na=list(str(input()))\r\nb=list(str(input()))\r\n\r\n\r\nmin_res=0\r\nmax_res=0\r\n\r\nap={};bp={}\r\nfor i in range(0,10):\r\n ap[i]=a.count(str(i))\r\n bp[i]=b.count(str(i))\r\n\r\nfor i in range(9,0,-1):\r\n k=min(ap[i-1],bp[i])\r\n max_res+=k\r\n bp[i-1]=bp[i-1]+bp[i]-k\r\n#max_res+=min(ap[1],bp[2]) ----------- FOR MAXIMUM --------------\r\n\r\nap={};bp={}\r\nfor i in range(0,10):\r\n ap[i]=a.count(str(i))\r\n bp[i]=b.count(str(i))\r\nbp[-1]=0\r\nfor i in range(9,-1,-1):\r\n k = min(ap[i], bp[i])\r\n min_res+=ap[i]-k\r\n bp[i-1]+=bp[i]-k\r\n\r\nprint(min_res)\r\nprint(max_res)\r\n", "import sys\r\nimport itertools\r\nimport collections\r\n\r\ndef rs(x=''): return sys.stdin.readline().strip() if len(x) == 0 else input(x).strip()\r\ndef ri(x=''): return int(rs(x))\r\ndef rm(x=''): return map(str, rs(x).split())\r\ndef rl(x=''): return rs(x).split()\r\ndef rmi(x=''): return map(int, rs(x).split())\r\ndef rli(x=''): return [int(x) for x in rs(x).split()]\r\ndef println(val): sys.stdout.write(str(val) + '\\n')\r\n\r\ndef solve(testCase):\r\n n = ri()\r\n sher, mor = list(rs()), list(rs())\r\n sher = list(map(int, sher))\r\n mor = list(map(int, mor))\r\n sher.sort()\r\n mor.sort()\r\n i, j = 0, 0\r\n while i < n and j < n:\r\n if sher[i] > mor[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n j += 1\r\n minFlicks = n - i\r\n i, j = 0, 0\r\n while i < n and j < n:\r\n if sher[i] >= mor[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n j += 1\r\n maxFlicks = i\r\n print(minFlicks)\r\n print(maxFlicks)\r\n\r\nfor _ in range(ri() if 0 else 1):\r\n solve(_ + 1)\r\n", "from sys import stdin\n\nN = int(stdin.readline())\nsherlock = list(map(int, stdin.readline().strip()))\nmoriarty = list(map(int, stdin.readline().strip()))\n\nmcounts = [0] * 10\nfor m in moriarty:\n mcounts[m] += 1\n\ndef minflicks(counts):\n flicks = 0\n for s in sherlock:\n si = s\n while counts[si % 10] == 0:\n si += 1\n # print(s, si % 10, counts, counts[si % 10])\n\n if si % 10 < s:\n flicks += 1\n\n counts[si % 10] -= 1\n\n return flicks\n\ndef maxflicks(counts):\n flicks = 0\n for s in sherlock:\n si = s + 1\n while counts[si % 10] == 0:\n si += 1\n\n if si % 10 > s:\n flicks += 1\n\n counts[si % 10] -= 1\n\n return flicks\n\nprint(minflicks(mcounts[:]))\nprint(maxflicks(mcounts[:]))\n", "n = int(input())\r\n\r\n\r\nbb = []\r\nb = list(map(int, list(input())))\r\n\r\naa = [0] * 10\r\na = list(map(int, list(input())))\r\nfor i in range(n):\r\n aa[a[i]] += 1\r\n\r\n\r\naaa = list(aa)\r\n\r\n\r\nfor i in range(n):\r\n bb.append((b[i], i))\r\n\r\n#aa.sort(key=lambda x: x[0])\r\nbb.sort(key=lambda x: x[0])\r\n\r\n\r\nr1 = 0\r\nfor i in range(n):\r\n\r\n x = bb[i][0]\r\n t = 1\r\n for j in range(x, 10):\r\n if aa[j] > 0:\r\n aa[j] -= 1\r\n t = 0\r\n break\r\n if t:\r\n r1 += 1\r\n\r\n\r\nr2 = 0\r\nfor i in range(n):\r\n\r\n x = bb[i][0]\r\n for j in range(x + 1, 10):\r\n if aaa[j] > 0:\r\n aaa[j] -= 1\r\n r2 += 1\r\n break\r\n\r\nprint(r1, r2)\r\n", "n = int(input())\n\na = sorted(input())\nb = sorted(input())\nx,y=0,0\n\nfor i in range(0,n):\n if b[i]>=a[x]:\n x+=1\n if b[i]>a[y]:\n y+=1\nprint(n-x)\nprint(y)\n", "n=int(input())\r\na=sorted([int(x) for x in input()])\r\nb=sorted([int(x) for x in input()])\r\nk1,k2=0,0\r\nfor i in range(n):\r\n if b[i]>=a[k1]: k1+=1\r\n if b[i]>a[k2]: k2+=1\r\nprint(n-k1)\r\nprint(k2)\r\n", "n=int(input())\r\narr1=sorted(input())\r\narr2=sorted(input())\r\nx,y=0,0\r\nfor i in arr2:\r\n if i>=arr1[x]:x+=1\r\n if i>arr1[y]:y+=1\r\nprint(n-x,y)", "n = int(input())\r\nsherlock_card = [int(i) for i in input()]\r\nmoriati_card = [int(i) for i in input()]\r\nsherlock_card.sort()\r\nmoriati_card.sort()\r\ni = 0\r\nmoriati_hit = 0\r\nfor j in range(n):\r\n if moriati_card[j] > sherlock_card[i]:\r\n moriati_hit += 1\r\n i += 1\r\n else:\r\n continue\r\nmoriati_hited = 0\r\nsherlock_card.sort(reverse=True)\r\nmoriati_card.sort(reverse=True)\r\ni = 0\r\nfor j in range(n):\r\n if sherlock_card[j] > moriati_card[i]:\r\n moriati_hited += 1\r\n else:\r\n i += 1\r\nprint(moriati_hited)\r\nprint(moriati_hit)", "u = int(input())\r\nm = [int(k) for k in input()]\r\nl = [int(k) for k in input()]\r\nn = l.copy()\r\nl.sort()\r\nm.sort()\r\ncount=0\r\nfor k in m:\r\n t=0\r\n flag=0\r\n while t < len(l):\r\n if l[t]>=k:\r\n flag=1\r\n l.remove(l[t])\r\n break\r\n t+=1\r\n if flag==0:\r\n count+=1\r\nprint(count)\r\ncount=0\r\nn.sort()\r\nfor k in m:\r\n t=0\r\n flag=0\r\n while t < len(n):\r\n if n[t]>k:\r\n flag=1\r\n n.remove(n[t])\r\n break\r\n t+=1\r\n if flag==1:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n\r\n", "n = int(input())\r\nsher = list(map(int, input()))\r\nmori = list(map(int, input()))\r\nsher.sort()\r\nmori.sort()\r\n\r\n# minimum no of flicks that moriarty will get - find just equal or greater\r\ni, j = 0, 0\r\nmin_flicks_mori = 0\r\nwhile i<n and j<n:\r\n if mori[j]>=sher[i]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\n min_flicks_mori+=1\r\nprint(min_flicks_mori)\r\n\r\ni, j = 0, 0\r\nmax_flicks_sher = n\r\nwhile i<n and j<n:\r\n if mori[j]>sher[i]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\n max_flicks_sher -= 1\r\nprint(max_flicks_sher)", "# https://codeforces.com/problemset/problem/777/B\n# Problem\n# Big O:\n# Time complexity: O(n log (n)) + 2*(O(n) + O(n))*O(k) = O(n)*O(k)\n# Space complexity: 3*O(n) = O(n)\n\n# Problem\n\n\ndef value_index_greater_or_equal_than(ordered_list, number):\n for i in range(0, len(ordered_list)):\n element = ordered_list[i]\n if element >= number:\n return i\n return -1\n\n\ndef flicks(sherlocks_card, sorted_moriarty_card, prefer_flicks):\n flicks = 0\n\n for digit in sherlocks_card:\n increment = 1 if prefer_flicks else 0\n minimum_index = value_index_greater_or_equal_than(\n sorted_moriarty_card, digit + increment)\n if (minimum_index >= 0):\n flicks = flicks + 1 if increment else flicks\n sorted_moriarty_card.pop(minimum_index)\n else:\n flicks = flicks if increment else flicks + 1\n sorted_moriarty_card.pop(0)\n return flicks\n\n\ndef solve(number_of_digits, sherlocks_card, moriartys_card):\n moriartys_card.sort()\n min_moriartys_flicks = flicks(\n sherlocks_card, moriartys_card.copy(), False)\n max_sherlocks_flicks = flicks(\n sherlocks_card, moriartys_card.copy(), True)\n\n return min_moriartys_flicks, max_sherlocks_flicks\n\n\n# Read input\nnumber_of_digits = int(input())\nsherlocks_card = [int(x) for x in input()]\nmoriartys_card = [int(x) for x in input()]\nmoriartys_flicks, sherlocks_flicks = solve(\n number_of_digits, sherlocks_card, moriartys_card)\nprint(moriartys_flicks)\nprint(sherlocks_flicks)\n", "n = int(input().strip())\r\nsherlock_min = sorted(map(int, list(input())), reverse=True)\r\nmoriarty_min = sorted(map(int, list(input())))\r\nsherlock_max = sherlock_min[:]\r\nmoriarty_max = moriarty_min[:]\r\n\r\nmin_flicks = n\r\nmax_flicks = 0\r\niterate = 0\r\nfor i, sh in enumerate(sherlock_min[:]):\r\n flag = True\r\n for j, mo in enumerate(moriarty_min):\r\n if mo >= sh:\r\n min_flicks -= 1\r\n sherlock_min.pop(iterate)\r\n moriarty_min.pop(j)\r\n flag = False\r\n break\r\n if flag:\r\n iterate += 1\r\n\r\nprint(min_flicks)\r\niterate = 0\r\nfor i, sh in enumerate(sherlock_max[:]):\r\n flag = True\r\n for j, mo in enumerate(moriarty_max):\r\n if mo > sh:\r\n max_flicks += 1\r\n sherlock_max.pop(iterate)\r\n moriarty_max.pop(j)\r\n flag = False\r\n break\r\n if flag:\r\n iterate += 1\r\nprint(max_flicks)\r\n", "n = int(input())\nl = input()\nm = input()\na = [0 for _ in range(10)]\nb = [0]*10\nfor i in range(n):\n a[int(l[i])] += 1\n b[int(m[i])] += 1\nc = []\nd = []\nc.extend(a)\nd.extend(b)\nf_max = 0\nfor i in range(10):\n for j in range(i, 10):\n if a[i] > b[j]:\n a[i], b[j] = a[i] - b[j], 0\n else:\n a[i], b[j] = 0, b[j] - a[i]\n break\n for k in range(i+1, 10):\n if c[i] > d[k]:\n c[i] = c[i] - d[k]\n f_max += d[k]\n d[k] = 0\n else:\n f_max += c[i]\n d[k] = d[k] - c[i]\n break \nprint(sum(a))\nprint(f_max)\n", "n=int(input())\r\na=input()\r\nb=input()\r\na=list(a)\r\nb=list(b)\r\na.sort()\r\nb.sort()\r\ni=n-1\r\nj=n-1\r\nc1=0\r\nc2=0\r\nwhile i>=0 and j>=0:\r\n\tif b[j]>a[i]:\r\n\t\tc1+=1\r\n\t\tj=j-1\r\n\t\ti=i-1\r\n\telse:\r\n\t\ti=i-1\r\ni=j=n-1\r\nwhile i>=0 and j>=0:\r\n\tif b[j]>=a[i]:\r\n\t\tc2+=1\r\n\t\tj=j-1\r\n\t\ti=i-1\r\n\telse:\r\n\t\ti=i-1\r\n\r\nprint(n-c2)\r\nprint(c1)", "n = int(input())\r\nshe = [int(x) for x in input()]\r\nmor = [int(x) for x in input()]\r\nshe.sort()\r\nmor.sort()\r\nl = 0\r\nr = n - 1\r\nans = 0\r\nfor i in range(n):\r\n if she[l] > mor[i]:\r\n ans += 1\r\n r -= 1\r\n else:\r\n l += 1\r\nprint(ans)\r\nl = 0\r\nr = n - 1\r\nans = 0\r\nfor i in range(n):\r\n if she[l] >= mor[i]:\r\n r -= 1\r\n else:\r\n ans += 1\r\n l += 1\r\nprint(ans)", "from collections import Counter\r\n\r\nn = int(input())\r\nnum1 = input()\r\nnum2 = input()\r\n\r\nSher = list(sorted(num1, reverse=True))\r\nMor = Counter(map(int, num2))\r\n\r\nans1 = 0\r\nfor i in range(n):\r\n temp = {k for k in Mor.keys() if k >= int(Sher[i])}\r\n\r\n if len(temp) == 0:\r\n ans1 += 1\r\n\r\n else:\r\n Mor[min(temp)] -= 1\r\n\r\n if Mor[min(temp)] == 0:\r\n del Mor[min(temp)]\r\n\r\nMor = Counter(map(int, num2))\r\nans2 = 0\r\nfor i in range(n):\r\n temp = {k for k in Mor.keys() if k > int(Sher[i])}\r\n\r\n if len(temp) != 0:\r\n ans2 += 1\r\n Mor[min(temp)] -= 1\r\n\r\n if Mor[min(temp)] == 0:\r\n del Mor[min(temp)]\r\n\r\nprint(ans1, ans2, sep='\\n')\r\n", "n = int(input())\r\ns = list(map(int, input()))\r\nm = list(map(int, input()))\r\nm.sort()\r\nm1 = list(m)\r\nmor = 0\r\nshe = 0\r\nfor i in s:\r\n flick = True\r\n brk = True\r\n for j in range(n):\r\n if m[j] >= i and flick:\r\n flick = False\r\n m[j] = -1\r\n if m1[j] > i and brk:\r\n she += 1\r\n m1[j] = -1\r\n brk = False\r\n if flick:\r\n mor += 1\r\nprint(mor)\r\nprint(she)", "n = int(input())\r\n\r\nsher = input()\r\nmori = input()\r\n\r\ntemp = [1]*n\r\ntempx = [1]*n\r\n\r\nsher = sorted(sher)\r\nmori = sorted(mori)\r\n\r\nmaximum = 0\r\nminimum = n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(tempx[j]!=0 and mori[j]>sher[i]):\r\n maximum+=1\r\n tempx[j]=0\r\n break\r\n for j in range(n):\r\n if(temp[j]!=0 and mori[j]>=sher[i]):\r\n minimum-=1\r\n temp[j] = 0\r\n break\r\nprint(str(minimum)+\"\\n\"+str(maximum))\r\n", "x = int(input())\r\na = list(map(int,input()))\r\nb = list(map(int,input()))\r\na.sort()\r\nb.sort()\r\nk = 0\r\nk1 = 0\r\nfor i in range(x):\r\n if b[i] >= a[k1]:\r\n k1+= 1\r\n if b[i] > a[k]:\r\n k += 1\r\nprint(x-k1)\r\nprint(k)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\nimport bisect\n\nn = int(input())\nsherlock = sorted(input())\nmoriarti = sorted(input())\n\n# go through sorted sherlock and try to find the lowest moriarti bigger than that.\n# 1. it doesn't make sense to skip element sherlock[s1]\n# in favor of bigger element sherlock[s2]\n# 2. use the lowest possible element (moriarti[m1]) to cover sherlock[s1].\n# because it doesn't make sense to save moriarti[m1] and use bigger moriarti[m2]\n# since next considered elements from sherlock would be bigger\nma = 0\ni, j = 0, 0\nwhile i < n and j < n:\n if sherlock[i] < moriarti[j]:\n ma += 1\n i += 1\n j += 1\n\n# go through sorted sherlock reversevely\n# 1. if we can't cover sherlock[s1] we use lowest element for it\n# 2. if we cover sherlock[s1] we use current element for it\n# given away the lowest - ok\n# can we cover current using already used bigger elements?\n# we won't cover more elements\nmi = 0\ni, jl, jr = n-1, 0, n-1\nwhile i >= 0 and jl <= jr:\n if sherlock[i] > moriarti[jr]:\n mi += 1\n jl += 1\n else:\n jr -= 1\n\n i -= 1\n\nprint(\"%d\\n%d\"%(mi, ma))\n", "from sys import stdin\nn = int(stdin.readline())\nsherlock = [int(x) for x in list(stdin.readline()[:-1])]\nmoriarty = [int(x) for x in list(stdin.readline()[:-1])]\n\ns1 = sorted(sherlock,reverse=True)\nm1 = sorted(moriarty,reverse=True)\n\n\ncount = 0\n\nm1_ptr = 0\nfor i in range(n):\n\tif s1[i]>m1[m1_ptr]:\n\t\tcount += 1\n\telse:\n\t\tm1_ptr += 1\n\nprint(count)\n\n\ncount = 0\n\nm1_ptr = 0\nfor i in range(n):\n\tif s1[i]<m1[m1_ptr]:\n\t\tcount += 1\n\t\tm1_ptr += 1\n\nprint(count)" ]

[ "from collections import deque\r\ndef bfs(i, G, V):\r\n V[i] = 1\r\n Q = deque([i])\r\n while Q:\r\n u = Q.popleft()\r\n for v in G[u]:\r\n if not V[v]:\r\n V[v] = 1 if V[u] == 2 else 2\r\n Q.append(v)\r\n else:\r\n if V[v] == V[u]:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nG = [[] for _ in range(n+1)]\r\nI = []\r\npossible = True\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\n I.append(u)\r\n I.append(v)\r\n\r\nI.sort()\r\nV = [0 for _ in range(n+1)]\r\nfor i in I:\r\n if not V[i]:\r\n possible = bfs(i, G, V)\r\n if not possible:\r\n print(0)\r\n break\r\n\r\nif possible:\r\n m1, m2 = 1, n\r\n for i in range(1, n+1):\r\n if V[i] == 1:\r\n m1 = i\r\n elif V[i] == 2 and m2 == n:\r\n m2 = i\r\n if m2 < m1:\r\n print(0)\r\n else:\r\n print(m2-m1)\r\n\r\n", "n,m=map(int,input().split())\r\na=[0]*(n+1)\r\nc=[0]*4\r\nd=[0]*4\r\nans=0\r\nfor i in range(m): \r\n x,y=sorted(map(int,input().split()))\r\n a[x]|=1\r\n a[y]|=2\r\nfor x in a: c[x]+=1\r\nif c[3]==0:\r\n for i in range(1,n):\r\n if a[i]>1: break\r\n d[a[i]]+=1\r\n c[a[i]]-=1\r\n if c[1]>0: continue\r\n ans+=1\r\nprint(ans)", "n,m=(int(z) for z in input().split())\r\nminofmax=n\r\nmaxofmin=1\r\nfor i in range(m):\r\n u,v=(int(z) for z in input().split())\r\n if u>v:\r\n u,v=v,u\r\n maxofmin=max(u,maxofmin)\r\n minofmax=min(v,minofmax)\r\nif maxofmin>minofmax:\r\n print(0)\r\nelse:\r\n print(minofmax-maxofmin)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n, A):\r\n m = len(A)\r\n left = 1\r\n right = n\r\n for i in range(m):\r\n A[i].sort()\r\n left = max(left, A[i][0])\r\n right = min(right, A[i][1])\r\n '''\r\n print('A: ' + str(A))\r\n print('left: %d, right: %d' % (left, right))\r\n '''\r\n if left >= right:\r\n return 0\r\n return right - left\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = []\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n A.append([a, b])\r\n ans = solve(n, A)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\nl = 1 \r\nr = n - 1\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if x > y:\r\n tmp = x\r\n x = y\r\n y = tmp\r\n r = min(r, y - 1)\r\n l = max(l, x)\r\nprint(max(0, r - l + 1))", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nif m==0:\r\n print (n-1)\r\nelse:\r\n i=0\r\n d1=[]\r\n d2=[]\r\n while i<m:\r\n uv=input().split()\r\n u=int(uv[0])\r\n v=int(uv[1])\r\n d1.append(max(u,v))\r\n d2.append(min(u,v))\r\n i+=1\r\n x=min(d1)\r\n y=max(d2)\r\n if x<=y:\r\n print(0)\r\n else:\r\n print(x-y)\r\n", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = [0] * (n + 1)\r\nb = [0] * (n + 1)\r\nfor i in range(m):\r\n u, v = read()\r\n if u > v: u, v = v, u\r\n a[u] = b[v] = 1\r\nL, R = 1, n\r\nfor i in range(1, n + 1):\r\n if b[i] == 1:\r\n R = i\r\n break\r\nfor i in range(n, 0, -1):\r\n if a[i] == 1:\r\n L = i\r\n break\r\nans = max(0, R - L)\r\nprint(ans)", "#https://codeforces.com/group/fzY0kNJuh2/contest/294236/problem/A\r\nn,m=map(int,input().split())\r\nma=0\r\nmi=10000000000000000\r\nfor _ in range(m):\r\n l=[int(x) for x in input().split()]\r\n l.sort()\r\n ma=max(l[0],ma)\r\n mi=min(l[1],mi)\r\nif m==0:\r\n print(n-1)\r\nelse:\r\n print(max(0,mi-ma))", "def main():\n n, m = map(int, input().split())\n lo, hi = 1, n\n for _ in range(m):\n u, v = map(int, input().split())\n if u > v:\n if lo < v:\n lo = v\n if hi > u:\n hi = u\n else:\n if lo < u:\n lo = u\n if hi > v:\n hi = v\n print(max(hi - lo, 0))\n\n\nif __name__ == '__main__':\n main()\n", "n,m = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\n\r\nav = []\r\nbv = []\r\n\r\nfor i in range(m):\r\n\tt = input()\r\n\ta,b = t.split(' ')\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tif a > b: a,b = b,a\r\n\tav.append(a)\r\n\tbv.append(b)\r\n\r\nif m == 0:\r\n\tprint(n-1)\r\n\texit()\r\n\r\nres = min(bv) - max(av)\r\n\r\nif res <= 0 : res = 0\r\n\t\r\nprint(res)", "def compute():\n n, m = [int(s) for s in input().split()]\n p = {}\n for i in range(m):\n u, v = [int(s) for s in input().split()]\n if u > v:\n if p.get(u) == 2:\n return 0\n if p.get(v) == 1:\n return 0\n p[u] = 1\n p[v] = 2\n else:\n if p.get(v) == 2:\n return 0\n if p.get(u) == 1:\n return 0\n p[v] = 1\n p[u] = 2\n div1, div2 = [], []\n for k, v in p.items():\n if v == 1:\n div1.append(k)\n else:\n div2.append(k)\n p_left = [i for i in range(1, n + 1) if i not in p]\n if not div1:\n if p_left:\n div1.append(p_left[-1])\n p_left.remove(p_left[-1])\n else:\n return 0\n if not div2:\n if p_left:\n div2.append(p_left[0])\n p_left.remove(p_left[0])\n else:\n return 0\n div1_easiest = min(div1)\n div2_hardest = max(div2)\n if div2_hardest > div1_easiest:\n return 0\n\n res = 1\n for i in range(len(p_left)):\n if p_left[i] > div1_easiest:\n pass\n elif p_left[i] < div2_hardest:\n pass\n else:\n res += 1\n\n return res\nres = compute()\nprint(res)\n", "n, m = map(int,input().split())\r\nl, r = 1, n\r\nfor i in range(m):\r\n\tx, y = map( int, input().split() )\r\n\tif x > y: x, y = y, x\r\n\tl, r = max(x,l),min(y,r)\r\nif r - l < 0: l,r=0,0\r\nprint(r - l)\r\n", "from sys import *\r\n\r\nn,m=(int(z) for z in stdin.readline().split())\r\nminofmax=n\r\nmaxofmin=1\r\nfor i in range(m):\r\n u,v=(int(z) for z in stdin.readline().split())\r\n if u>v:\r\n u,v=v,u\r\n maxofmin=max(u,maxofmin)\r\n minofmax=min(v,minofmax)\r\nif maxofmin>minofmax:\r\n stdout.write(\"0\\n\")\r\nelse:\r\n stdout.write(str(minofmax-maxofmin)+\"\\n\")", "n, m = [int(i) for i in input().split()]\ns1 = [1]\ns2 = [n]\nfor i in range(m):\n\ta, b = [int(i) for i in input().split()]\n\ts1.append(min(a,b))\n\ts2.append(max(a,b))\ns1.sort()\ns2.sort()\nif s1[-1] < s2[0]:\n\tprint(s2[0]-s1[-1])\nelse:\n\tprint(0)\n", "'''\r\nCreated on May 8, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\ndef main():\r\n n,m = map(int,input().split())\r\n lo, hi = 1, n \r\n for _ in range(m):\r\n u,v = map(int,input().split())\r\n if u>v :\r\n if lo<v:\r\n lo = v \r\n if hi>u:\r\n hi = u \r\n elif v>u:\r\n if lo<u:\r\n lo = u \r\n if hi>v:\r\n hi = v \r\n print( max(hi - lo , 0)) \r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "'''\r\nCreated on May 8, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\n'''def main():\r\n n,m = map(int,input().split())\r\n lo, hi = 1, n \r\n for _ in range(m):\r\n u,v = map(int,input().split())\r\n if u>v :\r\n if lo<v:\r\n lo = v \r\n if hi>u:\r\n hi = u \r\n elif v>u:\r\n if lo<u:\r\n lo = u \r\n if hi>v:\r\n hi = v \r\n print( max(hi - lo , 0)) \r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n '''\r\nn, m = map(int,input().split())\r\ni, j = 2,n \r\nfor k in range(m):\r\n x,y = map(int,input().split())\r\n if x>y:\r\n x,y = y,x\r\n \r\n i, j = max(i,x + 1), min(j,y)\r\nprint(max(j-i+1,0))", "n,m=map(int,input().split())\r\n\r\nx=10000000\r\ny=0 \r\nif m!=0:\r\n for i in range(m):\r\n \r\n a,b=map(int,input().split())\r\n c=min(a,b)\r\n d=max(a,b)\r\n #print(d)\r\n if c>y:\r\n y=c\r\n if d<x:\r\n x=d\r\n if x-y<0:\r\n print(0)\r\n else:\r\n print(x-y)\r\nelse:\r\n print(n-1)", "f = lambda: map(int, input().split())\r\nn, m = f()\r\na, b = 1, n\r\nfor i in range(m):\r\n u, v = sorted(f())\r\n a = max(a, u)\r\n b = min(b, v)\r\nprint(max(0, b - a))", "n, m = map(int, input().split())\r\na = set()\r\nb = set()\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if x < y:\r\n a.add(x)\r\n b.add(y)\r\n else:\r\n a.add(y)\r\n b.add(x)\r\nif m == 0:\r\n print(n-1)\r\nelse:\r\n print(max(0, min(b) - max(a)))\r\n", "n, k = map(int, input().split())\r\n\r\nmini = []\r\nmaxi = []\r\n\r\nif k == 0 :\r\n print(n - 1)\r\nelse :\r\n for _ in range(k) :\r\n q, r = map(int, input().split())\r\n mini.append(min(q, r))\r\n maxi.append(max(q, r))\r\n print(max(0, min(maxi) - max(mini)))", "def solve(data, n, m):\r\n i = 1\r\n j = n\r\n flags1 = [False]*(n+1)\r\n flags2 = [False]*(n+1)\r\n for x in data:\r\n if flags1[x[0]] and flags1[x[1]]:\r\n return 0\r\n elif flags2[x[0]] and flags2[x[1]]:\r\n return 0\r\n else:\r\n if (x[0] > x[1]):\r\n flags1[x[0]] = True\r\n flags2[x[1]] = True\r\n else:\r\n flags2[x[0]] = True\r\n flags1[x[1]] = True\r\n while i<(n+1) and flags1[i]==False:\r\n i+=1\r\n while j>0 and flags2[j]==False:\r\n j-=1\r\n if (j==0):\r\n return n-1\r\n elif (i < j):\r\n return 0\r\n else:\r\n return i-j\r\n \r\nnumb = [int(x) for x in input().split()]\r\nn = numb[0]\r\nm = numb[1]\r\ndata = []\r\nfor k in range(m):\r\n data.append([int(x) for x in input().split()])\r\n \r\nprint(solve(data,n,m))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, m] = list(map(int, input().split()))\r\nupper = n\r\nlower = 1\r\nfor i in range(m):\r\n [u, v] = list(map(int, input().split()))\r\n upper = min(upper, max(u, v))\r\n lower = max(lower, min(u, v))\r\nres = max(0, upper-lower)\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nsmall = 0\r\nlarge = n+1\r\ns = set(range(1, n+1))\r\nfor i in range(m):\r\n a, b = sorted(map(int, input().split()))\r\n if a > small:\r\n small = a\r\n if b < large:\r\n large = b\r\n s -= {a, b}\r\n if small >= large:\r\n print(0)\r\n break\r\nelse:\r\n x = 0\r\n for i in s:\r\n if small < i < large:\r\n x += 1\r\n\r\n if small == 0 and large == n+1:\r\n print(n-1)\r\n else:\r\n print(x+1)", "n, m = map(int, input().split())\r\nl, r = 1, n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n l = max(l, min(a,b))\r\n r = min(r, max(a,b))\r\nprint(max(0, r-l))\r\n", "# coding: utf-8\n\nfrom __future__ import print_function\nfrom __future__ import unicode_literals\nfrom __future__ import division\nfrom __future__ import absolute_import\nimport math\nimport string\nimport itertools\nimport fractions\nimport heapq\nimport collections\nimport re\nimport array\nimport bisect\n\ndef array2d(d1, d2, init = None):\n return [[init for _ in range(d1)] for _ in range(d2)]\n\nn, m = map(int, input().split(\" \"))\n\ndiv1 = [n]\ndiv2 = [1]\n\nfor i in range(m):\n u, v = map(int, input().split(\" \"))\n if u > v:\n u, v = (v, u)\n div1.append(v)\n div2.append(u)\n\nmin_div1 = min(div1)\nmax_div2 = max(div2)\nif min_div1 < max_div2:\n print(0)\nelse:\n print(min_div1 - max_div2)\n\n", "n,m=map(int,input().split());f,s=[],[]\r\nif m == 0:print(n-1);exit(0)\r\nfor i in range(m):a,b=map(int,input().split());f.append(min(a,b));s.append(max(a,b))\r\nif len(set(f).intersection(set(s))):print(0)\r\nelse:print(max(0,min(s)-max(f)))", "import sys\nsys.stderr = sys.stdout\n\n\ndef division(n, m, S):\n u0 = 1\n v0 = n\n for u, v in S:\n if v < u:\n u, v = v, u\n u0 = max(u0, u)\n v0 = min(v0, v)\n if u0 >= v0:\n return 0\n return v0 - u0\n\n\ndef main():\n n, m = readinti()\n S = readinttl(m)\n print(division(n, m, S))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\nmaxDiv2 = 0\r\nminDiv1 = 100000\r\n\r\nfor i in range(0, m):\r\n\ta, b = map(int, input().split())\r\n\tif (a > b):\r\n\t\ta, b = b, a\r\n\tif (a > maxDiv2):\r\n\t\tmaxDiv2 = a\r\n\tif (b < minDiv1):\r\n\t\tminDiv1 = b\r\nif m == 0:\r\n\tprint(n - 1)\r\nelse:\r\n\tprint(max(0, minDiv1 - maxDiv2))\r\n", "#coding:utf-8\r\nn, m = map(int,input().split())\r\nL=1\r\nR=n\r\nfor i in range(m):\r\n\ta, b = map(int,input().split())\r\n\tif a>b:\r\n\t\ta,b=(b,a)\r\n\tL=max(a,L)\r\n\tR=min(b,R)\r\nif R-L<=0:\r\n\tprint(0)\r\nelse:\r\n\tprint(R-L)", "a,b=map(int,input().split())\r\nl,r=1,a\r\nfor _ in \" \"*b:u,v=sorted(map(int,input().split()));l=max(l,u);r=min(r,v)\r\nprint(max(r-l,0))", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n def Intersection(l1, r1, l2, r2):\r\n if l2 < l1:\r\n l1, r1, l2, r2 = l2, r2, l1, r1\r\n return [l2, min(r1, r2)]\r\n\r\n def Len(l, r):\r\n return r - l + 1\r\n\r\n n, m = map(int, input().split())\r\n\r\n lx = 2\r\n rx = n\r\n\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n if u > v:\r\n u, v = v, u\r\n\r\n l, r = Intersection(lx, rx, u + 1, v)\r\n\r\n if Len(l, r) <= 0:\r\n print(0)\r\n return\r\n\r\n lx, rx = l * 1, r * 1\r\n\r\n print(Len(lx, rx))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys\nimport math\nimport itertools as it\nimport operator as op\nimport fractions as fr\n\nn,m = map(int,sys.stdin.readline().split())\n\n\nl,r = 1,n-1\nfor _ in range(m):\n a,b = map(int,sys.stdin.readline().split())\n if a > b: a,b = b,a\n l = max(l,a)\n r = min(r,b-1)\n\nif l <= r:\n r = r - l + 1\nelse:\n r = 0\n\nprint(r)", "n,pairs = map(int,input().split())\r\nbig = set()\r\nsmall = set()\r\nflag = False\r\nans = 0\r\nmn = 0\r\nmx = 0\r\nfor i in range(pairs):\r\n l,r = map(int,input().split())\r\n if max(l,r) in small:\r\n flag = True\r\n if min(l,r) in big:\r\n flag = True\r\n big.add(max(l,r))\r\n small.add(min(l,r))\r\nif big:\r\n mx = min(big)\r\n mn = max(small)\r\nif flag or mn>mx:\r\n print(0)\r\nelif pairs==0:\r\n print(n-1)\r\nelse:\r\n print(mx-mn)", "#n=int(input())\r\n#n,m=map(int,input().split())\r\n#arr=list(map(int,input().split()))\\\r\n#for i in range(m):\r\nn,m=map(int,input().split())\r\nA=1\r\nB=n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n if u>v:\r\n u,v=v,u\r\n #print(u,v)\r\n A=max(u,A)\r\n B=min(v,B)\r\nprint(max(0,B-A))" ]

[ "num = int(input())\nstations = list(map(int,list(input().split())))\npoints = sorted(list(map(int,list(input().split()))))\n\nsum1 = sum(stations[points[0]-1:points[1]-1])\nsum2 = sum(stations) - sum(stations[points[0]-1:points[1]-1])\n\nif sum1 < sum2:\n print(sum1)\nelse:\n print(sum2)\n\t \t \t \t\t\t\t \t \t\t \t \t \t\t", "nb_elems = [int(x) for x in input().split()]\r\nelems = [int(x) for x in input().split()]\r\nsrc, tgt = [int(x) for x in input().split()]\r\nmins = min(src, tgt)\r\nmaxs = max(src, tgt)\r\n\r\nsums = sum(elems)\r\nclockwise = sum(elems[mins-1:maxs-1])\r\naclocwise = sums - clockwise\r\nprint(min(clockwise, aclocwise))\r\n", "#!/usr/bin/env python3 \n\nn = int(input())\n\nst = list(map(int, input().split()))\ni, j = map(int, input().split())\ni -= 1\nj -= 1\nd = 0\nstation = []\nfor x in range(len(st)):\n\tstation.append(d)\n\td = d + st[x]\nstation.append(d) # last value of st list \n\nif i > j:\n\ti, j = j, i\n\ndistance = station[j] - station[i]\n\nprint(min(distance, (station[-1] - distance)))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\n\r\nd = sum(a[s - 1 : t - 1])\r\n\r\nprint(min(d, sum(a) - d))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(list(map(lambda x: int(x)-1, input().split())))\r\ntot = sum(d)\r\nprint(min(sum(d[s:t]), tot-sum(d[s:t])))", "def swap(num1,num2):\r\n arr = [num2,num1]\r\n return arr\r\n\r\nnum = int(input())\r\ndistance = list(map(int, input() .split()))\r\ncities = list(map(int, input() .split()))\r\nanswer = 0\r\nsum1 = 0\r\nsum2 = 0\r\n\r\nif cities[0] == cities[1]:\r\n answer = 0\r\nif (cities[0] > cities[1]):\r\n cities = swap(cities[0], cities[1])\r\ni = cities[0] - 1\r\nwhile(i < cities[1] - 1):\r\n sum1 += distance[i]\r\n i += 1\r\ni = cities[1] - 1\r\nwhile(i < num):\r\n sum2 += distance[i]\r\n i += 1\r\ni = 0\r\nwhile(i < cities[0] - 1):\r\n sum2 += distance[i]\r\n i += 1\r\nif(sum1 < sum2):\r\n print(sum1)\r\nelse:\r\n print(sum2)", "inp = int(input())\r\nls = list(map(int, input().split()))\r\ns1,s2 = map(int,input().split())\r\nif s1>s2: s1,s2 = s2,s1\r\nd1 = sum(ls[s1-1:s2-1])\r\nd2 = sum(ls[:s1-1])+sum(ls[s2-1:])\r\nprint(min(d1,d2))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=sum(a)\r\ns1=0\r\nl=min(b[0],b[1])\r\nr=max(b[0],b[1])\r\nfor i in range(l-1,r-1):\r\n\ts1=s1+a[i]\r\nif s-s1<s1:\r\n\tprint(s-s1)\r\nelse:\r\n\tprint(s1)", "n = int(input())\n\na = list(map(int,input().split()))\n\nx,y = input().split()\nx,y = int(x),int(y)\n\nif(x > y):\n\tx,y = y,x\n\np = sum(a[x-1:y-1])\nq = sum(a[y-1:n]) + sum(a[0:x-1])\n\nprint(min(p,q))", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\nd=[int(a)for a in input().split()]\r\na,b=map(int,input().split())\r\nput=0\r\nput1=0\r\ns=min(a-1,b-1)\r\nt=max(a-1,b-1)\r\nfor i in range(s,t):\r\n put+=d[i]\r\nfor i in range(s):\r\n put1+=d[i]\r\nfor i in range(t,len(d)):\r\n put1+=d[i]\r\nprint(min(put,put1))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\ns,t=min(x,y),max(x,y)\r\nprint(min(sum(l[s-1:t-1]),sum(l[t-1:])+sum(l[:s-1])))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\na=0\r\nb=0\r\ni=s-1\r\nwhile(1):\r\n if i==t-1:\r\n break\r\n a=a+l[i]\r\n i=(i+1)%n\r\n \r\ni=t-1\r\nwhile(1):\r\n if i==(s-1):\r\n break\r\n b=b+l[i]\r\n i=(i+1)%n\r\nif a>0 and b>0:\r\n print(min(a,b))\r\nelif a>0 and b==0:\r\n print(a)\r\nelif b>0 and a==0:\r\n print(b)\r\nelse:\r\n print(0)", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n s, t = list(map(int, input().split()))\r\n s1, t1 = min(s, t), max(s, t)\r\n\r\n answer = 0\r\n for i in range(s1 - 1, t1 - 1):\r\n answer += arr[i]\r\n\r\n alternate_answer = sum(arr) - answer\r\n print(min(answer, alternate_answer))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nd = list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\nk = d[min(s,t)-1:max(s,t)-1]\r\nprint(min(sum(k),sum(d)-sum(k)))", "def calc_shortest(D, s1, s2):\r\n #D[1:3] = D[1]+D[2] = d_2+d_3 = distance between Station 2 and Station 4\r\n if s1 == s2:\r\n return 0\r\n elif s1 < s2:\r\n path1 = sum(D[s1-1:s2-1])\r\n else:\r\n path1 = sum(D[s2-1:s1-1])\r\n\r\n path2 = sum(D)-path1\r\n\r\n if path1 < path2:\r\n return path1\r\n else:\r\n return path2\r\n\r\nN = [int(i) for i in input().strip().split()][0]\r\nD = [int(i) for i in input().strip().split()]\r\ns1, s2 = [int(i) for i in input().strip().split()]\r\nprint(calc_shortest(D, s1, s2))\r\nexit(0)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nx.sort()\r\n\r\nprint(min(sum(l[:x[0] - 1]) + sum(l[x[1] - 1:]), sum(l[x[0] - 1:x[1] - 1])))", "n = int(input())\nds = list(map(int,input().split()))\ns, t = sorted(map(int,input().split()))\n\nprint(min(sum(ds[s-1:t-1]), sum(ds) - sum(ds[s-1:t-1])))\n\t \t\t\t\t\t\t \t \t \t\t\t\t \t \t", "number = int(input())\r\narr = list(map(int , input().split()))\r\nW_stations = list(map(int , input().split()))\r\ndef sum(arr , start , end):\r\n count = 0\r\n for i in range(start , end) :\r\n count += arr[i]\r\n return count\r\nbig = max(W_stations[0] , W_stations[1])\r\nsmall = min(W_stations[1] , W_stations[0])\r\nfirst_method = sum(arr, big - 1, len(arr)) + sum(arr , 0 , small-1 )\r\nsecound_method = sum(arr , small - 1 , big-1)\r\nprint(min(secound_method , first_method))", "from typing import SupportsFloat\r\n\r\n\r\nn = int(input())\r\nd = []\r\n\r\ninp = input()\r\nd = list(map(int ,inp.split(' ')))\r\n\r\ns, t = map(int, input().split())\r\n \r\nsf = 0 \r\nsb = 0 \r\ni = s - 1 \r\nwhile (i % n != t - 1):\r\n sf += d[i%n]\r\n i+=1\r\n\r\ni = s-2\r\nwhile (i != t - 2):\r\n if (i < 0) :\r\n i += n\r\n sb += d[i]\r\n i-=1\r\n\r\nprint (min(sf, sb))\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nmaxi = max(a, b)\r\nmini = min(a, b)\r\naux = l[-1]\r\nsuma = 0\r\nfor i in range(n):\r\n l[i] += suma\r\n suma = l[i]\r\n\r\nl = [0] + l\r\nl.pop()\r\nr = abs(l[a-1]- l[b-1])\r\nle = l[-1] - l[maxi - 1] + aux + l[mini - 1]\r\n\r\nprint(min(r, le))\r\n", "def left_to_right(stations):\n\n sum = 0\n\n for i in range(stations[0] - 1, stations[1] - 1):\n sum += distances[i]\n\n return sum\n\ndef right_to_left(stations):\n\n sum = 0\n i = stations[0] - 1\n\n while(i != stations[1] - 1):\n i -= 1\n sum += distances[i]\n if (i == - 1):\n i = n_stations - 1\n\n return sum\n\n\nn_stations = int(input(\"\"))\ndistances = [int(x) for x in input(\"\").split(\" \")]\nstations = [int(x) for x in input(\"\").split(\" \")]\n\nstations = sorted(stations)\n\nsum = left_to_right(stations)\nsum1 = right_to_left(stations)\n\nif sum < sum1:\n print(sum)\nelse:\n print(sum1)\n", "def minDistances(n, distances, nOfSs: list):\r\n result1 = 0\r\n result2 = 0\r\n nOfSs.sort()\r\n pos_1 = nOfSs[0] - 1\r\n pos_2 = nOfSs[1] - 1\r\n if pos_1 == pos_2:\r\n print(0)\r\n else:\r\n for i in range(0, n):\r\n if i >= pos_1 and i < pos_2:\r\n result1 += distances[i]\r\n else:\r\n result2 += distances[i]\r\n result = result1 if result1 < result2 else result2\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n distances = [int(i) for i in input().split()]\r\n nOfSs = [int(i) for i in input().split()]\r\n minDistances(n=n, distances=distances, nOfSs=nOfSs)", "# coding: utf-8\nn = int(input())\nd = [int(i) for i in input().split()]\ns, t = [int(i) for i in input().split()]\nif s > t:\n s, t = t, s\ncircu = sum(d)\nlen1 = sum(d[s-1:t-1])\nlen2 = circu-len1\nprint(min(len1,len2))\n", "n = int(input())\nm = list(map(int, input().split()))\ns,e = map(int, input().split())\nif (s == e):\n print(0)\nelse:\n ans1 = 0\n ans2 = 0\n start = min(s,e)\n end = max(s,e)\n start-=1\n end-=1\n for i in range(start,end):\n ans1+=m[i]\n for i in range(start-1,end-n-1,-1):\n ans2+=m[i]\n print(min(ans1,ans2))", "n = input()\n\ntemp = input()\ntemp = temp.split(\" \")\nd= [int(x) for x in temp]\n\n#print(d)\n\ns1, s2 = input().split(\" \")\ns1, s2 = int(s1), int(s2)\n\nif s1 > s2:\n s1, s2 = s2, s1\n\n#print(d[s1-1:s2-1])\n#print(d[0:(s1-1)])\n#print(d[(s2-1):len(d)])\nif sum(d[s1-1:s2-1]) < sum(d[0:(s1-1)]) + sum(d[(s2-1):len(d)]):\n print(sum(d[s1-1:s2-1]))\nelse:\n print (sum(d[0:s1-1]) + sum(d[s2-1:len(d)]))\n", "\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nf = list(map(int,input().split()))\r\nf.sort()\r\n\r\n\r\na = sum(t[f[0]-1:f[1]-1])\r\n\r\nb = sum(t[f[1]-1:])+sum(t[:f[0]-1])\r\nprint(min(a,b))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\npre = [0,l[0]]\r\nfor i in range(1,n):\r\n pre.append(pre[-1]+l[i])\r\n#print(pre)\r\nif(s>t):\r\n s,t = t,s\r\ndistance = pre[t-1] - pre[s-1]\r\nprint(min(distance, (pre[-1] - distance)))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns, t = map(int, input().split())\r\nb = 0\r\nif s > t:\r\n s, t = t, s\r\nwhile s != t:\r\n s += 1\r\n b += a[s - 2]\r\nprint(min(b, sum(a) - b))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\ntmp = sum(d[s-1:t-1])\r\ntmp2 = sum(d) - tmp\r\nprint(min(tmp, tmp2))\r\n\r\n# CodeForcesian\r\n# ♥\r\n# ناشنوا باش\r\n# وقتی همگی از محال بودن آرزو هایت سخن میگویند\r\n", "import sys\r\nimport math\r\n\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nin_str = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nst = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvsum = math.fsum(in_str)\r\n\r\nvmax = 0\r\nvmin = 0\r\nif(st[0] > st[1]):\r\n vmax = st[0]\r\n vmin = st[1]\r\nelse:\r\n vmax = st[1]\r\n vmin = st[0]\r\n \r\ntemp = int(math.fsum(in_str[vmin - 1:vmax - 1]))\r\n\r\ntemp1 = int(vsum - temp)\r\n\r\nif(temp < temp1):\r\n print (temp)\r\nelse:\r\n print (temp1) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\n\r\nstart,end=sorted(s)\r\n\r\nl=l+l\r\n\r\nprint(min(sum(l[start-1:end-1]),sum(l[end-1:(n+start-1)])))", "n = int(input().strip())\nc = [int(i) for i in input().strip().split()]\np = [int(i) for i in input().strip().split()]\np.sort()\n\ns = sum(c[p[0]-1:p[1]-1])\nt = sum(c)\n\nprint(\n min(\n s,\n t - s\n )\n)\n\n\t\t\t \t\t \t \t\t\t\t \t \t\t\t\t \t\t \t\t", "stations=int(input())\r\n\r\nx=input().split()\r\n\r\nasdf,zxcv=input().split()\r\n\r\ntargetA,targetB=int(asdf)-1,int(zxcv)-1\r\n\r\nstationDistances=[0]*stations\r\n\r\n\r\nif targetB<targetA:\r\n\r\n asdf=targetA\r\n\r\n zxcv=targetB\r\n\r\n targetA=zxcv\r\n\r\n targetB=asdf\r\n\r\n\r\nfor i in range(stations):\r\n\r\n stationDistances[i]=int(x[i])\r\n\r\n\r\ni=targetA\r\n\r\nforwardDist=0\r\n\r\nwhile i!=targetB:\r\n\r\n forwardDist+=stationDistances[i]\r\n\r\n i+=1\r\n\r\n if i>=stations:\r\n\r\n i=0\r\n\r\n\r\ni=targetA\r\n\r\nbackwardDist=0\r\n\r\nwhile i!=targetB:\r\n\r\n i-=1\r\n\r\n if i<0:\r\n\r\n i=stations-1\r\n\r\n backwardDist+=stationDistances[i]\r\n\r\n\r\nif forwardDist>backwardDist:\r\n\r\n print(backwardDist)\r\n\r\nelse:\r\n\r\n print(forwardDist)", "input()\r\nD=list(map(int,input().split()))\r\ns,t =sorted(map(int,input().split()))\r\nd=sum(D[s-1:t-1])\r\nprint(min(d,sum(D)-d))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns,t=[int(x) for x in input().split()]\r\ns,t=min(s,t),max(s,t)\r\nk=sum(a)\r\nres=0\r\nfor i in range(s-1,t-1):\r\n res+=a[i]\r\nprint(min(res,k-res))", "# https://codeforces.com/contest/278/problem/A?locale=ru\r\nn = int(input())\r\ndistances = (input())\r\nd = [int(number) for number in distances.split()]\r\nstations = (input())\r\ns = [int(number) for number in stations.split()]\r\nif s[0] > s[1]:\r\n s[0], s[1] = s[1], s[0]\r\n# print(d)\r\n# print(s)\r\n\r\nsumm1 = 0\r\nfor el in range(s[0]-1, s[1]-1):\r\n summ1 += d[el]\r\n\r\nsumm2 = 0\r\nfor el in range(s[0]-1):\r\n summ2 += d[el]\r\nfor el in range(s[1]-1, len(d)):\r\n summ2 += d[el]\r\n\r\nif summ1 < summ2:\r\n print(summ1)\r\nelse:\r\n print(summ2)\r\n\r\n\r\n# s = \" 3 2 5\"\r\n# m = s.split()\r\n# print(m)\r\n", "n=int(input())\nd=[int(i) for i in input().split()]\ns,t=[int(i) for i in input().split()]\nif s==t:\n print(0)\n\ndis=0\n\nif s!=t:\n \n \n for i in range(min(s,t)-1,max(s,t)-1):\n dis+=d[i]\n\n print(min(dis,sum(d)-dis))\n \n", "n = int(input())\r\nd = list(map(int, input().split()))\r\na,b = map(int, input().split())\r\na,b = min(a,b), max(a,b)\r\nx = sum(d[a-1:b-1])\r\ny = sum(d[:a-1]) + sum(d[b-1:])\r\nprint(min(x,y))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nif t<s:s,t=t,s\r\nans=0\r\nfor i in range(s-1,t-1):\r\n ans+=l[i]\r\n l[i]=0\r\nprint(min(ans,sum(l)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\ntot = sum(l)\r\ndist = 0\r\nfor i in range(min(s,t)-1,max(s,t)-1):\r\n dist += l[i]\r\n#print(dist)\r\nprint(min(dist,tot - dist))\r\n", "if __name__ == '__main__':\n n = int(input())\n d = list(map(int, input().split()))\n s, t = map(int, input().split())\n s = s - 1\n t = t - 1\n\n if s == t:\n print(0)\n elif s < t:\n l = d[s:t]\n p = sum(l)\n q = sum(d) - sum(l)\n print(min(p, q))\n elif t < s:\n l = d[t:s]\n p = sum(l)\n q = sum(d) - sum(l)\n print(min(p, q))\n\n \t\t\t\t \t \t\t\t \t\t\t\t\t\t \t\t\t\t\t\t\t\t \t", "n = int(input())\r\nstring = input()\r\ndistances = [int(x) for x in string.split()]\r\nstring = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nx = a - 1\r\nd1 = 0\r\nwhile x != b - 1:\r\n d1 += distances[x]\r\n x += 1\r\n x = x % n\r\nx = b - 1\r\nd2 = 0\r\nwhile x != a - 1:\r\n d2 += distances[x]\r\n x += 1\r\n x = x % n\r\nprint(min([d1, d2]))", "n=int(input())\r\nstat=list(map(int, input().split()))\r\nm1, m2=map(int, input().split())\r\n\r\nm1-=1;m2-=1\r\nma=max(m1,m2)\r\nmi=min(m1,m2)\r\n\r\ns1=sum(stat[mi:ma])\r\ns2=0\r\ni=ma\r\nwhile i%n!=mi:\r\n\ts2+=(stat[i%n])\r\n\ti+=1\r\nprint(min(s1,s2))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\na, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nans = 0\r\nx = min(a, b)\r\ny = max(a, b)\r\nfor i in range(x, y):\r\n ans += d[i]\r\nprint(min(ans, s - ans))# 1698503065.8789093", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns,t=map(int,input().split())\r\nk=0\r\nif(s<=t):\r\n for i in range(s,t):\r\n k+=a[i-1]\r\n if(k<sum(a)-k):\r\n print(k)\r\n else:\r\n print(sum(a)-k)\r\nelse:\r\n for i in range(t,s):\r\n k+=a[i-1]\r\n if(k<sum(a)-k):\r\n print(k)\r\n else:\r\n print(sum(a)-k)", "n = int(input())\r\n\r\nA = input().split()\r\n\r\ns, d = input().split()\r\ns = int(s)\r\nd = int(d)\r\n\r\nif s > d:\r\n s, d = d, s\r\n\r\nS = [0] * 110\r\n\r\nfor i in range(len(A)):\r\n S[i+1] = S[i] + int(A[i])\r\n\r\n#print(S[d-1] - S[s-1], S[n] - S[d-1] + S[s-1] )\r\nres = min( S[d-1] - S[s-1], S[n] - S[d-1] + S[s-1] ) \r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=sorted(list(map(int,input().split())))\r\n\r\nz=sum(l[s-1:t-1])\r\nm=min(z,sum(l)-z)\r\nprint(m)", "n, d = int(input()), [int(i) for i in input().split()]\ns, t = (int(i) for i in input().split())\ns, t = min(s, t), max(s, t)\nres = min(sum(d[s - 1 : t - 1]), sum(d[: s - 1]) + sum(d[t - 1 :]))\nprint(res)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nd1=0\r\nd2=0\r\nm=min(s,t)-1\r\nm1=max(s,t)-1\r\nfor i in range(m,m1):\r\n d1+=l[i]\r\nj=m\r\nwhile(j!=m1):\r\n if(j==0):\r\n j=n-1\r\n else:\r\n j-=1\r\n d2+=l[j]\r\nprint(min(d1,d2))\r\n", "n=int(input())\r\nA = list(map(int,input().split()))\r\ns,e=map(int,input().split())\r\ns-=1\r\ne-=1\r\nd1 = sum(A[min(e,s):max(e,s)])\r\nd2 = sum(A[max(e,s):]) + sum(A[:min(s,e)]) \r\n\r\nprint(min(d1,d2))", "n = int(input())\r\nx = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nprint(min(\r\n sum(x[min(a, b)-1:max(a, b)-1]),\r\n sum(x[:min(a, b)-1])+sum(x[max(a, b)-1:])\r\n))", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\n[s, t] = list(map(int,input().split(\" \")))\r\nl = min(s-1,t-1)\r\nr = max(s-1,t-1)\r\nif(l == r):\r\n print(0)\r\nelse:\r\n d1 = 0\r\n i = l\r\n while(i != r):\r\n d1 += a[i]\r\n i += 1\r\n i = r\r\n d2 = 0\r\n while(i != l):\r\n d2 += a[i]\r\n i += 1\r\n i %= n\r\n \r\n print(min(d1,d2))\r\n \r\n \r\n", "# coding=utf8\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n args = str(input()).split()\r\n args = [int(it) for it in args]\r\n a = min(args) - 1\r\n b = max(args) - 1\r\n print(min(sum(line[a:b]), sum(line)-sum(line[a:b])))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nif s<t:\r\n\ts=sum(a[s-1:t-1])\r\n\tprint(min(s,sum(a)-s))\r\nelif t<s:\r\n\ts=sum(a[t-1:s-1])\r\n\tprint(min(s,sum(a)-s))\r\nelse:\r\n\tprint(0)\r\n", "n, d, s1, s2 = int(input()), list(map(int, input().split())), 0, 0\r\ns, t = map(int, input().split())\r\ni = s\r\nwhile i != t:\r\n s1, i = s1 + d[i - 1], i + 1\r\n if i == n + 1: i = 1\r\ni = s\r\nwhile i != t:\r\n if i >= 2: s2, i = s2 + d[i - 2], i - 1\r\n else: s2, i = s2 + d[n - 1], i - 1\r\n if i == 0: i = n\r\nprint(min(s1, s2))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\na,b=[int(i) for i in input().split()]\r\nif a==b:\r\n\tprint(0)\r\nelse:\r\n\tif a > b :\r\n\t\tc = a\r\n\t\ta = b\r\n\t\tb = c\r\n\ta-=1\r\n\tb-=1\r\n\t\r\n\tk1= 0\r\n\tfor i in range(a,b):\r\n\t\tk1+=l[i]\r\n\t\r\n\tk2= 0\r\n\tfor i in range(b-n,a):\r\n\t\tk2+=l[i%n]\r\n\tprint(min(k1,k2))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = input().split()\r\nl1, l2 = ((int(s[0]), int(s[1])) if int(s[0]) < int(s[1]) else (int(s[1]), int(s[0])))\r\nst = sum(l)\r\ns12 = sum([l[i-1] for i in range(1, n+1) if i >= l1 and i < l2])\r\nprint(min(s12, st-s12))\r\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\ntotal_distance = sum(d)\r\ndistance_st = 0\r\nif s < t:\r\n distance_st = sum(d[s-1:t-1])\r\nelse:\r\n distance_st = sum(d[t-1:s-1])\r\n\r\nprint(min(distance_st, total_distance - distance_st))\r\n", "n, t = int(input()), [0] + list(map(int, input().split()))\r\na, b = map(int, input().split())\r\n\r\nfor i in range(1, n + 1):\r\n t[i] += t[i - 1]\r\n\r\nif a > b: a, b = b, a\r\na, b = a - 1, b - 1\r\nprint(min(t[b] - t[a], t[a] + t[n] - t[b]))", "n=int(input());r=[*map(int,input().split())];s,t=sorted(map(int,input().split()));print(min(sum(r[s-1:t-1]),sum(r)-sum(r[s-1:t-1])))", "n=int(input())\r\ndistArray=list(map(int,input().split()))\r\nnum=list(map(int,input().split()))\r\nnum.sort()\r\ns,t=num\r\nfirstWayArray=distArray[s-1:t-1]\r\nsecondWayArray=distArray[t-1:]+distArray[:s-1]\r\nsolution=[sum(firstWayArray),sum(secondWayArray)]\r\nsolution.sort()\r\nprint(solution[0])", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns1,s2=map(int,input().split())\r\nif s1==s2:\r\n print(0)\r\nelif s1<s2:\r\n print(min(sum(l[s1-1:s2-1]),sum(l[0:s1-1])+sum(l[s2-1:])))\r\nelse:\r\n print(min(sum(l[s2-1:s1-1]),sum(l[0:s2-1])+sum(l[s1-1:])))\r\n", "# https://codeforces.com/problemset/problem/278/A\r\n\r\n\r\n_ = input()\r\ndistances = tuple(map(int, input().split()))\r\na, b = map(int, input().split())\r\na, b = min(a, b), max(a, b)\r\nfront = sum(distances[a-1: b-1])\r\nback = 0\r\ntotal = sum(distances)\r\nif front < total - front:\r\n print(front)\r\nelse:\r\n print(total-front)\r\n\r\n", "import sys\r\n\r\ndef main():\r\n _, *l, s, t = map(int, sys.stdin.read().strip().split())\r\n s, t = sorted((s-1, t-1))\r\n s1 = sum(l[s:t])\r\n s2 = sum(l[t:] + l[:s])\r\n return min(s1, s2)\r\n \r\nprint(main())\r\n", "i=lambda:[*map(int,input().split())]\r\ni()\r\na=i()\r\nc=sum(a)\r\ns,t=sorted(i())\r\nk=sum(a[x-1]for x in range(s,t))\r\nprint(min(k,c-k))", "\n\n\nn = int(input())\ndistances = list(map(int,input().split()))\nstart,end = map(int,input().split())\nif start == end :\n print(0)\n exit()\n\nif start>end :\n start,end = end,start\npath1 = 0\npath2 = sum(distances[end-1:]) + sum(distances[:start-1])\nfor i in range(start-1,end-1):\n path1+=distances[i]\nprint(min([path1,path2]))\n\n", "N = int(input())\nL = list(map(int, input().split()))\ns, t = map(int, input().split())\ns -= 1\nt -= 1\n\nnow = s\nans1 = 0\nwhile now != t:\n ans1 += L[now]\n now += 1\n if now == N:\n now = 0\n\nnow = s\nans2 = 0\nwhile now != t:\n now -= 1\n if now == -1:\n now = N - 1\n ans2 += L[now]\nprint(min(ans1, ans2))\n", "trem = int(input())\ndist = list(map(int, input().split()))\nobj = list(map(int, input().split()))\nobj = sorted(obj)\ninv = dist\nsoma_d = (sum(dist[obj[0]-1:obj[1]-1]))\nsoma_e = 0\ncont = obj[0]-1\nwhile cont != obj[1]-1:\n if cont - 1 == -1:\n cont = trem - 1\n else:\n cont -= 1\n soma_e += dist[cont]\nprint(min(soma_e, soma_d))\n\t\t\t\t \t \t \t \t\t \t\t\t \t\t\t \t\t\t \t\t", "#http://codeforces.com/problemset/problem/278/A\r\n#solved\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(list(map(int, input().split())))\r\noutput = 0\r\noutput1 = 0\r\n\r\nfor i in range(s - 1, t - 1):\r\n output += d[i]\r\n\r\nfor j in range(t - 1, n):\r\n output1 += d[j]\r\n\r\nfor k in range(0, s - 1):\r\n output1 += d[k]\r\n\r\nprint(min(output, output1))", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn=read_int()\n\ta=read_ints()\n\ts,t=read_ints()\n\tif s>t:\n\t\ts,t=t,s\n\tprint(min(sum(a[s-1:t-1]), sum(a)-sum(a[s-1:t-1])))\n\nsolve()\n", "\r\ns=0\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\nif(a>b):\r\n a,b=b,a\r\nfor i in range(a-1,b-1):\r\n s=s+l[i]\r\nx=(sum(l)-s)\r\nif(s<=x):\r\n print(s)\r\nelse:\r\n print(x)\r\n\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\nif a>b:a,b=b,a\r\ns=[0]*n\r\ns[0]=d[0]\r\nfor i in range(1,n):\r\n s[i]=d[i]+s[i-1]\r\ns.append(0)\r\ntotal=s[-2]\r\nprint(min(total-s[b-1-1]+s[a-1-1],s[b-1-1]-s[a-1-1]))\r\n", "n, = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nsa = sum(arr)\r\na,b = map(int,input().split())\r\nsb = sum(arr[min(a,b)-1:max(a,b)-1])\r\nprint(min(sb,sa-sb))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nsum1=count=0\r\nif s<t:\r\n\tfor i in range(s-1,t-1):\r\n\t\tsum1+=l[i]\r\n\tfor i in range(len(l)):\r\n\t\tif i not in range(s-1,t-1):\r\n\t\t\tcount+=l[i]\r\n\tprint(min(sum1,count))\r\nelif s>t:\r\n\tfor i in range(t-1,s-1):\r\n\t\tsum1+=l[i]\r\n\tfor i in range(len(l)):\r\n\t\tif i not in range(t-1,s-1):\r\n\t\t\tcount+=l[i]\r\n\tprint(min(sum1,count))\r\nelse:\r\n\tprint(0)", "n=int(input())\r\na= list(map(int, input().split()))\r\nt,s=map(int,input().split())\r\nif t==s:print(0)\r\nelif abs(t-s)==1:print(a[min(t,s)-1])\r\nelse:\r\n temp1=min(t,s)\r\n temp2=max(t,s)\r\n temp3=sum(a[temp1-1:temp2-1])\r\n temp4=sum(a)-temp3\r\n print(min(temp3,temp4))\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nif t<s:\r\n s,t=t,s\r\nprint(min(sum(x[:t-1])-sum(x[:s-1]),sum(x)-sum(x[:t-1])+sum(x[:s-1])))", "n=int(input())\r\na=list(map(int,input().split()))\r\nl,r=map(int,input().split())\r\ni=l-1\r\nsum1,sum2=0,0\r\nwhile (i!=r-1):\r\n\t\r\n\tsum1+=a[i]\r\n\ti+=1\r\n\tif i==n:\r\n\t\ti=0\r\n\t# print(sum1)\r\ni=r-1\r\nwhile i!=l-1 :\r\n\tsum2+=a[i]\r\n\ti+=1\r\n\tif i==n:\r\n\t\ti=0\r\n\t# print(sum2)\r\nprint(min(sum1,sum2))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\nprint(min(sum(d[s-1:t-1]), sum(d) - sum(d[s-1:t-1])))", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nif s > t:\r\n s, t = t, s # Ensure s is less than or equal to t\r\n\r\n# Calculate the shortest path\r\nclockwise = sum(distances[s - 1:t - 1])\r\ncounter_clockwise = sum(distances) - clockwise\r\n\r\nprint(min(clockwise, counter_clockwise))\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nh,j=map(int,input().split())\r\nx=min(h,j)\r\ny=max(h,j)\r\ni=x-1\r\na=0\r\nwhile i<y-1:\r\n a+=li[i]\r\n i+=1\r\ni=y-1\r\nb=0\r\nwhile i<n:\r\n b+=li[i]\r\n i+=1\r\ni=0\r\nwhile i<x-1:\r\n b+=li[i]\r\n i+=1\r\nprint(min(a,b))", "n = int(input())\nd = list(map(int, input().split()))\ns, t = sorted(list(map(int, input().split())))\nprint(min(sum(d[s - 1: t - 1]), sum(d[t - 1: n]) + sum(d[: s - 1])))\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nA = list(inputarray())\n\np, q = sorted(inputarray())\np, q = p - 1, q - 1\n\nprint(min(sum(A[p:q]), sum(A[:p]) + sum(A[q:])))\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------02.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nd=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nif s>t:s,t=t,s\r\nr=sum(d[:t-1])-sum(d[:s-1])\r\nl=sum(d[:s-1])+sum(d)-sum(d[:t-1])\r\nprint(min(r,l))", "n = int(input())\r\nd = list(map(int, input().split(' ')))\r\ns, t = sorted(list(map(int, input().split(' '))))\r\nc = sum(d[s - 1:t - 1])\r\nprint(min(c, sum(d) - c))", "\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\nst = list(map(int, input().split()))\r\ns, t = sorted(st)\r\narr += arr\r\ns-=1\r\nt-=1\r\n\r\nprint(min(sum(arr[s:t]), sum(arr[t:(num+s)])))\r\n# print(arr)\r\n# print(s)\r\n# print(t)\r\n\r\n\r\n\r\n", "n = input()\r\nd = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nif s == t:\r\n print(0)\r\nelse:\r\n tot1 = 0\r\n for i in range(min(s,t)-1, max(s,t)-1):\r\n tot1+=d[i]\r\n tot2 = sum(d)-tot1\r\n print(min(tot1, tot2))", "# using python 3 \n\ndef solution(d, initial, final):\n\tif initial == final :\n\t\treturn 0\n\n\tsum_dis = sum(d)\n\n\ttemp = initial\n\ttemp2 = final \n\tinitial = min(temp, temp2) -1 \n\tfinal = max(temp,temp2) -1\n\n\tdis = sum(d[initial : final])\n\n\treturn min(sum_dis - dis , dis)\n\nn = int(input())\nd = list(map(int, input().split()))\ninitial , final = list(map(int, input().split()))\n\nprint(solution(d, initial, final))\n\n\n", "n=int(input())\nx=list(map(int,input().split()))\na,b=list(map(int,input().split()))\ns=min(a,b)\nt=max(a,b)\ns1=sum(x[s-1:t-1])\ns2=sum(x)-s1\nprint(min(s1,s2))\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\nif(a>b):\r\n a,b=b,a\r\ns1=sum(l[a-1:b-1])\r\ns2=sum(l[0:a-1])+sum(l[b-1:])\r\nprint(min(s1,s2))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\nc=min(x,y)\r\nd=max(x,y)\r\nb=sum(a[c-1:d-1])\r\n# print(b)\r\nif b>=sum(a)-b:\r\n\tprint(sum(a)-b)\r\nelse:\r\n\tprint(b)\t", "n=int(input())\r\na=[int(a) for a in input().split()]\r\ns,t=map(int,input().split())\r\nsumm=sum(a)\r\nfirst=sum(a[min(s,t)-1:max(s,t)-1])\r\nprint(min(first,summ-first))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\nop1 = op2 = 0\r\ni = s-1\r\nwhile i != t-1:\r\n op1 += d[i]\r\n i = (i + 1) % n\r\n\r\nj = t-1\r\nwhile j != s-1:\r\n op2 += d[j]\r\n j = (j + 1) % n\r\n\r\nprint(min(op1, op2))\r\n", "n =int(input())\r\nd = list(map(int,input().split()))\r\ni,f = sorted(map(int,input().split()))\r\nl = sum(d[i-1:f-1])\r\n# print((l,[sum(d[:i])+sum(d[f-1:]),k][f == n-1]))\r\nprint(min(l,sum(d[:i-1]+d[f-1:])))", "n = int(input())\nv = list(map(int,input().strip().split()))\np = list(map(int,input().strip().split()))\nx = min(p) - 1\ny = max(p) - 1\ns = sum(v[x:y])\ns2 = sum(v)-s\nprint(min(s,s2))", "n = int(input().strip())\r\narr = list(map(int,input().split()))\r\ns, t = map(int,input().split())\r\nif s == t:\r\n print(0)\r\n exit()\r\ns, t = s-1, t-1\r\nif s < t:\r\n print(min(sum(arr[s:t]), sum(arr[t:]) + sum(arr[:s])))\r\nelse:\r\n print(min(sum(arr[t:s]), sum(arr[s:]) + sum(arr[:t])))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\n\r\nif a>b:\r\n a,b=b,a\r\n\r\nsum1=0\r\nfor i in range(a-1,b-1):\r\n sum1+=l[i]\r\n\r\nsum2=0\r\nfor i in range(b-1,n):\r\n sum2+=l[i]\r\n\r\nfor i in range(0,a-1):\r\n sum2+=l[i]\r\n\r\nprint(min(sum1,sum2))", "b=int(input())\r\na=list(map(int,input().split()))\r\nx,y=map(int,sorted(list(map(int,input().split()))))\r\nprint(min(sum(a[x-1:y-1]),sum(a)-sum(a[x-1:y-1])))", "n=int(input())\nd=list(map(int, input().split()))\ns,t=map(int, input().split())\nif s<t:\n l=d[s-1:t-1]\n p=sum(l)\n q=sum(d)-sum(l)\n print(min(p,q))\nelif t<s:\n l=d[t-1:s-1]\n p=sum(l)\n q=sum(d)-sum(l)\n print(min(p,q))\nelse:\n print(0)", "n_estacoes = int(input())\n\nentrada = str(input()).split(' ')\nd_estacoes = []\nfor dist in entrada:\n d_estacoes.append(int(dist))\ntotal = sum(d_estacoes)\n\n\nalvo = str(input()).split(' ')\nalvos = [int(alvo[0]), int(alvo[1])]\n\nif alvos[0] == alvos[1]:\n print(0)\nelse:\n a0 = min(alvos[0], alvos[1]) - 1\n a1 = max(alvos[0], alvos[1]) - 1\n caminho = 0\n for i in range(a0, a1):\n caminho += d_estacoes[i]\n print(min(total - caminho, caminho))\n\t \t\t\t \t \t \t\t \t \t \t \t \t", "n = int(input().strip())\r\nll = list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\ns -=1\r\nt -= 1\r\nif s == t:\r\n print(0)\r\nelse:\r\n if s < t:\r\n print(min(sum(ll[s:t]), sum(ll[t:]) + sum(ll[0:s])))\r\n else:\r\n print(min(sum(ll[t:s]), sum(ll[s:]) + sum(ll[0:t])))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\ns,t=min(s,t),max(s,t)\r\ns-=1\r\nt-=1\r\nz=0\r\nx=0\r\nfor i in range(s,t):\r\n z+=a[i]\r\n\r\nfor i in range(s):\r\n x+=a[i]\r\nfor i in range(t,n):\r\n x+=a[i]\r\n\r\nprint(min(z,x))\r\n \r\n", "n = int(input())\r\narr = [0]+list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\nif s==t:\r\n print(0)\r\nelse:\r\n if s>t:\r\n mini=t\r\n maxi=s\r\n else:\r\n mini=s\r\n maxi=t\r\n mini1=0\r\n for i in range(mini,maxi):\r\n mini1 += arr[i]\r\n mini2=0\r\n for i in range(maxi,n+1):\r\n mini2 += arr[i]\r\n for i in range(mini):\r\n mini2 += arr[i]\r\n print(min(mini1,mini2))\r\n ", "n=int(input())\r\nd=[int(x) for x in input().split()]\r\ns,t=map(int,input().split())\r\ns_new,t_new=min(s,t)-1,max(s,t)-1\r\nportion_sum=sum(d[s_new:t_new])\r\n\r\nprint(min(portion_sum,sum(d)-portion_sum))", "stations = int(input())\ndistances = [int(i) for i in input().split()]\nsource, destination = [int(i) - 1 for i in input().split()]\nif source > destination:\n temp = source\n source = destination\n destination = temp\nclockwise = counterclockwise = 0\nfor i in range(source, destination):\n clockwise += distances[i]\ni = source\nwhile i != destination:\n i = (i - 1) % stations\n counterclockwise += distances[i]\nprint(min(clockwise, counterclockwise))\n\t\t\t \t\t \t\t\t\t \t \t\t \t\t \t\t\t", "n = int(input())\r\nmat = list(map(int,input().split()))\r\nx,y = map(int, input().split())\r\nx,y = min(x,y)-1,max(x,y)-1\r\none_way = sum(mat[x:y])\r\nprint(min(one_way,sum(mat)-one_way))\r\n", "def solve():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n x,y = list(map(int,input().split()))\r\n v,v2 = 0,0\r\n if x > y:\r\n x,y = y,x\r\n for i in range (0,n):\r\n if i < x-1 or i > y-2:\r\n v2 += l[i]\r\n else:\r\n v += l[i]\r\n print(min(v,v2))\r\nsolve()", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\nl = li()\r\ns,t = li()\r\ns -= 1\r\nt -= 1\r\nif s > t:\r\n s,t = t,s\r\nx = y = 0\r\nfor i in range(s,t):\r\n x += l[i]\r\nfor i in range(s-1,-(n-t) - 1,-1):\r\n y += l[i]\r\nprint(min(x,y))", "from sys import stdin\n\n\ndef main():\n stdin.readline()\n l = list(map(int, stdin.readline().strip().split()))\n s, t = map(int, stdin.readline().strip().split())\n if s == t:\n return 0\n if s > t:\n s, t = t, s\n s -= 1\n t -= 1\n return min(sum(l[s:t]), sum(l[:s]) + sum(l[t:]))\n\n\nprint(main())\n", "stansiya=int(input())\r\ndlinna=list(map(int,input().split()))\r\nstart,finish=map(int,input().split())\r\nif start==finish:\r\n print(0)\r\n exit()\r\nstart1=min(start,finish)\r\nfinish1=max(start,finish)\r\nif start1==1 and finish1==stansiya:\r\n pt1=sum(dlinna[start1-1:finish1-1])\r\n pt2=dlinna[start-1]\r\n print(min(pt2,pt1))\r\nelse:\r\n pt1=sum(dlinna[start1-1:finish1-1])\r\n pt2=sum(dlinna[0:start1-1])+sum(dlinna[finish1-1:len(dlinna)])\r\n print(min(pt1,pt2))\r\n ", "n = int(input())\nl = [int(x) for x in input().split()]\ns, t = [int(x) for x in input().split()]\ns, t = min(s, t) - 1, max(s, t) - 1\nprint(min(sum(l[s: t]), sum(l[t:]) + sum(l[:s])))\n", "N = int(input())\r\nnums = []\r\nnumstr = input().split()\r\nfor i in numstr:\r\n nums.append(int(i))\r\n\r\nnumstr = input().split()\r\nind1 = int(numstr[0])-1\r\nind2 = int(numstr[1])-1\r\n\r\nif ind2<ind1:\r\n temp = ind1\r\n ind1 = ind2\r\n ind2 = temp\r\n\r\ntot = 0\r\nbetween = 0\r\nfor i in range(N):\r\n tot+=nums[i]\r\n if i>=ind1 and i<ind2:\r\n between+=nums[i]\r\n\r\nprint(min(between, tot-between))", "n = int(input())\nst = list(map(int, input().split()))\nx = list(map(int, input().split()))\na = min(x)-1\nb = max(x)-1\nif a == b:\n print(0)\n exit()\n\nal = sum(st)\n\nf = sum(st[a:b])\ns = al - f\n\nprint(min(f, s))\n", "n=int(input())\r\np=input()\r\ns=input()\r\nx=list(map(int,p.split()))\r\ny=list(map(int,s.split()))\r\nsum=0\r\nrhs=0\r\nfor i in range (min(y[0],y[1]),max(y[0],y[1])):\r\n sum=sum+x[i-1]\r\nfor j in x:\r\n rhs=rhs+j\r\nprint(min(sum,rhs-sum))\r\n", "n = int(input())\na = list(map(int, input().split()))\ns, t = map(int, input().split())\nif s > t:\n s, t = t, s\nans = min(sum(a[s-1:t-1]), sum(a) - sum(a[s-1:t-1]))\nprint(ans)", "n = int(input())\r\nr = lambda: map(int,input().split())\r\nd = list(r())\r\nstart,end = r()\r\nstart,end =min(start,end)-1,max(start,end)-1\r\n\r\nprint (min(sum(d[start:end]),sum(d[end:] + d[:start])))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nSum=sum(a)\r\nd=sum(a[min(b)-1:max(b)-1])\r\nprint(min(d,Sum-d))\r\n", "d = int(input())\r\ndistances = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nstart = min(a, b)\r\nend = max(a, b)\r\n\r\n\r\nsum1 = sum2 = 0\r\n\r\nfor i in range(end-start):\r\n sum1 += distances[start-1+i]\r\n\r\nfor j in range(d-end+1):\r\n sum2 += distances[end-1+j]\r\n\r\nfor k in range(start-1):\r\n sum2 += distances[k]\r\n\r\n\r\nprint(min(sum1, sum2))\r\n", "#!/usr/bin/python3\n\nn = int(input())\nd = list(map(int, input().split()))\ns, t = tuple(map(int, input().split()))\n\nif s > t:\n s, t = t, s\na1 = sum([d[i] for i in range(s - 1, t - 1)])\na2 = sum([d[i] for i in range(s - 2, t - n - 2, -1)])\nprint(min(a1, a2))\n", "n = int(input())\nds = list(map(int, input().split()))\na, b = sorted(map(lambda x: int(x)-1, input().split()))\n\nr1 = sum(ds[a:b])\nr2 = sum(ds[:a]) + sum(ds[b:])\nr = min(r1, r2)\nprint(r)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\na,b= map(int, input().split())\r\ns= min(a,b)\r\nt = max(a,b)\r\nx = l[s-1:t-1]\r\ny = l[:s-1] + l[t-1:]\r\nprint(min( sum(x) , sum(y) ))", "\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\nfwd = 0\r\ntotal = sum(d)\r\nfor i in range(s - 1, t - 1):\r\n fwd += d[i]\r\nprint(min(fwd, total - fwd))\r\n\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nx=sum(a[min(s,t)-1:max(s,t)-1])\r\ny=sum(a[max(s,t)-1:])+sum(a[:min(s,t)-1])\r\nprint(min(x,y))\r\n", "\r\ndef main():\r\n\r\n stations = int(input())\r\n s = list(map(int, input().split()))\r\n a, b = map(int, input().split())\r\n\r\n if (a > b):\r\n aux = a\r\n a = b\r\n b = aux\r\n\r\n path_1 = s[a-1:b-1]\r\n path_2 = s[b-1:] + s[0:a-1]\r\n\r\n print(min(sum(path_1), sum(path_2)))\r\n\r\nmain()\r\n\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nif s>t: s,t=t,s\r\ns-=1; t-=1\r\nprint(min(sum(l[s:t]),sum(l[t:])+sum(l[:s])))", "n=int(input())\r\na = list(map(int,input().split(\" \")))\r\n[s,t]=list(map(int,input().split(\" \")))\r\ns=s-1\r\nt=t-1\r\nif s==t:\r\n print(0);\r\nelse:\r\n d1=0\r\n d2=0\r\n if s>t:\r\n i=0\r\n while i<t:\r\n d1+=a[i]\r\n i+=1\r\n while i<s:\r\n d2+=a[i]\r\n i+=1\r\n while i<n:\r\n d1+=a[i]\r\n i+=1\r\n else:\r\n i = 0\r\n while i < s:\r\n d1 += a[i]\r\n i+=1\r\n while i < t:\r\n d2 += a[i]\r\n i+=1\r\n while i < n:\r\n d1 += a[i]\r\n i+=1\r\n print((d1,d2)[d1>=d2])", "n = int(input())\nar = [0] + list(map(int, input().split()))\na, b = map(int, input().split())\na, b = min(a, b), max(a, b)\nrez1 = 0\nfor i in range(a, b):\n rez1 += ar[i]\nrez2 = 0\nfor i in range(b, n + 1):\n rez2 += ar[i]\nfor i in range(1, a):\n rez2 += ar[i]\nprint(min(rez1, rez2))", "n = int(input())\r\ndist = list(map(int,input().split()))\r\nl,m = list(map(int,input().split()))\r\ns = min(l,m)\r\nt = max(l,m)\r\ns-=1\r\ncnt = 0\r\nfor i in range(s,t-1):\r\n\tcnt+=dist[i]\r\nprint(min(cnt,sum(dist)-cnt))", "n = int(input())\r\ndistances = input().split( )\r\nstart,stop = input().split()\r\nstart = int(start)\r\nstop = int(stop)\r\nbuffer=0\r\nif start < stop : \r\n for i in range(start-1,stop-1):\r\n buffer=buffer+int(distances[i])\r\nelse :\r\n for i in range(stop-1 , start-1):\r\n buffer=buffer+int(distances[i]) \r\ntotal_distance=0\r\nfor i in distances:\r\n total_distance=total_distance+int(i)\r\nanti = total_distance - buffer\r\nprint(min(buffer,anti))\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\nif s == t:\r\n print(0)\r\n exit()\r\nif s < t:\r\n start = s\r\n end = t\r\nelse:\r\n start = t\r\n end = s\r\nd = 0\r\nd1 = 0\r\nfor i in range(start-1,end-1):\r\n d += lis[i]\r\n\r\nfor j in range(end-1,n):\r\n d1 += lis[j]\r\n\r\nfor k in range(0,start-1):\r\n d1 += lis[k]\r\nif d1 < d:\r\n print(d1)\r\nelse:\r\n print(d)", "#Ana Clara Lacaze\n#193858\n \nn = int(input())\nd = list(int(x) for x in input().split())\ns,t = [int(x) for x in input().split()]\n\npath1 = sum(d[min(s,t)-1:max(s,t)-1])\npath2 = sum(d[:min(s,t)-1])+sum(d[max(s,t)-1:])\nprint(min(path1,path2))\n\t\t\t \t\t \t \t\t \t \t\t \t\t\t", "__author__ = \"runekri3\"\r\n\r\nn = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\ns, t = min(s, t), max(s, t)\r\n\r\nif s == t:\r\n print(\"0\")\r\nelse:\r\n rightwise_sum = sum(distances[s - 1:t - 1])\r\n leftwise_sum = sum(distances[:s-1]) + sum(distances[t-1:])\r\n\r\n print(min(rightwise_sum, leftwise_sum))\r\n", "input()\ndists = [int(_) for _ in input().split()]\norig, dest = input().split()\norig, dest = int(orig), int(dest)\norig -= 1\ndest -= 1\n\na = b = 0\n\nif dest == orig:\n print(0)\nelif dest > orig:\n a = sum(dists[orig:dest])\n b = sum(dists[:orig]) + sum(dists[dest:])\n print(min(a, b))\nelse:\n a = sum(dists[orig:]) + sum(dists[:dest])\n b = sum(dists[dest:orig])\n print(min(a, b))\n\n \t \t\t\t \t\t \t\t\t \t \t\t \t \t \t\t", "n = int(input())\r\nd = [int(x) for x in input().split()]\r\ns, t = [int(x) for x in input().split()]\r\nif s == t:\r\n print('0')\r\nelse:\r\n s -= 1\r\n t -= 1\r\n\r\n if s > t:\r\n s, t = t, s\r\n left = sum(d[:s])\r\n left += sum(d[t:])\r\n right = sum(d[s: t])\r\n print(min(left, right))", "n = int(input())\nd = list(map(int, input().split()))\ns, t = map(int, input().split())\n\nprint(min(sum(d[min(s-1, t-1):max(s-1, t-1)]), sum(d) - sum(d[min(s-1, t-1):max(s-1, t-1)])))\n", "def shortest_distance(arr, a, b):\r\n first_distance = sum(arr[min(a, b) - 1: max(a,b) - 1])\r\n second_distance = sum(arr[0:min(a, b) - 1]) + sum(arr[max(a, b) - 1:])\r\n return min(first_distance, second_distance)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nprint(shortest_distance(arr, a, b))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns,t = map(int, input().split())\r\nup = 0\r\ni = s-1\r\nwhile i != t-1:\r\n\tup += d[i]\r\n\ti = (i+1)%n\r\n#print (up)\r\ndown = 0\r\ni = t-1\r\nwhile i != s-1:\r\n\tdown += d[i]\r\n\ti = (i+1)%n\r\n#print (down)\r\nif down <= up:\r\n\tprint (down)\r\nelse:\r\n\tprint (up)", "n = int(input())\ndistances = [int(x) for x in input().split(\" \")]\na, b = sorted([int(x) for x in input().split(\" \")])\n\ndistance_straight = sum(distances[a-1:b-1])\ndistance_reverse = sum(distances[b-1:]) + sum(distances[:a-1])\n\nprint(min(distance_straight, distance_reverse))\n\t\t \t\t\t\t \t \t\t \t\t\t\t\t", "import math\r\nimport random\r\nimport itertools\r\nimport collections\r\nimport sys\r\nimport time\r\nimport fractions\r\nimport os\r\nimport functools\r\nimport bisect\r\n\r\n\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n return tmp\r\n\r\ndef contains(l, elem):\r\n index = bisect.bisect_left(l, elem)\r\n if index < len(l):\r\n return l[index] == elem\r\n return False\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(' ')))\r\na, b = map(int, input().split(' '))\r\n\r\nif a>b:\r\n a, b = b, a\r\n\r\na-=1\r\nb-=1\r\n\r\n\r\n\r\nsumm = sum(l)\r\nsummab = 0\r\nfor i in range(a, b):\r\n summab+=l[i]\r\n\r\n\"\"\"\r\nprint(summ, summab, a, b)\r\n\"\"\"\r\n\r\nprint(min(summab, summ-summab))", "no_stations = int(input())\ndistances = [int(i) for i in input().split(' ')]\ns, t = [int(i) for i in input().split(' ')]\nif s > t:\n aux = t\n t = s\n s = aux\n\nclockwise = sum(distances[s-1:t-1])\ncountercl = sum(distances) - clockwise\n\nif clockwise < countercl:\n print(clockwise)\nelse:\n print(countercl)\n\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\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd,k=sorted(map(int,input().split()))\r\nd=d-1\r\nk=k-1\r\nprint(min(sum(l[d:k]),sum(l)-sum(l[d:k])))", "n = int(input())\ns = [int(i) for i in input().split()]\na, b = [int(i) for i in input().split()]\nk = 0\nfor i in range(n):\n k+=s[i]\nt = 0\nfor i in range(abs(a-b)):\n t+=s[min(a,b)+i-1]\nprint(min(t, k-t))\n\n", "n = int(input())\na = list(map(int, input().split()))\ns, t = map(int, input().split())\ns -= 1\nt -= 1\nif s > t: s,t = t,s\nx = sum(a[s:t])\ny = sum(a[0:s]) + sum(a[t:n])\nprint(min(x, y))\n\n", "# A. Circle Line\n\nn = int(input())\nd = list(map(int, input().split()))\ns, t = map(int, input().split())\ns -= 1\nt -= 1\n\nif s > t:\n s, t = t, s\n\ns1 = sum(d[s:t])\ns2 = sum(d[t:]) + sum(d[:s])\nprint(min(s1, s2))\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = sorted(list(map(int, input().split())))\r\ns -= 1\r\nt -= 1\r\nprint(min(sum(d[s:t]), sum(d) - sum(d[s:t])) if s != t else '0')", "n=int(input())\r\nd=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nk=sum(d)\r\nif s>t:\r\n\ts,t=t,s\r\nl=sum(d[s-1:t-1])\r\n#print(l)\r\nif k-l>l:\r\n\tprint(l)\r\nelse:\r\n\tprint(k-l)", "n = int(input())\r\nd = list(map(int, input().split()))\r\n\r\ns, t = map(int, input().split())\r\nif s == t:\r\n print(0)\r\nelse:\r\n st, en = min(s,t), max(s,t)\r\n print(min(sum(d[st-1:en-1]), sum(d[:st-1])+sum(d[en-1:])))\r\n", "class No:\n def __init__(self, n, dado, anterior, proximo):\n self.dado = dado\n self.n = n\n self.anterior = anterior\n self.proximo = proximo\n\n\nclass ListaDuplamenteEncadeada:\n cabeca = None\n rabo = None\n\n def acrescentar(self, n, dado):\n novo_no = No(n, dado, None, None)\n if self.cabeca is None:\n novo_no.anterior = novo_no\n novo_no.proximo = novo_no\n self.cabeca = novo_no\n self.rabo = novo_no\n else:\n novo_no.anterior = self.rabo\n novo_no.proximo = self.cabeca\n self.rabo.proximo = novo_no\n self.cabeca.anterior = novo_no\n self.rabo = novo_no\n\n\na = int(input())\n\nlista = [int(c) for c in input().split()]\n\nlistaEncadeada = ListaDuplamenteEncadeada()\n\nfor i in range(len(lista)):\n\n listaEncadeada.acrescentar(i+1, lista[i])\n\n\ns, e = input().split()\ns = int(s)\ne = int(e)\n\ncurrent = listaEncadeada.cabeca\n\nwhile (current.n != s):\n current = current.proximo\n\nk = current\nsomaDireita = 0\nsomaEsquerda = 0\n\nwhile (k.n != e):\n somaDireita += k.dado\n k = k.proximo\n\nk = current\n\nwhile (k.n != e):\n k = k.anterior\n somaEsquerda += k.dado\n \nprint(min(somaDireita,somaEsquerda))\n\n\n \n\n\t\t \t\t \t \t\t \t \t\t\t\t\t\t\t \t", "#import sys\ndef calculator(a,s,e,n):\n m=sum(a[s-1:e-1])\n mm=sum(a)-m\n '''\n mm=0\n mm+=sum(a[s-2::-1])\n mm+=sum(a[e-1:])\n '''\n return min(m,mm)\n\nn=int(input())\na=list(map(int,input().split()))\ns,t=map(int,input().split())\nif s==t:\n print(0)\n exit()\nprint(calculator(a,min(t,s),max(s,t),n))\n", "def shortest_distance(n_station: int, distances: list, start: int, end: int) -> int:\r\n station_from = min(start, end)\r\n station_to = max(start, end)\r\n\r\n home = sum(distances[station_from:station_to])\r\n away = sum(distances[station_to:]) + sum(distances[:station_from])\r\n\r\n return (min(home, away))\r\n\r\n\r\nn = int(input())\r\nd = [0] + [int(i) for i in input().split()]\r\n(s, t) = map(int, input().split())\r\n\r\nprint(shortest_distance(n, d, s, t))", "def circle_line(a, s, t):\r\n n = len(a)\r\n d1 = 0\r\n for i in range(min(s, t), max(s, t)):\r\n d1 += a[i - 1]\r\n d2 = 0\r\n for i in range(max(s, t), min(s, t) + n):\r\n d2 += a[(i - 1) % n]\r\n if d2 >= d1:\r\n break\r\n return min(d1, d2)\r\n\r\n\r\nn = int(input().strip())\r\na = list(map(int, input().strip().split()))\r\nassert len(a) == n\r\ns, t = list(map(int, input().strip().split()))\r\nprint(circle_line(a, s, t))", "n = int(input()) \r\nlistt = list(map(int,input().split()))\r\nstart,end = map(int,input().split())\r\nscore = 0\r\nsc = 0\r\nif start == end : \r\n print(0)\r\nelif start > end : \r\n for i in range(start-2 , end - 2 , -1 ) :\r\n score += listt[i] \r\n scor2 = sum(listt) - score \r\n print(min(scor2 ,score))\r\nelse : \r\n for i in range(start -1 , end-1 ) : \r\n sc += listt[i]\r\n scorr = sum(listt) - sc\r\n print(min(sc,scorr))\r\n\r\n", "# It's all about what U BELIEVE\nimport sys\ninput = sys.stdin.readline\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)\nMOD = \"1000000007\"\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n############################ SOLUTION IS COMING ###############################\nn = gint()\na = gint_arr()\ns, t = gint_arr()\n\nif s > t:\n s, t = t, s\n\ns -= 1\nt -= 1\nw1 = 0\nw2 = sum(a[s:t])\n\nwhile t != s:\n w1 += a[t]\n t = (t + 1) % n\n\nprint(min(w1, w2))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nc=0\r\nsuml=sum(l)\r\nfor i in range(min(s,t),max(s,t)):\r\n c+=l[i-1]\r\n \r\nprint(min(c,suml-c))", "n = int(input())\r\nd = [int(s) for s in input().split(' ')]\r\ns, t = [int(s) for s in input().split(' ')]\r\na = min(s, t)\r\nb = max(s, t)\r\nans = min(sum(d[a - 1: b - 1]), sum(d[b - 1:]) + sum(d[:a - 1]))\r\nprint(ans)", "# Circle Line\r\nn = int(input())\r\nd = [int(x) for x in input().strip().split(\" \")]\r\ns, t = map(int, input().split())\r\na = min(s, t)\r\nb = max(s, t)\r\nprint(min(sum(d[a-1:b-1]), sum(d[b-1:]) + sum(d[:a-1])))\r\n", "n = int(input())\r\nd = [int(c) for c in input().split()]\r\na,b = sorted([int(c)-1 for c in input().split()])\r\n\r\nmin_d1 = sum(d[a:b])\r\nmin_d2 = sum(d[b:]) + sum(d[:a])\r\n\r\nprint(min(min_d1,min_d2))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\nif a > b:\r\n a,b=b,a\r\nfw,bw=0,0\r\nfor i in range(a-1,b-1):\r\n fw+=l[i]\r\nbw=sum(l)-fw\r\nprint(min(fw,bw))", "t=int(input())\r\narr=list(map(int,input().strip().split()))[:t]\r\na,b =map(int,input().split())\r\nif(b>a):\r\n\tl=b\r\n\tb=a\r\n\ta=l\r\nif(a>=b):\r\n\tans1=0\r\n\tfor i in range(a-2,b-2,-1):\r\n\t\tans1=ans1+arr[i]\r\n\tans2=0\r\n\tk=a-1\r\n\twhile(1):\r\n\t\tans2=ans2+arr[k]\r\n\t\tk+=1\r\n\t\tif(k==t):\r\n\t\t\tk=0\r\n\t\tif(k==b-1):\r\n\t\t\tbreak\r\n\t\r\nans=min(ans1,ans2)\r\nprint(ans)\r\n", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nif s > t:\r\n s, t = t, s\r\n\r\na = 0\r\n\r\nfor i in range(s - 1, t - 1):\r\n\r\n a += d[i]\r\n\r\nb = 0\r\n\r\nfor i in range(s - 2, t - n - 2, -1):\r\n\r\n b += d[i]\r\n\r\nstdout.write(str(min(a, b)))\r\n \r\n", "_ = input()\r\nlst = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nperimeter = sum(lst)\r\nif a > b: a, b = b, a\r\none = sum(x for x in lst[a-1:b-1])\r\nprint(min(one, perimeter - one))", "o = int(input())\r\na = input().split()\r\np = [int(i) for i in a]\r\nb = input().split()\r\nm = int(b[0])-1\r\nn = int(b[1])-1\r\ns = []\r\nif m<n:\r\n sum1=0\r\n for i in range(m,n):\r\n sum1+=p[i]\r\n s.append(sum1)\r\n sum2 = 0\r\n for i in range(n,o):\r\n sum2+=p[i]\r\n for i in range(m):\r\n sum2+=p[i]\r\n s.append(sum2)\r\nelse:\r\n k=m\r\n m=n\r\n n=k\r\n sum1=0\r\n for i in range(m,n):\r\n sum1+=p[i]\r\n s.append(sum1)\r\n sum2 = 0\r\n for i in range(n,o):\r\n sum2+=p[i]\r\n for i in range(m):\r\n sum2+=p[i]\r\n s.append(sum2)\r\nprint(min(s))\r\n\r\n\r\n\r\n", "import logging\n\nl = logging.Logger(\"\")\nh = logging.StreamHandler()\nf = logging.Formatter(fmt=\"[{filename}:{lineno}] {msg}\", style=\"{\")\nh.setFormatter(f)\nl.addHandler(h)\nbug = l.info\n\n# To disable uncomment the next line\n# bug = lambda x:None\n\n# teste=(1,2,3,4)\n# bug(f'{teste=}')\n# bug(f'{2*teste=}')\n\n# -------------------------------------------------------------------- #\nfrom math import sqrt\n\n\ndef main():\n n = int(input())\n stations = list(map(int, input().split()))\n i, j = map(int, input().split())\n i -= 1\n j -= 1\n\n if i == j:\n print(0)\n return\n\n distd = 0\n aux = i\n while aux != j:\n distd += stations[aux]\n if aux + 1 == n:\n aux = 0\n continue\n aux += 1\n\n diste = 0\n aux = i\n while aux != j:\n if aux - 1 == -1:\n aux = n - 1\n else:\n aux -= 1\n diste += stations[aux]\n\n print(min(distd, diste))\n\n\nif __name__ == '__main__':\n main()\n\n\t \t\t \t \t\t\t \t \t\t \t\t \t \t \t\t \t \t", "n = int(input())\n\nstations = [int(x) for x in input().split()]\ns, t = map(int, input().split())\n\nif s == t:\n ans = 0\nelse:\n if s > t:\n aux = s\n s = t\n t = aux\n s = s - 1\n t = t - 1\n right_sum = sum(stations[s:t])\n left_sum = sum(stations[:s]+stations[t:])\n ans = min(right_sum, left_sum)\n\nprint(ans)\n\n\t \t \t\t\t \t \t \t \t \t \t\t\t", "stationAmount = int(input())\nstations = input().split()\ns = sorted(input().split(), key=int)\nstartS = int(s[0])\nendS = int(s[1])\nlen1 = 0\nlen2 = 0\nfor i in range(startS-1,endS-1,1):\n len1 += int(stations[i])\nfor i in range(endS-1,len(stations),1):\n len2 += int(stations[i])\nfor i in range(0,startS-1,1):\n len2 += int(stations[i])\nprint(min(len1,len2))", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n a = input_ints()\r\n s, t = input_ints()\r\n s -= 1\r\n t -= 1\r\n if s > t:\r\n s, t = t, s\r\n x = sum(a[s:t])\r\n print(min(x, sum(a) - x))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "x = int(input())\r\na = list(map(int,input().split()))\r\nc,d = map(int,input().split())\r\nr = sum(a)\r\nif c>d:\r\n\tc,d = d,c\r\nt = sum(a[c-1:d-1])\r\nif r - t > t:\r\n\tprint(t)\r\nelse:\r\n\tprint(r-t)", "n = int(input())\n\nstations = [int(x) for x in input().split()]\n\ns, t = [int(x) for x in input().split()]\n\nfront = 0\nback = 0\n\nif (s == t): print(0)\nelif (s < t):\n for i in range(s-1, t-1):\n front += stations[i]\n for i in range(t-1, n):\n back += stations[i]\n for i in range(0, s-1):\n back += stations[i]\n if (front< back): print(front)\n else: print(back)\nelse:\n for i in range(t, s):\n front += stations[i - 1]\n for i in range(s-1, n):\n back += stations[i]\n for i in range(0, t-1):\n back += stations[i]\n if (front< back): print(front)\n else: print(back)\n\t \t \t \t\t\t\t \t\t \t \t\t \t \t", "n = input()\r\nx = list(map(int,input().split(' ')))\r\ns,e = sorted(list(map(int,input().split(' '))))\r\ntotal = sum(x)\r\ncur = sum(x[s-1:e-1])\r\nprint(min(cur,total-cur))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb,c=map(int,input().split())\r\nb-=1\r\nc-=1\r\ns=0\r\nz=[b,c]\r\nz.sort()\r\nb=z[0]\r\nc=z[1]\r\nfor i in range(b,c):\r\n s=s+a[i]\r\n a[i]=0\r\nl=0\r\nfor i in range(len(a)):\r\n l=l+a[i]\r\nprint(min(s,l))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nSum=sum(a)\r\nr=sum(a[min(b)-1:max(b)-1])\r\nprint(min(r,Sum-r))", "def circle_line(n,a,b):\r\n # x=b[0]\r\n temp1=b[0]\r\n temp2=b[0]\r\n y=b[1]\r\n dist1=0\r\n dist2=0\r\n while temp1!=y:\r\n dist1=dist1+a[temp1-1]\r\n temp1=temp1+1\r\n if temp1==(n+1):\r\n temp1=1\r\n\r\n while temp2!=y:\r\n if temp2==1:\r\n dist2=dist2+a[len(a)-1]\r\n else: \r\n dist2=dist2+a[temp2-2]\r\n\r\n temp2=temp2-1\r\n if temp2==0:\r\n temp2=n\r\n\r\n\r\n ans=min(dist1,dist2)\r\n print(ans)\r\n\r\n\r\nn=int(input(''))\r\na=list(map(int,input('').split()))\r\nb=list(map(int,input('').split()))\r\ncircle_line(n,a,b)", "'''input\n4\n2 3 4 9\n1 3\n'''\nn = int(input())\ns = list(map(int, input().split()))\na, b = map(int, input().split())\nif a > b:\n\ta, b = b, a\nprint(min(sum(s[a-1:b-1]), sum(s[:a-1]) + sum(s[b-1:])))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nb=sorted(b)\r\ns=sum(a)\r\nif(b[0]==b[1]):\r\n print (0)\r\n \r\nelse:\r\n d=sum(a[b[0]-1:b[1]-1])\r\n ans=min(d,s-d)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\ndistances = list(map(int, input().split()))\ns1, s2 = map(int, input().split())\ns1, s2 = min(s1,s2), max(s1,s2)\n\ns1 -= 1\ns2 -= 1\n\nd_total = sum(distances)\nd_p1 = sum(distances[s1:s2])\n\nprint(min(d_p1, d_total-d_p1))\n", "n = int(input())\ns = list(map(int,input().split()))\na,b= map(lambda x:int(x)-1, input().split())\nif a > b: a,b=b,a\ntot = sum(s[a:b])\nprint (min(tot, sum(s)-tot))\n", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns, t = (int(el) for el in input().split())\r\n\r\ns -= 1\r\nt -= 1\r\n\r\nr1 = 0\r\nfor i in range(min(s, t), max(s, t)):\r\n r1 += a[i]\r\n\r\nr2 = 0\r\nfor i in range(max(s, t), n):\r\n r2 += a[i]\r\n \r\nfor i in range(0, min(s, t)):\r\n r2 += a[i]\r\n \r\nprint(min(r1, r2))", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\npath1 = 0\r\nif s == t:\r\n print(0)\r\nelse:\r\n if s < t:\r\n for i in range(s-1, t-1):\r\n path1 += distances[i]\r\n else:\r\n for i in range(s-1, n):\r\n path1 += distances[i]\r\n for i in range(t-1):\r\n path1 += distances[i]\r\n path2 = 0\r\n if t < s:\r\n for i in range(t-1, s-1):\r\n path2 += distances[i]\r\n else:\r\n for i in range(t-1, n):\r\n path2 += distances[i]\r\n for i in range(s-1):\r\n path2 += distances[i]\r\n result = min(path1, path2)\r\n \r\n print(result)\r\n", "n = int(input())\ndist = input().split()\ndist = [int(d) for d in dist]\ns,t = input().split()\ns1 = int(s)\nt1 = int(t)\ns = min(s1,t1)\nt = max(s1,t1)\n\ndist1 = 0\ndist2 = 0\n\nfor i in range(s-1,t-1):\n dist1 += dist[i]\n\nj = t-1 \nwhile j!=s-1:\n dist2 += dist[j]\n j = (j+1)%n\n\n \nif dist1>dist2:\n print(dist2)\nelse:\n print(dist1)\n", "tramnum = int(input())\r\ndistances = input().split()\r\nlocations = input().split()\r\nfor i in range(tramnum):\r\n distances[i] = int(distances[i])\r\nfor i in range(2):\r\n locations[i] = int(locations[i])\r\n\r\ntotaldist = 0\r\nfor i in range(tramnum):\r\n totaldist += distances[i]\r\n\r\nway1 = 0\r\n\r\nlocations = sorted(locations)\r\n\r\ns = locations[0]\r\nt = locations[1]\r\n\r\nfor i in range(s-1, t-1):\r\n way1 += distances[i]\r\n\r\nway2 = totaldist - way1\r\n\r\nif way1 < way2:\r\n print(way1)\r\nelse:\r\n print(way2)\r\n", "def solve():\n global s, t\n s -= 1\n t -= 1\n s, t = min(s, t), max(s, t)\n return min(sum(d[s:t]), sum(d[t:] + d[:s])) \n\n\ndef main():\n global n, d, s, t\n n = int(input())\n d = list(map(int, input().split()))\n s, t = list(map(int, input().split()))\n print(solve())\n\n\nmain()\n", "n = int(input())\nx = [int(i) for i in input().split()]\ns,t = [int(i) for i in input().split()]\ns-=1\nt-=1\nx += x[:-1]\nif s>t:\n s,t=t,s\na = sum(x[s:t])\nb = sum(x[t:n+s])\nprint(min(a,b))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\na=min(l2)-1\r\nb=max(l2)-1\r\nprint(min(sum(l[a:b]),sum(l[:a])+sum(l[b:])))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\nmax_=max(s,t)\r\nmin_=min(s,t)\r\ns=min_\r\nt=max_\r\nc1=0\r\nc2=0\r\nfor i in range(s-1,t-1):\r\n c1+=l[i]\r\nfor i in range(s-1):\r\n c2+=l[i]\r\nfor i in range(t-1,n):\r\n c2+=l[i]\r\nprint(min(c1,c2))", "\nn = int(input())\ndistancias = list(input().split())\norigem, destino = input().split()\norigem, destino = int(origem), int(destino)\nif origem > destino:\n\torigem, destino = destino, origem\n\npath1 = [i for i in range(origem-1, destino-1)]\npath2 = [i for i in range(n) if i not in path1]\n# i = destino\n# while i != origem:\n# \tpath2.append(i)\n# \ti = (i+1)%n\n\nsum_path1 = 0\nfor i in path1:\n\tsum_path1+=int(distancias[i])\n\n\nsum_path2 = 0\nfor i in path2:\n\tsum_path2+=int(distancias[i])\n\nprint(min(sum_path1, sum_path2))\n# print(sum_path2)\n# print(sum_path1)", "n = int(input())\r\n\r\na = input().split()\r\ns = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n s += a[i]\r\n\r\na = a+a+a\r\nx, t = map(int,input().split())\r\nif x > t:\r\n x, t = t, x\r\nd1 = 0\r\nfor i in range(x+n-1, t+n-1):\r\n d1 += a[i]\r\nprint(min(d1, s-d1))", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn=int(input())\r\nd=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\ns,t=min(s,t),max(s,t)\r\nprint(min(sum(d[s-1:t-1]),sum(d[t-1:]+d[0:s-1])))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns,t=map(int,input().split())\r\n\r\ndef shortest(s,t,l) :\r\n a=sum(l[s-1:t-1])\r\n if t< n :\r\n b=sum(l[t-1:])+sum(l[:s-1])\r\n else:\r\n b=l[-1] +sum(l[:s-1])\r\n \r\n print(min(a,b))\r\n\r\nif s>t :\r\n temp=s\r\n s=t\r\n t=temp\r\n shortest(s,t,l)\r\nelif s==t :\r\n print(0)\r\nelse:\r\n shortest(s,t,l)", "n = int(input())\r\nl = list(map(int,input().split()))*2\r\na= sorted(list(map(int,input().split())))\r\nl.insert(0,0)\r\nz,x = 0,0\r\nfor i in range(a[0],a[1]):\r\n\tz+=l[i]\r\nfor i in range(a[1],a[0]+n):\r\n\tx+=l[i]\r\nprint(min(z,x))", "n=int(input());a=list(map(int,input().split()));x,y=map(int,input().split());a=a+a;x,y=max(x,y)-1,min(x,y)-1\r\np,q=y,x\r\ny=y+n\r\nprint(min(sum(a[x:y]),sum(a[p:q])))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\nx,y=x-1,y-1\r\nd=[]\r\nfor i in range(n-1):\r\n xx=l[i]\r\n d.append(xx)\r\nif(x==y):\r\n print(0)\r\nelse:\r\n s,c=0,0\r\n if(x<y):\r\n for i in range(x,y):\r\n s=s+l[i]\r\n for i in range(y,n):\r\n c=c+l[i]\r\n for i in range(0,x):\r\n c=c+l[i]\r\n print(min(s,c))\r\n else:\r\n for i in range(x-1,y-1,-1):\r\n s=s+l[i]\r\n for i in range(x,n):\r\n c=c+l[i]\r\n for i in range(0,y):\r\n c=c+l[i]\r\n print(min(s,c))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\ns = sum(arr[a - 1:b - 1])\r\nprint(min(s, sum(arr) - s))", "import itertools\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n data = [int(v) for v in input().split()]\r\n s,f = [int(v)-1 for v in input().split()]\r\n data = data+data\r\n s,f = min(s,f), max(s,f)\r\n print(min(sum(data[s:f]), sum(data[f:s+n])))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nz = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\ns,t = min(l),max(l)\r\nx = sum(z[s-1:t-1])\r\ny = (sum(z[:s-1]) + sum(z[t-1:]))\r\nprint(min(x,y))\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\ns, t = map(int, input().split())\r\nsum_1 = 0\r\nsum_2 = sum(l)\r\nfor i in range(min(s,t) - 1, max(s,t) - 1):\r\n sum_1 += l[i]\r\nprint(min(sum_1,sum_2 - sum_1))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\na,b=min(a,b),max(a,b)\r\nprint(min(sum(l[a-1:b-1]),(sum(l[:a-1])+sum(l[b-1:]))))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns,t = map(int, input().split())\r\n\r\nif s == t:\r\n print(0)\r\nelse:\r\n if s > t:\r\n temp = s\r\n s = t\r\n t = temp\r\n init = sum(d[s-1:t-1])\r\n print(abs(min(init, sum(d)-init)))", "n=int(input())\r\nli=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\na-=1\r\nb-=1\r\nif(a==b):\r\n print(0)\r\nelse:\r\n a,b=min(a,b),max(a,b)\r\n dist1=sum(li[a:b])\r\n dist2=sum(li[:a])+sum(li[b:])\r\n print(min(dist1,dist2))", "def circleLine(distances:list, stations:list):\n if stations[0] == stations[1]:\n print(\"0\")\n else:\n statDistances = [0]*(len(distances)+1)\n for i in range(1, len(statDistances)):\n statDistances[i] = distances[i-1] + statDistances[i-1]\n if stations[0] > stations[1]:\n distance = statDistances[stations[0]-1] - statDistances[stations[1]-1]\n else:\n distance = statDistances[stations[1]-1] - statDistances[stations[0]-1]\n print(min(distance, statDistances[-1] - distance))\n\nif __name__ == \"__main__\":\n input()\n circleLine(list(map(int, input().split(\" \"))), list(map(int, input().split(\" \"))))\n\t \t\t \t\t\t\t\t \t\t \t\t \t\t", "n = int(input())\r\ns = input().split(' ')\r\na,b = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\nif a>b :\r\n temp = a\r\n a = b\r\n b = temp\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(a-1,b-1) :\r\n count1 += int(s[i])\r\n s[i] = '0'\r\nfor i in s :\r\n count2 += int(i)\r\nif count1>count2 :\r\n print(count2)\r\nelse :\r\n print(count1)\r\n", "import sys\nn = int(input())\nd = list(map(int, sys.stdin.readline().split()))\ns, t = map(int, sys.stdin.readline().split())\nif s == t:\n print(0)\nelse:\n mi = min(s,t)-1\n ma = max(s,t)-1\n total = sum(d)\n t1 = sum(d[mi:ma])\n print(min(t1,total-t1))\n", "#https://codeforces.com/problemset/problem/278/A\r\n\r\nimport sys\r\nimport math\r\n\r\ndef main():\r\n\t#sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n\t#sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n\t#sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n\tn = int(sys.stdin.readline().strip())\r\n\tdist = list(map(int, sys.stdin.readline().strip().split()))\r\n\ts, t = map(int, sys.stdin.readline().strip().split())\r\n\tb = min(s, t)\r\n\te = max(s, t)\r\n\r\n\tx = sum(dist)\r\n\tk = sum(dist[b - 1:e - 1])\r\n\r\n\tprint(min(k, x - k))\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n#hajj", "n = int(input())\nD = list(map(int, input().split()))\ns,t = map(int, input().split())\n\ni = s-1\nr1 = 0\nwhile i != t-1:\n r1 = r1 + D[i]\n i = (i + 1) % n\n\nr2 = 0\nwhile i != s-1:\n r2 = r2 + D[i]\n i = (i + 1) % n\n\nprint(min(r1,r2))\n", "n = int(input())\r\nlst = [*map(int, input().split())]\r\ns, t = sorted(map(int, input().split()))\r\nres = sum(lst[s - 1:t - 1])\r\nprint(min(res, sum(lst) - res))\r\n", "n = int(input())\r\nD = list(map(int,input().split()))\r\ns , t = sorted(map(int,input().split()))\r\nd = sum(D[s-1:t-1])\r\n\r\nprint(min(d , sum(D)-d))\r\n\r\n\r\n", "ii = int(input())\r\nl_d = list(map(int, input().split()))\r\np, q = map(int, input().split())\r\n\r\nif p > q:\r\n t = p\r\n p = q\r\n q = t\r\n\r\nprint(min(sum(l_d[p - 1 : q - 1]), sum(l_d[:p - 1]) + sum(l_d[q - 1:])))", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN=int(input())\r\nL=list(map(int,input().split()))\r\nX,Y=map(int,input().split())\r\nS=[]\r\nsum1=0\r\nif X>Y:\r\n\tX,Y=Y,X\r\nS.append(0)\r\nS.append(0)\r\nfor i in range(N):\r\n\tsum1+=L[i]\r\n\tS.append(sum1)\r\nans1=S[Y]-S[X]\r\nans2=S[N+1]-S[Y]+S[X]\r\nprint(min(ans1,ans2))\r\n", "# circle line\n\ndef ascendingPath(distanceStations, stationA, stationB):\n maior = max(stationA, stationB)\n menor = min(stationA, stationB)\n\n return sum(distanceStations[menor-1:maior-1])\n\n\ndef descendingPath(distanceStations, stationA, stationB):\n maior = max(stationA, stationB)\n menor = min(stationA, stationB)\n aux = sum(distanceStations[maior-1:])\n aux += sum(distanceStations[:menor-1])\n return aux \n\nstations = int(input())\ndistanceStations = list(map(int,input().split()))\nstationA, stationB = list(map(int,input().split()))\nif stationA == stationB: print(0)\nelse:\n print(min(ascendingPath(distanceStations,stationA,stationB),descendingPath(distanceStations,stationA,stationB)))\n \t \t \t \t \t\t \t \t\t \t\t\t\t\t\t\t", "n = int(input())\r\nd = [0] * (n + 2)\r\nf = [0] * 102\r\n\r\ndistances = list(map(int, input().split()))\r\nfor i in range(2, n + 2):\r\n d[i] = distances[i - 2]\r\n f[i] = f[i - 1] + d[i]\r\n\r\ns, t = map(int, input().split())\r\nif s > t:\r\n s, t = t, s\r\n\r\ndistance = f[t] - f[s]\r\nalternative_distance = f[n + 1] - distance\r\nshortest_distance = min(distance, alternative_distance)\r\n\r\nprint(shortest_distance)\r\n", "def direita(distances, s, t, n):\n som = 0\n while(s != t):\n if(s >= 1 and s <= n):\n som += distances[s-1]\n s += 1\n if(s > n):\n s = 1\n return som\n\n\ndef esquerda(distances, s, t, n): \n som = 0\n while(s != t):\n if(s >= 1 and s <= n):\n som += distances[s-2]\n s -= 1\n if(s == 0):\n s = n+1\n return som\n \n \nn = int(input())\ndistances = input()\ndistances = distances.split()\nfor i in range(len(distances)):\n distances[i] = int(distances[i])\nstations = input()\ns, t = stations.split()\ns = int(s)\nt = int(t)\n\ndEsq = esquerda(distances, s, t, n)\ndDir = direita(distances, s, t, n)\nif(dEsq <= dDir):\n print(dEsq)\nelse:\n print(dDir)\n\n \t \t \t\t\t \t\t \t\t\t\t \t \t \t\t\t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nif t < s:\r\n t, s = s, t\r\n\r\nif s == t:\r\n print(0)\r\nelse:\r\n a = sum(arr)\r\n b = sum(arr[s-1:t-1])\r\n #print(arr[s-1:t-1])\r\n #print(a, b)\r\n print(min(b, a-b))\r\n\r\n", "n = int(input())\ndist = [int(x) for x in input().split()]\nline = input().split()\ns = int(line[0])\nt = int(line[1])\n\na = min(s, t)\nb = max(s, t)\n\ndist1 = 0\naux = dist.copy()\nfor i in range(a - 1, b - 1):\n dist1 += dist[i]\n aux.remove(dist[i])\n \ndist2 = sum(aux)\n\nprint(min(dist1, dist2))\n \t\t\t\t \t\t\t \t\t \t \t\t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nx=sum(a)\r\ny=sum(a[min(z)-1:max(z)-1])\r\nprint(min(y,x-y))\r\n", "n = int(input())\r\nd = [int(str) for str in input().split()]\r\ns1, f1 = [int(str) - 1 for str in input().split()]\r\ns = min(s1, f1)\r\nf = max(s1, f1)\r\ndirect = sum(d[s:f])\r\nrevers = sum(d[f:]+d[:s])\r\nif min(direct, revers) == 0 & (f - s) > 0:\r\n print(max(direct, revers))\r\nelse :\r\n print(min(direct, revers))", "z=lambda:map(int,input().split());z();a=list(z());b,c=sorted(z());print([min(sum(a[b-1:c-1]),sum(a)-sum(a[b-1:c-1])),0][b==c])", "n_stations = int(input())\n\ndist_stations = input().split()\ndist_stations = [int(x) for x in dist_stations]\n\nobjective_stations = input().split()\nobjective_stations = [int(x) for x in objective_stations]\n\nstarting_station = objective_stations[0] - 1\nfinal_station = objective_stations[1] - 1\n\ndist_between_stations_clockwise = 0\ndist_betweem_stations_counter_clockwise = 0\n\n#clockwise\nwhile starting_station != final_station:\n starting_station += 1\n starting_station = starting_station % (n_stations)\n dist_between_stations_clockwise += dist_stations[starting_station-1]\n\n\n\nstarting_station = objective_stations[0] - 1\n\n#counter clockwise\nwhile starting_station != final_station:\n final_station += 1\n final_station = final_station % n_stations\n\n dist_betweem_stations_counter_clockwise += dist_stations[final_station-1]\n\nprint(min(dist_betweem_stations_counter_clockwise, dist_between_stations_clockwise))\n \t\t\t \t\t \t\t\t\t\t \t\t \t \t\t\t \t \t\t", "n = int(input())\r\nlis = [int(i) for i in input().split()]\r\ns, t= [int(i) for i in input().split()]\r\ns += -1\r\nt += -1\r\nif(s > t):\r\n x = t\r\n t = s\r\n s = x\r\nsum1,sum2 = [0,0]\r\nfor i in range(s,t):\r\n sum1 += lis[i]\r\n\r\nfor i in range(0, n):\r\n if i in range(s, t):\r\n continue\r\n else:\r\n sum2 += lis[i]\r\nprint(min(sum1, sum2))\r\n# print(sum1)\r\n# print(sum2)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Circle Line\"\r\n# Class: A\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n = int(input())\r\n d = list(map(int, input().split()))\r\n f, t = sorted(map(int, input().split()))\r\n print(min(sum(d[f-1:t-1]), sum(d[:f-1])+sum(d[t-1:])))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "'''\r\nCreated on ٠٩‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\nn = int(input())\r\nlis = [int(x) for x in input().split()]\r\ntemp = input().split()\r\nttt = tt = t = int(temp[0])\r\nsss = ss = s = int(temp[1])\r\nlen1 = len2 = 0\r\nwhile tt != ss:\r\n len1 += lis[tt - 1]\r\n tt += 1\r\n if tt == n+1:\r\n tt = 1\r\n \r\nwhile ttt != sss:\r\n len2 += lis[ttt - 2]\r\n ttt -= 1\r\n if ttt == 0:\r\n ttt = n\r\n#print(len1 , len2)\r\nprint(min(len1,len2))\r\n", "n = int(input())\narray = input()\nparts = array.split()\narr = []\nfor t in range(0, n):\n arr.append(int(parts[t]))\n\narray1 = input()\nparts1 = array1.split()\narr1 = []\nfor t in range(0, 2):\n arr1.append(int(parts1[t]))\n\narr1.sort()\nsum1, sum2= 0, 0\n\n\ninit = arr1[0] - 1\n\nterminate = int(arr1[1])-1\nfor i in range (init, terminate):\n sum1 = sum1+ arr[i]\n\nsum2 = sum(arr) - sum1\n\nprint(min(sum1, sum2))", "n = int(input())\ndistances = list(map(int, input().split()))\n[first, second] = sorted(list(map(int, input().split())))\n\ndistance_1 = sum(distances[first - 1: second - 1])\ndistance_2 = sum(distances[:first - 1] + distances[second - 1:])\nprint(min(distance_1, distance_2))\n\n", "import sys\nmy_file = sys.stdin\n##my_file = open(\"input.txt\", \"r\")\nnum = int(my_file.readline())\ndist = my_file.readline().strip(\"\\n\").split(\" \")\ncoords = my_file.readline().strip(\"\\n\").split(\" \")\ndist = [int(i) for i in dist]\ncoords = [int(i) for i in coords]\nstart = coords[0]-1\nend = coords[1]-1\nif start > end:\n temp = start\n start = end\n end = temp\n##print(dist, \"\\n\", coords)\nlen1 = sum(dist[start:end:])\nlen2 = sum(dist[end:len(dist):])+sum(dist[:start:])\n##print(sum(dist[:start:]))\n##print(len1, len2)\nif len1<len2:\n print(len1)\nelse:\n print(len2)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl,r=map(int,input().split())\r\nw=sum(a[min(l,r)-1:max(l,r)-1])\r\nprint(min(sum(a)-w,w))", "def find_shortest_distance(n, distances, s, t):\r\n # Создаем и заполняем матрицу начальными значениями\r\n distance = [[float('inf') for _ in range(n)] for _ in range(n)]\r\n for i in range(n):\r\n distance[i][i] = 0\r\n if i < n - 1:\r\n distance[i][i+1] = distances[i]\r\n distance[i+1][i] = distances[i]\r\n else:\r\n distance[i][0] = distances[i]\r\n distance[0][i] = distances[i]\r\n\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 distance[i][k] + distance[k][j] < distance[i][j]:\r\n distance[i][j] = distance[i][k] + distance[k][j]\r\n\r\n return distance[s-1][t-1]\r\n\r\n# Входные данные\r\nn = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nresult = find_shortest_distance(n, distances, s, t)\r\nprint(result)\r\n", "n=input()\r\nd=[int(v) for v in input().split()]\r\ns,t=[int(v) for v in input().split()]\r\nif s==t:\r\n print (0)\r\n raise SystemExit\r\n\r\ns,t=min([s,t]),max([s,t])\r\n\r\nprint (min([sum(d[s-1:t-1]),sum(d)-sum(d[s-1:t-1])]))", "n = int(input())\nd = [int(x) for x in input().split()]\ncum = [0] + [sum(d[:i]) for i in range(1, len(d) + 1)]\ns, t = (int(x) for x in input().split())\ns, t = min(s, t), max(s, t)\nval = cum[t - 1] - cum[s - 1]\nprint(min(val, cum[-1] - val))\n", "n=int(input())\n\ns=(input().split())\nfor i in range(n):\n s[i]=int(s[i])\n\na,b=map(int,input().split())\n\nif(a>b):\n t=a\n a=b\n b=t\ns1=s[a-1:b-1]\ns2=s[b-1:]+s[:a-1]\nans1=0\nans2=0\nfor item in s1:\n ans1+=item\n\nfor item in s2:\n ans2+=item\n\nprint(min(ans1,ans2))\n \n", "input()\r\nl=[0]+list(map(int,input().split()))\r\na,b=map(int,input().split())\r\ntot=sum(l)\r\nfor i in range(2,len(l)-1):\r\n l[i]=l[i]+l[i-1]\r\nt=l[max(a,b)-1]-l[min(a,b)-1]\r\nprint(min(t,tot-t))\r\n", "trash = int(input());\r\n\r\ndists = [int(n) for n in input().split()];\r\ntargets = [int(n) for n in input().split()];\r\ntargets.sort();\r\n\r\nt1 = 0;\r\nt2 = 0;\r\n\r\nfor i in range(targets[0]-1, targets[1]-1):\r\n t1 += dists[i];\r\n\r\nfor i in range(targets[1]-1, len(dists)):\r\n t2 += dists[i];\r\n\r\nfor i in range(0, targets[0]-1):\r\n t2 += dists[i];\r\n \r\nprint(min(t1, t2));", "n = int(input())\r\na = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\nif s > t:\r\n s, t = t, s\r\nsum1 = sum(a[s - 1: t - 1])\r\nif sum1 < sum(a) - sum1:\r\n print(sum1)\r\nelse:\r\n print(sum(a) - sum1)\r\n\r\n", "lst=[]\r\nb=0\r\nd=0\r\nz=int(input())\r\nx=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nv=abs(c[0]-c[1])\r\n#print('v=',v)\r\nn=min(c)-1\r\n#print('n=',n)\r\nfor i in range(v):\r\n b+=x[n]\r\n# print('b=',b)\r\n n+=1\r\n#for r in range(max(c)-1,z):\r\n# d+=x[r]\r\n# print(\"d=\",d)\r\nj=0 \r\nfor r in range(z):\r\n \r\n if j not in range(min(c)-1,min(c)-1+v):\r\n lst.append(x[j])\r\n \r\n j+=1\r\n# print('j=',j)\r\n \r\nd=sum(lst) \r\n#print('lst',lst)\r\n#print(\"d=\",d) \r\nif b<d:\r\n print(b)\r\nelse:\r\n print(d)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\ns, t = map(int, input().split())\r\nsm1 = 0\r\nsm2 = 0\r\nif t < s:\r\n t, s = s - 1, t\r\nelse:\r\n t -= 1\r\nfor i in range(n):\r\n if s <= (i + 1) <= t:\r\n sm1 += a[i]\r\n else:\r\n sm2 += a[i]\r\nprint(min(sm1, sm2))\r\n", "def main():\n n = int(input())\n estacoes = [int(i) for i in input().split()]\n s, t = map(int, input().split())\n\n if s != t:\n if t < s:\n aux = s\n s = t\n t = aux\n s = s - 1\n t = t - 1\n soma_dir = sum(estacoes[s:t])\n soma_esq = sum(estacoes[:s] + estacoes[t:])\n ret = min(soma_dir, soma_esq)\n else:\n ret = 0\n\n print(ret)\n\n\nif __name__ == '__main__':\n main()\n\n \t\t \t\t\t\t\t \t \t\t \t\t\t\t\t\t \t\t", "a = int(input())\r\nb = [int(s) for s in input().split(\" \")]\r\nc = [int(s) for s in input().split(\" \")]\r\nm = 0\r\nn = 0\r\nc.sort()\r\nfor i in range(c[0],c[1]):\r\n m = m + b[i-1]\r\nfor i in range(a):\r\n n = n + b[i]\r\nif m > n - m:\r\n print (n-m)\r\nelse:\r\n print(m)", "n, dis = int(input()), list(map(int, input().split())) * 2\r\ns, t = sorted(map(int, input().split()))\r\nprint(min(sum(dis[s - 1:t - 1]), sum(dis[t - 1:s - 1 + n])))\r\n", "from itertools import accumulate\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ns, t = min(k), max(k)\r\nm = sum([i for i in d[s-1:t-1]])\r\nprint(min(m, sum(d)-m))", "n = input()\n\nline = [int(x) for x in input().split()]\n\ntotal = sum(line)\n\ns, t = input().split()\ns = int(s)\nt = int(t)\nif s > t:\n s, t = t, s\ns -= 1\nt -= 1\n\ncost = 0\n\nfor i in range(s, t):\n cost += line[i]\n\nif cost < total - cost:\n print(cost)\nelse:\n print(total - cost)\n\n\t\t\t\t\t\t\t \t\t \t \t \t\t\t \t\t", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\nif s == t:\r\n print(0)\r\n exit()\r\n\r\nif s > t:\r\n s, t = t, s\r\n\r\nclockwise_distance = sum(distances[s-1:t-1])\r\ncounterclockwise_distance = sum(distances) - clockwise_distance\r\n\r\nprint(min(clockwise_distance, counterclockwise_distance))\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 n = int(wtf[0])\r\n D = list(map(int, wtf[1].split()))\r\n s,t = map(int, wtf[2].split())\r\n if s==t:\r\n print(0)\r\n else:\r\n tmp = sorted([s,t])\r\n s = tmp[0]\r\n t = tmp[1]\r\n cw = D[s-1:t-1]\r\n ccw = D[t-1:n]\r\n ccw.extend(D[0:s-1])\r\n print(min(sum(cw),sum(ccw)))\r\n", "def solution(l1,l2):\r\n lower = min(l2)\r\n upper = max(l2)\r\n \r\n \r\n #print(l1[lower-1:upper-1])\r\n #print(l1[:lower-1],l1[upper-1:])\r\n travel1=sum(l1[lower-1:upper-1])\r\n travel2=sum(l1[:lower-1])+sum(l1[upper-1:])\r\n\r\n return min(travel1,travel2)\r\n \r\ndef answer():\r\n n = int(input())\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "def shortest_distance(distances: list, start: int, end: int) -> int:\r\n if start > end:\r\n start, end = end, start\r\n\r\n home = sum(distances[start:end])\r\n away = sum(distances[end:]) + sum(distances[:start])\r\n\r\n return min(home, away)\r\n\r\n\r\ninput()\r\nd = [0] + [int(i) for i in input().split()]\r\n(s, t) = map(int, input().split())\r\n\r\nprint(shortest_distance(d, s, t))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, f = map(int, input().split())\r\nstr = 0\r\nfor i in range(min(s, f) - 1, max(s, f) - 1):\r\n str += d[i]\r\nprint(min(str, sum(d) - str))\r\n", "n = int(input())\nd = [int(x) for x in input().split(' ')]\ns, t = [int(x) for x in input().split(' ')]\na = min(s,t)\nb = max(s,t)\nx = 0\nfor i in range(a - 1, b - 1):\n\tx += d[i]\ny = 0\nfor i in list(range(b - 1, n)) + list(range(a - 1)):\n\ty += d[i]\nprint(min(x,y))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nSum=sum(l)\r\nx=sum(l[min(s)-1:max(s)-1])\r\nprint(min(x,Sum-x))\r\n\r\n", "n = int(input())\r\n\r\ndistances = list(map(int, input().split()))\r\n\r\ntotal = sum(distances)\r\n\r\ns, t = map(int, input().split())\r\n\r\nif s == t:\r\n print(0)\r\n exit()\r\n\r\nshort = [sum(distances[s-1:t-1]), sum(distances[t-1:s-1])][s > t]\r\n\r\nprint(min(short, total-short))\r\n", "stations = []\r\nn = int(input())\r\nstations = list(map(int,input().split()))\r\nstart , end = map(int,input().split())\r\n\r\nstart -= 1\r\nend -= 1\r\n\r\nforward = 0\r\ns = start\r\nwhile True :\r\n if s == end:\r\n break\r\n \r\n forward += stations[s]\r\n s+=1\r\n if s == len(stations):\r\n s = 0\r\ns = start\r\nbackward = 0\r\nwhile True :\r\n if s == end:\r\n break\r\n \r\n backward += stations[s-1]\r\n s-=1\r\n if s == -1:\r\n s = len(stations)-1\r\nprint(forward if forward <= backward else backward)\r\n\r\n", "n,d=int(input()),list(map(int,input().split()))\r\na,b=map(int,input().split())\r\ntemp=min(a,b)\r\nb=max(a,b)\r\na=temp\r\nprint(min(sum(d[a-1:b-1]),sum(d[b-1:]+d[0:a-1])))", "def circle_line():\n n = int(input())\n dist = list(map(int,input().split()))\n origem, destino = map(int,input().split())\n\n if origem==destino:\n print(0)\n return\n if origem>destino:\n origem, destino = destino, origem\n\n c1 = 0\n for d in dist[origem-1:destino-1]:\n c1+=d\n c2 = sum(dist)-c1\n print(c1) if c1 < c2 else print(c2)\n\ncircle_line()\n\t\t \t \t\t\t \t\t\t \t \t\t \t\t \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort()\r\nr = 0\r\nl = 0\r\nfor i in range (b[0]-1,b[1]-1):\r\n l += a[i]\r\nfor i in range(b[1]-1,n):\r\n r += a[i]\r\nfor i in range(b[0]-1):\r\n r += a[i]\r\nif r<l : print (r)\r\nelse : print (l)\r\n", "#d1 -> dist de 1 a 2\nn = int(input())\nd = input().split(\" \")\nsin = input().split(\" \")\n\nd = map(int, d)\nd = list(d)\n\n# 1 <= s\n# t <= n\ns = int(sin[0])\nt = int(sin[1])\n\ndist1 = 0\ndist2 = 0\n\nif s == t:\n print(0)\nelse:\n i = min(s, t) - 1\n j = max(s, t) - 1\n while i < j:\n dist1 += d[i]\n i += 1\n \n dist2 = sum(d) - dist1\n #print(dist1, dist2)\n print(min(dist1, dist2))\n \n", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef printnl(val):\r\n\tsys.stdout.write(str(val) + '\\n')\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\nres = sum(d)\r\ns, t = map(int, input().split())\r\ns -= 1\r\nt -= 1\r\n\r\nans1, ans2 = 0, 0\r\n\r\nif s == t:\r\n\tprint(0)\r\nelif s < t:\r\n\tnow = 0\r\n\tfor i in range(s, t):\r\n\t\tnow += d[i]\r\n\tif now < res - now:\r\n\t\tprint(now)\r\n\telse:\r\n\t\tprint(res - now)\r\nelse:\r\n\tnow = 0\r\n\tfor i in range(t, s):\r\n\t\tnow += d[i]\r\n\tif now < res - now:\r\n\t\tprint(now)\r\n\telse:\r\n\t\tprint(res - now)", "n = int(input())\r\nd = []\r\nd = [int(item) for item in input().split()]\r\ns, t = map(int, input().split())\r\ndist1 = 0\r\nfor i in range(min(s, t), max(s, t)):\r\n dist1 += d[i-1]\r\ntot = 0\r\nfor i in range(0, n):\r\n tot += d[i]\r\ndist2 = tot-dist1\r\nres = min(dist2, dist1)\r\n\r\nprint(res)\r\n", "n = int(input())\r\nd = [0] + list(map(int, input().split()))\r\nl = sum(d)\r\ns, t = map(int, input().split())\r\nfor i in range(2, len(d)-1):\r\n d[i] += d[i-1]\r\nz = d[max(s, t)-1] - d[min(s, t)-1]\r\nprint(min(z, l-z))\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn = int(input())\r\nai = list(map(int,input().split()))\r\ns,t = map(int,input().split())\r\ns -= 1\r\nt -= 1\r\nai2 = [0] * (n+1)\r\nai2[0] = 0\r\nfor i in range(1,n+1):\r\n ai2[i] = ai2[i-1] + ai[i-1]\r\nprint(min(min(abs(ai2[s] - ai2[t]), abs(ai2[-1] - ai2[s]) + abs(ai2[t])), abs(ai2[-1] - ai2[t]) + abs(ai2[s])))\r\n", "n = int(input())\r\nl_d = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\n\r\nif a > b:\r\n t = a\r\n a = b\r\n b = t\r\n\r\nprint(min(sum(l_d[a - 1 : b - 1]), sum(l_d[:a - 1]) + sum(l_d[b - 1:])))", "n = int(input())\nd = list(map(int, input().split()))\ns, t = map(int, input().split())\nstart, end = min(s, t)-1, max(s, t)-1\nans = min(sum(d[start:end]), sum(d[:start]) + sum(d[end:]))\nprint(ans)\n\n \t \t\t\t\t\t\t\t\t\t \t\t \t \t", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc,d=sorted(map(int,input().split()))\r\nprint(min((sum(b[c-1:d-1]),sum(b[:c-1])+sum(b[d-1:]))))", "n=int(input())\r\nd=[int(i) for i in input().split()]\r\ns,t=[int(i) for i in input().split()]\r\nz=sum(d)\r\na=[s,t]\r\ns=min(a)\r\nt=max(a)\r\nab=abs(sum(d[s-1:t-1]))\r\nprint(min(ab,z-ab))\r\n", "def main():\n input()\n distances = [int(_) for _ in input().split()]\n stations = [int(_) for _ in input().split()]\n left = min(stations) - 1\n right = max(stations) - 1\n\n forward = sum(distances[left:right])\n reverse = sum(distances[right:]) + sum(distances[:left])\n\n print(min(forward, reverse))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input());li = list(map(int, input().split()));s, t = map(int, input().split());sum = sum(li);a = abs(s - t);x = 0\r\nfor i in range(a):x += li[min(s, t)-1+i]\r\nif((sum-x) > x):print(x)\r\nelse:print(sum-x)", "n=int(input())\r\nl=input().split()\r\ns,t=input().split()\r\ns=int(s)\r\nt=int(t)\r\nif(s==t):\r\n print(0)\r\nelse:\r\n if(s>t):\r\n s,t=t,s\r\n for i in range(n):\r\n l[i]=int(l[i])\r\n r,m=0,0\r\n for i in range(s-1,t-1):\r\n r+=l[i]\r\n i+=1\r\n for i in range(t-1,n):\r\n m+=l[i]\r\n for i in range(s-1):\r\n m+=l[i]\r\n if(m>r):\r\n print(r)\r\n else:\r\n print(m)\r\n", "x = int(input())\r\ny = list(map(int, input().split()))\r\na, b = sorted(list(map(int, input().split())))\r\nab = sum(y[a-1:b-1])\r\nba = sum(y) - ab\r\nif ab < ba:\r\n print(ab)\r\nelse:\r\n print(ba)", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\n[s, t] = sorted([int(x) for x in input().split()])\r\nprint(min(sum(L[(s-1):(t-1)]), sum(L)-sum(L[(s-1):(t-1)])))\r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl2=[int(j) for j in input().split()]\r\ns=min(l2)\r\nt=max(l2)\r\nif s==t:\r\n print(0)\r\nelse :\r\n l3=[]\r\n \r\n d=t-s\r\n count=0\r\n for k in range(d):\r\n count=count+l1[s-1+k]\r\n l3.append(count)\r\n \r\n l3.append(sum(l1)-count)\r\n\r\n print(min(l3))", "input()\r\nStations = list(map(int, input().split()))\r\nFirst, Second = list(map(int, input().split()))\r\nCount1, Count2 = 0, 0\r\ni = First - 1\r\nwhile i != Second - 1:\r\n Count1 += Stations[i]\r\n i = (i + 1) % len(Stations)\r\ni = (First - 2 if First - 2 >= 0 else len(Stations) - 1)\r\nwhile i != Second - 1:\r\n Count2 += Stations[i]\r\n i = (i - 1 if i - 1 >= 0 else len(Stations) - 1)\r\nCount2 += Stations[Second - 1]\r\nprint(min(Count2, Count1))\r\n", "n = int(input())\nd = [int(a) for a in input().split()]\ns, t = [int(a) - 1 for a in input().split()]\n\nif s > t:\n s, t = t, s\n\nlength = sum(d)\n_sum = sum(d[s:t])\n\ndist = min(_sum, length - _sum)\n\nprint(dist)", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\n\r\n# Calculate the distance by traveling in one direction\r\ndirect_distance = sum(distances[min(s, t) - 1:max(s, t) - 1])\r\n\r\n# Calculate the distance by traveling in both directions\r\ncircumference = sum(distances)\r\ncirc_distance = circumference - direct_distance\r\n\r\n# Take the minimum of the two distances\r\nmin_distance = min(direct_distance, circ_distance)\r\n\r\nprint(min_distance)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\n\r\nfc = sum(data[s - 1:t - 1])\r\nsc = sum(data[t - 1:]) + sum(data[:s - 1])\r\nprint(min(fc, sc))", "I=lambda:list(map(int,input().split()))\r\nI()\r\nd=[0]+I()\r\ns,t=sorted(I())\r\ns=sum(d[s:t])\r\nprint(min(sum(d)-s,s))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns, t = list(map(int, input().split()))\r\nif t < s:\r\n s, t = t, s\r\nx = 0\r\nfor i in range(s-1, t-1):\r\n x += d[i]\r\n d[i] = 0\r\nprint(min(x, sum(d)))", "def ring(lst, a, b):\r\n s, d1 = sum(lst), 0\r\n if a > b:\r\n a, b = b, a\r\n for i in range(a - 1, b - 1):\r\n d1 += lst[i]\r\n return min(d1, s - d1)\r\n\r\n\r\nn = int(input())\r\nz = [int(i) for i in input().split()]\r\nA, B = [int(y) for y in input().split()]\r\nprint(ring(z, A, B))\r\n", "numbers_of_stations = int(input())\n\ndistances_between_pairs_of_neighboring_stations = input().split()\n\nfor i in range(numbers_of_stations):\n distances_between_pairs_of_neighboring_stations[i] = int(distances_between_pairs_of_neighboring_stations[i])\n\ndeparture_destination = input().split()\n\nfor i in range(2):\n departure_destination[i] = int(departure_destination[i])\n\ndeparture_destination.sort()\ndeparture = departure_destination[0]\ndestination = departure_destination[1]\n\n\ndistance_way_1 = 0\ndistance_way_2 = 0\n\nfor i in range(departure - 1, destination - 1):\n distance_way_1 += distances_between_pairs_of_neighboring_stations[i]\n\nfor i in range(destination - 1, numbers_of_stations):\n distance_way_2 += distances_between_pairs_of_neighboring_stations[i]\n\nfor i in range(0, departure - 1):\n distance_way_2 += distances_between_pairs_of_neighboring_stations[i]\n\nprint(min(distance_way_1, distance_way_2))", "def solve():\r\n n = int(input())\r\n li = list(map(int, input().split()))\r\n s, t = map(int, input().split())\r\n li = li + li\r\n if s == t: \r\n print(0)\r\n return\r\n \r\n if s > t: s, t = t, s\r\n ls, rs = 0, 0\r\n for i in range(s-1, t-1):\r\n ls += li[i]\r\n\r\n s = n + s\r\n for i in range(t-1, s-1):\r\n rs += li[i]\r\n print(min(ls, rs))\r\n\r\nif __name__== \"__main__\":\r\n solve()", "# Circle Line\n\n\ndef distanceBetweenBusStops(distance, start, stop):\n if start == stop:\n return 0\n start, stop = min(start, stop), max(start, stop)\n ans1 = sum(distance[start: stop])\n i = 0\n while i != start:\n distance.append(distance[i])\n i += 1\n ans2 = sum(distance[stop:])\n return min(ans1, ans2)\n\n\nn = int(input())\narr = [0] + list(map(int, input().split()))\nstart, stop = list(map(int, input().split()))\nprint(distanceBetweenBusStops(arr, start, stop))\n", "num=int(input())\r\n\r\ns=list(map(int,input().split()))\r\n\r\na,b=map(int,input().split())\r\n\r\n\r\n\r\nif a==b:\r\n print(0)\r\n \r\nelse:\r\n t=sum(s)\r\n l=min(a,b)-1\r\n m=max(a,b)-1\r\n d2=0\r\n \r\n for i in range(l,m):\r\n d2+=s[i]\r\n \r\n print(min(t-d2,d2))", "n = int(input())\r\nd = [int(x) for x in input().split()]\r\ns, t = [int(x) for x in input().split()]\r\nif s == t:\r\n print(0)\r\n exit()\r\ntotal = sum(d)\r\ni = s - 1\r\ndis = 0\r\nwhile i != t - 1:\r\n dis += d[i]\r\n i += 1\r\n if i == n:\r\n i = 0\r\nprint(min(dis, total - dis))", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\ns,t=map(int,input().split(' '))\r\nif s!=t:\r\n\ts-=1\r\n\tt-=1\r\n\tvar1=a[min(s,t):max(s,t)]\r\n\ttemp1=a[s]\r\n\ttemp2=a[t]\r\n\ta[s]=-1\r\n\ta[t]=-2\r\n\tb=a[max(s,t):n]+a[0:max(s,t)]\r\n\tpos1=b.index(-1)\r\n\tpos2=b.index(-2)\r\n\tvar2=b[min(pos1,pos2):max(pos1,pos2)]\r\n\tif -1 in var2:\r\n\t\tvar2[pos1]=temp1\r\n\tif -2 in var2:\r\n\t\tvar2[pos2]=temp2\r\n\tprint(min(sum(var1),sum(var2)))\r\nelse:\r\n\tprint(0)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nsu = sum(arr)\r\ns, t = [int(i) for i in input().split()]\r\nif s == t:print(0)\r\nelse:\r\n ans = 0\r\n if s > t:s,t=t,s\r\n for i in range(s, t):ans += arr[i-1]\r\n if su-ans < ans:print(su-ans)\r\n else:print(ans)", "n = int(input())\r\nlis = list(map(int , input().split()))\r\ns , t = map(int , input().split())\r\nlis3 = [s ,t]\r\nj = min(lis3)\r\ni = max(lis3)\r\n\r\ni2 = max(lis3)\r\nj2 = min(lis3)\r\nsum1 = 0\r\nsum2 = 0\r\nlis2 =[]\r\nfor k in range(1,n+1):\r\n lis2.append(k)\r\nif s != t :\r\n while True:\r\n if i == n:\r\n sum1+=lis[i - 1]\r\n i = 1\r\n if i == j:\r\n break\r\n sum1+=lis[i - 1]\r\n i+=1\r\n\r\n while j2 < i2:\r\n sum2+=lis[j2 - 1]\r\n j2+=1\r\n if sum1 > sum2:\r\n print(sum2)\r\n else:\r\n print(sum1)\r\nelse:\r\n print(0)", "n = int(input())\r\nd = [int(x) for x in input().split()]\r\ns, t = [int(x) for x in input().split()]\r\nprint(min(sum(d[min(s,t)-1:max(s,t)-1]),sum(d[max(s,t)-1:])+sum(d[:min(s,t)-1])))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns, t = sorted(map(int, input().split()))\r\nprint(min(sum(a[:s - 1]) + sum(a[t - 1:]), sum(a[s - 1: t - 1])))\r\n", "def calc_shortest(N, D, s1, s2):\r\n #D[1:3] = D[1]+D[2] = d_2+d_3 = distance between Station 2 and Station 4\r\n if s1 == s2:\r\n return 0\r\n elif s1 < s2:\r\n s1_index = s1-1\r\n s2_index = s2-1\r\n else:\r\n s1_index = s2-1\r\n s2_index = s1-1\r\n\r\n #print(\"s1:\"+str(s1_index)+\" s2:\"+str(s2_index))\r\n path1 = sum(D[s1_index:s2_index])\r\n path2 = sum(D)-path1\r\n\r\n if path1 < path2:\r\n return path1\r\n else:\r\n return path2\r\n\r\nN = [int(i) for i in input().strip().split()][0]\r\nD = [int(i) for i in input().strip().split()]\r\ns1, s2 = [int(i) for i in input().strip().split()]\r\nprint(calc_shortest(N, D, s1, s2))\r\nexit(0)", "n = int(input())\r\nlst = list(map(int , input().split()))\r\na,b = list(map(int , input().split()))\r\n\r\nif a==b:\r\n print(0)\r\nelif (a==1 and b==n) or (b==1 and a==n):\r\n print(min(lst[n-1],sum(lst[:n-1])))\r\nelse:\r\n mi = min(a,b)\r\n mx = max(a,b)\r\n print(min(sum(lst[mi-1:mx-1]), sum(lst[:mi-1])+sum(lst[mx-1:])))", "class CircleLine:\r\n def __init__(self,start,destination,distances):\r\n self.start= min(start,destination)-1\r\n self.destination= max(start,destination)-1\r\n self.distances=distances\r\n def Ans(self):\r\n temp=sum(self.distances[self.start:self.destination])\r\n return min(temp,sum(self.distances)-temp)\r\n def __str__(self):\r\n return '{}'.format(self.Ans())\r\n\r\n\r\ninput()\r\ndistances=list(map(int,input().split()))\r\np1,p2=map(int,input().split())\r\nprint(CircleLine(p1,p2,distances))\r\n", "n=int(input())\r\nd=list(map(int,input().split(\" \")))\r\ns,t=list(map(int,input().split(\" \")))\r\n\r\ns,t =min(s,t ),max(s,t)\r\nsum_=sum(d)\r\na=sum(d[s-1:t-1])\r\nb=sum_-a\r\n\r\nprint(min (a,b))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nx, y = min(a,b), max(a,b)\r\no = 0\r\n\r\nfor i in range(x, y):\r\n o += l[i-1]\r\n\r\nprint(min(o, sum(l)-o))", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns, t = list(map(int, input().split()))\r\na += a\r\ns, t = min(s, t), max(s, t)\r\nprint(min(sum(a[s - 1:t - 1]), sum(a[t - 1:s + n - 1])))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns, t = map(int, input().split())\r\ns1 = 0\r\nto = 0\r\nif s <= t:\r\n pass\r\nelse:\r\n temp = t\r\n t = s\r\n s = temp\r\nfor i in range(s,t):\r\n s1 += l[i-1]\r\nfor i in range(n):\r\n to += l[i]\r\ns2 = to - s1\r\nif s1> s2:\r\n print(s2)\r\nelse:\r\n print(s1)", "n=int(input())\r\na=input().split()\r\nb=input().split()\r\n\r\nstart=int(b[0])\r\nend=int(b[1])\r\n\r\ntot=0\r\nfor i in range(len(a)):\r\n tot=tot+int(a[i])\r\n\r\ndis=0\r\nif start<end:\r\n for i in range(start,end):\r\n dis=dis+int(a[i-1])\r\nelif start>end:\r\n for i in range(end,start):\r\n dis=dis+int(a[i-1])\r\n\r\nano=tot-dis\r\n\r\nif ano>dis:\r\n print(dis)\r\nelse:\r\n print(ano)", "n = int(input())\r\nt = list(map(int, input().split())) * 2\r\na, b = sorted(map(lambda x: int(x) - 1, input().split()))\r\n\r\nprint(min(sum(t[a:b]), sum(t[b:a+n])))\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\na,b=map(int,input().split())\r\na,b=a-1,b-1\r\nif a>b:\r\n a,b=b,a\r\n\r\nif sum(s[a:b])<sum(s[:a]+s[b:]):\r\n print(sum(s[a:b]))\r\nelse:\r\n print(sum(s[:a]+s[b:]))", "input()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb=sorted(b)\r\nprint(min(sum(a[b[0]-1:b[1]-1]),sum(a[:b[0]-1])+sum(a[b[1]-1:])))", "n=int(input())\r\np=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\nw=sum(p[min(x,y)-1:max(y,x)-1])\r\nprint(min(sum(p)-w,w))", "a= int(input())\r\ns= list(map(int,(input().split())))\r\nc,d = map(int,(input().split()))\r\nif(c>d):\r\n c,d=d,c\r\ntotal=0\r\nsum=0\r\nfor i in range(len(s)):\r\n total = total+s[i]\r\nfor i in range(c-1,d-1):\r\n sum=sum+s[i]\r\nprint(min(sum,(total-sum)))\r\n", "n = int(input())\ndistances = list(map(int, input().split(' ')))\nquestion = list(map(int, input().split(' ')))\n\nif question[0] == question[1]:\n print(0)\n exit(0)\nif question[0] > question[1]:\n question[0],question[1] = question[1],question[0]\n\npossible_answer = 0\nfor i in range(question[0]-1,question[1]-1):\n possible_answer += distances[i]\n\nprint(min(possible_answer, sum(distances) - possible_answer))", "n = int(input())\nstations = list(map(int, input().split(' ')))\nde, para = map(int, input().split(' '))\n\nif de > para:\n aux = de\n de = para\n para = aux\n\nif de == para:\n print(0)\nelse:\n ida = sum(stations[de-1:para-1])\n stations = stations * 2\n volta = sum(stations[para-1:(n + de)-1])\n if ida > volta:\n print(volta)\n else:\n print(ida)" ]

[ "# [https://codeforces.com/contest/685/submission/42128998 <- https://codeforces.com/contest/685/status/B <- https://codeforces.com/contest/685 <- https://codeforces.com/blog/entry/45556 <- https://codeforces.com/problemset/problem/685/B <- https://algoprog.ru/material/pc685pB]\r\n\r\nimport bisect\r\n\r\nn, q = [int(s) for s in input().split()]\r\n\r\nps = [int(s) for s in input().split()]\r\n\r\nchilds = [[] for _ in range(n)]\r\n\r\nfor (c,pa) in enumerate(ps):\r\n childs[pa-1].append(c+1)\r\ntoposort = []\r\nthis_level = [0]\r\nnext_level = []\r\nwhile len(this_level) > 0:\r\n for this_n in this_level:\r\n toposort.append(this_n)\r\n for c in childs[this_n]:\r\n next_level.append(c)\r\n this_level = next_level\r\n next_level = []\r\n\r\nsz = [0]*n\r\npotentials = [0]*n\r\npotential_sz = [0]*n\r\npotential_lo = [0]*n\r\ncentr = [0]*n\r\n\r\nfor node in reversed(toposort):\r\n if len(childs[node]) == 0:\r\n centr[node] = node\r\n sz[node] = 1\r\n else:\r\n s = 1\r\n lg_c = -1\r\n lg_c_sz = 0\r\n for c in childs[node]:\r\n s += sz[c]\r\n if sz[c] > lg_c_sz:\r\n lg_c_sz = sz[c]\r\n lg_c = c\r\n sz[node] = s\r\n if lg_c_sz <= sz[node]//2:\r\n centr[node] = node\r\n potentials[node] = [node]\r\n potential_sz[node] = [sz[node]]\r\n continue\r\n\r\n potentials[node] = potentials[lg_c]\r\n potential_sz[node] = potential_sz[lg_c]\r\n\r\n i = bisect.bisect_right(potential_sz[node], sz[node]//2, lo=potential_lo[lg_c])\r\n centr[node] = potentials[node][i]\r\n\r\n potentials[node].append(node)\r\n potential_lo[node] = i\r\n potential_sz[node].append(sz[node])\r\n\r\nvs = [int(input()) - 1 for i in range(q)]\r\nprint('\\n'.join([str(centr[v]+1) for v in vs]))", "def main():\r\n\timport sys\r\n\tE=sys.stdin\r\n\tR=E.readline\r\n\tn,q=map(int,R().split())\r\n\tP=[0,0]+[int(i) for i in R().split()]\r\n\t#n=q=300000\r\n\t#P=[0]+list(range(n))\r\n\t#exit()\r\n\tC=[[]]\r\n\ti=0\r\n\twhile i<n:\r\n\t\ti+=1\r\n\t\tC.append([])\r\n\ti=2\r\n\tj=len(P)\r\n\twhile i<j:\r\n\t\tC[P[i]].append(i)\r\n\t\ti+=1\r\n\ti=Qi=0\r\n\tW=[0]*(n+1)\r\n\tS=[0]*(n+1)\r\n\tQ=[0]*(n+1)\r\n\twhile i<n:\r\n\t\ti+=1\r\n\t\tW[i]=len(C[i])\r\n\t\tif W[i]==0:\r\n\t\t\tQ[Qi]=i\r\n\t\t\tQi+=1\r\n\tA=[0]*(n+1)\r\n\twhile Qi:\r\n\t\tQi-=1\r\n\t\tx=Q[Qi]\r\n\t\tS[x]+=1\r\n\t\tif P[x]:\r\n\t\t\ty=P[x]\r\n\t\t\tS[y]+=S[x]\r\n\t\t\tW[y]-=1\r\n\t\t\tif W[y]==0:\r\n\t\t\t\tQ[Qi]=y\r\n\t\t\t\tQi+=1\r\n\t\ta=S[x]>>1\r\n\t\tA[x]=x\r\n\t\tfor z in C[x]:\r\n\t\t\tif S[z]>a:\r\n\t\t\t\tA[x]=A[z]\r\n\t\t\t\tb=S[x]-S[A[x]]\r\n\t\t\t\twhile b>a:\r\n\t\t\t\t\tA[x]=P[A[x]]\r\n\t\t\t\t\tb=S[x]-S[A[x]]\r\n\t\t\t\tbreak\r\n\twhile q:\r\n\t\tq-=1\r\n\t\tsys.stdout.write(str(A[int(R())])+'\\n')\r\nmain()\r\n" ]

[ "a,b = map(int,input().split())\r\nmat = []\r\nfor i in range(a) :\r\n arr = list(map(int,input().split()))\r\n mat.append(arr)\r\nmat = sorted(mat, key = lambda x : (-x[0],x[1]))\r\nprint(mat.count(mat[b-1]))", "n,k = map(int,input().split())\r\na,d = [],{}\r\nfor i in range(n):\r\n\tl = tuple(map(int,input().split()))\r\n\tif l in d:\r\n\t\td[l]+=1\r\n\telse:\r\n\t\td[l]=1\r\n\ta.append(l)\r\n\r\nb = sorted(a, key=lambda x: (x[0], 10-x[1]), reverse=True)\r\nprint(d[b[k-1]])", "a=input().split()\r\nn=int(a[0])\r\nk=int(a[1])\r\nm=[]\r\n\r\n\r\nfor i in range(n):\r\n c=input().split()\r\n m.append([int(c[0]), 50-int(c[1])])\r\n\r\n \r\nm.sort()\r\nm.reverse()\r\nsrc=m[k-1]\r\ncount=0\r\nfor i in range(n):\r\n if m[i]==src:\r\n count+=1\r\nprint(count) \r\n", "# cook your dish here\r\n\r\nn,k = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n l.append([-a,b])\r\n\r\nl.sort()\r\n\r\ni=0\r\nans=1\r\n\r\nfor j in range(k-2,-1,-1):\r\n if l[j]==l[k-1]:\r\n ans+=1\r\n # print(1,ans)\r\n else:\r\n break\r\n \r\nfor j in range(k,n):\r\n if l[j]==l[k-1]:\r\n ans+=1\r\n # print(2,ans)\r\n else:\r\n break\r\n \r\nprint(ans)", "\n\nn, k = map(int, input().split())\nli = []\nfor i in range(n):\n a, b = map(int, input().split())\n li.append((-a, b))\nli.sort()\n\n\nprint(li.count(li[k - 1]))\n", "def cmp(x,y):\r\n if x[0]>y[0]:\r\n return True\r\n elif x[0]==y[0] and x[1]<y[1]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef bubbleSort(arr):\r\n\tn = len(arr)\r\n\tfor i in range(n-1):\r\n\t\tfor j in range(0, n-i-1):\r\n\t\t\tif cmp(arr[j],arr[j + 1]):\r\n\t\t\t\tarr[j], arr[j + 1] = arr[j + 1], arr[j]\r\n\r\n\r\nn,k = map(int,input().split())\r\nx = [tuple(map(int,input().split())) for _ in range(n)]\r\nbubbleSort(x)\r\nx = x[::-1]\r\nd = {}\r\nrank = {}\r\nfor i in range(n):\r\n if x[i] in d:\r\n d[x[i]][0]+=1\r\n d[x[i]].append(i+1)\r\n else:\r\n d[x[i]] = [1,i+1]\r\nfor i in d:\r\n t = d[i][1:]\r\n for j in t:\r\n rank[j] = d[i][0]\r\n\r\nprint(rank[k])\r\n", "n,k=list(map(int,input().split()))\r\nli=[]\r\nfor t in range(n):\r\n li.append(list(map(int,input().split())))\r\nli = sorted(li,key=lambda x: (-x[0],x[1]))\r\nprint(li.count(li[k-1]))", "cases, n = map(int, input().split())\r\narr = []\r\nfor _ in range(cases):\r\n a, b = map(int, input().split())\r\n arr.append([a, b])\r\n\r\nsor = sorted(arr, key = lambda x: (-x[0], x[1]))\r\n\r\nprint(sor.count(sor[n-1]))", "n, k = map(int, input().split())\r\nA = []\r\ncon = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n A.append(a*50 - b)\r\nA.sort()\r\nfor i in range(n):\r\n if A[i] == A[n-k]:\r\n con += 1\r\nprint(con)\r\n", "def question1():\r\n total_team, count_at = map(int,input().split())\r\n teams = []\r\n for i in range(total_team):\r\n problem_solved,time_taken = map(int,input().split())\r\n teams.append([problem_solved,time_taken])\r\n for i in range(total_team-1):\r\n for j in range(total_team-1):\r\n if teams[j][0] < teams[j+1][0]:\r\n teams[j],teams[j+1] = teams[j+1],teams[j]\r\n elif teams[j][0] == teams[j+1][0]:\r\n if teams[j][1] > teams[j+1][1]:\r\n teams[j],teams[j+1] = teams[j+1],teams[j]\r\n \r\n count = 0\r\n for i in range(total_team):\r\n if teams[i] == teams[count_at-1]:\r\n count += 1\r\n return count \r\n \r\n \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(question1())\r\n remained_test_cases -= 1 ", "import os.path\r\nimport sys\r\nfrom math import *\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef inp(): return sys.stdin.readline().strip()\r\n\r\n\r\nn,k=map(int,inp().split())\r\nml=[]\r\nfor i in range(n):\r\n a,b=map(int,inp().split())\r\n ml.append((a,-b))\r\nml.sort(reverse=True)\r\nprint(ml.count(ml[k-1]))", "n, k = map(int, input().split())\r\nl = [0]*n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l[i] = 100*x - y\r\n # l.append([x,y])\r\n # l[0].append(x)\r\n # l[1].append(y)\r\nl.sort(reverse=True)\r\n# l = sorted(l, key=lambda x: x[0], reverse= True)\r\nprint(l.count(l[k-1]))", "from bisect import bisect_left, bisect_right\r\n\r\nn, k = map(int, input().split())\r\nli = []\r\n\r\nfor _ in range(n):\r\n p, t = map(int, input().split())\r\n li.append(100*p-t)\r\nli.sort()\r\n\r\nx = bisect_left(li, li[-k])+1\r\ny = bisect_right(li, li[-k])\r\n\r\nprint(y-x+1)", "n , t = map(int ,input().split())\r\nres = []\r\nfor i in range(n):\r\n s = list(map(int , input().split()))\r\n res.append(s)\r\nref = [] \r\nfor i in res : \r\n if i[0] not in ref : \r\n ref.append(i[0])\r\nref = sorted(ref , reverse= True)\r\n\r\nresult = [] \r\nfor i in ref : \r\n x= [] \r\n for j in res: \r\n if j[0] == i :\r\n x.append(j) \r\n x=sorted(x , key= lambda x : x[1])\r\n for k in x:\r\n result.append(k) \r\nprint(result.count(result[t-1]))\r\n", "n, k = map(int, input().split())\r\nl = {}\r\nma = 0\r\np = 0\r\nr = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n ma = max(ma, b)\r\n key = str(a) + ' ' + str(b)\r\n if key not in l:\r\n l[key] = 1\r\n else:\r\n l[key] += 1\r\n\r\ndef so(x):\r\n a, b = map(int, x[0].split())\r\n return (a, ma-b)\r\n\r\nl = sorted(l.items(), key=so, reverse=True)\r\n\r\nfor a, b in l:\r\n r += b\r\n # print(a, b, r)\r\n if r >= k:\r\n print(b)\r\n break", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000005\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n\r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n\r\nfrom math import inf, ceil, sqrt, log2\r\nfrom collections import defaultdict\r\n\r\ndd = lambda x: defaultdict(lambda: x)\r\n\r\n(n, k), a = minp(), list()\r\nfor _ in range(n) : a.append(linp())\r\na = sorted(a, key=lambda x: (-x[0], x[1]))\r\nprint(a.count(a[k-1]))", "n,k = map(int,input().split())\r\ns = []\r\n\r\nfor i in range(n):\r\n\ta,b = map(int,input().split())\r\n\tr = a**a-b\r\n\ts.append(r)\r\n\r\n\r\ns.sort(reverse=True)\r\n\r\n\r\nprint(s.count(s[k-1]))", "def rankList():\r\n n,k = map(int,input().split())\r\n l=[]\r\n hash=[0]*51\r\n for i in range(n):\r\n p,t = map(int,input().split())\r\n hash[p] += 1\r\n l.append((p,t))\r\n l=sorted(l,reverse=True)\r\n i=0\r\n nl=[]\r\n while i<n:\r\n count = hash[l[i][0]]\r\n nl.append(l[i:i+count])\r\n i += count\r\n for i in nl:\r\n i.sort()\r\n nll=[]\r\n for i in nl:\r\n nll=nll+i\r\n print(nll.count(nll[k-1]))\r\n\r\n\r\nrankList()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\nmatrix = []\nfor _ in range(n):\n matrix.append(list(map(int, input().split())))\n\n#sorted_matrix = sorted(matrix)[::-1]\n\nmatrix.sort(key=lambda x: (-x[0], x[1]))\n\nprint(matrix.count(matrix[k-1]))\n", "n, k = map(int, input().split())\r\n\r\ntm = []\r\n\r\nfor _ in range(n):\r\n p, t = map(int, input().split())\r\n tm.append([p, t])\r\n\r\ntm.sort(key=lambda x: (x[0] * -1, x[1]))\r\nans = tm.count(tm[k-1])\r\nprint(ans)\r\n", "from collections import*\r\nn,k=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n mat.append(a)\r\nmat.sort(reverse=True)\r\nnew=defaultdict(list)\r\nfor i in mat:\r\n new[i[0]].append(i[1])\r\nfor i in new:\r\n new[i].sort()\r\nres=[]\r\nd=OrderedDict()\r\nfor i in new:\r\n for j in range(len(new[i])):\r\n a=tuple([i,new[i][j]])\r\n if a in d:\r\n d[a]+=1\r\n else:\r\n d[a]=1\r\nres=[]\r\ntemp=list(d.values())\r\nfor i in temp:\r\n for j in range(i):\r\n res.append(i)\r\nprint(res[k-1])\r\n\r\n\r\n", "n, k = map(int, input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int, input().split())))\r\narr.sort(reverse=True, key=lambda x: (x[0], -x[1]))\r\ncount = 0\r\nteam = arr[k-1]\r\nfor ele in arr:\r\n if team[0] == ele[0] and team[1] == ele[1]:\r\n count += 1\r\nprint(count)", "n, k = map(int, input().split())\r\nl = []\r\nfor x in range (n):\r\n p, t = map(int, input().split())\r\n l.append((p,t))\r\n l.sort(key=lambda k: (k[0], -k[1]), reverse=True)\r\n\r\nprint(l.count(l[k-1]))", "n,k=map(int,input().split())\r\nd=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d.append((a,b))\r\n# print(d)\r\n# d.sort(key=)\r\nfor i in range(len(d)):\r\n for j in range(0,len(d)-i-1):\r\n if d[j][0]<d[j+1][0]:\r\n d[j],d[j+1]=d[j+1],d[j]\r\n# print(d)\r\nfor i in range(len(d)):\r\n for j in range(0,len(d)-i-1):\r\n # print(i,j)\r\n if d[j][0]==d[j+1][0] and d[j][1]>d[j+1][1]:\r\n d[j],d[j+1]=d[j+1],d[j]\r\n# print(d)\r\nprint(d.count(d[k-1]))", "# Rank List\r\ndef solve(teams, m):\r\n teams.sort(key=lambda x: (-x[0], x[1]))\r\n return teams.count(teams[m-1])\r\n \r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n teams = []\r\n for _ in range(n):\r\n teams.append(list(map(int, input().split())))\r\n print(solve(teams, m))", "import sys\r\nf = sys.stdin\r\n\r\nn, k = map(int, f.readline().strip().split())\r\nk -= 1\r\np, t = [], []\r\nfor line in f:\r\n p.append(int(line.strip().split()[0]))\r\n t.append(int(line.strip().split()[1]))\r\nfor z in range(n):\r\n for i in range(n-1):\r\n if p[i] < p[i+1] or (p[i] == p[i+1] and t[i] > t[i+1]):\r\n p[i], p[i+1] = p[i+1], p[i]\r\n t[i], t[i+1] = t[i+1], t[i]\r\ncount = 0\r\nfor i in range(n):\r\n if p[i] == p[k] and t[i] == t[k]:\r\n count += 1\r\nprint(count)", "n,k=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\nfor i in range(0,n-1):\r\n for j in range(i+1,n):\r\n if a[i][0]>a[j][0]:\r\n a[i],a[j]=a[j],a[i]\r\nfor i in range(0,n-1):\r\n for j in range(i+1,n):\r\n if a[i][0]==a[j][0] and a[i][1]<a[j][1]:\r\n a[i],a[j]=a[j],a[i]\r\na.reverse()\r\nprint(a.count(a[k-1]))", "n,k = map(int,input().split())\r\nl = [list(map(int,input().split())) for i in range(n)]\r\nl.sort(key=lambda x: (x[0],-x[1]),reverse=True)\r\n\r\nprint(l.count(l[k-1]))\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n manan,surbhi=map(int,input().split())\r\n l.append((manan,surbhi))\r\n\r\nl.sort(key=lambda x:(x[0], -x[1]),reverse=True)\r\nans=1\r\nps=l[k-1][0]\r\ntp=l[k-1][1]\r\nfor i in range(k,n):\r\n if l[i][0]==ps and l[i][1]==tp:\r\n ans+=1\r\n else:\r\n break\r\nfor i in range(k-2,-1,-1):\r\n if l[i][0]==ps and l[i][1]==tp:\r\n ans+=1\r\n else:\r\n break\r\n \r\nprint(ans)\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tp,t=map(int,input().split())\r\n\tp=-p\r\n\tl.append([p,t])\r\nl.sort()\r\nfor i in range(n):\r\n\tl[i][0]=abs(l[i][0])\r\nans=1\r\nidx=k-1\r\ntemp=l[k-1]\r\nfor i in range(idx-1,-1,-1):\r\n\tif l[i]==temp:\r\n\t\tans+=1\r\n\telse:\r\n\t\tbreak\r\nfor i in range(idx+1,n):\r\n\tif l[i]==temp:\r\n\t\tans+=1\r\n\telse:\r\n\t\tbreak\r\nprint(ans)", "n,k = map(int,input().split())\r\na,d = [],{}\r\nfor i in range(n):\r\n\tl = tuple(map(int,input().split()))\r\n\tif l in d:\r\n\t\td[l]+=1\r\n\telse:\r\n\t\td[l]=1\r\n\ta.append(l)\r\n\r\nb = sorted(a, key=lambda x:(x[0],x[1]),reverse=True)\r\np = [x[0] for x in b]\r\ndic = { x:p.count(x) for x in p}\r\ndic = { x:dic[x] for x in dic if dic[x]>1}\r\nrep = list(dic.keys())\r\ncount = list(dic.values())\r\nindex = [p.index(x) for x in rep]\r\n\r\nfor x in range(len(rep)):\r\n\tb[index[x]:index[x]+count[x]]=sorted(b[index[x]:index[x]+count[x]])\r\n\t\r\nprint(d[b[k-1]])", "n, k = map(int, input().split()) \r\n\r\nteams = [] \r\n\r\nfor _ in range(n):\r\n p, t = map(int, input().split()) \r\n teams.append((p, t)) \r\n\r\n\r\nteams.sort(key=lambda x: (-x[0], x[1]))\r\n\r\nkth = teams[k-1]\r\nans = teams.count(kth)\r\nprint(ans)", "a=list(map(int,input().split()))\r\nlis=[]\r\nfor i in range(a[0]):\r\n b=list(map(int,input().split()))\r\n lis.append(b)\r\nlis=sorted(lis,key =lambda x:(-x[0],x[1]))\r\ng=[]\r\ni=0\r\nwhile i<len(lis):\r\n l=[]\r\n l.append(lis[i])\r\n j=i+1 \r\n while j<len(lis) and lis[i]==lis[j]:\r\n i=i+1\r\n l.append(lis[j])\r\n j=j+1 \r\n g.append(l)\r\n i=i+1 \r\n\r\ndef ans(g):\r\n count=0\r\n for i in g:\r\n for j in i:\r\n count=count+1 \r\n if count==a[1]:\r\n return len(i)\r\nprint(ans(g))", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n[0,1,4,6,7]\r\n'''\r\ndef solve():\r\n n, k = MII()\r\n\r\n teams = []\r\n for _ in range(n):\r\n p, t = MII()\r\n teams.append((p, t))\r\n\r\n teams.sort(key=lambda x: x[1])\r\n teams.sort(key=lambda x: -x[0])\r\n\r\n # print(teams)\r\n ans = []\r\n for i in range(1, len(teams)):\r\n if teams[i] != teams[i-1]:\r\n ans.append(i)\r\n ans.append(len(teams))\r\n\r\n # print(ans)\r\n for i in range(len(ans)):\r\n if ans[i] >= k:\r\n if i == 0:\r\n print(ans[i])\r\n else:\r\n print(ans[i] - ans[i-1])\r\n return\r\n\r\nsolve()", "\r\ndef solution():\r\n\tn,k=map(int,input().split())\r\n\tcount={}\r\n\tarr=[]\r\n\tfor i in range(n):\r\n\t\tp,t=map(int,input().split())\r\n\t\tif (p,t) not in count:\r\n\t\t\tcount[(p,t)]=1\r\n\t\telse:\r\n\t\t\tcount[(p,t)]+=1\r\n\t\tarr.append((p,t))\r\n\tarr.sort(reverse=True)\r\n\tp,t=arr[k-1]\r\n\tleft=k-2\r\n\tright=k\r\n\twhile left>=0 and arr[left][0]==p:\r\n\t\tleft-=1\r\n\twhile right<n and arr[right][0]==p:\r\n\t\tright+=1\r\n\tleft+=1\r\n\ttemp=arr[left:right]\r\n\ttemp.sort()\r\n\tarr[left:right]=temp\r\n\tp,t=arr[k-1]\r\n\tprint(count[(p,t)])\r\n\t\r\n\r\n\r\n\treturn\r\n\r\n\r\n\r\n\r\n\t\t\t\r\nsolution()\r\n", "arr=list(map(int,input().split()))\r\nn,k=arr[0],arr[1]\r\np={}\r\nl=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n a=(a[0],-a[1])\r\n l.append(a)\r\n if a in p.keys():\r\n p[a]+=1\r\n else:\r\n p[a]=1\r\nl.sort(reverse=True)\r\nprint(p[l[k-1]])", "def main() :\r\n n,k = map(int,input().split())\r\n l = list()\r\n for _ in range(n):\r\n p,t = map(int,input().split())\r\n l.append([p,-t])\r\n l.sort(reverse=True)\r\n print(l.count(l[k-1])) \r\n \r\nmain()", "n, k = map(int, input().split())\r\nteams, freqs = [tuple(int(i) for i in input().split()) for _ in range(n)], {}\r\nteams.sort(key = lambda x: (-x[0], x[1]))\r\nfor team in teams:\r\n freqs[team] = freqs.get(team, 0) + 1\r\nprint(freqs[teams[k - 1]])\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n fk = []\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n fk.append((a, b))\r\n \r\n # sort the list of tuples in descending order of first element, if first elements are equal, sort in ascending order of second element\r\n fk.sort(key=lambda x: (-x[0], x[1]))\r\n \r\n cnt = 0\r\n # count the number of tuples with first and second element equal to the first and second element of the kth tuple\r\n for i in range(n):\r\n if (fk[i][0] == fk[k-1][0]) and (fk[i][1] == fk[k-1][1]):\r\n cnt += 1\r\n print(cnt)\r\n\r\n# call the solve function\r\nsolve()\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n f=list(map(int,input().split()))\r\n l.append(f)\r\n\r\nl.sort()\r\nl.reverse()\r\np=l[k-1][0]\r\nv=0\r\nlis=[]\r\nfor i in l :\r\n if i[0] == p:\r\n lis.append(i)\r\nk=k-1\r\nm=abs(l.index(lis[0])-k)\r\nlis.reverse()\r\ni=0\r\nwhile i < len(lis):\r\n if lis[i] == lis[m]:\r\n v+=1\r\n i+=1\r\nprint(v)\r\n", "[n,k] = list(map(int,input().split()))\r\n\r\nlis = []\r\nans = 0\r\n\r\ndef Insert(val):\r\n l = len(lis)\r\n \r\n for i in range(l):\r\n v = lis[i]\r\n \r\n if v[0]>val[0]:\r\n pass\r\n elif v[0] == val[0] and v[1]>=val[1]:\r\n lis.insert(i,val)\r\n return\r\n elif v[0] == val[0] and v[1]<val[1]:\r\n pass\r\n elif v[0] < val[0]:\r\n lis.insert(i,val)\r\n return\r\n lis.append(val)\r\n return\r\n \r\nfor i in range(n):\r\n ip = list(map(int,input().split()))\r\n \r\n if len(lis) == 0:\r\n lis.append(ip)\r\n else:\r\n Insert(ip)\r\n\r\n\r\nansVal = lis[k-1]\r\nfor l in lis:\r\n if l == ansVal:\r\n ans+=1\r\n \r\nprint(ans)", "n,x=map(int,input().split())\r\na=[]\r\nk={}\r\nfor _ in range(n):\r\n p,q=map(int,input().split())\r\n if p not in k:\r\n k[p]=1\r\n a.append([p,q])\r\na.sort()\r\nk=sorted(k)\r\np=[]\r\nk=k[::-1]\r\nfor i in k:\r\n for j in a:\r\n if j[0]==i:\r\n p.append(j)\r\nprint(p.count(p[x-1]))", "n,k=map(int,input().split());d={}\r\nfor i in range(n):\r\n\tp,t=map(int,input().split())\r\n\tif p not in d:d[p]=[t,]\r\n\telse:d[p].append(t)\r\nl=sorted(d.keys(),reverse=True);r=[]\r\nfor i in l:\r\n\tfor j in sorted(d[i]):\r\n\t\tr.append((i,j))\r\nprint(r.count(r[k-1])) ", "'''input\r\n7 2\r\n4 10\r\n4 10\r\n4 10\r\n3 20\r\n2 1\r\n2 1\r\n1 10\r\n\r\n'''\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nn,k = getints()\r\nd = {}\r\nfor i in range(n):\r\n\ta,b=getints()\r\n\tkey = (-a,b)\r\n\tif key in d:\r\n\t\td[key]+=1\r\n\telse:\r\n\t\td[key]=1\r\nl = list(sorted(d.items()))\r\ncnt = 0\r\nfor a,b in l:\r\n\tcnt+=b\r\n\tif cnt>=k:\r\n\t\tprint(b)\r\n\t\texit(0)", "from collections import defaultdict, Counter\r\nn, k = map(int, input().split())\r\nsolved = []\r\npen = []\r\nfor i in range(n):\r\n t, p = map(int, input().split())\r\n solved.append(t)\r\n pen.append(p)\r\n\r\n\r\npenSort = [x for _, x in sorted(zip(solved, pen))][::-1]\r\nsolved = sorted(solved)[::-1]\r\ncheck = defaultdict(list)\r\nfor i in range(n):\r\n check[solved[i]].append(penSort[i])\r\nfor t in check:\r\n check[t].sort()\r\n\r\nrank =[]\r\ncnt = 0\r\nfor t in check:\r\n prev = 0\r\n prevRank = 0\r\n for p in check[t]:\r\n if p == prev:\r\n rank.append(prevRank)\r\n prev = p\r\n else:\r\n rank.append(len(rank)+1)\r\n prev = p\r\n prevRank = len(rank)\r\nans = Counter(rank)[rank[k-1]]\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\na,d = [],{}\r\nfor i in range(n):\r\n\tl = tuple(map(int,input().split()))\r\n\tif l in d:\r\n\t\td[l]+=1\r\n\telse:\r\n\t\td[l]=1\r\n\ta.append(l)\r\na = sorted(a, key = lambda x: x[1])\r\na = sorted(a, key = lambda x: x[0],reverse=True)\r\nprint(d[a[k-1]])", "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\n# sys.setrecursionlimit(999)\r\n\r\n\r\nn,k = map(int,input().split())\r\nt = []\r\nfor _ in [0]*n:\r\n t.append(list(map(int,input().split())))\r\nt.sort(key=lambda x:(-x[0],x[1]))\r\n\r\npt = t[k-1]\r\n\r\nprint(t.count(pt))\r\n", "n, k = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\na.sort(key=lambda x: (x[0], -x[1]), reverse=True)\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] == a[k-1]:\r\n cnt += 1\r\nprint(cnt)", "\r\nfrom sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import Counter as C\r\nfrom collections import defaultdict as dd\r\nfrom math import ceil,sqrt\r\n\r\nn,k= mp()\r\nv=[]\r\nfor _ in range(n):\r\n\tp,t = mp()\r\n\tv.append((p,t))\r\n\t# print(p,t)\r\nv.sort(key = lambda x:x[1])\r\nv.sort(key = lambda x:(x[0]),reverse=True)\r\n# print(v)\r\nprint(v.count(v[k-1]))\r\n\r\n\r\n\r\n", "n, k = [int(x) for x in input().split()]; d = {}; a = []\r\nfor i in range(n):\r\n temp = [int(x) for x in input().split()]\r\n a.append(temp)\r\n x = tuple(temp)\r\n if x in d: d[x] += 1\r\n else: d[x] = 1\r\nprint(d[tuple(sorted(a, key=lambda row: (row[0], -row[1]), reverse = True)[k - 1])])", "n,k=map(int,input().split())\r\na=[0.0]*n\r\nfor i in range (n):\r\n p,t=map(int,input().split())\r\n a[i]=p+(50-t)/100\r\n #print(a[i])\r\na.sort()\r\na=a[::-1]\r\nc=a[k-1]\r\ncount=0\r\nfor i in range (n):\r\n if a[i]==c:\r\n count+=1\r\nprint(count)", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n m, p = map(int, input().split())\r\n a.append((-m, p))\r\na.sort()\r\nprint(a.count(a[k-1]))", "def insert(left, right, scores, val):\r\n while left < right:\r\n mid = left + (right-left) // 2\r\n if val == scores[mid]:\r\n right = mid\r\n break\r\n elif (val[0] > scores[mid][0]) or (val[0] == scores[mid][0] and val[1] < scores[mid][1]):\r\n right = mid\r\n else:\r\n left = mid + 1\r\n \r\n scores.insert(right, val)\r\n return scores\r\n\r\nn, k = map(int, input().split())\r\ncounter = {}\r\n\r\nscores = []\r\nfor _ in range(n):\r\n key = tuple(map(int, input().split()))\r\n counter[key] = counter.get(key, 0) + 1\r\n insert(0, len(scores), scores, key)\r\n \r\nprint(counter[scores[k-1]])", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tp,t=map(int,input().split())\r\n\tl.append((p,t))\r\nl = sorted(l, key = lambda x:(x[0], -x[1]),reverse=True)\r\ns=list(set(l))\r\ns = sorted(s, key = lambda x:(x[0], -x[1]),reverse=True)\r\nr=0\r\nc=0\r\nrl={}\r\nfor i in s:\r\n\tnc=l.count(i)\r\n\tfor i in range(nc):\r\n\t\tr+=1\r\n\t\trl[r]=nc\r\nprint(rl[k])", "\r\nI = lambda: map(int, input().split())\r\n \r\nn, k = I()\r\nA = sorted((tuple(I()) for _ in range(n)), key=lambda x: (-x[0], x[1]))\r\n \r\nprint(A.count(A[k-1]))", "n,k = map(int,input().split())\r\nTeams = {}\r\nTeams_lst = []\r\nfor i in range(n):\r\n data = tuple(map(int,input().split()))\r\n Teams_lst.append(data)\r\n if data in Teams:\r\n Teams[data] += 1\r\n else:\r\n Teams[data] = 1\r\n\r\ndef sort_tuples(Mtx):\r\n for i in range(len(Mtx)):\r\n for j in range(len(Mtx)-i-1):\r\n if Mtx[j][0] < Mtx[j+1][0] :\r\n Mtx[j], Mtx[j+1] = Mtx[j+1], Mtx[j]\r\n for i in range(len(Mtx)):\r\n for j in range(len(Mtx)-i-1):\r\n if Mtx[j][0] == Mtx[j+1][0] and Mtx[j][1] > Mtx[j+1][1]:\r\n Mtx[j], Mtx[j+1] = Mtx[j+1], Mtx[j]\r\n return Mtx\r\n\r\nkeys_sorted = sort_tuples(list(Teams.keys())) \r\nteams_Sorted = sort_tuples(Teams_lst)\r\n\r\nprint(Teams[teams_Sorted[k-1]])\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tp,t=map(int,input().split())\r\n\tl.append((p,t))\r\nl = sorted(l, key = lambda x:(x[0], -x[1]),reverse=True)\r\nprint(l.count(l[k-1]))", "n, k = map(int, input().split())\r\nms = []\r\nfor i in range(n):\r\n p, t = map(int, input().split())\r\n ms.append((p, t))\r\n\r\nms = sorted(ms, key=lambda x: (-x[0], x[1]))\r\nprint(ms.count(ms[k-1]))\r\n", "import math,sys,collections,bisect\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef binarysearch(l,r,arr,k):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif arr[mid] == k:\n\t\t\treturn mid\n\t\telif arr[mid]>k:\n\t\t\treturn binarysearch(l,mid-1,arr,k)\n\t\treturn binarysearch(mid+1,r,arr,k)\n\treturn -1\ndef ispossible(n):\n\n\th = 1\n\tnum = 2\n\tpre = 2\n\twhile num<=n:\n\t\tpre = num\n\t\th+=1\n\t\tnum+=(h*2)+h-1\n\treturn n-pre\n\ndef cal(n):\n\ttmp = 0\n\twhile n:\n\t\ttmp+=n%10\n\t\tn//=10\n\treturn tmp\ndef solve():\n\n\tn,k = list(map(int,input().split()))\n\tarr = []\n\tfor i in range(n):\n\t\tarr.append(list(map(int,input().split())))\n\tarr.sort(key = lambda x:(-x[0],x[1]))\n\ti = 0\n\twhile i<n:\n\t\tj = i\n\t\twhile j<n and arr[i][0] == arr[j][0] and arr[i][1] == arr[j][1]:\n\t\t\tj+=1\n\t\tk-=(j-i)\n\t\tif k<=0:\n\t\t\tprint(j-i)\n\t\t\tbreak\n\t\ti = j\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "n, k = map(int, input().split())\r\nlst = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n lst.append([-a, b])\r\nlst.sort()\r\nprint(lst.count(lst[k-1]))", "n, k = map(int,input().split())\r\nA = []\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n A.append([a, -1*b])\r\nA.sort()\r\nA.reverse()\r\nB = A[k-1]\r\nprint(A.count(B))", "def solve(case):\n N, K= list(map(int, input().split()))\n teams = []\n for _ in range(N):\n p, t= list(map(int, input().split()))\n teams += [(-p,t)]\n teams.sort()\n rankings = dict()\n idx = 0\n \n while idx < N:\n actual_team = teams[idx]\n actual_idx = idx\n shared = 1\n while (actual_idx < N-1 and actual_team == teams[actual_idx+1]):\n actual_idx += 1\n shared += 1\n for i in range(idx, idx+shared):\n rankings[i] = shared\n idx += shared\n print(rankings[K-1])\n\ndef main():\n solve(0)\n\nmain()\n\n \t\t \t\t \t \t\t \t\t\t\t \t\t", "f=[]\r\np,t=0,0\r\nn,k=map(int,input().split())\r\nfor i in range(n):\r\n p,t=map(int,input().split())\r\n f.append((p,-t))\r\nf = sorted(f)\r\nf.reverse()\r\nprint(f.count(f[k-1]))", "from collections import Counter\nfrom itertools import accumulate\n\nif __name__ == '__main__':\n n_k = input().split()\n n = int(n_k[0])\n k = int(n_k[1])\n p_t_arr = []\n for i in range(n):\n p_t = input().split()\n p = int(p_t[0])\n t = int(p_t[1])\n p_t_arr.append(tuple([p, t]))\n\n cnt = Counter(p_t_arr)\n sorted_scores = sorted(set(p_t_arr), key =lambda x: (x[0], -x[1]), reverse=True)\n positions_ord = [cnt[sorted_score] for sorted_score in sorted_scores]\n acc = list(accumulate(positions_ord))\n \n index = 0\n while k > acc[index]:\n index += 1\n print(positions_ord[index])\n \n \t \t\t\t\t \t \t \t \t\t\t\t\t\t \t \t \t", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nA=sorted((tuple(I())for _ in range(n)),key=lambda x:(-x[0],x[1]))\r\nprint(A.count(A[k-1]))", "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, arr):\r\n arr.sort(key=lambda x: (-x[0], x[1]))\r\n\r\n i = 0\r\n\r\n while i < N:\r\n j = i+1\r\n\r\n while j < N and arr[j] == arr[i]:\r\n j += 1\r\n\r\n if i <= K <= j:\r\n return j-i\r\n\r\n i = j\r\n\r\n return -1\r\n\r\n\r\nN, K = read_numeric_list()\r\narr = []\r\n\r\nfor _ in range(N):\r\n arr.append(read_numeric_list())\r\n\r\nprint(solve(N, K, arr))\r\n", "n, k = map(int, input().split())\n\nres = []\nfor _ in range(n):\n p, t = map(int, input().split())\n res.append((-p, t))\n\nres.sort()\n\ni=j= k-1\n\nwhile (i-1) >= 0 and res[k-1] == res[i-1]:\n if i >= 0 and res[i-1] == res[k-1]:\n i -= 1\n\nwhile (j+1) < n and res[k-1] == res[j+1]:\n if j < n and res[j+1] == res[k-1]:\n j += 1\n\nprint(j-i + 1)\n\n", "n, k = map(int, input().split())\r\nres = []\r\n\r\nfor _ in range(n):\r\n res.append([int(i) for i in input().split()])\r\nres.sort(reverse=True)\r\n\r\nplace = []\r\nx = -1\r\nlst = []\r\n\r\nfor i in range(n):\r\n if not x == res[i][0]:\r\n place.append(lst[::-1])\r\n x = res[i][0]\r\n lst = []\r\n if x == res[i][0]:\r\n lst.append(res[i])\r\n\r\nplace.append(lst[::-1])\r\nplace = sum(place, [])\r\n\r\nprint(place.count(place[k-1]))\r\n", "n,k = map(int,input().split())\r\nl = []\r\nfor _ in range(n):\r\n p,t = map(int,input().split())\r\n l.append((p,-t))\r\nl.sort(reverse=True)\r\nprint(l.count(l[k-1]))", "dp=[]\r\nn,k=map(int,input().split())\r\nfor _ in range(n):\r\n p,t=map(int,input().split())\r\n dp.append((p,-t))\r\ndp.sort(reverse=True)\r\nprint(dp.count(dp[k-1]))", "class Team:\r\n def __init__(self, problems, penaltytime):\r\n self.problems = problems\r\n self.penaltytime = penaltytime\r\n\r\ndef cmp(left, right):\r\n return left.problems > right.problems or (left.problems == right.problems and left.penaltytime < right.penaltytime)\r\n\r\nn, k = map(int, input().split())\r\nteams = []\r\n\r\nfor i in range(n):\r\n problems, penaltytime = map(int, input().split())\r\n teams.append(Team(problems, penaltytime))\r\n\r\nteams.sort(key=lambda x: (x.problems, -x.penaltytime), reverse=True)\r\nk -= 1\r\nl = k\r\nr = k\r\n\r\nwhile l > 0 and teams[l - 1].problems == teams[k].problems and teams[l - 1].penaltytime == teams[k].penaltytime:\r\n l -= 1\r\n\r\nwhile r + 1 < n and teams[r + 1].problems == teams[k].problems and teams[r + 1].penaltytime == teams[k].penaltytime:\r\n r += 1\r\n\r\nprint(r - l + 1)\r\n", "from collections import Counter\nn, k = (int(x) for x in input().split())\nls = [tuple(int(x) for x in input().split()) for _ in range(n)]\nls.sort(key=lambda x: x[1])\nls.sort(key=lambda x: x[0], reverse=True)\nteamc = Counter(ls)\nprint(teamc[ls[k - 1]])\n", "n, k = map(int, input().split())\r\nscores = [tuple(map(int, input().split())) for _ in range(n)]\r\nscores.sort(key=lambda x: (-x[0], x[1]))\r\n\r\nret = 1\r\nfor i in range(k-2, -1, -1):\r\n if scores[i] == scores[k-1]:\r\n ret += 1\r\n else:\r\n break\r\n \r\nfor i in range(k, n):\r\n if scores[i] == scores[k-1]:\r\n ret += 1\r\n else:\r\n break\r\n\r\nprint(ret)", "a,b=map(int,input().split())\r\ndi={}\r\nfor i in range(a):\r\n c,d=map(int,input().split())\r\n di[c]=di.get(c,[0,[]])\r\n di[c][0]+=1\r\n di[c][1].append(d)\r\nfor i in sorted(list(di.keys()),reverse=True):\r\n b-=di[i][0]\r\n if b<=0:\r\n l=sorted(di[i][1])\r\n print(l.count(l[di[i][0]+b-1]))\r\n break", "def teams_with_kth_place(n, k, teams):\r\n count = 0\r\n for i in range(n):\r\n pa, ta = teams[i]\r\n better_teams = 0\r\n same_teams = 0\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n pb, tb = teams[j]\r\n if pb > pa or (pb == pa and tb < ta):\r\n better_teams += 1\r\n elif pb == pa and tb == ta:\r\n same_teams += 1\r\n if better_teams + 1 <= k <= better_teams + same_teams + 1:\r\n count += 1\r\n return count\r\ndef main():\r\n n, k = map(int, input().split()) \r\n teams = []\r\n for _ in range(n):\r\n pi, ti = map(int, input().split())\r\n teams.append((pi, ti))\r\n result = teams_with_kth_place(n, k, teams)\r\n print(result)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = [int(i) for i in input().split()]\n\nscores = []\n\nfor i in range(n):\n\tp = [int(j) for j in input().split()]\n\n\tif scores == []:\n\t\tscores.append(p)\n\t\tcontinue\n\n\tfor j in range(len(scores)):\n\t\tif scores[j][0] < p[0] or (scores[j][0] == p[0] and scores[j][1] > p[1]):\n\t\t\tscores = scores[:j] + [p] + scores[j:]\n\t\t\tp = None\n\t\t\tbreak\n\n\tif p != None:\n\t\tscores.append(p)\n\nprint(scores.count(scores[k-1]))\n", "d = []\r\nn,k=map(int,input().split())\r\nfor _ in range(n):\r\n p,t=map(int,input().split())\r\n d.append((p,-t))\r\nd.sort(reverse=True)\r\nprint(d.count(d[k-1]))\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append([-a,b])\r\nl=sorted(l)\r\nans=l[k-1]\r\nprint(l.count(ans))", "T,k=map(int,input().split())\r\nc=[]\r\nfor _ in range(T):\r\n\tM,N=map(int,input().split())\r\n\tc.append((M,N))\r\nsorted_teams = sorted(c, key=lambda x: (-x[0], x[1]))\r\nkth_team_score = sorted_teams[k-1]\r\nnum_kth_place_teams = sum(1 for team in sorted_teams if team == kth_team_score)\r\nprint( num_kth_place_teams)\r\n", "n,k=[int(x) for x in input().split()]\nt=[]\nfor i in range (n):\n a,b=[int(x) for x in input().split()]\n t.append([-a,b])\nt.sort()\nprint(t.count(t[k-1]))\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\n\r\nl_t = list([list(map(int, input().split())) for _ in range(n)])\r\nl_t.sort(key=lambda x: (-x[0], x[1]))\r\n\r\nl = 0\r\nh = 0\r\nt = 0\r\n\r\nwhile k - l - 1 >= 0 and l_t[k - l - 1] == l_t[k - 1]:\r\n t += 1\r\n l += 1\r\nwhile k + h < n and l_t[k + h] == l_t[k - 1]:\r\n t += 1\r\n h += 1\r\n\r\nprint(t)", "temp = [int(x) for x in input().split()]\nsomething = []\nfor i in range(temp[0]):\n temp2 = [int(x) for x in input().split()]\n temp2[1] = -temp2[1]\n something.append(temp2)\nsomething.sort()\nsomething = something[::-1]\ntemp3 = something[temp[1] - 1]\nanswer = 0 \nfor i in something:\n if i == temp3:\n answer += 1\nprint(answer)", "def func(arr):\r\n return arr[1]\r\n# f=open(\"input.txt\",'r')\r\n# h=open(\"output.txt\",'w')\r\n# b,g=map(int,f.readline().split())\r\n# T=int(f.readline())\r\n# arr = [int(i)for i in f.readline().split()]\r\n# for _ in range(1,n+1):\r\n # t=int(input())\r\nn,k=map(int,input().split()) \r\n # s=input()\r\n # arr=list(map(int,input().split()))\r\n # s=list(map(int,input()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\narr.sort(reverse=True)\r\nprev=0\r\n# print(arr)\r\nfor i in range(n):\r\n if arr[i][0]!=arr[prev][0]:\r\n arr=arr[:prev]+sorted(arr[prev:i],key=func)+arr[i:]\r\n prev=i\r\narr=arr[:prev]+sorted(arr[prev:n],key=func)\r\nprint(arr.count(arr[k-1]))", "# from math import sqrt\r\n# from math import sqrt\r\n# from collections import Counter\r\n# from collections import deque\r\n# mod=1073741824\r\n# d=[0]*11\r\n# for i in range(1,11):\r\n# for j in range(i,11,i):\r\n# d[j]+=1\r\ndef solve():\r\n n,k=map(int,input().split())\r\n d={}\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n if a in d:\r\n d[a].append(b)\r\n else:\r\n d[a]=[b]\r\n l=list(sorted(d.items(),reverse=True))\r\n\r\n for i,j in l:\r\n if len(j)>=k:\r\n j.sort()\r\n x=j[k-1]\r\n print(j.count(x))\r\n return\r\n k-=len(j)\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 solve()\r\n\r\n\r\n\r\n\r\n", "n, k = map(int,input().split()) \r\n\r\nfun = []\r\n\r\nfor i in range(n):\r\n \r\n a,b= map(int,input().split())\r\n \r\n fun.append((-a,b)) \r\n \r\nfun.sort() \r\nc = fun.count(fun[k-1]) \r\nprint(c) ", "def sequence(a):\r\n n=len(a)\r\n g,k,x=[a[0]],[1],0\r\n for i in range(1,n):\r\n if a[i]==a[i-1]:\r\n k[x]+=1\r\n else:\r\n g.append(a[i])\r\n k.append(1)\r\n x+=1\r\n return g,k\r\nn,k=list(map(int,input().split()))\r\nd,a,l,s={},[],[],0\r\nfor pratyush in range(n):\r\n p,t=list(map(int,input().split()))\r\n a.append([p,t])\r\na.sort(reverse=True)\r\nfor p,t in a:\r\n if d.get(p)==None:\r\n d[p]=[t]\r\n else:\r\n d[p].append(t)\r\nfor p in d.keys():\r\n d[p]=d[p][::-1]\r\nfor p in d.keys():\r\n for i in d[p]:\r\n l.append([p,i])\r\ng,f=sequence(l)\r\nfor i in range(len(f)):\r\n s+=f[i]\r\n if s>=k:\r\n print(f[i])\r\n break", "n,k = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n p,t = map(int,input().split())\r\n l.append([p,t])\r\n\r\nl.sort(key=lambda x:(-x[0],x[1]))\r\nprint(l.count(l[k-1]))", "n,k=map(int,input().split())\r\nnums=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n nums.append([x,y])\r\nnums.sort(key=lambda x:(x[0],-x[1]),reverse=True)\r\npb=nums[k-1][0]\r\ntb=nums[k-1][1]\r\nans=0\r\nfor i in range(n):\r\n if pb==nums[i][0] and nums[i][1]==tb:\r\n ans+=1\r\nprint(ans)", "from collections import defaultdict as dd\r\nn,k=list(map(int,input().split()))\r\nd=dd()\r\nfor _ in range(n):\r\n p,t=list(map(int,input().split()))\r\n if p not in d:\r\n d[p]=[[t,p]]\r\n else:\r\n d[p].append([t,p])\r\nx=list(d.keys())\r\nx.sort()\r\nx.reverse()\r\nt=[]\r\nfor i in x:\r\n z=d[i]\r\n z.sort()\r\n t.extend(z)\r\ny=t[k-1]\r\na=t.count(y)\r\nprint(a)", "number_of_testcases = 1 #int(input())\r\nfor _ in range(number_of_testcases):\r\n N, K = map(int,input().split())\r\n solved_problems = [0]*N\r\n panalty_time = [0]*N \r\n result = [0]*N \r\n \r\n for i in range(N):\r\n solved_problems[i], panalty_time[i] = map(int,input().split())\r\n result[i] = 100*solved_problems[i] + 50 - panalty_time[i]\r\n \r\n #print(result)\r\n result.sort(reverse=True)\r\n num_teams = 0 \r\n \r\n for i in range(N):\r\n if result[i] == result[K-1]:\r\n num_teams+=1 \r\n \r\n \r\n print(num_teams)", "n,k = map(int,input().split())\r\nd=[]\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n d.append([a,b])\r\nd = sorted(d,key=lambda l:[-l[0],l[1]])\r\nprint(d.count(d[k-1]))", "from collections import Counter as C\r\ndef miis():\r\n return map(int, input().split())\r\n\r\nn, k = miis()\r\na = []\r\nfor i in range(n):\r\n p ,t = miis()\r\n a.append(-p*1000000+t)\r\na.sort()\r\nprint(C(a)[a[k-1]])\r\n", "import functools\r\n\r\nn, k = map(int, input().strip().split())\r\nranklist = [list(map(int, input().strip().split())) for _ in range(n)]\r\nranklist.sort(key=lambda x: [x[0],-x[1]], reverse=True)\r\n\r\n# print(ranklist)\r\nfor i, ranks in enumerate(ranklist):\r\n if i + 1 == k:\r\n val = ranks\r\n ans = 0\r\n for j, rank in enumerate(ranklist):\r\n if val == rank:\r\n ans += 1\r\n print(ans)\r\n quit()", "n, k = map(int, input().split())\r\n\r\nt = []\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n t.append([l,r])\r\n\r\nt.sort(key=lambda x: (x[0], -x[1]), reverse=True)\r\n\r\ncheck = None\r\nfor i in range(n):\r\n if i == k-1:\r\n check = t[i]\r\nprint(t.count(check))", "def Rank_List():\r\n list1 = [int(x) for x in input().split(' ')]\r\n n = list1[0]\r\n k = list1[1]\r\n \r\n probSolved = []\r\n penaltyTime = []\r\n timeDict = {}\r\n\r\n for i in range(n):\r\n list2 = [int(x) for x in input().split(' ')]\r\n probSolved.append(list2[0])\r\n penaltyTime.append(list2[1])\r\n\r\n if list2[0] in timeDict.keys():\r\n timeDict[list2[0]].append(list2[1])\r\n else: \r\n timeDict[list2[0]] = [list2[1]]\r\n \r\n probSolved_sorted = sorted(probSolved, reverse= True)\r\n probs_at_reqd_pos = probSolved_sorted[k-1]\r\n\r\n teams_before = 0 \r\n for unique_prob in timeDict.keys():\r\n if unique_prob > probs_at_reqd_pos:\r\n teams_before += len(timeDict[unique_prob])\r\n \r\n pos_in_that_slab = k - teams_before \r\n\r\n time_sorted_that_prob = sorted(timeDict[probs_at_reqd_pos])\r\n time_at_reqd_pos = time_sorted_that_prob[pos_in_that_slab - 1]\r\n\r\n teams_sharing = time_sorted_that_prob.count(time_at_reqd_pos)\r\n print(teams_sharing)\r\n return\r\n\r\n \r\nRank_List()", "n, k = [int(p) for p in input().split()]\nteams = []\nfor i in range(n):\n team = tuple([int(p) for p in input().split()])\n teams.append(team)\n\nteams.sort(key=lambda x:(x[0], -x[1]), reverse=True)\ntable = {}\nfor i in teams:\n try:\n table[hash(i)] += 1\n except KeyError:\n table[hash(i)] = 1\np = teams[k-1]\nprint(table[hash(p)])", "lst =[]\r\nfor i in range(51):\r\n lst.append([])\r\n for j in range(51):\r\n lst[i].append(0)\r\nn , k = map(int, input().split(\" \"))\r\nfor i in range(n):\r\n a,b =map(int,input().split(\" \"))\r\n lst[a][b]+=1\r\n\r\nflag,p =False,0\r\nfor i in range(50,0,-1):\r\n for j in range(51):\r\n if(lst[i][j]>0):\r\n p+=lst[i][j]\r\n if(p>=k ):\r\n print(lst[i][j])\r\n flag=True\r\n break \r\n if(flag):break", "n,k=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n\ts=\"\"\r\n\tp,q=map(int,input().split())\r\n\ts=s+str(p)\r\n\tq=50-q\r\n\ts1=\"\"\r\n\tif q<10:\r\n\t\ts1=\"0\"+str(q)\r\n\telse:\r\n\t\ts1=str(q)\r\n\ts=s+s1\r\n\tl.append(int(s))\r\nl.sort(reverse=True)\r\nz=l[k-1]\r\nprint(l.count(z))\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n", "def main():\n\tn,k=[int(i) for i in input().split()]\n\tl=[]\n\tfor i in range(n):\n\t\tl.append([int(i) for i in input().split()])\n\tl.sort(key=lambda x : (-x[0],x[1]))\n\tprint(l.count(l[k-1]))\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\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=sorted([lst() for _ in range(n)],key=lambda x:(-x[0],x[1]))\r\n p,t=-1,-1;ans=0\r\n if k<=n:p,t=a[k-1]\r\n for x,y in a:\r\n if x==p and y==t:ans+=1\r\n print(ans)", "n,k=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n p,t=map(int,input().split())\r\n l.append((p,t))\r\na=sorted(l,key=lambda x:(-x[0],x[1]))\r\nprint(a.count(a[k-1]))", "from itertools import groupby\r\nn,k=map(int,input().split())\r\nbox=[]\r\nfor _ in range(n):\r\n t,p=map(int,input().split())\r\n box.append([t,p])\r\n\r\nbox.sort(key=lambda x:(x[0],-x[1]),reverse=True)\r\ngroups=groupby(box)\r\nfor i in range(k):\r\n ans=box[i]\r\nfor key,g in groups:\r\n if ans==key:\r\n print(len(list(g)))\r\n\r\n", "n,k=map(int,input().split())\r\nli={}\r\nfor i in range(n):\r\n v,vv=(map(int,input().split()))\r\n if v not in li:\r\n li[v]=list()\r\n li[v].append([v,vv])\r\nc=[]\r\nf=0\r\nfor i in sorted(li,reverse=True):\r\n c+=sorted(li[i])\r\nfor i in c:\r\n if i==c[k-1]:\r\n f+=1\r\nprint(f)", "rank = []\nn, k = map(int,input().split())\nfor i in range(n):\n p, t = map(int,input().split())\n rank.append((p, -t))\nrank.sort(reverse=True)\nprint(rank.count(rank[k - 1]))\n", "n,k=map(int,input().split())\r\na={}\r\nb=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n z=x*10000-y\r\n if z in a:\r\n a[z]+=1\r\n else:\r\n a[z]=1\r\n b.append(z)\r\nb.sort()\r\nb=b[::-1]\r\nprint(a[b[k-1]])\r\n", "n, k = map(int,input().split())\na = []\nfor i in range(n):\n\tp, t = map(int,input().split())\n\ta.append([p, t])\na = sorted(a, key = lambda x:(-x[0], x[1]))\nans = 0\nfor x in range(n):\n\tif a[x][0] == a[k-1][0] and a[x][1] == a[k-1][1]:\n\t\tans+=1\n\nprint(ans)", "n,k = [int(x) for x in input().split()]\r\na = []\r\nfor _ in range(n):\r\n a.append([int(x) for x in input().split()])\r\n\r\na.sort(key = lambda x: x[1])\r\na.sort(reverse=True,key=lambda x: x[0])\r\nb=a[k-1] \r\nprint(a.count(b))", "from operator import itemgetter as item\r\nn,k=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n lst.append((x,-y))\r\nlst.sort(key=item(0,1),reverse=True)\r\nprint(lst.count(lst[k-1]))\r\n", "from math import sqrt, ceil, log\r\nfrom heapq import heapify, heappush, heappop\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nioint = lambda: int(input())\r\nioarr = lambda: list(map(int, input().split(\" \")))\r\nprnys = lambda: print(\"YES\")\r\nprnno = lambda: print(\"NO\")\r\n\r\nMAX = 10**9\r\n\r\n\r\nn, k = ioarr()\r\narr = []\r\nfor _ in range(n):\r\n cur = ioarr()\r\n heappush(arr, -1000 * cur[0] + cur[1])\r\n\r\npre = 1\r\nrank = 0\r\ncnt = 0\r\npreCnt = 0\r\nwhile arr:\r\n cur = heappop(arr)\r\n if cur == pre:\r\n cnt += 1\r\n else:\r\n rank += cnt\r\n\r\n preCnt = cnt\r\n cnt = 1\r\n\r\n pre = cur\r\n\r\n if rank >= k:\r\n print(preCnt)\r\n exit()\r\n\r\nprint(cnt)\r\n", "n, k = map(int,input().split()) \r\nf=[]\r\nfor i in range(n):\r\n a,b= map(int,input().split())\r\n f.append((-a,b)) \r\nf.sort() \r\nc=f.count(f[k-1]) \r\nprint(c) ", "\"\"\"\r\n Author: Sagar Pandey\r\n\r\n\"\"\"\r\n# ---------------------------------------------------Import Libraries---------------------------------------------------\r\nimport sys\r\nimport time\r\nimport os\r\nfrom math import sqrt, log, log2, ceil, log10, gcd, floor, pow, sin, cos, tan, pi, inf, factorial\r\nfrom copy import copy, deepcopy\r\nfrom sys import exit, stdin, stdout\r\nfrom collections import Counter, defaultdict, deque\r\nfrom itertools import permutations\r\nimport heapq\r\nfrom bisect import bisect_left as bl\r\n# If the element is already present in the list,\r\n# the left most position where element has to be inserted is returned.\r\nfrom bisect import bisect_right as br\r\nfrom bisect import bisect\r\n\r\n# If the element is already present in the list,\r\n# the right most position where element has to be inserted is r\r\n\r\n# ---------------------------------------------------Global Variables---------------------------------------------------\r\n# sys.setrecursionlimit(100000000)\r\nmod = 1000000007\r\n# ---------------------------------------------------Helper Functions---------------------------------------------------\r\niinp = lambda: int(sys.stdin.readline())\r\ninp = lambda: sys.stdin.readline().strip()\r\nstrl = lambda: list(inp().strip().split(\" \"))\r\nintl = lambda: list(map(int, inp().split(\" \")))\r\nmint = lambda: map(int, inp().split())\r\nflol = lambda: list(map(float, inp().split(\" \")))\r\nflush = lambda: stdout.flush()\r\n\r\n\r\ndef permute(nums):\r\n def fun(arr, nums, cur, v):\r\n if len(cur) == len(nums):\r\n arr.append(cur.copy())\r\n i = 0\r\n while i < len(nums):\r\n if v[i]:\r\n i += 1\r\n continue\r\n else:\r\n cur.append(nums[i])\r\n v[i] = 1\r\n fun(arr, nums, cur, v)\r\n cur.pop()\r\n v[i] = 0\r\n i += 1\r\n # while i<len(nums) and nums[i]==nums[i-1]:i+=1 # Uncomment for unique permutations\r\n return arr\r\n\r\n res = []\r\n nums.sort()\r\n v = [0] * len(nums)\r\n return fun(res, nums, [], v)\r\n\r\n\r\ndef subsets(res, index, arr, cur):\r\n res.append(cur.copy())\r\n for i in range(index, len(arr)):\r\n cur.append(arr[i])\r\n subsets(res, i + 1, arr, cur)\r\n cur.pop()\r\n return res\r\n\r\n\r\ndef sieve(N):\r\n root = int(sqrt(N))\r\n primes = [1] * (N + 1)\r\n primes[0], primes[1] = 0, 0\r\n for i in range(2, root + 1):\r\n if primes[i]:\r\n for j in range(i * i, N + 1, i):\r\n primes[j] = 0\r\n return primes\r\n\r\n\r\ndef bs(arr, l, r, x):\r\n if x < arr[0] or x > arr[len(arr) - 1]:\r\n return -1\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n if arr[mid] == x:\r\n return mid\r\n elif arr[mid] < x:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n return -1\r\n\r\n\r\ndef isPrime(n):\r\n if n <= 1: return False\r\n if n <= 3: return True\r\n if n % 2 == 0 or n % 3 == 0: return False\r\n p = int(sqrt(n))\r\n for i in range(5, p + 1, 6):\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n return True\r\n\r\n\r\n# -------------------------------------------------------Functions------------------------------------------------------\r\n\r\ndef solve():\r\n n,k=mint()\r\n arr=[]\r\n for i in range(n):\r\n arr.append(intl())\r\n arr.sort(key=lambda x:(-x[0],x[1]))\r\n d={}\r\n i=0\r\n rank=1\r\n # print(arr)\r\n while i<n:\r\n j=i\r\n while j<n and arr[i]==arr[j]:\r\n j+=1\r\n d[rank]=j-i\r\n t=rank\r\n while rank<t+j-i:\r\n d[rank]=j-i\r\n rank+=1\r\n i=j\r\n\r\n # print(d)\r\n if k not in d.keys():\r\n print(d[k-1])\r\n else:\r\n print(d[k])\r\n\r\n\r\n\r\n\r\n\r\n# -------------------------------------------------------Main Code------------------------------------------------------\r\nstart_time = time.time()\r\n# for _ in range(iinp()):\r\ns=sieve(10**6)\r\nsolve()\r\n# print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n", "a,b=map(int,input().split())\r\np=[]\r\nfor i in range(a):\r\n c,d=map(int,input().split())\r\n z=c,-d\r\n p.append(z)\r\np.sort()\r\np.reverse()\r\nu=p.count(p[b-1])\r\nprint(u)", "n, k = list(map(int,input().split()))\r\nl = []\r\nfor i in range(n):\r\n inp=list(map(int,input().split()))\r\n l.append(inp)\r\nl.sort(key = lambda x: (-x[0], x[1]))\r\nprint(l.count(l[k - 1]))", "# https://codeforces.com/contest/166/problem/A\n\n# n, k = map(int, input().split())\n# li = []\n# for i in range(n):\n# a, b = map(int, input().split())\n# li.append((-a, b))\n# li.sort()\n\n\n# print(li.count(li[k - 1]))\n\n\ndef I(): return map(int, input().split())\n\n\nn, k = I()\nA = sorted((tuple(I()) for _ in range(n)), key=lambda x: (-x[0], x[1]))\n\nprint(A.count(A[k - 1]))\n", "n,k=map(int,input().split())\r\narr=[[0,0] for _ in range(n)]\r\nfor i in range(n):\r\n arr[i]=list(map(int,input().split()))\r\narr.sort(key=lambda x:x[0],reverse=True)\r\ntemp=[]\r\nstart,end=-1,-1\r\nfor i in range(1,n):\r\n if arr[i][0]==arr[i-1][0] and start==-1:\r\n start=i-1\r\n if arr[i][0]!=arr[i-1][0] and start!=-1:\r\n end=i-1\r\n if start!=-1 and end==-1 and i==n-1:\r\n end=n-1\r\n if start!=-1 and end!=-1:\r\n temp=arr[start:end+1]\r\n temp.sort(key=lambda x:x[1])\r\n arr[start:end+1]=temp\r\n start,end=-1,-1\r\nkth=arr[k-1]\r\ncount=0\r\nfor i in range(n):\r\n if arr[i]==kth:\r\n count+=1\r\nprint(count)", "def sorter(mass):\r\n l = len(mass)\r\n for i in range(l - 1):\r\n for j in range(l - i - 1):\r\n if mass[j][0] == mass[j + 1][0]:\r\n if mass[j][1] > mass[j + 1][1]:\r\n mass[j], mass[j + 1] = mass[j + 1], mass[j]\r\n return mass\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nmass = []\r\nfor i in range(n):\r\n p, t = list(map(int, input().split()))\r\n mass.append((p, t))\r\nmass = sorter(sorted(mass, reverse = True))\r\ncount = 0\r\nfor i in range(n):\r\n if mass[i] == mass[k - 1]:\r\n count += 1\r\nprint(count)", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn,k = amap()\r\nl = []\r\nfor i in range(n):\r\n q,p = amap()\r\n l.append((q,p))\r\n\r\nl.sort(key = lambda x:(-x[0],x[1]))\r\nans = 1\r\nfor i in range(k-2,-1,-1):\r\n if l[i]==l[k-1]:ans+=1\r\n else:break\r\n\r\nfor i in range(k,n):\r\n if l[i]==l[k-1]:ans+=1\r\n else:break\r\n\r\nprint(ans)", "import bisect\n\ntmp = input().split()\nn = int(tmp[0])\nk = int(tmp[1])\n\nscores = list()\ntimes = list()\nfor i in range(n):\n tmp = input().split()\n scores.append(int(tmp[0]))\n times.append(int(tmp[1]))\n\nsorted_scores = sorted(zip(scores, times), key=lambda y : (y[0], -y[1]), reverse=True)\n\nans = 1\ni = k-2\nwhile i>=0 and (sorted_scores[i] == sorted_scores[k-1]):\n ans = ans + 1 \n i = i - 1\n\ni = k\nwhile i < n and (sorted_scores[i] == sorted_scores[k-1]):\n ans = ans + 1 \n i = i + 1 \n\nprint(ans)", "a,b=map(int,input().split())\r\nq=[]\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n z=x,-y\r\n q.append(z)\r\nq.sort()\r\nh=q[::-1]\r\nf=h.count(h[b-1])\r\nprint(f)\r\n ", "n,k=map(int,input().split())\r\nl,c=[],0\r\nfor _ in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nl.sort(reverse=True)\r\na,x,y=l[k-1][0],k-1,k-1\r\nfor i in range(k-2,-1,-1):\r\n\tif l[i][0]==a:\r\n\t\tx=i\r\n\telse:\r\n\t\tbreak\r\nfor i in range(k,n):\r\n\tif l[i][0]==a:\r\n\t\ty=i\r\n\telse:\r\n\t\tbreak\r\nd=k-1-x\r\nd=y-d\r\nfor i in range(y,x-1,-1):\r\n\tif l[i]==l[d]:\r\n\t\tc+=1\r\nprint(c)", "(n, k) = map(int, input().split())\r\nx = list([list(map(int, input().split())) for _ in range(n)])\r\nx.sort(key=lambda x: (-x[0], x[1]))\r\nl = 0\r\nh = 0\r\nt = 0\r\nwhile k - l - 1 >= 0 and x[k - l - 1] == x[k - 1]:\r\n t += 1\r\n l += 1\r\nwhile k + h < n and x[k + h] == x[k - 1]:\r\n t += 1\r\n h += 1\r\nprint(t)", "import collections\nimport math\nfrom sys import stdin\nimport sys\n\n\ndef get(t=int):\n lis = stdin.readline().strip().split()\n return list(map(t, lis))\n\n\ndef single_str():\n return get(str)[0]\n\n\ndef single_int():\n return get()[0]\n\n\nn, k = get()\nw = []\nfor i in range(1, n + 1):\n p, t = get()\n w.append((-p, t))\nw = sorted(w)\n# print(w)\nrank = [1]\nfor i in range(1, n):\n if w[i] == w[i - 1]:\n rank.append(rank[-1])\n else:\n rank.append(rank[-1] + 1)\nprint(rank.count(rank[k - 1]))\n", "# LUOGU_RID: 105474537\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n p, t = map(int, input().split())\r\n a.append((-p, t))\r\n\r\na.sort()\r\nk -= 1\r\nc, i, x = 1, k - 1, a[k]\r\nwhile i >= 0 and a[i] == x: \r\n c += 1; i -= 1\r\ni = k + 1\r\nwhile i < n and a[i] == x:\r\n c += 1; i += 1\r\nprint(c)", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn, k = map(int, input().split())\n\tais = []\n\tfor i in range(n):\n\t\tais.append(list(map(int, input().split())))\n\tais.sort(key = lambda x: (-x[0], x[1]))\n\tprint(ais.count(ais[k-1]))\n", "n, k = map(int, input().split())\r\narr = []\r\nfor _ in range(n):\r\n p, t = map(int, input().split())\r\n arr.append((p, -t))\r\narr.sort(reverse=True)\r\nprint(arr.count(arr[k - 1]))\r\n", "from collections import Counter\r\n\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor x in range(n):\r\n a,b=map(int,input().split())\r\n l.append((a,-b))\r\n\r\na=sorted(l,reverse=True)\r\n\r\nc=Counter(l)\r\n\r\nprint(c[a[k-1]])\r\n\r\n", "from collections import Counter\nfrom itertools import accumulate\n\ntestcases = []\nn, k = [int(x) for x in input().split(' ')]\nfor _ in range(n):\n points = [int(x) for x in input().split(' ')]\n testcases.append(tuple(points))\n\n# # print(testcases)\n# points_approx = []\ncnt = Counter(testcases)\nsorted_scores = sorted(set(testcases), key =lambda x: (x[0], -x[1]), reverse=True)\n# print(sorted_scores)\npositions_ord = [cnt[sorted_score] for sorted_score in sorted_scores]\nacc = list(accumulate(positions_ord))\n\nans_i = 0\nwhile k > acc[ans_i]:\n ans_i += 1\nprint(positions_ord[ans_i])\n\n \t\t\t \t\t\t\t\t \t \t \t \t \t \t", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n l,m=map(int,input().split())\r\n a.append([-l,m])\r\na.sort()\r\n \r\nprint(a.count(a[k-1]))", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nx = []\r\nfor _ in range(n):\r\n p, t = map(int, input().split())\r\n x.append(50 * p + 50 - t)\r\nx.sort()\r\ncnt = defaultdict(lambda : 0)\r\nfor i in x:\r\n cnt[i] += 1\r\nans = cnt[x[-k]]\r\nprint(ans)", "# Let's begin!\r\n\r\nfrom collections import deque\r\nimport sys\r\nimport re\r\nfrom math import *\r\nfrom itertools import *\r\nfrom heapq import *\r\nfrom bisect import bisect, bisect_left, bisect_right\r\nfrom collections import deque, Counter, defaultdict as dd\r\n# Sangeeta Singh\r\n\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef ri(): return int(input())\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(map(str, input().split()))\r\ndef isPowerOfTwo(x): return (x and (not(x & (x - 1))))\r\ndef lcm(x, y): return (x*y)//gcd(x, y)\r\ndef alpha(x): return ord(x)-ord('A')\r\ndef modMul(a, b): return ((a % mod) * (b % mod)+mod) % mod\r\ndef modAdd(a, b): return ((a % mod) + (b % mod)+mod) % mod\r\ndef modSub(a, b): return ((a % mod) - (b % mod)+mod) % mod\r\n\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\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef dtob(n):\r\n s = bin(n).replace(\"0b\", \"\")\r\n return (34-len(s))*'0'+s\r\n\r\n\r\ndef highestPowerof2(x):\r\n x |= x >> 1\r\n x |= x >> 2\r\n x |= x >> 4\r\n x |= x >> 8\r\n x |= x >> 16\r\n return x ^ (x >> 1)\r\n\r\n\r\ndef nextPowerOf2(N):\r\n if not (N & (N - 1)):\r\n return N\r\n return int(\"1\" + (len(bin(N)) - 2) * \"0\", 2)\r\n\r\n\r\ndef isPrime(x):\r\n if x == 1:\r\n return False\r\n if x == 2:\r\n return True\r\n for i in range(2, int(x ** 0.5) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef factors(n):\r\n i = 2\r\n ans = []\r\n while i <= sqrt(n):\r\n if (n % i == 0):\r\n if (n / i != i):\r\n ans.append(int(n/i))\r\n if i != 1:\r\n ans.append(i)\r\n i += 1\r\n return ans\r\n\r\n\r\n# def primeFactors(n):\r\n# c = 2\r\n# l = []\r\n# while(n > 1):\r\n# if(n % c == 0):\r\n# l.append(c)\r\n# n = n / c\r\n# else:\r\n# c = c + 1\r\n# return l\r\n\r\n\r\n# Primes = [1] * 100001\r\n# primeNos = []\r\n# def sieveOfEratosthenes(n):\r\n# p = 2\r\n# while (p * p <= n):\r\n# if (Primes[p]):\r\n# for i in range(p * p, n+1, p):\r\n# Primes[i] = 0\r\n# p += 1\r\n# for p in range(2, n+1):\r\n# if Primes[p]:\r\n# primeNos.append(p)\r\n# sieveOfEratosthenes(100000)\r\n# print(primeNos)\r\n\r\n\r\nMAXN = 100001\r\nspf = [0 for i in range(MAXN)]\r\n\r\n\r\ndef sieve():\r\n spf[1] = 1\r\n for i in range(2, MAXN):\r\n spf[i] = i\r\n\r\n for i in range(4, MAXN, 2):\r\n spf[i] = 2\r\n\r\n for i in range(3, ceil(sqrt(MAXN))):\r\n if (spf[i] == i):\r\n for j in range(i * i, MAXN, i):\r\n if (spf[j] == j):\r\n spf[j] = i\r\n\r\n# prime Factors\r\n\r\n\r\n# sieve()\r\ndef getFactorization(x):\r\n ret = []\r\n while (x != 1):\r\n ret.append(spf[x])\r\n x = x // spf[x]\r\n return ret\r\n\r\n\r\nmod = 10**9+7\r\nabc = \"abcdefghijklmnopqrstuvwxyz\"\r\nN = 100005\r\n# mod = 998244353\r\n# for k, v in groupby(a): grouping consecutive similar elements\r\n\r\n############### Main! ################\r\n\r\n\r\ndef sangee():\r\n n, K = rl()\r\n a = [rl() for i in range(n)]\r\n a.sort(reverse=True)\r\n d = dd(int)\r\n for i in a:\r\n d[tuple(i)] += 1\r\n d1 = dd(list)\r\n for i in a:\r\n d1[i[0]].append(i[1])\r\n # print(d)\r\n # print(d1)\r\n for k in d1:\r\n d1[k].sort()\r\n\r\n # print(d1)\r\n # print(a)\r\n cnt = 1\r\n key = -1\r\n val = -1\r\n for k in d1:\r\n for i in d1[k]:\r\n if cnt == K:\r\n key = k\r\n val = i\r\n print(d[(key, val)])\r\n return\r\n cnt += 1\r\n\r\n\r\nt = 1\r\n# t = ri()\r\nfor _ in range(t):\r\n sangee()\r\n", "num,index=map(int,input().split())\r\nl=[]\r\nfor i in range(num):\r\n l.append(list(map(int,input().split())))\r\ndef bubbleSort(arr):\r\n n = len(arr)\r\n for i in range(n-1):\r\n for j in range(0,n-i-1):\r\n if (arr[j][0] == arr[j+1][0] and arr[j][1] > arr[j+1][1]) or arr[j][0]<arr[j+1][0]:\r\n temp=arr[j]\r\n arr[j]=arr[j+1]\r\n arr[j+1]=temp \r\nbubbleSort(l)\r\nprint(l.count(l[index-1]))", "n,k=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n arr.append(x)\r\nfor i in range(n-1):\r\n for j in range(n-i-1):\r\n if arr[j][0]>arr[j+1][0]:\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n elif arr[j][0]==arr[j+1][0]:\r\n if arr[j][1]<arr[j+1][1]:\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n\r\narr=arr[-1::-1] \r\nans=arr[k-1]\r\nresult=arr.count(ans)\r\nprint(result)", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n P = lambda: map(int, input().split())\r\n\r\n n, k = P()\r\n a = list()\r\n\r\n for i in range(n):\r\n a.append([int(x) for x in input().split()])\r\n a.sort(key=lambda item: (item[0], -item[1]), reverse=True)\r\n print(a.count(a[k - 1]))", "a,b=map(int,input().split())\r\nli=[]\r\nfor i in range(a):\r\n x1,x2=map(int,input().split())\r\n li.append((x1,x2))\r\nli.sort(key= lambda x : (-x[0],x[1]))\r\nm=li.count(li[b-1])\r\nprint(m)", "# cook your dish here\r\n\r\nn,k = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n l.append([-a,b])\r\n\r\nl.sort()\r\nprint(l.count(l[k-1]))", "n,k = map(int,input().split())\r\nah = []\r\nbh = []\r\nab = []\r\n\r\naz = []\r\nbz = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n ah.append(a)\r\n bh.append(b)\r\n ab.append((a,b))\r\nab.sort()\r\nab.reverse()\r\nflag = True\r\nl = ab.copy()\r\nwhile flag:\r\n flag = False\r\n for i in range(len(ab)-1):\r\n if l[i][0] == l[i+1][0]:\r\n if l[i][1] > l[i+1][1]:\r\n l[i],l[i+1] = l[i+1],l[i]\r\n flag = True\r\nans = l[k-1]\r\nansw = l.count(ans)\r\nprint(answ)\r\n", "try:\r\n n,k=map(int,input().split())\r\n j=[]\r\n for i in range(n):\r\n f=[]\r\n p,t=map(int,input().split())\r\n f.append(p)\r\n f.append(t)\r\n j.append(f)\r\n final = sorted(j, key=lambda x: (x[0],-x[1]),reverse=True)\r\n \r\n \r\n print(final.count(final[k-1]))\r\nexcept:\r\n pass\r\n", "n, k = map(int, input().split())\nteams = []\n\nfor i in range(n):\n team_info = list(map(int, input().split()))\n teams.append(team_info)\n\n\ndef custom_sort_key(team):\n return (-team[0], team[1])\n\n\nteams = sorted(teams, key=custom_sort_key)\ncounts = [1] # Initialize the first count to 1\n\nfor i in range(1, len(teams)):\n if teams[i] == teams[i - 1]:\n counts[-1] += 1 # Increment the last count in the list\n else:\n counts.append(1) # Start counting a new group of teams\n\n# Now, counts[i] contains the number of teams sharing the i+1-th place.\nfor i in range(0, len(counts)):\n if counts[i]-k >= 0:\n print(counts[i])\n break\n else:\n k = k-counts[i]\n", "n, k = map(int, input().split())\r\nstandings = []\r\nfor i in range(n):\r\n standings.append(list(map(int, input().split())))\r\nstandings.sort(reverse=True, key=lambda x: (x[0],-x[1]))\r\n#print(standings)\r\ncount = 0\r\ni = k-1\r\nwhile i>-1 and standings[i][0]==standings[k-1][0] and standings[i][1]==standings[k-1][1]:\r\n count += 1\r\n i -= 1\r\ni = k\r\nwhile i<n and standings[i][0]==standings[k-1][0] and standings[i][1]==standings[k-1][1]:\r\n count += 1\r\n i += 1\r\nprint(count)\r\n", "def solution():\r\n\tn, k = map(int, input().split())\r\n\tscore = []\r\n\tfor i in range(n):\r\n\t\ta, b = map(int, input().split())\r\n\t\tscore.append([a,b])\r\n\tscore = sorted(score, key=lambda x: (-x[0], x[1]))\r\n\tprint(score.count(score[k-1]))\r\n\r\nsolution()", "l = []\r\nn, k = map(int, input().split())\r\nfor _ in range(n):\r\n l1,l2 = (map(int, input().split()))\r\n l.append((-l1,l2))\r\nl.sort()\r\nprint(l.count(l[k - 1]))", "def main():\r\n n, k = map(int, input().split())\r\n V = []\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n V.append((a, -b))\r\n V.sort(reverse=True)\r\n x, y = k - 1, k - 1\r\n while x > 0 and V[x - 1] == V[x]:\r\n x -= 1\r\n while y < len(V) - 1 and V[y] == V[y + 1]:\r\n y += 1\r\n print(y - x + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k=map(int, input().split())\r\n\r\na=[]\r\n\r\nfor i in range(0,n):\r\n p,q=list(map(int, input().split()))\r\n\r\n a.append([p,100-q])\r\n\r\na.sort()\r\n\r\nl1=a[n-k]\r\n\r\ncount=0\r\n\r\nfor i in a:\r\n if i[0]==l1[0] and i[1]==l1[1]:\r\n count=count+1\r\n\r\nprint (count)\r\n\r\n\r\n \r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\ndef inInt():\r\n return int(input())\r\ndef inStr():\r\n return input().strip(\"\\n\")\r\ndef inIList():\r\n return(list(map(int,input().split())))\r\ndef inSList():\r\n return(input().split())\r\n\r\ndef solve(case, d):\r\n ans = 0\r\n j = 0\r\n for i in range(len(case)):\r\n while case[i] - case[j] > d:j += 1\r\n ans += int((i - j) * (i - j - 1)/2)\r\n \r\n\r\n print(ans)\r\n\r\nnums = inIList()\r\ncase = inIList()\r\nsolve(case, nums[1])", "n, d = map(int, input().split())\r\ndots = list(map(int, input().split()))\r\ncursor = 0\r\nans = 0\r\nif n > 2:\r\n for i in range(2, n):\r\n while dots[i]-dots[cursor]>d:\r\n cursor+=1\r\n k=i-cursor\r\n ans+=k*(k-1)//2\r\n print(ans)\r\nelse:\r\n print(0)", "def Search(L,aa,x):\n a=aa\n b=len(L)\n while(b-a>1):\n i=(b+a)//2\n if(L[i]>x):\n b=i\n elif(L[i]<x):\n a=i\n else:\n return (i+1)-aa-1\n return b-aa-1\n\nimport math\n\nn,d=map(int,input().split())\n\nP=list(map(int,input().split()))\nans=0\nfor i in range(n):\n x=Search(P,i,P[i]+d)\n if(x>1):\n ans+=((x)*(x-1))//2\nprint(ans)\n", "import math,sys,collections,bisect,heapq\nfrom itertools import combinations\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef possible(freq,mid,n):\n\tc = 0\n\tfor i in freq:\n\t\tc+=freq[i]//mid\n\tif c>=n:\n\t\treturn True\n\treturn False\n\ndef binarysearch(l,r,arr,k,ini):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif ini-arr[mid]>=k:\n\t\t\treturn binarysearch(l,mid-1,arr,k,ini)\n\t\telse:\n\t\t\treturn binarysearch(mid+1,r,arr,k,ini)\n\treturn l\ndef binarysearch2(l,r,k,st):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif mid-st+1==k:\n\t\t\treturn mid\n\t\telif mid-st+1<k:\n\t\t\treturn binarysearch2(mid+1,r,k,st)\n\t\treturn binarysearch2(l,mid-1,k,st)\n\treturn -1\ndef ispossible(n):\n\n\th = 1\n\tnum = 2\n\tpre = 2\n\twhile num<=n:\n\t\tpre = num\n\t\th+=1\n\t\tnum+=(h*2)+h-1\n\treturn n-pre\n\ndef cal(n):\n\ttmp = 0\n\twhile n:\n\t\ttmp+=n%10\n\t\tn//=10\n\treturn tmp\ndef solve():\n\tn,d = list(map(int,input().split()))\n\tarr = list(map(int,input().split()))\n\tarr.sort()\n\tl = r = 0\n\tans = 0\n\twhile r<n:\n\t\twhile r<n and arr[r]-arr[l]<=d:\n\t\t\tr+=1\n\t\t\tk = r-l-1\n\t\t\tans+=k*(k-1)//2\n\t\tl+=1\n\tprint(ans)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "def bs(num):\n\tlow = 0\n\thigh = n-1\n\twhile low<high:\n\t\tmid = (low+high)//2\n\t\tif a[mid]-num>d:\n\t\t\thigh = mid-1\n\t\telse:\n\t\t\tlow = mid+1\n\tif a[low]-num>d:\n\t\treturn low-1\n\telse:\n\t\treturn low\n\nn,d = map(int,input().split())\na = list(map(int,input().split()))\nans = 0\nfor i in range(n):\n\tf = bs(a[i])\n\tf = f-i\n\tans += max(0,(f*(f-1))//2)\nprint (ans)", "import bisect\nI = lambda: map(int, input().rstrip().split())\nn, d = I()\nx = list(I())\nans = 0\ndef getCount(m):\n return (m * (m - 1)) // 2\nfor i in range(n - 2):\n a = x[i]\n c = a + d\n ind = bisect.bisect_left(x, c)\n if ind > n - 1:\n ind = n - 1\n elif x[ind] != c:\n ind -= 1\n ans += getCount(ind - i)\nprint(ans)", "\r\nn , d = map(int , input().split(' '))\r\n\r\nl = list(map(int ,input().split(' ')))\r\n\r\nans = 0\r\ni = 0\r\nj = 0\r\nwhile n>i :\r\n while l[i]-l[j] > d: # when the condition is not working make a step\r\n j +=1\r\n\r\n ans += ((i-j)*(i-j-1))//2 \r\n\r\n i +=1\r\n\r\n\r\nprint(ans)\r\n", "from collections import deque\r\nn,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nt=0\r\ns1=deque()\r\ni=0\r\nwhile i<n:\r\n if len(s1)==0:\r\n s1.append(s[i])\r\n i+=1\r\n elif s[i]-s1[0]<=d:\r\n s1.append(s[i])\r\n i+=1\r\n else:\r\n m=len(s1)\r\n t+=(m-1)*(m-2)//2\r\n s1.popleft()\r\nm=len(s1)\r\nt+=m*(m-1)*(m-2)//6\r\nprint(t)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\np = 0\r\nans = 0\r\nfor i in range(n):\r\n while a[i] - a[p] > d:\r\n p += 1\r\n diff = i - p\r\n ans += (diff * (diff - 1)) // 2\r\nprint(ans)\r\n", "n,d = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\nfinal = 0\r\nfor i in range(n-2):\r\n l = i\r\n r = n-1\r\n ans = -1\r\n while l <= r:\r\n mid = l+(r-l)//2\r\n if nums[mid] - nums[i] <= d:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n if ans-i >= 2:\r\n final += (ans-i-1)*(ans-i)//2\r\nprint(final)", "s = [int (i) for i in input().split()];\r\n\r\nn = s[0];\r\nk = s[1];\r\n\r\na = [int (i) for i in input().split()];\r\n\r\ni = 0;\r\nj = 0;\r\ntotal = 0;\r\n\r\nwhile(i < n):\r\n while(j < n and a[j] - a[i] <= k):\r\n j += 1;\r\n\r\n if(j - i >= 3):\r\n x = j - i - 1;\r\n total += (x * (x-1))/2;\r\n i += 1;\r\n\r\nprint(int(total))", "n, dist = map(int, input().split())\r\n\r\npoints = list(map(int, input().split()))\r\n\r\ngroup_count = 0\r\ntail = 0\r\nfor head in range(n) :\r\n while points[head] - points[tail] > dist: # when the condition is not working make a step\r\n tail += 1\r\n\r\n # the number of points in the segment between two pointers, excluding the rightmost point\r\n k = head - tail\r\n\r\n # there exist exactly k * (k - 1) // 2 triplets of points with the fixed rightmost point\r\n group_count += (k * (k - 1)) // 2\r\nprint(group_count)\r\n", "n,d = map(int,input().split())\r\nar = list(map(int,input().split()))\r\n \r\ni,j,s = 0,0,0\r\n \r\nwhile i<n:\r\n\twhile ar[i]-ar[j]>d:\r\n\t\tj += 1\r\n\tN = i-j\r\n\ts += N*(N-1)//2\r\n\ti += 1\r\nprint(s)", "\r\nimport math\r\nfrom collections import Counter\r\nimport bisect\r\n\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nways = 0\r\nfor i in range(n - 2) :\r\n y = bisect.bisect_right(x, x[i] + d)\r\n ways += max(0, ((y - i - 2) * (y - i - 1)) // 2)\r\nprint(ways)\r\n", "# Read input\r\nn, d = map(int, input().split())\r\ncoordinates = list(map(int, input().split()))\r\n\r\n# Initialize variables\r\ncount = 0\r\nleft_pointer = 0\r\n\r\n# Iterate through the coordinates\r\nfor i in range(n):\r\n # Move the left pointer until the distance condition is met\r\n while coordinates[i] > d + coordinates[left_pointer] and left_pointer < n:\r\n left_pointer += 1\r\n # Calculate the number of valid groups of three points\r\n distance_between_points = i - left_pointer - 1\r\n count += (distance_between_points + 1) * distance_between_points // 2\r\n\r\n# Print the result\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nj=0\r\nans=0\r\nfor i in range(2,n):\r\n while abs(a[j]-a[i])>k:\r\n j=j+1\r\n d=i-j\r\n ans=ans+(d)*(d-1)//2\r\nprint(ans)", "n,d = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\ndef binary_search(arr,low,high,target):\r\n while low<=high:\r\n mid = (low+high)>>1\r\n # print(low,high,mid)\r\n if arr[mid]>target:\r\n high = mid-1\r\n else:\r\n if mid==high:\r\n return mid\r\n if arr[mid+1]>target:\r\n return mid\r\n low = mid+1\r\n \r\n# print(binary_search(arr,0,n-1,0))\r\n \r\n \r\nres = 0\r\ni = 0\r\nwhile i<n:\r\n # print(d+arr[i])\r\n j = binary_search(arr,i,n-1,d+arr[i])\r\n # print(j)\r\n if (j-i)>=2:\r\n cnt = 1+j-i\r\n res+= ((cnt-2)*(cnt-1))//2\r\n i+=1\r\n\r\nprint(res)", "from bisect import bisect_left\r\n\r\ndef sol(a,n,d):\r\n ans = 0\r\n for i in range(n-2):\r\n x = a[i]+d\r\n pos = bisect_left(a,x)\r\n if pos < n and a[pos] == x:\r\n pos+=1\r\n x = pos - (i+2)\r\n\r\n ans+=((x*(x+1))//2)\r\n return ans\r\n\r\nn,d = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nprint(sol(a,n,d))", "import bisect\n\nN, D = map(int, input().split())\n\nA = list(map(int, input().split()))\nA.sort()\n\nans = 0\nfor i in range(N):\n X = bisect.bisect_left(A, A[i] - D)\n temp = i - X\n ans += max(0, (temp * (temp - 1))//2)\nprint(ans)\n", "n,d=map(int,input().split())\nar=list(map(int,input().split()))\nans=0\nind1=0\nind2=0\nwhile ind1<n:\n\twhile ind2<n and ar[ind1]-ar[ind2]>d:\n\t\tind2+=1\n\tt=ind1-ind2\n\tans=ans+(t*(t-1))//2\n\tind1+=1\nprint(ans)\n\n\t\t \t\t \t \t \t\t\t\t\t \t \t \t \t \t\t", "n, d = map(int, input().split())\r\nar = list(map(int,input().split()))\r\nx = 0\r\nj = 0\r\nfor i in range(n):\r\n while ar[i] - ar[j] > d:\r\n j += 1\r\n k = i - j\r\n x += (k * (k - 1) / 2)\r\nprint(int(x))\r\n", "n,d=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nk=0\r\ne=0\r\nfor i in range(2,n):\r\n while r[i]-r[k]>d:\r\n k=k+1\r\n p=i-k\r\n e+=p*(p-1)//2\r\nprint(e) ", "\nn, d = list(map(int, input().split()))\n\npoints = list(map(int, input().split()))\n\n\ndef count_sum_one_to(num):\n return int((num * (num + 1)) / 2)\n\n\ndef next_index(i, start=0):\n for k in range(start, n):\n if points[k] - d > points[i]:\n return k - 1\n return n - 1\n\n\nresult = 0\nleft, right = 0, 0\n\n\nwhile left < n:\n\n right = next_index(left, right)\n if left != right:\n result += count_sum_one_to(right - left - 1)\n left += 1\n\nprint(result)\n", "from bisect import bisect_left\r\n\r\ninp = input().split(' ')\r\nn = int(inp[0])\r\nd = int(inp[1])\r\narr = [int(x) for x in input().split(' ')]\r\nans = 0\r\nfor i in range(len(arr)):\r\n\tx = arr[i]\r\n\tupper = x - d\r\n\tk = max(i - bisect_left(arr, upper, 0, len(arr)), 0)\r\n\tans += k * (k-1) / 2\r\nprint(int(ans))\r\n", "a, b = map(int, input().split())\r\np = list(map(int, input().split()))\r\nsu = 0\r\nj=0\r\nfor i in range(a):\r\n while j + 1 < a and p[j + 1] - p[i] <= b:\r\n j += 1\r\n cnt = j - i - 1\r\n su += cnt * (cnt + 1) // 2\r\nprint(su)\r\n", "n,d=map(int, input().split())\r\n\r\nl1=list(map(int, input().split()))\r\n\r\ni=0\r\nj=0\r\ncount=0\r\n\r\nwhile i<n:\r\n\r\n while (j<n and l1[j]-l1[i]<=d):\r\n j+=1\r\n\r\n count=count+((j-i-2)*(j-i-1))//2\r\n\r\n i+=1\r\n\r\nprint (count)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns,x=0,0\r\nfor i in range(n):\r\n\twhile a[i]>d+a[x] and x<n:\r\n\t\tx+=1\r\n\tm=i-x-1\r\n\ts+=(m+1)*m//2\r\nprint(s)", "n,d=map(int,input().split())\r\nfrom bisect import bisect_right as bl\r\na,r=list(map(int,input().split())),0\r\nfor i in range(n):\r\n q=bl(a,a[i]+d)-2-i\r\n if q>0:r+=q*(q+1)//2\r\nprint(r)", "def cf(l,x,d,n):\r\n\tif l[-1]-l[x]<=d:\r\n\t\treturn n-1-x\r\n\telif l[x+1]-l[x]>d:\r\n\t\treturn 1\r\n\telse:\r\n\t\tlow=x\r\n\t\thigh=n-1\r\n\t\tans=0\r\n\t\twhile low<=high:\r\n\t\t\tmid=(low+high)//2\r\n\t\t\tif l[mid]-l[x]==d:\r\n\t\t\t\treturn mid-x\r\n\t\t\telif l[mid]-l[x]>d:\r\n\t\t\t\thigh=mid-1\r\n\t\t\telse:\r\n\t\t\t\tans=mid\r\n\t\t\t\tlow=mid+1\r\n\t\treturn high-x\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nz=0\r\nfor x in range(n-2):\r\n\ty=cf(l,x,d,n)\r\n\tz=z+((y*(y-1))//2)\r\nprint(z)", "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\n\r\nimport bisect\r\n\r\nmod=10**9+7\r\n\r\n#print(bisect.bisect_right([1,2,3],2))\r\n#print(bisect.bisect_left([1,2,3],2))\r\n\r\nn,d=R()\r\n\r\nx=L()+[1e10]\r\n\r\nx.sort()\r\n\r\nl=0\r\nr=0\r\nans=0\r\nwhile r<n:\r\n while r+1<=n and x[r+1]-x[l]<=d: r+=1\r\n \r\n ans+=(r-l-1)*(r-l)//2\r\n\r\n l+=1\r\n\r\nprint(ans)", "def BS(low,high,key,l):\r\n ans=0\r\n while low<=high:\r\n mid=(low+high)//2\r\n if l[mid]==key:\r\n floor=key\r\n ans=mid\r\n break\r\n elif l[mid]<key:\r\n floor=l[mid]\r\n ans=mid\r\n low=mid+1\r\n elif l[mid]>key:\r\n high=mid-1\r\n return ans\r\n \r\n\r\n\r\nn,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\naa=0\r\nfor i in range(len(l)-2):\r\n e=BS(i,len(l)-1,l[i]+k,l)\r\n length=(e-i+1)\r\n aa+=(((length-2)*(length-1))//2)\r\n #print(e,aa)\r\nprint(aa)", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\nn,d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\ndef c(x:int):\r\n return 0 if x<2 else (x*(x-1)//2)\r\n\r\nans = 0\r\n\r\nfor i in range(0,n):\r\n j = bisect.bisect_right(a,a[i]+d)\r\n ans += c(j-i-1)\r\n\r\nprint(ans)", "n, d = map(int, input().split())\narr = [*map(int, input().split())]\n\nans = 0\n\nfrom bisect import bisect\n\nfor i in range(n):\n\tp = bisect(arr, arr[i] + d) - i - 1\n\tans += (p * (p - 1)) // 2\n\nprint(ans)", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nj = 0\ncnt = 0\n\nfor i in range(n):\n while a[i] - a[j] > d:\n j += 1\n k = i - j\n cnt += k * (k -1) // 2\n\nprint(cnt)\n \t\t\t\t\t\t \t\t \t\t\t\t\t \t", "n,d=map(int,input().split())\r\nL=list(map(int,input().split()))\r\n \r\nj=0\r\ne=0\r\nfor i in range(n):\r\n while(j<n and L[i]+d>=L[j]):\r\n j+=1\r\n x=j-i-2\r\n if(x<=0):\r\n continue\r\n e+=(x*(x+1))//2\r\nprint(e)", "from sys import stdin,stdout,stderr\r\ndef binary(lo,hi,value):\r\n global a\r\n ans=lo\r\n while lo<=hi:\r\n mid=(lo+hi)//2\r\n if a[mid]<=value:\r\n ans=mid\r\n lo=mid+1\r\n else:hi=mid-1\r\n return ans\r\nn,d=map(int,input().split())\r\na=[int(x)for x in input().split()]\r\nans=0\r\nfor i in range(n):\r\n lo=binary(i+1,n-1,a[i]+d)\r\n lo=(lo-i)\r\n ans=ans+lo*(lo-1)/2\r\nprint(int(ans))", "from bisect import bisect_left\r\nn,k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(2, n):\r\n\tind = bisect_left(l, l[i]-k)\r\n\tno = i-ind\r\n\t# print(no)\r\n\r\n\tans += max(0, no*(no-1)//2)\r\nprint(ans)", "n,d=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nx=0;t=0\r\nfor i in range(n-2):\r\n while (t<n and c[t]<=c[i]+d):\r\n t=t+1 \r\n t-i-1\r\n x=x+(t-i-1)*(t-i-2)/2\r\nprint(int(x))", "import bisect\n\n\ndef handle() -> str:\n n, d = [int(s) for s in input().split(\" \")]\n values = [int(s) for s in input().split(\" \")]\n count = 0\n\n for i in range(len(values) - 2):\n furthest_index = bisect.bisect_right(values, values[i] + d)\n if furthest_index == len(values) or values[furthest_index] > values[i] + d:\n furthest_index -= 1\n between = furthest_index - i - 1\n if between >= 1:\n count += ((between * (between + 1))) // 2\n return count\n\n\nprint(handle())\n", "import sys\n\n\ndef solve(d, points):\n # points.append(math.inf)\n pointer1 = 0\n pointer2 = 0\n totalPairs = 0\n while pointer1 < len(points) - 1:\n\n if pointer2 < len(points) and abs(points[pointer2] - points[pointer1]) <= d:\n pointer2 += 1\n\n elif pointer2 == len(points) or abs(points[pointer2] - points[pointer1]) > d:\n # calculate up to points - 1\n nodes = pointer2 - pointer1 # includes first value\n if nodes >= 3:\n nodes -= 1 # take one off for the first value\n pairings = ((nodes) * (nodes - 1)) // 2 # combinations of nodes nC2\n totalPairs += pairings\n pointer1 += 1\n\n return totalPairs\n\n\ndef readinput():\n n, d = map(int, sys.stdin.readline().rstrip().split(\" \"))\n points = list(map(int, sys.stdin.readline().rstrip().split(\" \")))\n\n print(solve(d, points))\n\n\nreadinput()\n", "from math import comb\r\n\r\ndef binsearch(X, start, end, search):\r\n while (start < end):\r\n mid = (start + end) // 2\r\n if X[mid] == search:\r\n return mid\r\n elif X[mid] > search:\r\n end = mid\r\n else:\r\n start = mid + 1\r\n return start\r\n\r\n\r\ndef main():\r\n n, d = list(map(int, input().split()))\r\n X = list(map(int, input().split()))\r\n K = []\r\n for i in range(2, n):\r\n j = binsearch(X, 0, len(X), X[i] - d)\r\n if X[i] - X[j] <= d:\r\n K.append(i - j)\r\n print(sum([comb(k, 2) for k in K]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#Tardes de coding. Problem C: Points On Line\r\ndef main():\r\n\t(n,d) = (int(inp) for inp in input().split())\r\n\tcoords = [int(coord) for coord in input().split()]\r\n\tgroups_points = 0\r\n\tfor i in range(0, n-2):\r\n\t\tfind = coords[i] + d\r\n\t\tindex = binary_search(find,coords,i,n-1)\r\n\t\t#number of numbers that there are between index and i\r\n\t\taux = index - i\r\n\t\tgroups_points += aux*(aux-1)//2\r\n\tprint(groups_points)\r\n\treturn groups_points\r\n\r\n#we return the index of num or of the first num that is less than num\r\ndef binary_search(num, coords,start,end):\r\n\tif end <= start :\r\n\t\tif num == coords[start]:\r\n\t\t\treturn start\r\n\t\telse: \r\n\t\t\tindex = start\r\n\t\t\twhile coords[index] > num:\r\n\t\t\t\tindex-=1\r\n\t\t\treturn index\r\n\telse:\r\n\t\tmiddle = (end+start)//2\r\n\t\tif coords[middle] == num:\r\n\t\t\treturn middle\r\n\t\telif coords[middle] > num:\r\n\t\t\treturn binary_search(num, coords, start, middle-1)\r\n\t\telse:\r\n\t\t\treturn binary_search(num,coords,middle+1, end)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n,d=map(int,input().split())\narr=list(map(int,input().split()))\nans = 0\nl = 0\n\nfor i in range(n):\n while arr[i]-arr[l]>d:\n l+=1\n k=i-l\n ans+=k*(k-1)//2\nprint(ans)\n", "\r\nn,d = map(int,input().split())\r\n\r\np = list(map(int,input().split()))\r\n\r\nif n<=2 :\r\n print(0)\r\n \r\nelse :\r\n \r\n l = 0 \r\n r = 2 \r\n \r\n cnt = 0\r\n \r\n \r\n while(r<n) :\r\n \r\n if p[r]-p[l]<=d :\r\n r += 1 \r\n \r\n else :\r\n \r\n cnt = cnt + ((r-l-1)*(r-l-2))//2 \r\n l = l + 1\r\n \r\n while(l<n-2) :\r\n \r\n cnt = cnt + ((r-l-1)*(r-l-2))//2 \r\n l += 1\r\n \r\n print(cnt)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n, d = map(int, input().split())\na = list(map(int, input().split())) + [1000000000000]\nans = 0\nl = 0\nr = 0\nwhile l < n - 1:\n\twhile a[r] - a[l] <= d : \n\t\tr += 1\n\tans += (r - l - 1) * (r - l - 2)//2\n\tl += 1\nprint(ans)\n\n \t\t\t \t\t \t\t \t\t\t \t\t\t \t\t \t\t\t", "import math\r\nimport sys\r\nimport collections\r\nimport bisect\r\nimport string\r\nimport time\r\ndef get_ints():return map(int, sys.stdin.readline().strip().split())\r\ndef get_list():return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string():return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n,d=get_ints()\r\n arr=get_list()\r\n ans=0\r\n for i in range(n-2):\r\n starting=arr[i]\r\n start_point=i\r\n maxim=starting+d\r\n extreme_point=bisect.bisect_right(arr,maxim)\r\n end_point=extreme_point-1\r\n gap=end_point-start_point\r\n ans+=(gap*(gap-1)//2)\r\n print(ans)", "n,d=map(int,input().split())\r\nlist1=[int(x)for x in input().split()]\r\nindex2=0\r\nsum_pair=0\r\nfor index1 in range(n):\r\n while list1[index1]-list1[index2]>d:\r\n index2+=1\r\n \r\n data=index1-index2\r\n sum_pair+=(data*(data-1))//2\r\nprint(sum_pair)\r\n\r\n", "n,d=[int(i) for i in input().split()]\r\nx=[int(i) for i in input().split()]\r\n\r\nk=0\r\nS=0\r\n\r\nfor i in range(2,n):\r\n while x[i]-x[k]>d:k=k+1\r\n P=i-k\r\n S+=P*(P-1)//2\r\n \r\nprint(S)\r\n", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\ndef p(x) :\r\n return (x*(x + 1))//2\r\nn, d = map(int, inpu().split())\r\na = list(map(int, inpu().split()))\r\ni = 0\r\nans = 0\r\nj = 2\r\nwhile j < n :\r\n while a[j] - a[i] > d :\r\n i += 1\r\n while j - i <= 1:\r\n j += 1\r\n while (j < n) and (a[j] - a[i] <= d) :\r\n ans += p(j - i - 1)\r\n j += 1\r\nprin(str(ans) + '\\n')", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\n############################################################################\r\n# ACTUAL CODE\r\n############################################################################\r\nfrom functools import reduce\r\nimport operator as op\r\nimport math\r\n\r\nnCr = lambda n, r: reduce(op.mul, range(n - r + 1, n + 1), 1) // math.factorial(r)\r\n\r\ndef binarySearch(beg, end, target, A):\r\n def condition(mid):\r\n return A[mid] > target\r\n\r\n lo = beg\r\n hi = end\r\n while lo < hi:\r\n mid = lo + ((hi - lo) // 2)\r\n if condition(mid):\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n return lo - 1\r\n\r\n\r\ndef solve(n, d, A):\r\n ways = 0\r\n\r\n for i in range(n - 2):\r\n j = binarySearch(i + 1, n, A[i] + d, A)\r\n if j >= i + 2:\r\n ways += nCr(j - i, 2)\r\n\r\n print(ways)\r\n\r\ndef main():\r\n n, d = list(map(int, input().strip().split(\" \")))\r\n A = list(map(int, input().strip().split(\" \")))\r\n solve(n, d, A)\r\n\r\n\r\n############################################################################\r\n# FAST-IO\r\n# PyRIVAL\r\n############################################################################\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n############################################################################\r\n\r\n\r\n## DRIVER # PROGRAM ########################################################\r\nif __name__ == \"__main__\":\r\n main()", "n, d=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nres=0\r\nfor j in range(n):\r\n l, r=0, n\r\n while r-l>1:\r\n m=(l+r)//2\r\n if w[m]<=w[j]+d:\r\n l=m\r\n else:\r\n r=m\r\n x=l-j\r\n if x>=2:\r\n res+=x*(x-1)//2\r\nprint(res)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Points on Line\"\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 lower_bound(list_, s, e, x):\r\n l = s ; r = e ; ans = -1\r\n while l<=r:\r\n mid = (l + r)//2\r\n if list_[mid] >= x:\r\n ans = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return ans-(list_[ans]>x)\r\ndef Solve():\r\n z, d = list(map(int, input().split()))\r\n x = list(map(int, input().split()))\r\n ans = 0\r\n for l in range(z):\r\n r = lower_bound(x, l, z-1, x[l]+d)\r\n if r<0: r = z - abs(r)\r\n if r-l>=2:\r\n n = r - l - 1\r\n ans+=int((n-1)*n/2+n)\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "'''input\n4 2\n-3 -2 -1 0\n'''\nfrom sys import stdin\nfrom bisect import bisect_right\n\n\ndef make_dict(arr):\n\tmydict = dict()\n\tfor i in arr:\n\t\tmydict[i] = True\n\treturn mydict\n\n\ndef combi(n, c):\n\treturn (n * (n - 1)) // 2\n\n# main starts\nn, d = list(map(int, stdin.readline().split()))\narr = list(map(int, stdin.readline().split()))\nmydict = make_dict(arr)\ncount = 0\nfor i in range(n):\n\tindex = bisect_right(arr, arr[i] + d)\n\tcount += combi(index - i - 1 , 2)\n#\tprint(index, count)\nprint(count)", "from collections import deque\r\nn,d=[int(i) for i in input().split()]\r\nDeq=[int(j) for j in input().split()]\r\ncnt=0\r\nind=1\r\nj=1\r\nfor i in range(0,n-2):\r\n while j<n-1:\r\n if Deq[j+1]-Deq[i]<=d :\r\n j+=1\r\n else : break\r\n l=j-i\r\n if l==0 & i<n-3:\r\n j+=1\r\n continue\r\n if j==n-1 :\r\n cnt+=(l+1)*l*(l-1)//6\r\n break\r\n else :\r\n cnt+=(l)*(l-1)//2\r\nprint(cnt)", "inp=list(map(int,input().split()))\r\nn,d=inp\r\narr=list(map(int,input().split()))\r\ndef find (arr,ind,d):\r\n start=ind\r\n end=len(arr)-1\r\n if abs(arr[end]-arr[ind])<=d:\r\n return len(arr)-1\r\n while start+1<end:\r\n mid=(start+end)//2\r\n if abs(arr[mid]-arr[ind])>d:\r\n end=mid\r\n continue\r\n else:\r\n start=mid\r\n if abs(arr[end]-arr[ind])<=d:\r\n return end\r\n return start\r\nans=0\r\nfor i in range(len(arr)-2):\r\n k=find(arr,i,d)\r\n x=k-i\r\n ans+=(x*(x-1))//2\r\nprint (ans)", "def main():\r\n n, d = read_ints()\r\n points = read_ints()\r\n\r\n ans = 0\r\n j = 0\r\n for i in range(n):\r\n while j + 1 < n and points[j+1] - points[i] <= d:\r\n j += 1\r\n\r\n ans += max(0, (j-i) * (j-i-1) // 2)\r\n\r\n print(ans)\r\n\r\n\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n import sys\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n main()\r\n", "from bisect import bisect_left as bl\r\n\r\n\r\ndef ck(n, k):\r\n ans = 1\r\n for i in range(n - k + 1, n + 1):\r\n ans *= i\r\n\r\n for i in range(2, k + 1):\r\n ans //= i\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n\r\n ans = 0\r\n for i, e in enumerate(x):\r\n end = bl(x, e + d)\r\n if end == len(x):\r\n end -= 1\r\n\r\n if e + d < x[end]:\r\n end -= 1\r\n\r\n if end - i >= 2:\r\n ans += ck(end - i, 2)\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import defaultdict\r\ndef ncr(n, k):\r\n C = [[0 for x in range(k + 1)] for x in range(n + 1)]\r\n for i in range(n + 1):\r\n for j in range(min(i, k) + 1):\r\n if j == 0 or j == i:\r\n C[i][j] = 1\r\n else:\r\n C[i][j] = C[i - 1][j - 1] + C[i - 1][j]\r\n\r\n return C[n][k]\r\n#print(ncr(5,2))\r\nn,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nj=0\r\nans=0\r\n#prev=-1\r\nfor i in range(n):\r\n while(a[i]-a[j]>k):\r\n j+=1\r\n ans+=((i-j)*(i-j-1))//2\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\ncount=0\r\nj=0\r\nfor i in range(n):\r\n while j<n and nums[j]-nums[i]<=d:\r\n j+=1\r\n temp_length=(j-i-1)\r\n count+=int((temp_length*(temp_length-1))/2)\r\n \r\nprint(count)\r\n\r\n", "def bin(pref,le,ri,num):\r\n while le <= ri:\r\n mid = (le + ri) // 2\r\n if pref[mid] == num:\r\n return mid\r\n elif pref[mid] < num:\r\n le = mid + 1\r\n else:\r\n ri = mid - 1\r\n return le\r\nn,d=map(int,input().split())\r\narr = list(map(int, input().split()))\r\nans =0\r\nfor i in range(n):\r\n ind = bin(arr, 0, n - 1, arr[i] + d)\r\n if ind == n:\r\n ind -= 1\r\n elif arr[ind] > arr[i] + d:\r\n ind -= 1\r\n le=(ind - i + 1)\r\n if le >= 3:\r\n ans += (((le - 1) * (le - 2)) // 2)\r\nprint(ans)\r\n\r\n \r\n", "def binary_search(arr, n, key):\r\n l, r = 0, n-1\r\n while (l <= r):\r\n mid = l+r >> 1\r\n if (arr[mid] <= key):\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n return l\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n res = 0\r\n for i in range(n):\r\n j = binary_search(a, n, a[i]+k)-i-2\r\n res += max(0, j*(j+1)//2)\r\n print(res)\r\n \r\nmain()", "nd=input().split()\r\nn=int(nd[0])\r\nd=int(nd[1])\r\nx=input().split()\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\ns=0\r\nj=0\r\nfor i in range(n):\r\n while j < n and x[j]-x[i] <= d:\r\n j+=1\r\n k=j-i-1\r\n s+=(k*(k-1))//2\r\n \r\nprint(s) \r\n ", "\n\n# n, d = map(int, input().split())\n# li = [int(x) for x in input().split()]\n# i, j, ans = 0, len(li) - 1, 0\n# while i < len(li) and i + 1 < j:\n# count = 0\n# if li[j] - li[i] <= d:\n# count = j - i\n# i += 1\n# ans += (count * (count - 1) // 2)\n# else:\n# j -= 1\n# print(ans)\n\n\nn, d = map(int, input().split())\nar = list(map(int, input().split()))\n\ni, j, s = 0, 0, 0\n\nwhile i < n:\n while ar[i] - ar[j] > d:\n j += 1\n N = i - j\n s += N * (N - 1) // 2 # nC2 - pairing the elememts with i in the gap from i to j. \n i += 1\nprint(s)\n", "def numbersListInput():\n aux = list(map(int, input().strip().split()))\n return aux\n\ndef find_tail (arr, n, maxVal):\n mini = 0\n maxi = n\n mid = int(n/2)\n\n while True:\n if mid == 0 or mid == n-1:\n return mid\n if arr[mid] == maxVal:\n return mid\n if arr[mid] > maxVal and arr[mid-1] < maxVal:\n return mid-1\n if arr[mid] > maxVal and arr[mid-1] > maxVal:\n maxi = mid\n mid = int((mini+maxi)/2)\n if arr[mid] < maxVal and arr[mid-1] < maxVal:\n mini = mid\n mid = int((mini+maxi)/2)\n\nusr_input = numbersListInput()\nn = int(usr_input[0])\nd = int(usr_input[1])\nnumbersList = numbersListInput()\n\nres = 0\ntail = 0\nfor head in range(n):\n while (numbersList[head] - numbersList[tail] > d):\n tail += 1\n res += int (((head-tail)*(head-tail-1))/2)\nprint(res)\n \t \t\t \t\t\t \t\t\t \t\t \t \t\t\t\t\t \t", "n, d = map(int, input().split())\r\nl = list(map(int,input().split()))+[1e10]\r\na = i = j = 0\r\nwhile i<n-1:\r\n while l[j]-l[i]<=d:j+=1\r\n a+=(j-i-1)*(j-i-2)//2\r\n i+=1\r\nprint(a)", "#1 A. Points on Line div 1 round 153 \n#solve this problem using binary search\n\nn,k=map(int,input().split())\na=list(map(int,input().split()))\nl,r,ans=0,0,0\nwhile r<n:\n\twhile a[r]-a[l]>k:\n\t\tl+=1\n\tm=r-l\n\tans+=m*(m-1)//2\n\tr+=1\t\nprint(ans)\n\n", "def nCr(n):\r\n return (n-1)*n/2\r\n\r\ns = 0\r\nn,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nl = 1\r\nfor i in range(n-2):\r\n now = a[i]\r\n while(l < n and a[l]<=now+d): l+=1\r\n if l-i>=3:\r\n s+=nCr(l-i-1)\r\nprint(int(s))", "from math import comb; n, d = map(int, input().split()); arr = list(map(int, input().split())); l = r = ans = 0\r\nwhile l < n:\r\n while r < n and arr[r] - arr[l] <= d:r += 1\r\n a = r-l-1; ans += (a*(a-1)//2); l += 1\r\nprint(ans)\r\n", "n, d = list(map(int, input().split()))\nx = list(map(int, input().split()))\nl = 0\nans = 0\nfor r in range(n):\n while (x[r] - x[l] > d):\n l += 1\n k = max(0, r - l - 1)\n ans += k * (k + 1) // 2\nprint(ans)\n \t\t\t\t \t \t \t \t\t\t\t \t\t\t \t", "# Upsolve from Dukkha\r\n\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\noutput = 0\r\nj = 0\r\nfor i in range(n):\r\n while j < n and x[j] - x[i] <= d:\r\n j += 1\r\n k = j - i - 1\r\n output += (k/2)*(k-1)\r\nprint(int(output))\r\n", "n, k = list(map(int, input().split()))\nlis = list(map(int, input().split()))\n\n\n\ndef find(s, lis, a, k):\n l = s\n r = len(lis) - 1\n\n while (r - l) > 1:\n mid = (l + r) // 2\n \n if lis[mid] < a + k:\n l = mid\n else:\n r = mid\n if lis[r] <= a + k:\n return r\n return l\n\n\nnat = 0\ndef entekhab(y):\n return int(y * (y - 1) / 2)\ns = 0\nfor i in range(n):\n now = lis[i]\n loc = find(i, lis, now, k)\n \n \n if now + k >= lis[loc]:\n nat += entekhab(loc - i)\n \nprint(int(nat))\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n while j < n - 1 and a[j + 1] - a[i] <= d:\r\n j += 1\r\n x = j - i\r\n if x >= 2: ans += x * (x - 1) // 2\r\nprint(ans)", "n,d=[int(e) for e in input().split()]\r\nx=[int(e) for e in input().split()]\r\nans=0\r\ni=0\r\nj=0\r\nwhile i<n and j<n:\r\n while j<n and x[j]-x[i]<=d:\r\n j+=1\r\n j-=1\r\n k=j-i\r\n ans+=k*(k-1)//2\r\n i+=1\r\nprint(ans)", "n, d = map(int, input().split())\nx = list(map(int, input().split()))\nj = 0\nans = 0\nfor i in range(0, len(x)):\n\twhile j < len(x) and x[j] <= x[i] + d: j += 1\n\tans += (j - i - 1) * (j - i - 2) // 2\nprint(ans)\n", "import bisect\r\nn,d=map(int,input().split())\r\ns=0\r\nl=[int(s) for s in input().split()]\r\nfor i in range(n-2):\r\n k=l[i]+d\r\n k1=0\r\n k1=bisect.bisect_right(l,k)\r\n if(k1>i):\r\n k1=k1-i-1\r\n #print(k1)\r\n s+=(k1*(k1-1))//2\r\n else:\r\n break\r\nprint(s)\r\n \r\n \r\n \r\n ", "n,d=[int(i) for i in input().split()]\r\nq=list(map(int, input().split()))\r\ns=0\r\nif n<3:\r\n print(0)\r\nelse:\r\n t=3\r\n for i in range(n-2):\r\n for j in range(i+t-1,n):\r\n if q[j]-q[i]>d:\r\n j-=1\r\n break\r\n t=j-i\r\n s+=t*(t-1)//2\r\n print(s)\r\n", "# n=int(input())\r\n# n,k=map(int,input().split())\r\n'''l=0\r\nr=10**13\r\nwhile l+1<r:\r\n mid=(l+r)//2\r\n val=(max(0,b_b*mid-b)*rb+max(0,b_s*mid-s)*rs+max(0,b_c*mid-b)*rc)\r\n if val>money:\r\n r=mid\r\n if val<=money:\r\n l=mid'''\r\n# arr=list(map(int,input().split()))\r\n# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nn,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ni=0\r\nans=0\r\nfor j in range(n):\r\n while j-i>=3 and arr[j]-arr[i]>d:\r\n i+=1\r\n if arr[j]-arr[i]<=d:\r\n ans+=(j-i)*(j-i-1)//2\r\nprint(ans)\r\n", "#/usr/bin/env python3\n\nfrom sys import stdin\n\nn, d = map(int, stdin.readline().strip().split())\nx = list(map(int, stdin.readline().strip().split()))\nx.sort()\nend = 0\ncnt = 0\nfor i in range(len(x)):\n for j in range(end, len(x)):\n if x[j] - x[i] <= d:\n end = j\n else:\n break\n l = end - i \n cnt += l*(l-1)//2\nprint(cnt)\n \n\n", "N, target = input().split()\r\nN = int(N); target = int(target)\r\n \r\na = [int(i) for i in input().split()]\r\n \r\ndef checkIdx(a, l, val):\r\n\tif a[l] - val > target:\r\n\t\treturn -1\r\n\tr = len(a) - 1\r\n\twhile l <= r:\r\n\t\tmid = (l+r)//2\r\n\t\tif a[mid] - val > target:\r\n\t\t\tr = mid-1\r\n\t\telif a[mid] - val < target:\r\n\t\t\tl = mid+1\r\n\t\telse:\r\n\t\t\treturn mid\r\n \r\n\treturn r\r\n \r\ni = 0; j = 2\r\ncount = 0\r\nwhile i < N-2:\r\n\tpos = checkIdx(a, j, a[i])\r\n\tif pos != -1:\r\n\t\tpos = (pos-i-1) \r\n\tcount += (pos*(pos+1))//2\r\n\ti += 1; j += 1\r\n \r\nprint(count)", "# f=open('Documents/projects/CPDev/input.txt','r')\n# def get_int():return list(map(int,f.readline().split()))\n# def get_list(n): return [f.readline().split() for _ in range(n)]\n \ndef get_list(n): return list(input().split() for _ in range(n))\ndef get_int():return list(map(int,input().strip().split()))\n\nimport bisect\n \nn,m = get_int()\nli=get_int()\n \n \n \nans=0\ndef fact(x):\n res=1\n for i in range(2, x+1):\n res*=i\n return res\n \nj=0\nfor i in range(n):\n\n while li[i]-li[j]>m:\n j+=1\n ans+=(i-j)*(i-j-1)//2\n\nprint(ans)\n", "from collections import deque\r\nn,d = [int(i) for i in input().split()]\r\nalist = [int(i) for i in input().split()]\r\nde = deque()\r\ni = 0\r\nm = 0\r\nwhile i < n:\r\n while i < n and (len(de) == 0 or alist[i] - de[0] <= d):\r\n de.append(alist[i])\r\n if len(de) >= 3:\r\n m += (len(de)-1) *(len(de)-2) // 2\r\n i += 1\r\n de.popleft()\r\nprint (m)", "\nimport sys\nimport math\n\ndef bc(n, k): \n # since C(n, k) = C(n, n - k) \n if(k > n - k): \n k = n - k \n # initialize result \n res = 1\n # Calculate value of \n # [n * (n-1) *---* (n-k + 1)] / [k * (k-1) *----* 1] \n for i in range(k): \n res = res * (n - i) \n res = res / (i + 1) \n return res \n\n\ndef main():\n\tq = []\n\tfor line in sys.stdin.readlines():\n\t\tq.append(line)\n\n\tfor i in range(len(q)):\n\t\tq[i] = q[i].rstrip().split(' ')\n\t\tq[i] = [int(x) for x in q[i]]\n\n\tn = q[0][0]\n\td = q[0][1]\n\ta = q[1]\n\t# print(n, d, a)\n\ti = 0\n\tj = 1\n\tn_vals = []\n\tcount = 1\n\tret = 0\n\twhile (i < len(a)):\n\t\twhile (j < len(a) and a[i] + d >= a[j]):\n\t\t\tif count >= 2:\n\t\t\t\tret += bc(count, 2)\n\t\t\tcount += 1\n\t\t\tj+=1\n\t\ti+=1\n\t\tcount = max(count - 1, 1)\n\t\tif i == j:\n\t\t\tj+=1\n\n\tprint(int(ret))\n\n\t# n choose next value not previous value \n\t# need to find out how to exclude previous values\n\t# i think the overlapping values would be number of overlapping values choose k\n\t# so new value would be overlapping + new values choose k\n\t# and diff is overlapping + new values choose k - overlapping values choose k\n\n\t\t\n\nif __name__ == '__main__':\n\tmain()", "import bisect\r\nn, k = map(int, input().split(' '))\r\n\r\nc = [int(x) for x in input().split(' ')]\r\n\r\na = 0\r\nfor i in range(n-2):\r\n j = bisect.bisect_right(c, c[i] + k)\r\n a += 0.5*(j-i-2)*(j-i-1)\r\n #print(j, c[i]+k, a)\r\n\r\nprint(int(a))", "import sys\r\ninput=sys.stdin.readline\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif n<3:\r\n print(0)\r\n exit()\r\nelse:\r\n i=0\r\n j=1\r\n c=0\r\n while i<n and j<n :\r\n if a[j]-a[i]<=d:\r\n if j<n-1:\r\n j+=1\r\n elif j==n-1:\r\n l=j-i+1\r\n c+=(l-2)*(l-1)//2\r\n i+=1\r\n else:\r\n l = j-1 - i + 1\r\n c += (l - 2) * (l - 1) // 2\r\n i+=1\r\n print(c)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\ndef binary_search(key):\r\n l, r = 0, n-1\r\n while (l <= r):\r\n mid = l+r >> 1\r\n if (arr[mid] <= key):\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n return l\r\n\r\nres = 0\r\nfor i in range(n):\r\n j = binary_search(arr[i]+k)-i-2\r\n res += max(0, j*(j+1)//2)\r\nprint(res)\r\n", "n, d = map(int, input().split())\na = [int(i) for i in input().split()]\n\nl = 0\nans = 0\nfor r in range(n):\n while a[r] - a[l] > d:\n l += 1\n if a[r] - a[l] <= d:\n sz = r - l + 1 - 1\n ans += (sz) * (sz - 1) // 2\n\nprint(ans)\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans,j=0,0\r\nfor i in range(n):\r\n while a[i]-a[j]>d:\r\n j+=1\r\n v=i-j\r\n ans=ans+v*(v-1)//2\r\nprint(ans)", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nj=0\r\ns=0\r\nwhile i<x:\r\n f=0\r\n while a[j]-a[i]<=y and j<x:\r\n j+=1\r\n if j==x:\r\n f=1\r\n break\r\n \r\n p=j-i-2\r\n s+=(p*(p+1))//2\r\n i+=1\r\n if f:\r\n j-=1\r\n #print(s,i,j) \r\n\r\nprint(s) \r\n", "n, d = map(int, input().split())\r\nl = sorted(map(int, input().split()))\r\ns=ans=0;e=0\r\nwhile s<n-1:\r\n s+=1\r\n while l[s]-l[e]>d:e+=1\r\n k=s-e\r\n ans+=(k*(k-1))//2\r\nprint(ans)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\n\r\ndef lower_bound(value):\r\n first, last = 0, len(a)\r\n while first < last:\r\n mid = (first + last) // 2\r\n if value <= a[mid]:\r\n last = mid\r\n else:\r\n first = mid + 1\r\n\r\n return first\r\n\r\n\r\nfor i in range(n):\r\n j = lower_bound(a[i] - d)\r\n l = i - j\r\n if l >= 2:\r\n ans += l*(l-1)//2\r\n\r\nprint(ans)", "n, d = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n lo = i+2\r\n hi = n-1\r\n ans = None\r\n\r\n while lo <= hi:\r\n mid = hi - (hi -lo)//2\r\n if A[mid] - A[i] <= d:\r\n lo = mid+1\r\n ans = mid\r\n else:\r\n hi = mid-1\r\n\r\n if ans != None:\r\n k = ans-i\r\n total += (k-1)*k//2\r\nprint(total)", "import sys\r\ninput = sys.stdin.readline\r\nimport bisect\r\n\r\nn, d = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nif n < 3:\r\n print(0)\r\nelse:\r\n c = 0\r\n for i in range(n-2):\r\n a = bisect.bisect_right(w, w[i]+d)\r\n a = a - i - 1\r\n c += a*(a-1)//2\r\n print(c)\r\n", "import bisect \r\n\r\nn,d = [int(x) for x in input().split()]\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nans =0\r\n\r\nfor i in range(0,n):\r\n\r\n x = bisect.bisect_right(a,a[i]+d)\r\n\r\n ans+=(x-i-1)*(x-i-2)//2\r\n\r\nprint(ans)", "def bsearch(q, l, first, last):\r\n if first >= last:\r\n return first\r\n else:\r\n mid = (first+last) // 2\r\n if q < l[mid]:\r\n return bsearch(q, l, first, mid)\r\n elif q > l[mid]:\r\n return bsearch(q, l, mid+1, last)\r\n else:\r\n return mid\r\n\r\nn, d = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nfor first in range(n-2):\r\n last = bsearch(d+l[first], l, 0, n-1)\r\n if last - first < 2 or first >= last:\r\n continue\r\n if l[last] - l[first] > d:\r\n last -= 1\r\n x = last-first-1\r\n ans += (x*(1+x))//2\r\n\r\nprint(ans)\r\n", "n,d = list(map(int,input().split()))\r\nlist1 = list(map(int,input().split()))\r\nl = len(list1)\r\ni,j,ans=0,0,0\r\nwhile(i<n):\r\n while (list1[i]-list1[j]<=d)==False:\r\n j+=1\r\n ans += (i-j)*(i-j-1)/2\r\n i+=1\r\nprint(int(ans))\r\n ", "def solve(): \r\n n,d = map(int,input().split())\r\n arr = [int(x) for x in input().split()]\r\n arr.sort()\r\n if arr[n-1]-arr[0]<=d:\r\n print(int(((n-1)*(n-2)*n)/6))\r\n else:\r\n i=0\r\n j=0\r\n ans = 0\r\n while(j<n):\r\n while(i<n and arr[i]-arr[j]<=d):i+=1\r\n i-=1\r\n cnt=i-j\r\n ans+= cnt*(cnt-1)//2\r\n j+=1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__' :\r\n t = 1\r\n# t= int(input())\r\n while(t>0):\r\n solve() \r\n t-=1", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nc=0\r\nr=0\r\nfor i in range(n):\r\n c=max(c,i+1)\r\n while(c<n and abs(x[c]-x[i])<=d):\r\n c+=1\r\n c-=1\r\n r+=((c-i)*(c-i-1))//2\r\nprint(r)", "#Tardes de coding. Problem C: Points On Line\ndef main():\n\t(n,d) = (int(inp) for inp in input().split())\n\tcoords = [int(coord) for coord in input().split()]\n\tgroups_points = 0\n\tfor i in range(0, n-2):\n\t\tfind = coords[i] + d\n\t\tindex = binary_search(find,coords,i,n-1)\n\t\t#number of numbers that there are between index and i\n\t\taux = index - i\n\t\tgroups_points += aux*(aux-1)//2\n\tprint(groups_points)\n\treturn groups_points\n\n#we return the index of num or of the first num that is less than num\ndef binary_search(num, coords,start,end):\n\tif end <= start :\n\t\tif num == coords[start]:\n\t\t\treturn start\n\t\telse: \n\t\t\tindex = start\n\t\t\twhile coords[index] > num:\n\t\t\t\tindex-=1\n\t\t\treturn index\n\telse:\n\t\tmiddle = (end+start)//2\n\t\tif coords[middle] == num:\n\t\t\treturn middle\n\t\telif coords[middle] > num:\n\t\t\treturn binary_search(num, coords, start, middle-1)\n\t\telse:\n\t\t\treturn binary_search(num,coords,middle+1, end)\n\nif __name__ == \"__main__\":\n\tmain()\n\t \t \t \t\t\t\t \t \t\t\t\t \t \t\t\t\t\t", "n,d = map(int,input().split())\na = list(map(int,input().split()))\nres = 0\nleft = 0\nfor right in range(n):\n while a[right]-a[left] > d:\n left+=1\n x = right-left\n res += int(x*(x-1)/2)\nprint(res)\n\n\n", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nj, v = 0, 0\r\nfor i in range(n - 2):\r\n while j < n - 1 and x[j + 1] - x[i] <= d:\r\n j += 1\r\n v += (j - i) * (j - i - 1) // 2\r\nprint(v)", "import math\r\nimport io\r\n\r\nnancy,chim=map(int,input().split())\r\nalpha=list(map(int,input().split()))\r\nnano,zen=0,0\r\nfor i in range(nancy):\r\n while alpha[i]>chim+alpha[zen] and zen<nancy:\r\n zen+=1\r\n p=i-zen-1\r\n nano+=(p+1)*p//2\r\nprint(nano)", "n, d = map(int, input().split())\r\na = sorted([int(x) for x in input().split()])\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n while j + 1 < n and a[j + 1] - a[i] <= d:\r\n j += 1\r\n cnt = j - i - 1\r\n ans += cnt * (cnt + 1) // 2\r\nprint(ans)", "def uppper_bound(arr, x):\r\n l = 0\r\n r = len(arr) - 1\r\n while(l <= r):\r\n m = (l+r)//2\r\n if arr[m] <= x:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n return l\r\n\r\nn,d = map(int, input().split())\r\n \r\nx_list = input().split()\r\nx_list = [int(item) for item in x_list]\r\n \r\n\r\nsum = 0\r\n \r\n# for i in range(n-2):\r\n# count = 0\r\n# for j in range(i+2,n):\r\n \r\n# if x_list[j] - x_list[i] <= d:\r\n# count += 1\r\n \r\n# else:\r\n# break\r\n \r\n# sum += 0.5*count*(count+1)\r\n\r\nfor i in range(n):\r\n search = x_list[i] + d\r\n pos = uppper_bound(x_list, search) - 1\r\n sum += (pos - i) * (pos - i -1) * 0.5\r\n \r\nprint(int(sum))", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n,d=[int(x) for x in input().split()]\r\n arr=[int(x) for x in input().split()]\r\n res=0\r\n for i in range(n-2):\r\n l=i+1\r\n r=n-1\r\n ans=-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n if arr[mid]<=arr[i]+d:\r\n ans=mid\r\n l=mid+1\r\n else:\r\n r=mid-1\r\n if ans!=-1:\r\n curr=ans-i-1\r\n res+=((curr*(curr+1))//2)\r\n print(res)", "def count_groups_of_three(n, d, points):\r\n count = 0\r\n j = 2\r\n \r\n for i in range(n - 2):\r\n while j < n and points[j] - points[i] <= d:\r\n count += (j - i - 1) * (j - i) // 2\r\n j += 1\r\n \r\n return count\r\n\r\n# Read input\r\nn, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\n\r\n# Call the function and print the result\r\nresult = count_groups_of_three(n, d, points)\r\nprint(result)\r\n", "def readLine():\r\n return list(map(int,input().split()))\r\n\r\ndef lower_bound(arr,el):\r\n res = -1\r\n lo = 0\r\n hi = len(arr)-1\r\n\r\n while lo<=hi:\r\n mid = (lo + hi)//2\r\n if arr[mid]<=el:\r\n res = mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\n\r\n return res\r\n\r\nn,d = readLine()\r\narr = readLine()\r\n\r\nres= 0\r\n\r\nfor i,x in enumerate(arr):\r\n end = lower_bound(arr,x+d)\r\n k = end - i\r\n res+=(k*(k-1))//2\r\n\r\nprint(res)", "from collections import deque\r\n\r\ndef comb(m):\r\n if m<3:\r\n return 0\r\n else:\r\n return int(m*(m-1)*(m-2)/6)\r\n\r\nn,d = [int(i) for i in input().split()]\r\nx = [int(i) for i in input().split()]\r\ncnt = 0\r\nde = deque()\r\ntemp = 0\r\nfor i in range(n):\r\n if i == 0:\r\n de.append(x[i])\r\n else:\r\n if de[0]+d < x[i]:\r\n cnt += comb(len(de))-comb(temp)\r\n while len(de) != 0 and de[0]+d < x[i]:\r\n de.popleft()\r\n temp = len(de)\r\n de.append(x[i])\r\n #print(de)\r\ncnt += comb(len(de))-comb(temp)\r\nprint(cnt)\r\n", "def bs(arr,key):\r\n n = len(arr)\r\n if key>arr[-1]: return n\r\n l,h = 0,n-1\r\n while l<=h:\r\n m = l+(h-l)//2\r\n if key<arr[m]: h = m-1\r\n elif key>arr[m]: l = m+1\r\n else: return m\r\n return l\r\n\r\n\r\nn,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n-2):\r\n k = bs(l,l[i]+m)\r\n #print(i,k)\r\n if k==n: k-=1\r\n elif l[k]!=l[i]+m: k -= 1\r\n k = k - i\r\n c += k*(k-1)//2\r\n \r\nprint(c)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans=0\r\nj=0\r\n\r\nfor i in range(n):\r\n while l[i]-l[j]>k:\r\n j+=1\r\n total=i-j\r\n ans+=total*(total-1)//2\r\nprint(ans)", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\ng = [0]\r\nh = 0\r\nfor i in range(len(c)-2):\r\n l = i\r\n r = len(c)-1\r\n while r >= l :\r\n m = l+(r-l)//2\r\n k =c[m] - c[i]\r\n if k <= b :\r\n l = m+1\r\n t = m - i - 1\r\n else:\r\n r = m -1\r\n h += t*(t+1)/2\r\nprint(int(h))\r\n", "n_d = list(map(int,input().split()))\r\nn = n_d[0]\r\nd = n_d[1]\r\nnumbers = list(map(int,input().split()))\r\noutput = 0\r\nleft = 0\r\nright = n-1\r\nwhile left!=right:\r\n mid = (left+right)//2\r\n if numbers[mid] - numbers[0] > d:\r\n right = mid\r\n else:\r\n left = mid+1\r\nif numbers[left]-numbers[0] >d:\r\n left -= 1\r\noutput += left*(left-1)/2\r\nfor i in range(1,n-2):\r\n while left<n and numbers[left]-numbers[i]<=d:\r\n left+=1\r\n output += (left-i-1)*(left-i-2)/2\r\nprint(int(output))", "def run():\r\n n, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n j = 0\r\n ans = 0\r\n for i in range(n):\r\n while x[i] - x[j] > d:\r\n j += 1\r\n ans += (i - j) * (i - j - 1) // 2\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n run()\r\n", "n,d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\np = 0\r\nans = 0\r\nfor i in range(n):\r\n p = max(i+2, p)\r\n while p < n and (x[p] - x[i]) <= d:\r\n p += 1\r\n p -= 1\r\n ans += ((p-i-1)**2 + (p-i-1)) // 2\r\n\r\nprint(ans)", "import bisect\r\nn, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ni = 0\r\ntri = 0\r\nfor i in range(n - 2):\r\n tmp = bisect.bisect_right(a, a[i] + d)\r\n tmp = tmp - i - 1\r\n if tmp > 1:\r\n tri += tmp*(tmp-1)//2\r\nprint(tri)", "\r\n\r\n\r\n\r\nn,k = map(int,input().split())\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\nans=0\r\nst=0\r\n\r\nfor en in range(n):\r\n while t[en]-t[st]>k:\r\n st+=1\r\n \r\n total= en-st\r\n\r\n ans+=total*(total-1)//2\r\n\r\n\r\nprint(ans)\r\n\r\n \r\n", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nif n<3:\r\n print(0)\r\nelse:\r\n i=0 \r\n j=2 \r\n count=0\r\n while i<len(arr):\r\n while (j<len(arr) and (arr[j]-arr[i])<=d):\r\n j+=1 \r\n count+=((j-i-1)*(j-i-2))//2 \r\n i+=1 \r\n print(count)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\ni = 0\r\nj = 0\r\nwhile(i < n):\r\n if(i == j):\r\n j += 1\r\n while(j < n-1 and arr[j+1] - arr[i] <= d):\r\n j += 1\r\n if(j < n and arr[j] - arr[i] <= d and j-i+1 >= 3):\r\n ans += (j-i)*(j-i-1)//2\r\n i += 1\r\n\r\nprint(ans)", "import sys\nimport math as mt\nimport bisect\ninput=sys.stdin.buffer.readline \n#t=int(input())\ndef ncr(n):\n c=3\n return (n*(n-1)*(n-2))//6\nt=1\nfor __ in range(t):\n# s=input()\n #n=int(input())\n n,d=map(int,input().split())\n l=list(map(int,input().split()))\n ans=0\n pre=0\n for i in range(n):\n l1=bisect.bisect(l,l[i]+d)\n if (l1-i)>=3:\n ans+=ncr(l1-i)\n if pre-i>=3:\n ans-=ncr(pre-i)\n pre=l1\n print(ans) \n \t\t \t\t\t \t\t \t \t\t \t \t\t \t \t\t\t\t\t", "'''def dist(i,ar,d):\n\tk=0\n\tfor j in ar[i+1:]:\n\t\tif j-ar[i]<=d:\n\t\t\tk+=1\t\t\t#TLE\n\t\telse:\n\t\t\tbreak\n\treturn k*(k-1)//2'''\ndef main():\n\tn,d=map(int,input().split())\n\tar=sorted(list(map(int, input().split())))\n\tans=0\n\tl=0\n\tr=1\n\tk=0\n\twhile r<n:\n\t\tif ar[r]- ar[l]<=d:\n\t\t\tr+=1\n\t\t\tk+=1\n\t\t\tans+=k*(k-1)//2\n\t\telse:\n\t\t\tl+=1\n\t\t\tk-=1\n\t\t\n\t'''for i in range(n):\n\t\tans+=dist(i,ar,d)'''\n\tprint(ans)\n\t\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "from collections import deque\r\nd=deque()\r\nn,l=input().split()\r\nn=int(n)\r\nl=int(l)\r\ns4=input().split()\r\nfor i in range(len(s4)):\r\n s4[i]=int(s4[i])\r\ns4.append(0)\r\nsuma=0\r\nj=0\r\ni=0\r\nx=0\r\nfor i in range(n-2):\r\n while (j<n and s4[j]-s4[i]<=l):\r\n d.append(s4[j])\r\n j+=1\r\n x+=(len(d)-1)*(len(d)-2)/2\r\n d.popleft()\r\nprint(int(x))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n# 1 2 3 6 7\r\nans=0\r\ni=0\r\nfor j in range(n):\r\n \r\n while l[j]-l[i]>m:\r\n i+=1\r\n if l[j]-l[i]<=m:\r\n ans+=((j-i)*(j-i-1))//2\r\n\r\nprint(ans)\r\n ", "e = input()\r\nn, d = e.split()\r\nn, d = int(n), int(d)\r\ne = input()\r\na = [int(x) for x in e.split()]\r\nif n < 3:\r\n print(0)\r\nelse:\r\n i = 0\r\n j = 2\r\n c = 0\r\n while j<len(a):\r\n if a[j] - a[i] <= d:\r\n n = j - i - 1\r\n c += (n * (n + 1)) / 2\r\n j += 1\r\n else:\r\n i += 1\r\n print(int(c))\r\n", "def binarysearch(n, seq):\r\n\tlow = 0\r\n\thigh = len(seq)-1\r\n\t# print(n)\r\n\twhile low < high:\r\n\t\tmid = (high+low+1)//2\r\n\t\t# print(low, high, mid, n)\r\n\r\n\t\tif seq[mid] > n:\r\n\t\t\thigh = mid - 1\r\n\t\telse:\r\n\t\t\tlow = mid\r\n\r\n\treturn low\r\n\r\nif __name__ == '__main__':\r\n\tn, d = map(int, input().split())\r\n\tseq = [int(x) for x in input().split()]\r\n\r\n\tans = 0\r\n\tfor idx, i in enumerate(seq):\r\n\t\tidx2 = binarysearch(i+d, seq)\r\n\r\n\t\tnum_in_bw = idx2 - idx\r\n\t\tans += (num_in_bw*(num_in_bw-1)) // 2\r\n\t\t# print(ans,idx2)\r\n\tprint(ans)\r\n\t", "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 Points_on_Line2():\r\n import math \r\n\r\n n,d = invr()\r\n sequence = inlt()\r\n\r\n if n == 1 or n == 2:\r\n print(0)\r\n else:\r\n left_index_count = {}\r\n left_index = 0 \r\n right_index = 2 \r\n\r\n while right_index <= (n-1) and (sequence[right_index] - sequence[left_index] <= d):\r\n right_index += 1\r\n\r\n right_index -= 1\r\n\r\n if (right_index - left_index - 1) == 0:\r\n left_index_count[left_index] = 0\r\n else:\r\n flexible_points = right_index - left_index\r\n left_index_count[left_index] = math.comb(flexible_points,2)\r\n \r\n for left_index in range(1,n-2):\r\n\r\n while right_index <= (n-1) and sequence[right_index] -sequence[left_index] <= d :\r\n right_index += 1\r\n \r\n right_index -= 1\r\n\r\n if right_index - left_index - 1 == 0:\r\n left_index_count[left_index] = 0 \r\n else:\r\n flexible_points = right_index - left_index\r\n left_index_count[left_index] = math.comb(flexible_points,2)\r\n \r\n\r\n total_points = 0\r\n for left_index in left_index_count.keys():\r\n total_points += left_index_count[left_index]\r\n print(total_points)\r\n\r\n return \r\n\r\n\r\nPoints_on_Line2()", "n,d = map(int,input().split())\r\n\r\narr = tuple(map(int,input().split()))\r\n\r\ndef getMax(i):\r\n lo = i;hi=n-1\r\n while(lo<=hi):\r\n mid = (lo+hi)//2\r\n dist = arr[mid]-arr[i]\r\n if(mid == n-1):\r\n if(dist<=d):\r\n return mid\r\n break\r\n nextDist = arr[mid+1]-arr[i]\r\n if(dist <= d and nextDist > d):\r\n return mid\r\n elif(dist < d):\r\n lo = mid+1\r\n elif(dist>d):\r\n hi = mid-1\r\n\r\ncount = 0\r\nfor i in range(n):\r\n choices = getMax(i)-i\r\n count += (choices)*(choices-1)//2\r\n\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\na = [int(k) for k in input().split()]\r\nkolvo = 0\r\nr = 0\r\nl = 0\r\nans = 0\r\nwhile r < n:\r\n while a[r] - a[l] > d:\r\n l += 1\r\n kolvo = r - l\r\n ans += (kolvo * (kolvo - 1)) // 2\r\n r += 1\r\nprint(ans)\r\n\r\n", "import os,io\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\nn,d = list(map(int,input().split()))\nx = list(map(int,input().split()))\nx.append(x[-1]+d+1)\ns,i,j=0,0,0\nwhile i<n-1:\n while x[j]-x[i]<=d:\n j+=1\n s += (j-i-1)*(j-i-2)//2\n i+=1\nprint(s)", "def main():\n from collections import Counter\n n, d = map(int, input().split())\n l, cnt, j = list(map(int, input().split())), Counter(), 0\n for i, hi in enumerate(l):\n hi -= d\n while l[j] < hi:\n j += 1\n cnt[i - j] += 1\n print(sum(k * (k - 1) * v for k, v in cnt.items()) // 2)\n\n\nif __name__ == '__main__':\n main()\n", "from bisect import bisect_right\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndsum = i = 0\r\nfor i in range(n):\r\n count = bisect_right(a, a[i] + k) - i\r\n if count < 3: continue\r\n dsum += (count - 1) * (count - 2) // 2\r\nprint(dsum)\r\n", "def solve(n,d,ar):\n ans = 0\n\n for i in range(n-1,1,-1):\n rightmost = i\n p = i-2\n\n if ar[rightmost]-ar[p] > d: continue\n\n else:\n l = 0\n r = p\n while l <= r:\n mid = (l+r)//2\n\n if ar[rightmost] - ar[mid] > d:\n l = mid+1\n else:\n r = mid -1\n \n if ar[rightmost] - ar[mid] > d:\n k = mid + 1\n else:\n k = mid\n\n\n ans += (rightmost-k)*(rightmost-k-1) // 2\n\n\n\n\n\n\n print(ans)\n\n\n\n\n\n\nif __name__ == '__main__':\n n,d = map(int, input().split())\n ar = list(map(int, input().split()))\n solve(n,d,ar)", "def nc3(cnt):\r\n if n<2:\r\n return 0 \r\n return n*(n-1)//2 \r\nn,d=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfrom collections import Counter \r\nfrom bisect import bisect_right as br \r\nc=Counter(l)\r\nans=0 \r\nfor i in range(n):\r\n cnt=0 \r\n ind=br(l,l[i]+d)\r\n # print(cnt)\r\n cnt=ind-i-1 \r\n ans+=max(0,cnt*(cnt-1)//2)\r\nprint(ans)", "n,s=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\ni=n-1\r\nans=0\r\nfor j in range(n-1,-1,-1):\r\n while nums[j]-nums[i]<=s and i>=0:\r\n i=i-1\r\n gap=j-i-1\r\n ans=ans+(gap*(gap-1))//2\r\nprint(ans)", "n, batas = [int(item) for item in input().split()]\r\narr = [int(item) for item in input().split()]\r\nx = 0\r\na = 0\r\nfor i in range(n):\r\n while arr[i] - arr[a] > batas:\r\n a += 1\r\n x += ((i - a) * (i - a - 1)) // 2\r\nprint(x)\r\n", "import sys\r\nfrom bisect import bisect_left\r\ninput=sys.stdin.readline\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(2,n):\r\n start=i-3+1\r\n l=a[i]-d\r\n p=bisect_left(a,l)\r\n req=start-p+1\r\n res+=(req*(req+1)//2)\r\nprint(res)", "def solve(n: int, d: int, x: list[int]):\r\n ans = 0\r\n p = 0\r\n for i in range(2, n):\r\n while x[i]-x[p] > d:\r\n p += 1\r\n ans += int(((i-p)*(i-p-1))/2)\r\n return ans\r\n\r\n\r\ndef main():\r\n n, d = [int(_) for _ in input().strip().split(' ')]\r\n x = [int(_) for _ in input().strip().split(' ')]\r\n print(solve(n, d, x))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from bisect import *\r\ndef summation(x):\r\n return ((x*(x+1))//2)\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-2):\r\n right=bisect_left(a,a[i]+k+1)\r\n ans+=summation(right-i-2)\r\nprint(ans)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nans = 0\r\ni = 0\r\nfor j in range(2, n):\r\n while x[j] - x[i] > d:\r\n i += 1\r\n k = j - i\r\n if k >= 2:\r\n comb = k * (k - 1) // 2\r\n ans += comb\r\n\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\n\r\ncount = 0\r\nleft = 0\r\ngroups = 0\r\n\r\nfor right in range(n):\r\n while points[right] - points[left] > d:\r\n left += 1\r\n groups = right - left\r\n count += groups * (groups - 1) // 2\r\n\r\nprint(count)\r\n", "def p(a,b):\r\n o=-1\r\n l,h=0,len(a)-1\r\n while l<=h:\r\n mid=l+(h-l)//2\r\n if a[mid]<=b:\r\n o=mid\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n return o\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ndef sum(n):\r\n n-=1\r\n if n%2==0:\r\n return n//2*(n+1)\r\n else:\r\n f=n\r\n n-=1\r\n return (n//2*(n+1))+f\r\nre=0\r\nfor i in range(a-2):\r\n d=p(c,c[i]+b)\r\n re+=sum(d-i)\r\nprint(re)", "\r\nn,s=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\ni=0\r\nans=0\r\nfor j in range(n):\r\n while i<n and nums[i]-nums[j]<=s :\r\n i=i+1\r\n gap=i-j-1\r\n # print(i,j,gap)\r\n ans=ans+(gap*(gap-1))//2\r\nprint(ans)", "import math\r\n\r\n\r\ndef main_function():\r\n n, d = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n current_end = 0\r\n for i in range(n):\r\n for j in range(current_end, n):\r\n if a[j] - a[i] == d:\r\n z = max(0, j - i - 1)\r\n counter += (z * (z + 1)) // 2\r\n current_end = j\r\n #print(counter, \"1\")\r\n break\r\n elif a[j] - a[i] > d:\r\n z = max(0, j - i - 2)\r\n counter += (z * (z + 1)) // 2\r\n current_end = j - 1\r\n #print(counter, \"2\")\r\n break\r\n elif j == n - 1:\r\n current_end = n - 1\r\n z = max(0, j - i - 1)\r\n counter += (z * (z + 1)) // 2\r\n #print(counter, \"3\")\r\n break\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "# Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two farthest of them doesn't exceed d.\n\n# Note that the order of the points inside the group of three chosen points doesn't matter.\n\n# Input\n# The first line contains two integers: n and d (1 ≤ n ≤ 105; 1 ≤ d ≤ 109). The next line contains n integers x1, x2, ..., xn, their absolute value doesn't exceed 109 — the x-coordinates of the points that Petya has got.\n\n# It is guaranteed that the coordinates of the points in the input strictly increase.\n\n# Output\n# Print a single integer — the number of groups of three points, where the distance between two farthest points doesn't exceed d.\n\n# Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.\n\n# Examples\n# inputCopy\n# 4 3\n# 1 2 3 4\n# outputCopy\n# 4\n# inputCopy\n# 4 2\n# -3 -2 -1 0\n# outputCopy\n# 2\n# inputCopy\n# 5 19\n# 1 10 20 30 50\n# outputCopy\n# 1\n# Note\n# In the first sample any group of three points meets our conditions.\n\n# In the seconds sample only 2 groups of three points meet our conditions: {-3, -2, -1} and {-2, -1, 0}.\n\n# In the third sample only one group does: {1, 10, 20}.\n\n# ***************Solution Approach*****************\n\n# Let's select the rightmost point of our triplet. In order to do this we can iterate over all points in ascending order of their X-coordinate. At the same time we'll maintain a pointer to the leftmost point which lays on the distance not greater than d from the current rightmost point. We can easily find out the number of points in the segment between two pointers, excluding the rightmost point. Let's call this number k. Then there exist exactly k * (k - 1) / 2 triplets of points with the fixed rightmost point. The only thing left is to sum up these values for all rightmost points.\n\nn, k = map(int, input().split())\nlist1 = [int(x) for x in input().split()]\n\nflag = False\nif n<3:\n print(0)\nelse:\n list1.sort()\n i =0\n j = 2\n total = 0\n while j<len(list1):\n while i<=j and list1[j]- list1[i]>k:\n i+=1\n choices = j-i\n total+=((choices)*(choices-1))//2\n j+=1\n print(total)", "from heapq import heappush,heappop,_heapify_max,heapify\r\nimport operator as op\r\nimport sys\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nfrom collections import defaultdict, deque\r\nfrom functools import reduce\r\nfrom math import ceil, factorial, gcd, sqrt,log2,log\r\n\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\nmod=int(1e9)+7\r\n\r\n\r\ndef ncr(n,r):\r\n\tr=min(n,n-r)\r\n\tnmtr = reduce(op.mul,range(n,n-r,-1),1)\r\n\tdnmtr = reduce(op.mul,range(1,r+1),1)\r\n\treturn nmtr//dnmtr\r\n\r\n\r\ndef fact(n):\r\n\treturn factorial(n)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef myyy__answer():\r\n\tn,k=map(int,input().split())\r\n\ta=list(map(int,input().split()))\r\n\tans=0\r\n\r\n\tfor i in range(n):\r\n\t\tind = b_r(a,a[i]+k)-1\r\n\t\tif(ind-i>=2):\r\n\t\t\tind-=i\r\n\t\t\tind-=1\r\n\t\t\t# print(ind)\r\n\t\t\tans+=(ind*(ind+1))//2\r\n\t\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\n\t\t\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\t\t\t\r\n\r\n\t\t\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\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\t\t\t\r\n\t\t\r\n\r\n\t\r\n\r\n\t\r\n\t\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tinput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\").strip()\r\n\r\n\t# for _ in range(int(input())):\r\n\t\t# print(myyy__answer())\r\n\tmyyy__answer()\r\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\ndef bs(l,n,d):\r\n\ts = 0\r\n\te = n-1\r\n\twhile s<=e:\r\n\t\tmid = (s+e)//2\r\n\t\tif l[mid]<=d:\r\n\t\t\ts = mid+1\r\n\t\t\tind = mid\r\n\t\telse:\r\n\t\t\te = mid-1\r\n\treturn ind\r\n\r\nn,d = mp()\r\nl = sorted(mp())\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tj = bs(l,n,l[i]+d)\r\n\tcount = j-i\r\n\tif count < 2:\r\n\t\tpass\r\n\telse:\r\n\t\tans += (count*(count-1))//2\r\nprint(ans)\r\n\r\n\r\n", "n, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\n\r\ncount = 0\r\nleft = 0\r\n\r\nfor i in range(n):\r\n while points[i] - points[left] > d:\r\n left += 1\r\n count += (i - left) * (i - left - 1) // 2\r\n\r\nprint(count)", "n, d = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\n\r\na, b = 0, 1\r\ndone = 0\r\n\r\n\r\ndef comb(n, r):\r\n ret = 1\r\n for i in range(n - r + 1, n + 1):\r\n ret *= i\r\n den = 1\r\n while r > 0:\r\n den *= r\r\n r -= 1\r\n return int(ret/den)\r\n\r\ndef output(a, b, done):\r\n ret = 0\r\n\r\n if a < done < b:\r\n first = done - a\r\n second = b - done\r\n ret = comb(first, 2) * comb(second, 1) + comb(first, 1) * comb(second, 2) + comb(second, 3)\r\n elif b > done:\r\n check = b - a\r\n ret = comb(check, 3)\r\n #print(a, b, done, ret)\r\n return ret\r\n\r\n\r\nans = 0\r\n\r\nwhile b < n:\r\n if x[b] - x[a] > d:\r\n ans += output(a, b, done)\r\n done = b\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nans += output(a, b, done)\r\nprint(ans)\r\n\r\n", "def binpoisk(a, index, d):\r\n l, r = -1, index-1\r\n x = a[index]\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if x - a[m] <= d:\r\n r = m\r\n else:\r\n l = m\r\n return r\r\ndef main():\r\n n, d = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(2, n):\r\n l = binpoisk(a, i, d)\r\n if l != i - 1:\r\n ans += ((i - l) * (i - l - 1)) // 2\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, d = input().split()\nn = int(n); d = int(d)\n\na = [int(i) for i in input().split()]\n\ndef find_index(a, l, val):\n\n\tif a[l] - val > d:\n\t\treturn -1\n\tr = len(a) - 1\n\twhile l <= r:\n\t\tmid = (l+r)//2\n\t\tif a[mid] - val > d:\n\t\t\tr = mid-1\n\t\telif a[mid] - val < d:\n\t\t\tl = mid+1\n\t\telse:\n\t\t\treturn mid\n\n\treturn r\n\ni = 0; j = 2\ncount = 0\nwhile i < n-2:\n\tpos = find_index(a, j, a[i])\n\tif pos != -1:\n\t\tpos = (pos-i-1) \n\tcount += (pos*(pos+1))//2\n\ti += 1; j += 1\n\nprint(count)", "n, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nl, r = 0, 0\r\nc = 0\r\nwhile l != n:\r\n if r == n or a[r] - a[l] > d:\r\n x = r - l - 2\r\n c += (x * (x + 1)) >> 1\r\n l += 1\r\n else:\r\n r += 1\r\nprint(c)", "I = lambda: list(map(int, input().split()))\r\n\r\nn, d = I()\r\nx = I()\r\nl, r, ans = 0, 0, 0\r\nwhile r < n and x[r] - x[l] <= d:\r\n r += 1\r\nans += (r - l) * (r - l - 1) * (r - l - 2) // 6\r\nwhile r < n:\r\n while l < r and x[r] - x[l] > d:\r\n l += 1\r\n ans += (r - l) * (r - l - 1) // 2\r\n r += 1\r\nprint(ans)\r\n", "from bisect import bisect_left\r\n\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n ans = 0\r\n for r in range(n - 1, -1, -1):\r\n l = bisect_left(a, a[r] - d)\r\n k = r - l + 1 - 1\r\n ans += k * (k - 1) // 2\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nres = 0\r\n\r\nfor i in range(n - 2):\r\n l, r = i + 1, n - 1\r\n store = None\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if arr[mid] - arr[i] <= d:\r\n store = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\n if store:\r\n k = store - i - 1\r\n res += max(0, int((k + 1) * k / 2))\r\n\r\nprint(res)", "from bisect import bisect_left as bl\r\n\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n\r\n ans = 0\r\n for i, e in enumerate(x):\r\n end = bl(x, e + d)\r\n if end == len(x):\r\n end -= 1\r\n\r\n if e + d < x[end]:\r\n end -= 1\r\n\r\n span = end - i\r\n if span >= 2:\r\n ans += span * (span - 1) // 2\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import bisect\r\nn,d=map(int,input().split())\r\narr=list(map(int,input().split()));ans=0;i=0;j=0\r\nwhile i<n:\r\n j=bisect.bisect(arr,arr[i]+d,i,n)\r\n f=j-i-1\r\n ans+=max(0,(f*(f-1))//2)\r\n i+=1\r\nprint(ans)\r\n\r\n", "from sys import stdin\r\na,b=map(int,stdin.readline().split())\r\nz=list(map(int,stdin.readline().split()));i,j=0,0;ans=0\r\nr=lambda x:(x*(x+1))//2\r\nwhile i<a:\r\n while j<a and abs(z[j]-z[i])<=b:j+=1\r\n ans+=r(j-i-2)\r\n i+=1\r\nprint(ans)", "\r\ndef add(n,m):\r\n return n*(n+1)//2 - m*(m+1)//2\r\n\r\n\r\ndef binsearch(arr, key):\r\n low,high = 0,len(arr)-1\r\n ans = -1\r\n while low <= high:\r\n md = low + (high-low)//2\r\n if arr[md] >= key:\r\n ans = md\r\n high = md-1\r\n else :\r\n low = md + 1\r\n return ans\r\n\r\nn, d=map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = n*(n-1)*(n-2)//6\r\nfor i in range(n):\r\n k = binsearch(arr, arr[i]+d+1)\r\n \r\n if k == -1:\r\n continue\r\n else:\r\n if k == i+1:\r\n k = i+2\r\n el = add(n-i-2,k-i-2)\r\n \r\n ans -= el\r\n \r\nprint(ans)", "from bisect import bisect_right\r\n\r\n\r\nnum_points, max_distance = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\nsolution = 0\r\nfor pos_point_min, point_min in enumerate(points):\r\n point_max = point_min + max_distance\r\n pos_point_max = bisect_right(points, point_max) - 1\r\n num_middle_points = pos_point_max - pos_point_min\r\n if num_middle_points > 0:\r\n solution += num_middle_points * (num_middle_points-1) // 2\r\nprint(solution)\r\n", "import heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\ncs = list(R())\r\nr, res = 0, 0\r\nfor l in range(n):\r\n r = bisect_right(cs, cs[l] + k)\r\n res += (r - l - 1) * (r - l - 2) // 2 if r - l > 2 else 0\r\nprint(res)", "n,d = map(int, input().split())\r\na = input().split()\r\na = [int(el) for el in a]\r\n\r\nl = 0\r\ncnt = 0\r\nfor r in range(n):\r\n while l<n and (a[r] - a[l] > d):\r\n l += 1\r\n pointes_on_segment_cnt = r - l\r\n cnt += pointes_on_segment_cnt*(pointes_on_segment_cnt-1)//2\r\nprint(cnt)", "try:\r\n def comb(n):\r\n return n * (n-1) // 2\r\n\r\n N, d = list(map(int, input().split()))\r\n nums = list(map(int, input().split()))\r\n l = 0\r\n ans = 0\r\n\r\n for r in range(2, N):\r\n while nums[r] - nums[l] > d:\r\n l += 1\r\n ans += comb(r-l)\r\n \r\n # ans += \r\n\r\n print(ans)\r\n\r\nexcept Exception as e:\r\n print(e)", "from bisect import bisect_left\r\n\r\n\r\nn, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n idxr = bisect_left(a, a[i]+d)\r\n idxl = bisect_left(a, a[i]+1)\r\n if idxr < n and a[idxr] == a[i]+d:\r\n pass\r\n else:\r\n idxr -= 1\r\n\r\n if idxl == n:\r\n idxl -= 1\r\n # print(i, idxl, idxr, \"O\")\r\n first = max(0, idxl-i-1)\r\n terms = max(0, idxr-idxl+1)\r\n # print(first, terms, terms*(2*first+terms-1)//2)\r\n cnt += terms*(2*first+terms-1)//2\r\n\r\nprint(cnt)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\ndef c(x:int):\r\n return 0 if x<2 else (x*(x-1)//2)\r\n\r\nans = 0\r\nj = 1\r\n\r\nfor i in range(0,n):\r\n j = max(i+1,j)\r\n while(j<n and a[j]-a[i]<=d):\r\n j+=1;\r\n \r\n ans += c(j-i-1)\r\n\r\nprint(ans)", "# maa chudaaye duniya\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nleft = 0\r\nright = 0\r\nans = 0\r\nwhile right < n:\r\n while arr[right] - arr[left] > k:\r\n left += 1\r\n m = right - left\r\n ans += m*(m-1) // 2\r\n right += 1\r\nprint(ans)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 18/06/2023 11:12:52 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom bisect import bisect_right\r\n\r\nn, k = map(int, input().split())\r\na = [*map(int, input().split())]\r\n\r\nans = 0\r\nfor i in range(n - 2):\r\n p = bisect_right(a, a[i] + k) - i - 1\r\n ans += p * (p-1) // 2\r\n\r\nprint(ans)", "from bisect import bisect_right as br\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-2):\r\n j=br(a,a[i]+d)\r\n k=j-i\r\n ans+=(k-1)*(k-2)//2\r\nprint(ans)", "n, d = [int(x) for x in input().split()]\r\npoints = [int(x) for x in input().split()]\r\n\r\n\r\ndef bin_search(arr, l, r, val, d):\r\n dif = d + val\r\n while(l <= r):\r\n if l == r and arr[l] <= dif:\r\n return l\r\n mid = l + (r-l)//2\r\n # print(mid)\r\n if arr[mid] <= dif and arr[mid+1] > dif:\r\n return mid\r\n elif arr[mid] > dif:\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n\r\n return -1\r\n\r\n\r\nk = []\r\nfor i in range(n-2):\r\n l = i\r\n r = bin_search(points, l+2, n-1, points[l], d)\r\n if(r == -1):\r\n x = 0\r\n else:\r\n x = r - l - 1\r\n\r\n k.append(x*(x+1)//2)\r\nprint(sum(k))\r\n# print(k)\r\n", "def com(n):\r\n return n*(n-1)//2\r\n\r\n\r\nn,d=list(map(int,input().split()))\r\nx=(n+1)*[0]\r\nx[1:n]=list(map(int,input().split()))\r\nnCount=0;k=1\r\nfor i in range (3,n+1):\r\n while k<i-1:\r\n if x[i]-x[k]<=d:\r\n nCount+=com(i-k)\r\n #print(k)\r\n break\r\n else:\r\n k+=1\r\n\r\n\r\nprint(nCount)", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nj = 0\r\ns = 0\r\nfor i in range(2, n):\r\n while l[i] - l[j] > d:\r\n j += 1\r\n k = i-j\r\n s += k*(k-1)//2\r\nprint(s)", "N, D = map(int, input().strip().split())\r\nA = list(map(int, input().strip().split()))\r\nA.sort()\r\n\r\nans = 0\r\nN = len(A)\r\nj = 0\r\nfor i in range(N):\r\n while j < N and A[j] - A[i] <= D:\r\n j += 1\r\n dist = j - i - 1\r\n # print('!', dist, dist * (dist - 1) >> 1)\r\n ans += dist * (dist - 1) >> 1\r\n\r\nprint(ans)", "m1,m2=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nc=c1=c2=0\r\nwhile c1<m1-1:\r\n c1+=1\r\n while k[c1]-k[c2]>m2:\r\n c2+=1\r\n c+=((c1-c2)*((c1-c2)-1))//2\r\nprint(c)", "n, d = map(int, input().split())\r\na = tuple(map(int, input().split()))\r\ni = 0\r\ns = 0\r\nfor j in range(n):\r\n while a[j] - a[i] > d:\r\n i += 1\r\n s += (j - i - 1) * (j - i) // 2\r\nprint(s)", "if __name__ == \"__main__\":\r\n n, d = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n num_ways = 0\r\n j = 0\r\n for i in range(n):\r\n while j < n and a[j] - a[i] <= d:\r\n j += 1\r\n num = j - i # we have num elements from i to j-1\r\n num_ways += (num - 1) * (num - 2) // 2\r\n print(num_ways)", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans = 0\r\nl = 0\r\n\r\nfor i in range(n):\r\n while arr[i]-arr[l]>d:\r\n l+=1\r\n k=i-l\r\n ans+=k*(k-1)//2\r\nprint(ans)\r\n", "from sys import stdin\r\na,b=map(int,stdin.readline().split());a+=1\r\nz=[1]+list(map(int,stdin.readline().split()));i,j=1,1;ans=0\r\nr=lambda x:(x*(x+1))//2\r\nwhile i<a:\r\n if j<=i:j=i\r\n while j<a and abs(z[j]-z[i])<=b:j+=1\r\n if j-i-1>=2:ans+=r(j-i-2)\r\n i+=1\r\nprint(ans)", "n, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\n\r\ncount = 0 \r\nj = 0 \r\n\r\nfor i in range(n):\r\n while j + 1 < n and points[j + 1] - points[i] <= d:\r\n j += 1\r\n k = j - i \r\n count += k * (k - 1) // 2 \r\n\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nans = 0\r\nj = 0\r\nfor i in range(n):\r\n while j < n and x[j] - x[i] <= d:\r\n j += 1\r\n k = j - i - 1\r\n if k >= 2:\r\n ans += k * (k - 1) // 2\r\n\r\nprint(ans)\r\n", "n,d=list(map(int,input().split()))\narray=list(map(int,input().split()))\nstart=0\nend=0\nans=0\n\nwhile end<n:\n\twhile array[end]-array[start]>d:\n\t\tstart+=1\n\tk=end-start\n\tans+=k*(k-1)//2\n\tend+=1\nprint(ans)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nN,d = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nif N<3:\r\n exit(print(0))\r\n \r\nans = 0\r\nl = 0\r\nfor i in range(2,N):\r\n while A[i]>A[l]+d:\r\n l+=1\r\n t = i-l\r\n if t>=2:\r\n ans+= t*(t-1)//2\r\n \r\nprint(ans)\r\n\r\n", "from bisect import bisect_right\r\nn,d=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\ncnt=0\r\nfor i in range(n-2):\r\n x=bisect_right(a,a[i]+d)\r\n if(x-i>2):\r\n x=x-i-2\r\n cnt+=x*(x+1)//2\r\nprint(cnt)", "n, m = map(int, input().split())\nar = sorted(map(int, input().split()))\nres, b, e = 0, 0, 0\nwhile e < n-1:\n e += 1\n while ar[e] - ar[b] > m:\n b += 1\n res += ((e-b) * (e-b-1)) >> 1\nprint(res)\n", "import bisect\r\n\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(n-2):\r\n j = bisect.bisect_right(x, x[i] + d)\r\n count += (j-i-1)*(j-i-2)//2\r\n\r\nprint(count)\r\n\r\n", "def solve():\n n, d = input().split()\n n = int(n)\n d = int(d)\n array = list(map(int, input().split()))\n l = ans = 0\n i = 2\n while i < n:\n while array[i] - array[l] > d:\n l += 1\n ans += (i-l)*(i-l-1) / 2\n i += 1\n return int(ans)\n\nprint(solve())\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndef bs(ele,left,right):\r\n best=1\r\n while(left<=right):\r\n mid=left+(right-left)//2\r\n if(abs(ele-mid)<2):\r\n left+=1\r\n elif(abs(a[ele]-a[mid])<=d):\r\n best=mid\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n return best\r\ncnt=0\r\nfor i in range(n-2):\r\n c=bs(i,i,n-1)-i\r\n if(c>=2):\r\n cnt+=c*(c-1)//2\r\nprint(cnt)", "n, d = map(int, input().split())\r\nd += 1\r\nt = list(map(int, input().split())) + [1000000001 + d]\r\ns, j = 0, 2\r\nfor i in range(n - 2):\r\n while t[j] - t[i] < d: j += 1\r\n k = j - i - 1\r\n if k > 1: s += k *(k - 1)\r\nprint(s // 2)", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\narr = list(map(int, input().rstrip().split()))\r\nanswer = 0\r\nlocation = 0\r\nfor i in range(2,n):\r\n while arr[i]-arr[location]>k:\r\n location+=1 \r\n answer += ((i-location) * ( i -location- 1))/2\r\nprint(int(answer))", "iarr = list(map(int,input().split()))\nn = iarr[0]\nd = iarr[1]\narr = list(map(int,input().split()))\narr.sort()\nans = 0\nfor i in range(n-2):\n\tcurr = arr[i]\n\tl = i+1\n\tr = n-1\n\twhile (l<=r):\n\t\tmid = (l+r)//2\n\t\tif arr[mid]>curr+d:\n\t\t\tr = mid-1\n\t\telse:\n\t\t\tl = mid+1\n\tl-=1\n\tif l>i:\n\t\tcount = l-i\n\t\tans+=(count*(count-1))//2\nprint(ans)", "for _ in range(1):\r\n n, k = [int(i) for i in input().split()]\r\n arr = [int(i) for i in input().split()]\r\n p = q = 0\r\n\r\n ans = 0\r\n while p < n and q < n:\r\n while q+1 < n and arr[q+1] - arr[p] <= k:\r\n q = q+1\r\n m = q-p\r\n if m >= 2:\r\n ans += (m*(m-1))//2\r\n p = p+1\r\n\r\n print(ans)", "#double underscore makes a class variable or a class method private\r\nmod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nfrom bisect import *\r\nn, d = f()\r\nl = il()\r\nc=0\r\nfor i in range(n):\r\n x = bisect_right(l, l[i]+d)\r\n c += max(0, ((x-i-2)*(x-i-1))//2)\r\nprint(c)", "import math\r\nn,d = map(int , input().split())\r\na = list(map(int , input().split()))\r\n\r\nj=2\r\nans = 0\r\nfor i in range(n):\r\n while j<n and a[j] - a[i] <= d:\r\n j+=1\r\n if j-i>1:\r\n ans+=((j-i-1)*(j-i-2))//2\r\nprint(ans)", "n,d=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\np1=0\r\np2=0\r\nans=0\r\nwhile(p1<n):\r\n k=0\r\n while(p2<n and a[p2]-a[p1]<=d):\r\n p2+=1\r\n k=p2-p1-1\r\n ans+=k*(k-1)//2\r\n p1+=1\r\nprint(ans)\r\n", "n,d=map(int, input().split())\r\n\r\na=list(map(int, input().split()))\r\n\r\nif n<3:\r\n print (0)\r\nelse:\r\n i=0\r\n j=n-1\r\n\r\n count=0\r\n\r\n while i<n-2:\r\n\r\n while (a[j]-a[i]>d) and j-1>=i:\r\n j=j-1\r\n\r\n count=count+((j-i-1)*(j-i))//2\r\n\r\n i=i+1\r\n\r\n while (a[j]-a[i]<=d) and j+1<n:\r\n j=j+1\r\n\r\n print (count)\r\n\r\n ", "[n,d]=[int(i) for i in input().split()];\nx=[int(i) for i in input().split()];\ns=0;\nif(n>2):\n j=2;\n for i in range(0,n-2):\n while((j<n) and (x[j]-x[i]<=d)):\n j=j+1\n s=s+(j-i-1)*(j-i-2)//2;\n print(s);\nelse:\n print(0);\n", "import bisect\r\nx,y=map(int, input('').split())\r\nar=list(map(int, input('').split()))\r\nct=0\r\nfor i in range(x):\r\n z=ar[i]+y\r\n ind=bisect.bisect_right(ar,z)-1\r\n ct=ct+((ind-i)*(ind-i-1))/2\r\nprint(int(ct))\r\n\r\n", "import random, math\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\n\n# To Genrate Random Number for Test-Cases\ndef randomNumber(s, e):\n\treturn random.randint(s, e)\n\n# To Generate Random Array for Test-Cases\ndef randomArray(s, e, s_size, e_size):\n\tsize = random.randint(s_size, e_size)\n\tarr = [randomNumber(s, e) for i in range(size)]\n\treturn arr\n\n# To Generate Question Specific Test-Cases\ndef testcase():\n\tpass\n\n# Brute Force Approach to check Solution\ndef brute():\n\tpass\n\n# Efficient Approach for problem\ndef effe():\n\tpass\n\n\n# Function to call the actual solution\ndef solution(li, b):\n\tif len(li) < 3:\n\t\treturn 0\n\tli.sort()\n\ti = 0\n\tj = 2\n\ttot = 0\n\twhile j < len(li):\n\t\twhile i <= j and li[j] - li[i] > b:\n\t\t\ti += 1\n\t\tchoices = j - i\n\t\ttot += ((choices) * (choices - 1))//2\n\t\tj += 1 \n\treturn tot\n\n# Function to take input\ndef input_test():\n\t# for _ in range(int(input())):\n\t# n = int(input())\n\ta, b = map(int, input().strip().split(\" \"))\n\t# a, b, c = map(int, input().strip().split(\" \"))\n\tli = list(map(int, input().strip().split(\" \")))\n\tout = solution(li, b)\n\tprint(out)\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nret = 0\r\nfor i, val in enumerate(a):\r\n left, right = i - 1, n\r\n while left + 1 < right:\r\n mid = (left + right) >> 1\r\n if a[mid] - val > d:\r\n right = mid\r\n else:\r\n left = mid\r\n if left != i - 1:\r\n size = left - i - 1\r\n ret += size * (size + 1) // 2\r\nprint(ret)", "import sys\r\n\r\ninput = [int(x) for x in sys.stdin.buffer.read().split()]\r\nn = input[0]\r\nd = input[1]\r\nl = input[2:]\r\nii = 0\r\nans = 0\r\nfor i in range(len(l)):\r\n while l[i] - l[ii] > d:\r\n ii += 1\r\n ans += (i - ii) * (i - ii - 1) / 2\r\nprint(int(ans))\r\n", "import math\r\nfrom sys import stdin\r\n\r\n\r\ndef binary_search(data, val):\r\n test = len(data)\r\n if val >= data[-1]:\r\n return [test-1, test-1]\r\n elif val<= data[0]:\r\n return [0,0]\r\n high_index = len(data)-1\r\n low_index = 0\r\n while high_index > low_index:\r\n index = (high_index + low_index) // 2\r\n sub = data[index]\r\n if data[low_index] == val:\r\n return [low_index, low_index]\r\n elif sub == val:\r\n return [index, index]\r\n elif data[high_index] == val:\r\n return [high_index, high_index]\r\n elif sub > val:\r\n if high_index == index:\r\n return sorted([high_index, low_index])\r\n high_index = index\r\n else:\r\n if low_index == index:\r\n return sorted([high_index, low_index])\r\n low_index = index\r\n return sorted([high_index, low_index])\r\n\r\n\r\nn, m = map(int, input().split(\" \"))\r\nl = list(map(int, stdin.readline().rstrip().split(\" \")))\r\n\r\nans = 0\r\nfor i in range(n):\r\n x = binary_search(l, l[i]+m)\r\n c = x[0]-i\r\n if c >1:\r\n ans+= (c*(c-1)//2)\r\nprint(ans)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=n-2\r\nj=n-1\r\nans=0\r\nwhile(j>=0):\r\n if i>=0 and l[j]-l[i]<=d:\r\n i-=1\r\n else:\r\n k=j-i-1\r\n ans+=(k*(k-1))//2 \r\n j-=1\r\nprint(ans) ", "d = int(input().split()[1])\r\nL = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(len(L)):\r\n l = i - 1\r\n r = len(L)\r\n while r - l > 1:\r\n e = (l + r) // 2\r\n if L[e] <= L[i] + d:\r\n l = e\r\n else:\r\n r = e\r\n if l - i > 1:\r\n c += (l - i) * (l - i - 1) // 2\r\nprint(c)\r\n", "from bisect import bisect_right\nn, d = map(int, input().split())\nA = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n j = bisect_right(A, A[i] + d) - 1\n ans += (j - i) * (j - i - 1) // 2\nprint(ans)", "n,d=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nans=0\r\nj=0\r\nfor i in range(0,n-1):\r\n j=max(j,i+1)\r\n while j <n and l1[j]-l1[i] <=d:\r\n j+=1\r\n j-=1\r\n ans+= ( (j-i)*((j-i-1)) )//2\r\nprint(ans)", "#from math import factorial\r\n[n, d] = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\n\r\ni = l = 0\r\np = r = 2\r\n\r\nwhile l < (n -2) and r < n:\r\n x = nums[l]\r\n r = max(p, l+2)\r\n while r < n:\r\n #print('l', l, 'r',r, 'nums[l]', x, 'nums[r]', nums[r],'i',i)\r\n if nums[r] - x > d:\r\n p = r \r\n break\r\n i += (r - l - 1)*(r-l)/2\r\n r += 1\r\n \r\n \r\n \r\n l += 1\r\n \r\nprint(int(i))\r\n", "from collections import Counter,defaultdict,deque\r\n#import heapq as hq\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\nimport math\r\nimport sys\r\n\r\ninput=sys.stdin.readline\r\nn,d = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nwindow = deque()\r\nres = 0\r\nfor el in arr:\r\n window.append(el)\r\n while len(window)>=1 and (window[-1]-window[0])>d:\r\n window.popleft()\r\n #print(window)\r\n l = len(window)\r\n res+=(l-2)*(l-1)//2\r\nprint(res)\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nimport math\r\n\r\nai = lambda: list(map(int, stdin.readline().split()))\r\nei = lambda: map(int, stdin.readline().split())\r\nip = lambda: int(stdin.readline().strip())\r\n\r\nn,k = ei()\r\nli = ai()\r\nans = 0\r\nj=0\r\nfor i in range(2,n):\r\n\twhile(li[i]-li[j]) > k : \r\n\t\tj += 1\r\n\tx = i-j\r\n\tans += x*(x-1)//2\r\nprint(ans)", "import bisect as bs\n\ndef main():\n n, d = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n res = 0\n a.append(a[len(a) - 1]+1)\n for i in range(n):\n lwb = bs.bisect_right(a, a[i] + d, lo = i, hi = n)\n amount = lwb - i\n if (amount >= 3):\n res += ((amount-1) * (amount -2)) // 2\n print(res)\n\nif __name__ == '__main__':\n main()", "a,b=input().split()\r\nn=int(a)\r\nd=int(b)\r\n\r\n_point=[int(i) for i in input().split()]\r\n\r\nk=0\r\nS=0\r\nfor i in range(2,n):\r\n while _point[i]-_point[k]>d:\r\n k+=1\r\n Nu=i-k\r\n S+=Nu*(Nu-1)//2\r\nprint(S)\r\n", "n, d = map(int, input().split())\r\ncoordinates = list(map(int, input().split()))\r\n\r\ncount = 0\r\nleft_pointer = 0\r\n\r\nfor i in range(n):\r\n while coordinates[i] > d + coordinates[left_pointer] and left_pointer < n:\r\n left_pointer += 1\r\n distance_between_points = i - left_pointer - 1\r\n count += (distance_between_points + 1) * distance_between_points // 2\r\n\r\nprint(count)# 1698407577.8672788", "n, d = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\n\r\namounts = [1]\r\nfor num in range(2, 10**5):\r\n amounts.append(amounts[-1] + num)\r\n\r\n# print(amounts[:100])\r\n\r\nnum_of_options = 0\r\nind = 0\r\nind2 = 0\r\nwhile ind2 < n:\r\n # print(num_of_options)\r\n if abs(x[ind] - x[ind2]) <= d:\r\n if ind2 - ind >= 2:\r\n num_of_options += amounts[ind2 - ind - 2]\r\n ind2 += 1\r\n else:\r\n while abs(x[ind] - x[ind2]) > d:\r\n ind += 1\r\n\r\nprint(num_of_options)\r\n", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-2):\r\n\tl=i+2\r\n\tr=n-1\r\n\tkey=arr[i]+d\r\n\tans=-1\r\n\twhile(l<=r):\r\n\t\tmid=l+(r-l)//2\r\n\t\tif(arr[mid]>key):\r\n\t\t\tr=mid-1\r\n\t\telif(arr[mid]<key):\r\n\t\t\tans=mid\r\n\t\t\tl=mid+1\r\n\t\telse:\r\n\t\t\tans=mid\r\n\t\t\tbreak\r\n\tif(ans!=-1):\r\n\t\tk=ans-i\r\n\t\tc+=k*(k-1)//2\r\nprint(c)", "\r\n\r\ndef pro(arr,d):\r\n ans=0\r\n i=0\r\n j=0\r\n while(j<len(arr)):\r\n if(arr[j]-arr[i]<=d):\r\n #print(arr[i],arr[j])\r\n if(j-i>=2):\r\n k=j-i\r\n ans+= (k*(k-1)) //2\r\n j+=1\r\n else:\r\n i+=1\r\n print(ans)\r\n\r\nn,k=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\npro(arr,k)", "n,d=input().split(' ')\r\nn=int(n)\r\nd=int(d)\r\nqueue=[int(i) for i in input().split()]\r\nans=0\r\ndef find_max(begin,start,end):\r\n while start < end:\r\n mid=(start+end)//2\r\n if queue[mid]-queue[begin]<=d:\r\n start=mid+1\r\n else:\r\n end=mid\r\n mid=(start+end)//2\r\n if queue[mid]-queue[begin]>d:\r\n mid-=1\r\n return mid\r\nfor i in range(n-2):\r\n if i==0:\r\n j=find_max(i,i+2,n-1)\r\n else:\r\n j=find_max(i,j,n-1)\r\n if j-i<2:\r\n continue\r\n else:\r\n ans+=(j-i)*(j-i-1)//2\r\nprint(ans)", "import bisect\r\n\r\ndef solve(n, d):\r\n l = list(map(int, input().split()))\r\n count = 0\r\n for i in range(n):\r\n e = bisect.bisect_right(l, l[i]+d)\r\n if e-i-1 >= 2:\r\n count += (e-i-2)*(e-i-1)//2\r\n print(count)\r\n\r\n\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n solve(n, d)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))+[1e10]\r\na=i=j=0\r\nwhile i<n-1:\r\n while l[j]-l[i]<=d:j+=1\r\n a+=(j-i-1)*(j-i-2)//2\r\n i+=1\r\nprint(a)", "n, d = [int(i) for i in input().split()]\r\n\r\nx = [int(i) for i in input().split()]\r\nres = 0\r\n\r\nif n > 2:\r\n\r\n r = 2\r\n for i in range(n-2):\r\n \r\n flag = False\r\n while r < n :\r\n if x[r] - x[i] <= d:\r\n r+=1\r\n else:\r\n res += ((r-i-1)*(r-i-2))//2\r\n flag = True\r\n break\r\n \r\n if not flag:\r\n res += ((r-i-1)*(r-i-2))//2\r\n\r\n\r\nprint(res)\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn, d = map(int, input().split())\na = list(map(int, input().split()))\ntriangle = lambda n: n*(n+1)//2\nres = 0\nl, r = 0, 1\none_less = n-1\n\nwhile l < n and r < n:\n while r < one_less and a[r+1] - a[l] <= d:\n r += 1\n \n if l < r:\n #print(l, r, res)\n res += triangle(r-l-1)\n l += 1\nprint(res)\n", "import sys\r\nimport string\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nfrom collections import Counter\r\nfrom functools import lru_cache\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef main():\r\n _, d = mi(line())\r\n arr = lmi(line())\r\n\r\n begin = 0\r\n ans = 0\r\n for e, n in enumerate(arr):\r\n while n - arr[begin] > d:\r\n begin += 1\r\n\r\n # If n is the largest element of the pairs,\r\n # then what is the best we can do?\r\n elems = e - begin + 1\r\n if elems < 3:\r\n continue\r\n else:\r\n ans += (elems - 1) * (elems - 2) // 2\r\n print(ans)\r\nmain()\r\n", "n, d = list(map(int,input().split()))\r\npoints = list(map(int,input().split()))\r\ndl = [0]\r\nfor i in range(1, n):\r\n dl.append((points[i] - points[i - 1]) + dl[i - 1])\r\ncount = 0\r\nfor i in range(n - 2):\r\n x = dl[i]\r\n l = i + 1\r\n r = n\r\n while l + 1 != r:\r\n mid = (l + r) // 2\r\n if dl[mid] - dl[i] <= d:\r\n l = mid\r\n else:\r\n r = mid\r\n y = r - 1 - i\r\n if y > 1:\r\n count += int(y / 2 * (y - 1))\r\nprint(count)", "def main():\n num, choose = list(map(int, str(input()).split(\" \")))\n array = list(map(int, str(input()).split(\" \")))\n res, j = 0, 0\n\n for index, element in enumerate(array):\n while element - array[j] > choose:\n j += 1\n res += int(((index - j) * (index - j - 1)) / 2)\n\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n\n\t\t\t\t \t\t \t \t\t\t \t\t \t \t \t\t\t", "n, d = map(int, input().split())\nx = list(map(int, input().split()))\nk = 0\nj = 1\nfor i in range(n):\n\twhile (j < n and x[j] - x[i] <= d):\n\t\tj += 1\n\tk += ((max(0, j - i - 2) * (max(0, j - i - 2) + 1))) // 2\nprint(k)\n\n\t\t\t\t \t\t\t\t\t\t \t\t\t\t\t \t\t\t \t\t", "from bisect import *\r\n\r\nn,d = map(int,input().split())\r\nar = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(n):\r\n\tj = bisect_left(ar,ar[i]-d)\r\n\tN = i-j\r\n\ts += N*(N-1)//2\r\nprint(s)\r\n\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "n, d = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nl=0\r\nh=n-1\r\nkey=0\r\nc=0\r\nif n>=3:\r\n for i in range(n-2):\r\n l=i\r\n h=n-1\r\n key=0\r\n while l<=h:\r\n mid=(h+l)//2\r\n if b[mid]-b[i] <=d:\r\n l=mid+1\r\n key=mid\r\n else:\r\n h=mid-1\r\n if key >= i+2:\r\n key=key-i\r\n c+=(((key-1))*(key))//2\r\n\r\n\r\n\r\n print(c)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#Anuneet Anand\r\n \r\n \r\ndef BS(X,z,l,h):\r\n\tif l==h:\r\n\t\treturn h\r\n\telse:\r\n\t\tm = (l+h)//2\r\n\t\tif z<X[m]:\r\n\t\t\treturn BS(X,z,l,m)\r\n\t\telse:\r\n\t\t\treturn BS(X,z,m+1,h)\r\n \r\nn,d = map(int,input().split())\r\nX = list(map(int,input().split()))\r\n \r\ni = 0\r\nj = 2\r\nc = 0\r\n \r\nwhile i<n-2:\r\n\ta = X[i]+d\r\n\tj = BS(X,a,i+2,n)-1\r\n\tif a>X[n-1]:\r\n\t\tj = n-1\r\n\tk = j - i - 1\r\n\tc = c + k*(k+1)//2\r\n\ti = i + 1\r\n \r\nprint(c)\r\n", "from collections import deque\r\nn,d=[int(i) for i in input().split()]\r\nx=[int(i) for i in input().split()]\r\nans=0\r\nD=deque()\r\nfor i in range(n):\r\n D.append(x[i])\r\n if D[-1]-D[0]<=d and len(D)>=3:\r\n ans+=(len(D)-1)*(len(D)-2)//2\r\n while D[-1]-D[0]>d:\r\n D.popleft()\r\n if D[-1]-D[0]<=d:\r\n ans+=(len(D)-1)*(len(D)-2)//2\r\n #print('i',i)\r\n #print('D',D)\r\n #print('ans',ans)\r\nprint(ans)\r\n", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\ntotal = 0\nleft = 0\nfor right in range(2, n):\n\twhile arr[left]+d < arr[right]:\n\t\tleft += 1\n\tx = right-left-1\n\ttotal += (x+1)*x//2\nprint(total)\n", "[n, d] = [int(x) for x in input().split(' ')]\r\narr = [int(x) for x in input().split(' ')]\r\n\r\nres = 0\r\nfor i in range(n):\r\n\t\tle = i+2\r\n\t\tri = n\r\n\t\twhile(le < ri):\r\n\t\t\tmid = int(le + (ri - le)/2)\r\n\t\t\tif arr[mid] - arr[i] <= d:\r\n\t\t\t\tle = mid+1\r\n\t\t\telse:\r\n\t\t\t\tri = mid\r\n\t\tres += int(((le-i-1)*(le-i-2))/2)\r\nprint(res)", "n, d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n \r\ni, j, res = 0,0,0\r\n \r\nwhile i < n:\r\n\twhile arr[i] - arr[j] > d:\r\n\t\tj += 1\r\n\tk = i-j\r\n\tres += k * (k-1)//2\r\n\ti += 1\r\nprint(res)", "import bisect\r\n\r\nn, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n j = bisect.bisect_left(a, a[i] + d)\r\n if j == n:\r\n j -= 1\r\n while a[j] > a[i] + d:\r\n j -= 1\r\n k = j - i\r\n ans += k * (k - 1) // 2\r\nprint(ans)\r\n", "\r\ndef foo(x):\r\n\treturn (x*(x-1)//2)\r\n\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))+[1e10]\r\n\r\nj=0\r\nc=0\r\nfor i in range(2,n):\r\n\twhile l[i]-l[j]>d:\r\n\t\tj+=1\r\n\tk=i-j\r\n\tc=c+foo(k)\r\n\r\n\t\r\n\r\nprint(c)\r\n\r\n", "from collections import deque\r\nn, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ndeq, res = deque(), 0\r\nfor c in lst:\r\n while len(deq) > 0 and deq[0] < c - d:\r\n deq.popleft() \r\n lenDeq = len(deq)\r\n if lenDeq > 1:\r\n res += lenDeq * (lenDeq - 1) // 2\r\n deq.append(c)\r\nprint(res)", "n, d = list(map(int, input().split()))\r\nxs = list(map(int, input().split()))\r\nxs.sort()\r\n\r\ni = 0\r\nj = 1\r\nans = 0\r\nfor i in range(n):\r\n while j < len(xs) and xs[j] - xs[i] <= d:\r\n j += 1\r\n if xs[j - 1] - xs[i] <= d and j - i >= 3:\r\n ans += (j - i - 1) * (j - i - 2) // 2\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ncount = 0\r\nj = 0\r\n\r\nfor i in range(n):\r\n while j < n - 1 and arr[j + 1] - arr[i] <= d:\r\n j += 1\r\n\r\n num_points = j - i\r\n if num_points >= 2:\r\n count += (num_points * (num_points - 1)) // 2\r\n\r\nprint(count)\r\n", "from math import *\r\nfrom bisect import *\r\nn, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i, j in enumerate(l):\r\n x = bisect_right(l, j+d)\r\n val = (x-i-1)\r\n ans += comb(val, 2)\r\nprint(ans)\r\n", "[n , d ] = list(map(lambda x : int(x) , input().split()))\r\n\r\narr = list(map(lambda x : int(x) , input().split()))\r\n\r\n\r\ndef bs(arr,l,r,target):\r\n \r\n while(l<=r):\r\n mid = l + (r-l)//2\r\n if(arr[mid] <= target):\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n \r\n return r\r\n \r\n\r\n \r\nans = 0\r\n\r\nfor i in range(n):\r\n target = arr[i] + d\r\n max_r = bs(arr,i,n-1,target)\r\n m = max_r - i\r\n if(m +1 >= 3):\r\n ans += (m*(m-1)//2)\r\n \r\nprint(ans)", "#https://codeforces.com/problemset/problem/251/A\nn,d=map(int,input().split())\narr=list(map(int,input().split()))\ncount=0\nfor i in range(n-2):\n\tl=i+2\n\tr=n-1\n\twhile l<=r:\n\t\tmid=l+(r-l)//2\n\t\tif arr[mid]-arr[i] ==d:\n\t\t\tr=mid\n\t\t\tbreak\n\t\tif arr[mid]-arr[i] > d:\n\t\t\tr=mid-1\n\t\telse:\n\t\t\tl=mid+1\n\t#print(i,r)\n\tt=r-i\n\tt=(t*(t-1))//2\n\tcount+=t\nprint(count)\n", "n, d = list(map(int, input().split()))\r\nmas = list(map(int, input().split()))\r\ni = 0\r\nj = 2\r\nc = 2\r\ncount = 0\r\nif n == 1 or n == 2:\r\n print(0)\r\nelse:\r\n while i != n:\r\n while j != n and abs(mas[j] - mas[i]) <= d:\r\n j += 1\r\n len1 = j - i\r\n count += (len1-1)*(len1-2)//2\r\n i += 1\r\n print(count)", "import operator as op\r\nfrom functools import reduce\r\nimport bisect\r\n\r\ndef ncr(n, r):\r\n if n < r:\r\n return 0\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom\r\n\r\ndef main():\r\n n,d = map(int,input().split())\r\n coords = list(map(int,input().split()))\r\n ans = 0\r\n prev_j = 0\r\n\r\n for i in range(n):\r\n curr = coords[i]+d\r\n j = bisect.bisect(coords,curr)-1\r\n #print(i,j)\r\n if i == 0:\r\n ans += ncr(j-i+1,3)\r\n else:\r\n ans += ncr(prev_j-i+1,2)*(j-prev_j)\r\n ans += ncr(j-prev_j,2)*(prev_j-i+1)\r\n ans += ncr(j-prev_j,3)\r\n prev_j = j\r\n\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "n, d = map(int, input().split())\n\nx = list(map(int, input().split()))\n\n\nans = 0\n\n\nj = 0\n\nfor i in range(n):\n while j < n and abs(x[i] - x[j]) <= d:\n j += 1\n \n ans += (j-1-i) * (j-i-2) // 2\n\nprint(ans) ", "from bisect import bisect_right\nn, d = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\ns = 0\nfor i in range(n - 2):\n j = bisect_right(a, a[i] + d) - i - 1\n s += j * (j - 1) // 2\nprint(s)", "n, d = map(int, input().split())\r\nL = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n l = i - 1\r\n r = n\r\n while r - l > 1:\r\n e = (l + r) // 2\r\n if L[e] <= L[i] + d:\r\n l = e\r\n else:\r\n r = e\r\n if l - i > 1:\r\n c += (l - i) * (l - i - 1) // 2\r\nprint(c)\r\n", "def bin_search_right(array: list, target):\r\n l = -1\r\n r = len(array)\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if array[mid]<=target:\r\n l = mid\r\n else:\r\n r = mid\r\n return r\r\n \r\ndef bin_search_left(array: list, target):\r\n l = -1\r\n r = len(array)\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if array[mid]<target:\r\n l = mid\r\n else:\r\n r = mid\r\n return r\r\n\r\ndef comb(n):\r\n val = n-1\r\n return val*(val-1)/2\r\n \r\n\r\nn,d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nansw = 0\r\n\r\nfor i in range(0,n-2):\r\n target = a[i]+d\r\n id = bin_search_right(a,target)\r\n if id-i>2:\r\n answ+=comb(id-i)\r\nprint(int(answ))", "\r\n\r\nfrom collections import defaultdict\r\nimport math\r\nimport sys \r\nfrom bisect import bisect_right\r\n\r\ndef clc():\r\n n,d = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n arr = sorted(arr)\r\n ans= 0\r\n for i in range(0,len(arr)):\r\n curr = arr[i]\r\n back = curr-d-1\r\n ind = bisect_right(arr,back)\r\n contri = ((i-ind)*(i-ind-1))//2\r\n ans+=contri \r\n \r\n print(ans)\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(-1)\r\n ", "n,d=map(int,input().split())\na=list(map(int,input().split()))\ns,x=0,0\nfor i in range(n):\n\twhile a[i]>d+a[x] and x<n:\n\t\tx+=1\n\tm=i-x-1\n\ts+=(m+1)*m//2\nprint(s)\n \t\t\t\t\t \t\t \t\t\t\t\t \t\t\t", "n,d=map(int,input().split())\r\nL=list(map(int,input().split()))\r\n\r\nj=0\r\nans=0\r\nfor i in range(n):\r\n while(j<n and L[i]+d>=L[j]):\r\n j+=1\r\n x=j-i-2\r\n if(x<=0):\r\n continue\r\n ans+=(x*(x+1))//2\r\nprint(ans)", "def c(a,b):\r\n i=a\r\n ansc=1\r\n while i>a-b:\r\n ansc=ansc*i\r\n i=i-1\r\n i=1\r\n while i<=b:\r\n ansc=ansc/i\r\n i=i+1\r\n if a<b:\r\n ansc=0\r\n return ansc\r\n\r\nn,d=input().split(' ')\r\nn=int(n)\r\nd=int(d)\r\nque=input().split(' ')\r\nl=len(que)\r\ni=0\r\nans=0\r\nwhile i<l:\r\n que[i]=int(que[i])\r\n i=i+1\r\nqbegin=0\r\nqend=2\r\nwhile qend<l:\r\n test=que[qend]-que[qbegin]\r\n while (test>d) and (qbegin<=qend):\r\n qbegin += 1\r\n test=que[qend]-que[qbegin]\r\n if qend-qbegin>1:\r\n ans=ans+c(qend-qbegin+1,3)-c(qend-qbegin,3)\r\n qend=qend+1\r\nprint(int(ans))\r\n", "num, choose = map(int, input().split()) \nlista = list(map(int, input().split()))\n\nans = 0\n\n\n\nj = 0\nfor i in range(0,num):\n while(lista[i] - lista[j] > choose): j+=1\n ans += ((i - j) * (i - j - 1))/2\n\n\nprint(int(ans)) \n\t \t\t\t \t\t\t \t \t \t\t \t \t\t\t", "if __name__ == \"__main__\":\r\n ans = 0\r\n n, x = map(int, input().split(' '))\r\n lst = list(int(x) for x in input().split(' '))\r\n j = 2\r\n for i in range(0, n-2):\r\n b = 0\r\n for k in range(j, n):\r\n if lst[k] - lst[i] > x:\r\n b = k-1\r\n j = k\r\n break\r\n else:\r\n b = k\r\n j = k\r\n z = b-(i+1)\r\n if b != 0:\r\n ans += (z*(z+1))/2\r\n print(int(ans))", "from bisect import bisect_right\n\nn,d = map(int,input().split())\na=list(map(int,input().split()))\nres=0\nfor i in range(n-2):\n j=bisect_right(a,a[i]+d)\n k=j-i\n res+=(k-1)*(k-2)//2\nprint(res)\n\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 0\r\nans = 0\r\nfor i in range(n):\r\n while abs(a[i] - a[l]) > d :\r\n l = l + 1\r\n len = i - l - 1\r\n if len > 0:\r\n ans = ans + len * (len + 1) // 2\r\nprint(ans)", "n, d = [int(k) for k in input().split()]\r\narr = [int(k) for k in input().split()]\r\n\r\nt = 0\r\ni, j = 0, 0\r\n\r\nwhile j < len(arr):\r\n if arr[j] - arr[i] > d:\r\n i += 1\r\n else:\r\n num = j - i\r\n if num >= 2:\r\n t += (num * (num - 1)) // 2\r\n j += 1\r\n\r\n\r\nprint(t)\r\n\r\n\r\n", "n, d = list(map(int, input().split()))\n\npoints = [i for i in map(int, input().split())]\n\n\ndef find_match(p, index):\n right = n - 1\n left = index\n target = p[index] + d\n\n while left <= right:\n middle = (left + right) // 2\n middle_value = p[middle]\n\n if middle_value > target:\n right = middle - 1\n else:\n left = middle + 1\n\n return left\n\n\ndef count_sum_one_to(num):\n return int((num * (num + 1)) / 2)\n\n\nresult = 0\nfor i in range(n - 2):\n matched_index = find_match(points, i) - 1\n if i == matched_index:\n continue\n result += count_sum_one_to(matched_index - i - 1)\nprint(result)\n", "'''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)).readlin'''\r\nimport sys\r\n#n = int(input())\r\n#l1 = list(map(int,input().split()))\r\n#n,x = map(int,input().split())\r\n#s = input()\r\n#mod = 1000000007\r\nimport bisect\r\nans=0\r\nn,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n x= bisect.bisect_right(l,l[i]+d)\r\n\r\n x-=1\r\n if (x-i-1)>=1:\r\n ans+=(((x-i-1)*(x-i))//2)\r\n\r\n #print(x,ans)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "from bisect import bisect\r\n\r\n\r\ndef binarySearch(arr, x):\r\n\tl = 0\r\n\tr = len(arr) - 1\r\n\twhile l <= r:\r\n\r\n\t\tmid = (l + r) // 2\r\n\t\tif arr[mid] == x:\r\n\t\t\treturn mid\r\n\t\telif arr[mid] < x:\r\n\t\t\tl = mid + 1\r\n\t\telse:\r\n\t\t\tr = mid - 1\r\n\treturn r\r\n\r\n\r\nn, d = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n):\r\n\tr = binarySearch(ls, ls[i] + d)\r\n\tk = r - i\r\n\tsm += k * (k - 1) // 2\r\nprint(sm)\r\n", "def PL(arr,n,k):\r\n i=0\r\n j=0\r\n aux=0\r\n for i in range(n):\r\n while(arr[i]-arr[j]>k):\r\n j+=1\r\n aux+= ((i - j) * (i - j - 1))//2\r\n return aux\r\n\r\narr = []\r\nn, k = list(map(int, input().strip().split()))\r\narr = list(map(int, input().strip().split()))\r\nprint(PL(arr, n, k))", "def points_on_line(l,d):\r\n j=0\r\n combination=0\r\n for i in range(len(l)):\r\n while j<len(l) and l[j]<=l[i]+d:\r\n j+=1\r\n nums=j-i-1\r\n combination+=nums*(nums-1)//2\r\n return combination\r\n\r\nn,d=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nprint (points_on_line(l,d))\r\n ", "def findIndex(x,L,R,T):\r\n if x[R]<T:\r\n return R\r\n if x[L]>=T:\r\n return L\r\n while R-L>1: \r\n M=(R+L)//2\r\n if x[M]>=T:\r\n R=M\r\n else:\r\n L=M\r\n return R\r\n \r\n\r\nn,d=[int(i) for i in input().split()]\r\nx=[int(i) for i in input().split()]\r\nans=0\r\nfor R in range(2,n)[::-1]:\r\n L=findIndex(x,0,R,x[R]-d)\r\n ans+=(R-L)*(R-L-1)//2\r\nprint(ans)", "n, d = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nj = 0\r\nrez = 0\r\nfor i in range(2, n):\r\n while s[i] - s[j] > d:\r\n j += 1\r\n k = i - j\r\n rez += k * (k - 1) // 2\r\nprint(rez)", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nways=0\r\nj=1\r\nfor i in range(len(x)-2):\r\n while j<n:\r\n if x[j]-x[i]>d:\r\n break\r\n j+=1\r\n if j-i>=3:\r\n ways+=(j-i-2)*(j-i-1)//2\r\nprint(ways) ", "import sys\r\nimport collections\r\nfrom collections import Counter, deque\r\nimport itertools\r\nimport math\r\nimport timeit\r\nimport random\r\n\r\n#########################\r\n# imgur.com/Pkt7iIf.png #\r\n#########################\r\n\r\ndef sieve(n):\r\n if n < 2: return list()\r\n prime = [True for _ in range(n + 1)]\r\n p = 3\r\n while p * p <= n:\r\n if prime[p]:\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 2\r\n r = [2]\r\n for p in range(3, n + 1, 2):\r\n if prime[p]:\r\n r.append(p)\r\n return r\r\n\r\ndef divs(n, start=1):\r\n divisors = []\r\n for i in range(start, int(math.sqrt(n) + 1)):\r\n if n % i == 0:\r\n if n / i == i:\r\n divisors.append(i)\r\n else:\r\n divisors.extend([i, n // i])\r\n return divisors\r\n\r\ndef divn(n, primes):\r\n divs_number = 1\r\n for i in primes:\r\n if n == 1:\r\n return divs_number\r\n t = 1\r\n while n % i == 0:\r\n t += 1\r\n n //= i\r\n divs_number *= t\r\n\r\ndef flin(d, x, default=-1):\r\n left = right = -1\r\n for i in range(len(d)):\r\n if d[i] == x:\r\n if left == -1: left = i\r\n right = i\r\n if left == -1:\r\n return (default, default)\r\n else:\r\n return (left, right)\r\n\r\ndef ceil(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a * b) // math.gcd(a, b)\r\ndef prr(a, sep=' '): print(sep.join(map(str, a)))\r\ndef dd(): return collections.defaultdict(int)\r\ndef ddl(): return collections.defaultdict(list)\r\n\r\n# input = sys.stdin.readline\r\n\r\n\r\nn, m = mi()\r\nd = li()\r\ni = res = 0\r\nj = i + 2\r\nwhile i + 2 < n:\r\n while j < n and d[j] - d[i] <= m:\r\n j += 1\r\n k = j - i - 2\r\n res += k*(k + 1) // 2\r\n i += 1\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", "def fun(arr,l,h,k):\r\n\tans = 0 \r\n\tt=l \r\n\twhile l<=h:\r\n\t\tm = l+(h-l)//2\r\n\t\tif arr[m]<=k:\r\n\t\t\tans = m \r\n\t\t\tl = m+1\r\n\r\n\t\telse:\r\n\t\t\th =m-1\r\n\treturn ans-t+1\r\n\r\n\r\nn,d = map(int,input().split())\r\n\r\narr = [int(i) for i in input().split()]\r\nans=0\r\nfor i in range(n-2):\r\n\tcnt = max(fun(arr,i+2,n-1,arr[i]+d),0)\r\n\t\r\n\tans+= (cnt*(cnt+1))//2\t\r\nprint(ans)\t", "n,d=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=0\r\nans=0\r\nfor j in range(2,n):\r\n while j-i>=3 and a[j]-a[i]>d:\r\n i+=1\r\n if a[j]-a[i]<=d:\r\n ans+=((j-i-1)*(j-i))//2\r\nprint(ans)", "def main():\r\n n,t = map(int, fin().split())\r\n *arr, = map(int, fin().split())\r\n res = 0\r\n j = 0\r\n for i in range(n):\r\n while j+1<n and arr[j+1]-arr[i]<=t: j += 1\r\n k = j - i\r\n res += (k)*(k-1)//2\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()", "def main():\r\n n, d = map(int, input().split())\r\n X = [int(x) for x in input().split()]\r\n cnt = 0\r\n for i in range(n):\r\n l = i\r\n r = n - 1\r\n j = -1\r\n while(l <= r):\r\n m = l + (r - l) // 2\r\n if X[m] - X[i] <= d:\r\n l = m + 1\r\n j = max(j, m)\r\n else:\r\n r = m - 1 \r\n if j != -1:\r\n cnt += (j - i - 1) * (j - i) // 2\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "I=lambda :map(int,input().split())\r\nn,d=I()\r\narr=list(I())\r\n\r\n\r\nans=0\r\nindex=0\r\nfor i in range(n):\r\n while arr[index]+d <arr[i] and index<n:\r\n index+=1\r\n element=i-index-1\r\n ans+=(element+1)*element//2\r\n\r\nprint(ans)", "n, d = (int(x) for x in input().split())\nx = [int(x) for x in input().split()]\nl = 0\nr = 0\nans = 0\nwhile l < n:\n\twhile r < n and x[r] - x[l] <= d:\n\t\tr += 1\n\tans += (r - l - 1) * (r - l - 2) // 2\n\tl += 1\nprint(ans)\n", "def binary_search(points, left, right, target):\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if points[mid] - points[target] <= d:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return right\r\n\r\nn, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(n - 2):\r\n left = i + 2\r\n right = n - 1\r\n right_most = binary_search(points, left, right, i)\r\n count += (right_most - i) * (right_most - i - 1) // 2\r\n\r\nprint(count)\r\n", "n,d=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n\r\nans=0\r\n\r\n\r\ndef check(s,idx):\r\n if idx>=n:\r\n return 0\r\n\r\n l,r=idx,n-1\r\n while l<=r:\r\n mid=(l+r)>>1\r\n if a[mid]-s>d:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n return l\r\n\r\nfor i in range(n):\r\n s=a[i]\r\n idx=check(s,i+2)\r\n #print(check(s,i+2))\r\n\r\n if idx!=0:\r\n temp=idx-i-2\r\n ans+=(temp*(temp+1))//2\r\n\r\nprint(ans)\r\n", "\r\nimport bisect\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif n<3:\r\n print('0')\r\nelse:\r\n ans=0\r\n for i in range(n):\r\n j = bisect.bisect_right(a,a[i]+d)-1\r\n if (j-i)>1:\r\n ans+=int(((j-i-2)*(j-i-1))/2)+(j-i-1)\r\n print(ans)\r\n\r\n\r\n ", "def bs(l,r,t):\r\n if (l >= r):\r\n return l\r\n else:\r\n mid = (l + r + 1)//2\r\n if (a[mid] <= t):\r\n l = mid\r\n return bs(l,r,t)\r\n else:\r\n r = mid - 1\r\n return bs(l,r,t)\r\n\r\n\r\n\r\n\r\n\r\nn,d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n-2):\r\n no = a[i]\r\n x = bs(i+1, n-1, no+d) - 1 - i\r\n #print(x, \" for \", i)\r\n ans += (x)*(x+1)//2\r\nprint(ans)\r\n\r\n", "def main():\n n, d = [int(x) for x in input().split()]\n pontos = [int(x) for x in input().split()]\n print(solve(n, d, pontos))\n \ndef solve(n, d, pontos):\n posib = 0\n comb_2 = lambda n: (n*(n-1))//2\n for i in range(len(pontos)):\n max_p3 = pontos[i] + d\n i_max_p3 = limite_p3(pontos, max_p3)\n num_elem = (i_max_p3 - i)\n if num_elem < 1:\n continue\n \n posib += comb_2(num_elem)\n return posib\n\ndef limite_p3(pontos, x):\n l_sup = len(pontos) - 1\n l_inf = 0\n pos = []\n while l_inf <= l_sup:\n meio = l_inf + (l_sup - l_inf)//2\n if pontos[meio] > x:\n l_sup = meio - 1\n elif pontos[meio] == x:\n return meio\n else:\n l_inf = meio + 1\n pos.append(meio)\n return max(pos)\n\nmain()\n \t \t\t \t \t \t \t\t\t\t\t\t \t\t \t\t\t\t", "def PL(arr,n,k):\n j=0\n aux=0\n for i in range(len(arr)):\n # se repetira mientras arr[i] menos arr[j]\n # sea mayor que k y si en un inicio es menor no entra\n while(arr[i]-arr[j]>k):\n j+=1\n #print(\"Entro AHORRA \" +str(j))\n aux+= ((i - j) * (i - j - 1))//2\n #print(\"el resultado al momento: \"+str(aux)+ \" y j vale: \"+str(j) +\" y i vale: \"+str(i))\n return aux\n\narr = []\nn, k = list(map(int, input().strip().split()))\narr = list(map(int, input().strip().split()))\nprint(PL(arr, n, k))\n \t \t\t\t\t \t \t\t \t \t \t\t\t\t \t", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, d = [int(x) for x in input().split()]\r\nx = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nl = 0\r\nfor r in range(2, n):\r\n while x[r] - x[l] > d and r - l + 1 > 3:\r\n l += 1\r\n if x[r] - x[l] <= d:\r\n t = r - l\r\n ans += math.comb(t, 2)\r\nprint(ans)" ]

[ "d = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\na, b = map(int, input().split())\r\n \r\nnums = str(list(range(a, b+1)))\r\nr = 0\r\nfor i in range(len(d)):\r\n r += d[i] * nums.count(str(i))\r\nprint(r)", "f=lambda:map(int,input().split())\r\na=[6,2,5,5,4,5,6,3,7,6]\r\nsm=0\r\nx,y=f()\r\ns=str(list(range(x,y+1)))\r\nfor i in range(10):\r\n sm+=s.count(str(i))*a[i]\r\nprint(sm)", "def main():\n v = {\n \"1\" : 2,\n \"2\" : 5,\n \"3\" : 5,\n \"4\" : 4,\n \"5\" : 5,\n \"6\" : 6,\n \"7\" : 3,\n \"8\" : 7,\n \"9\" : 6,\n \"0\" : 6\n }\n a, b = map(int, input().split())\n answer = 0\n\n for i in range(a, b + 1):\n s = str(i)\n\n for e in s:\n answer += v[e]\n\n print(answer)\n\n\n\nif __name__ == \"__main__\":\n main()", "segment = [6,2,5,5,4,5,6,3,7,6]\na,b = map(int,input().split())\nans = 0\nfor i in range(a,b+1):\n for j in str(i):\n ans+=segment[int(j)]\n\nprint(ans)\n", "def f(n):\r\n s=0\r\n while n>9:\r\n s+= mp[n%10]\r\n n//=10\r\n s+=mp[n]\r\n return s\r\n \r\nmp = [6,2,5,5,4,5,6,3,7,6]\r\ns = 0\r\na,b = map(int,input().split())\r\nfor i in range(a,b+1):\r\n s += f(i)\r\nprint(s)", "string_list = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\r\nsegments = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n \r\nreference_dict = dict(zip(string_list, segments))\r\n \r\nnumlist = input().split()\r\nfirst = int(numlist[0])\r\nsecond = int(numlist[1])\r\n \r\ndef segment_find(reference_dict, first, second):\r\n adder = 0\r\n for i in range(first, second + 1):\r\n for n in str(i):\r\n adder += reference_dict[n]\r\n print(adder)\r\n \r\nsegment_find(reference_dict, first, second) ", "from sys import stdin as fin\n\n# fin = open(\"ecr6a.in\", \"r\")\n\nnums = (6, 2, 5, 5, 4, 5, 6, 3, 7, 6)\n\na, b = map(int, fin.readline().split())\n\nresult, last = 0, 0\nfor x in range(a, b + 1):\n dig = x % 10\n if not dig or not last:\n last = 0\n while x:\n x, dig = divmod(x, 10)\n last += nums[dig]\n else:\n last += nums[dig] - nums[dig - 1]\n result += last\n\nprint(result)", "a,b=map(int,input().split())\r\n\r\nsegments=[6,2,5,5,4,5,6,3,7,6]\r\ncount_1_to_1000000=28733372\r\ns=''\r\ncount=0\r\nif b-a+1<(10**6)/2:\r\n\tfor i in range(a,b+1):\r\n\t\ts+=str(i)\r\n\tfor i in range(10):\r\n\t\tcount+=s.count(str(i))*segments[i]\r\nelse:\r\n\tfor i in range(1,a):\r\n\t\ts+=str(i)\r\n\tfor i in range(b+1,10**6+1):\r\n\t\ts+=str(i)\r\n\tfor i in range(10):\r\n\t\tcount+=s.count(str(i))*segments[i]\r\n\tcount=count_1_to_1000000-count\r\nprint(count)", "def main():\r\n a, b = map(int, input().split())\r\n arr = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n ans = 0\r\n for i in range(a, b+1):\r\n x = i\r\n while x != 0:\r\n ans += arr[x%10]\r\n x //= 10\r\n print(ans)\r\n \r\nmain()", "c = input()\n\nd = c.split(' ')\n\na = int(d[0])\n\nb = int(d[1])\n\nsuma = 0\n\nfor j in range(a,b+1):\n k = str(j)\n for i in k:\n if i == '0':\n suma += 6\n elif i == '1':\n suma += 2\n elif i == '2':\n suma += 5\n elif i == '3':\n suma +=5\n elif i == '4':\n suma += 4\n elif i == '5':\n suma +=5\n elif i == '6':\n suma += 6\n elif i == '7':\n suma += 3\n elif i == '8':\n suma += 7\n elif i == '9':\n suma += 6\n\nprint(suma)\n\t \t \t \t\t\t\t \t \t \t\t \t", "def main():\n [a, b] = [int(_) for _ in input().split()]\n calc_dict = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\n count_digits = []\n count_1_to_1000000 = 28733372\n final_count = 0\n\n if b - a + 1 < 500000:\n s = str(list(range(a, b + 1)))\n\n for i in range(10):\n final_count += s.count(str(i)) * calc_dict[i]\n else:\n s = str(list(range(1, a))) + str(list(range(b + 1, 1000001)))\n\n for i in range(10):\n final_count += s.count(str(i)) * calc_dict[i]\n\n final_count = count_1_to_1000000 - final_count\n\n print(final_count)\n\n\nif __name__ == '__main__':\n main()\n", "segments = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\ni, j = map(int, input().split())\r\nnumbers = str(list(range(i, j+1)))\r\nresult = 0\r\nfor k in range(len(segments)):\r\n result += segments[k]*numbers.count(str(k))\r\nprint(result)", "a,b=map(int,input().split())\r\n\r\ni=str(list(range(a,b+1)))\r\nseg={'0': 6, '1': 2, '2': 5, '3': 5, '4': 4, '5': 5, '6': 6, '7': 3, '8': 7, '9': 6}\r\n\r\n\r\n\r\nprint(seg['0']*i.count('0')+seg['1']*i.count('1')+seg['2']*i.count('2')+seg['3']*i.count('3')+seg['4']*i.count('4')+seg['5']*i.count('5')+seg['6']*i.count('6')+seg['7']*i.count('7')+seg['8']*i.count('8')+seg['9']*i.count('9')\r\n)", "m = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\ndp = [-1 for i in range(0, 10**6 + 1)]\r\n\r\n\r\ndef calc(n):\r\n if (n < 10):\r\n return m[n]\r\n if dp[n] != -1:\r\n return dp[n]\r\n ans = m[n % 10] + calc(n//10)\r\n dp[n] = ans\r\n return ans\r\n\r\n\r\na, b = map(int, input().split())\r\nans = sum(map(calc, (i for i in range(a, b+1))))\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\nsum = 0\r\nt = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nfor i in range(a, b+1):\r\n s = str(i)\r\n for j in range(0, len(str(i))):\r\n sum+=t[int(s[j])]\r\nprint(sum)", "# 724A\r\n# θ(1) time\r\n# θ(1) space\r\n\r\n__author__ = 'artyom'\r\n\r\n# SOLUTION\r\n\r\nw = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nws = w.copy()\r\nfor i in range(1, 10):\r\n ws[i] += ws[i - 1]\r\n\r\n\r\ndef calc(n):\r\n r = 1000000\r\n s = 0\r\n while r > 0:\r\n if n // r > 0:\r\n if n // (r * 10) == 0:\r\n z = n // r\r\n if z > 1:\r\n s += (ws[z - 1] - ws[0]) * r\r\n s += w[z] * (1 + n % r)\r\n else:\r\n s += (ws[9] - ws[0]) * r + ws[9] * r * (n // (r * 10) - 1)\r\n z = n % (r * 10) // r\r\n if z > 0:\r\n s += ws[z - 1] * r\r\n s += w[z] * (1 + n % r)\r\n r //= 10\r\n return s\r\n\r\n\r\ndef main():\r\n a, b = read(3)\r\n return calc(b) - calc(a - 1)\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s='\\n'):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s)\r\n\r\n\r\nwrite(main())", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n a, b = map(int, input().split())\n\n act = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\n r = 0\n for i in range(a, b+1):\n r += sum(act[ord(c)-ord('0')] for c in str(i))\n print(r)\n", "a, b = map(int, input().split())\r\n\r\ncnt = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\nres = 0\r\n\r\nfor i in range(a, b + 1):\r\n x = i\r\n while x > 0:\r\n res += cnt[x % 10]\r\n x //= 10\r\n\r\nprint(res)\r\n", "c = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\na, b = map(int, input().split())\r\n\r\nnums = str(list(range(a, b+1)))\r\nt = 0\r\nfor i in range(len(c)):\r\n t += c[i] * nums.count(str(i))\r\nprint(t)", "dt = {0 : 6, 1 : 2, 2 : 5, 3 : 5, 4 : 4, 5 : 5, 6 : 6, 7 : 3, 8 : 7, 9 : 6}\na, b = map(int, input().split())\nprint( sum( sum( dt[ int(ni) ] for ni in str(n) ) for n in range(a, b + 1) ) )\n", "s=[6,2,5,5,4,5,6,3,7,6]\r\na,b=map(int,input().split())\r\nt=''.join(map(str,range(a,b+1)))\r\nprint(sum(s[d]*t.count(str(d))for d in range(10)))", "from itertools import accumulate\n\nD = [6, 2, 5, 5 ,4, 5, 6, 3, 7, 6]\nP = list(accumulate([0] + D))\ns = P[-1]\n\ndef radix_sum(c, k, first):\n return int((c - first)*k*s*10**(k-1) + (P[c]-6 if first else P[c])*10**k)\n\ndef total_sum(k):\n return sum(radix_sum(10, i, True) for i in range(k))\n\ndef prefix_sum(n):\n digits = [int(x) for x in n]\n l = len(digits)\n a = sum(D[digits[i]] * (int(n[i+1:]) + 1) for i in range(l-1)) + D[digits[-1]]\n return a + sum(radix_sum(c, l-1-i, i == 0) for i, c in enumerate(digits)) + total_sum(l-1)\n\na, b = input().split()\nprint(prefix_sum(b) - prefix_sum(str(int(a) - 1)))\n", "w=[6,2,5,5,4,5,6,3,7,6]\r\na,b=map(int,input().split())\r\ns=str(list(range(a,b+1)))\r\nq=0\r\nfor i in range(len(w)):\r\n q+=w[i]*s.count(str(i))\r\nprint(q)\r\n\r\n\r\n", "import io\nimport sys\nimport time\n\nstart = time.clock()\n#~ test = '1 3'\n#~ test = '10 15'\n#~ test = '1 1000000' #28733372\n#~ test = '1 11' #55\n#~ test = '1 21' #130\n\n#~ sys.stdin = io.StringIO(test)\n\na,b = map(int,input().split()) #1 ≤ a ≤ b ≤ 106\n\nm = [6,2,5,5,4,5,6,3,7,6]\n\nsm = sum(m)\n\ndef segs(i):\n s = 0\n for d in map(int,str(i)):\n s += m[d]\n #~ print(\"Segs on %s returns %s\" % (i,s))\n return s\n \ns = 0\n\nif b<a+10:\n for i in range(a,b+1):\n s += segs(i)\n #~ print(\"Up to %s the sum is %s\" % (i,s))\nelse: \n aa = (a//10)*10+10\n bb = (b//10)*10\n #~ print(a,aa,bb,b)\n for i in range(a,aa):\n s += segs(i)\n #~ print(s)\n for i in range(aa//10,bb//10):\n s += segs(i)*10\n #~ print(\"Inc by \",sm)\n s += sm\n #~ print(s)\n for i in range(bb,b+1):\n s += segs(i)\n #~ print(s)\n #~ print(\"End\")\n\nprint(s)\n\ndur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "a, b = list(map(int, input().split()))\r\ns = 0\r\nd = {\r\n \"0\" : 6,\r\n \"1\" : 2,\r\n \"2\" : 5,\r\n \"3\" : 5,\r\n \"4\" : 4,\r\n \"5\" : 5,\r\n \"6\" : 6,\r\n \"7\" : 3,\r\n \"8\" : 7,\r\n \"9\" : 6\r\n}\r\nfor i in range(a, b+1):\r\n ni = str(i)\r\n for l in range(len(ni)):\r\n s += d[ni[l]]\r\nprint(s)\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef query_value(c):\r\n n = ord(c) - ord('0')\r\n if n == 0:\r\n return 6\r\n if n == 1:\r\n return 2\r\n if n == 2:\r\n return 5\r\n if n == 3:\r\n return 5\r\n if n == 4:\r\n return 4\r\n if n == 5:\r\n return 5\r\n if n == 6:\r\n return 6\r\n if n == 7:\r\n return 3\r\n if n == 8:\r\n return 7\r\n if n == 9:\r\n return 6\r\n return -1\r\n\r\ndef solve(n):\r\n ans = 0\r\n for c in str(n):\r\n ans += query_value(c)\r\n return ans\r\n\r\ndef main():\r\n l, r = map(int, input().split())\r\n ans = 0\r\n for i in range(l, r + 1):\r\n ans += solve(i)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "seg = {0: 6, 1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}\r\na, b = map(int, input().split())\r\nprint(sum(sum(map(lambda x: seg[x], map(int, str(i)))) for i in range(a, b + 1)))\r\n", "m=[6,2,5,5,4,5,6,3,7,6]\r\ny=0\r\na,b=map(int,input().split())\r\nfor i in range(a,b+1):\r\n while(i>0):\r\n digit=i%10\r\n \r\n for j in range(10):\r\n if j==digit:\r\n y+=m[j]\r\n i=int(i/10)\r\nprint(y)", "def solve():\r\n li = {\"0\":6, \"1\":2, \"2\":5, \"3\":5, \"4\":4, \"5\":5, \"6\":6, \"7\":3, \"8\":7, \"9\":6}\r\n\r\n a, b = map(int, input().split())\r\n res = 0\r\n b += 1\r\n for i in range(a, b):\r\n s = str(i)\r\n for e in s:\r\n res += li[e]\r\n print(res)\r\n\r\nif __name__==\"__main__\":\r\n solve()", "d = {\r\n \"0\": 6,\r\n \"1\": 2,\r\n \"2\": 5,\r\n \"3\": 5,\r\n \"4\": 4,\r\n \"5\": 5,\r\n \"6\": 6,\r\n \"7\": 3,\r\n \"8\": 7,\r\n \"9\": 6\r\n}\r\n\r\na, b = map(int, input().split())\r\n\r\nresult = 0\r\nfor i in range(b - a + 1):\r\n for ch in f\"{a + i}\":\r\n result += d[ch]\r\n\r\nprint(result)", "a,b = input().split()\r\na,b = int(a),int(b)\r\n\r\n\"\"\"dic = {\r\n\t'0': 6,\r\n\t'1': 2,\r\n\t'2': 5,\r\n\t'3': 5,\r\n\t'4': 4,\r\n\t'5': 5,\r\n\t'6': 6,\r\n\t'7': 3,\r\n\t'8': 7,\r\n\t'9': 6\r\n}\"\"\"\r\n\r\nlst = list(range(a,b+1))\r\ntemp = str(lst)\r\n\r\nzero = temp.count('0')\r\none = temp.count('1')\r\ntwo = temp.count('2')\r\nthree = temp.count('3')\r\nfour = temp.count('4')\r\nfive = temp.count('5')\r\nsix = temp.count('6')\r\nseven = temp.count('7')\r\neight = temp.count('8')\r\nnine = temp.count('9')\r\n\r\n\r\nans = zero*6 + one*2 + two*5 + three*5 + four*4 + five*5 + six*6 + seven*3 + eight*7 + nine*6\r\nprint (ans)\r\n\"\"\"for i in range(a,b+1):\r\n\tfor j in str(i):\r\n\t\tsum += dic[j]\r\n\"\"\"\r\n#print (sum)", "segment = {'0':6,'1':2,'2':5,'3':5,'4':4,'5':5,'6':6,'7':3,'8':7,'9':6}\na,b = map(int,input().split())\nans = 0\ns = str([i for i in range(a,b+1)])\nfor i in s:\n try:\n ans+=segment[i]\n except:\n pass\nprint(ans)\n", "I = lambda: [int(i) for i in input().split()]\r\n\r\na, b = I()\r\nd = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nans = 0\r\n\r\nfor num in range(a, b+1):\r\n for x in str(num):\r\n ans += d[int(x)]\r\n\r\nprint(ans)", "# author: violist\n# created: 30.05.2022 17:26:03\n\nimport sys\ninput = sys.stdin.readline\n\na, b = map(int, input().split())\ncisla = {'0': 6, '1': 2, '2': 5, '3': 5, '4': 4, '5': 5, '6': 6, '7': 3, '8': 7, '9': 6}\nans = 0\nfor i in range(a, b + 1):\n for cis in str(i):\n ans += cisla[cis]\nprint(ans)\n", "a, b = map(int,input().split())\r\nd = [6,2,5,5,4,5,6,3,7,6]\r\npas = 0\r\nfor i in range(a,b+1):\r\n for k in (str(i)):\r\n pas += d[int(k)]\r\nprint(pas)\r\n ", "import sys\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndic={0:6, 1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7:3, 8: 7, 9: 6}\r\na,b=map(int,input().split())\r\nresult=0\r\nfor i in range(a,b+1):\r\n now=i\r\n while now:\r\n result+=dic[now%10]\r\n now//=10\r\nprint(result)\r\n \r\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n a, b = P()\r\n cnt, l = 0, [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n n = str(list(range(a, b + 1)))\r\n \r\n for i in range(10):\r\n cnt += l[i] * n.count(str(i))\r\n print(cnt)", "a, b = map(int, input().split())\r\nv = []\r\nsum = 0\r\nfor i in range(a, b+1):\r\n s = str(i)\r\n for j in range(0, len(s)):\r\n if s[j] == \"0\": sum+=6\r\n if s[j] == \"1\": sum+=2\r\n if s[j] == \"2\": sum+=5\r\n if s[j] == \"3\": sum+=5\r\n if s[j] == \"4\": sum+=4\r\n if s[j] == \"5\": sum+=5\r\n if s[j] == \"6\": sum+=6\r\n if s[j] == \"7\": sum+=3\r\n if s[j] == \"8\": sum+=7\r\n if s[j] == \"9\": sum+=6\r\nprint(sum)", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nm = {\n 0: 6,\n 1: 2,\n 2: 5,\n 3: 5,\n 4: 4,\n 5: 5,\n 6: 6,\n 7: 3,\n 8: 7,\n 9: 6\n}\n\ndef get_segments(a):\n global m\n\n s = 0\n\n while a > 0:\n n = a % 10\n s += m[n]\n a //= 10\n\n return s\n\na, b = [int(i) for i in input().split()]\n\ns = 0\n\nfor i in range(a, b+1):\n s += get_segments(i)\n\nprint(s)\n", "dic={'0':6,'1':2,'2':5,'3':5,'4':4,'5':5,'6':6,'7':3,'8':7,'9':6}\r\nnums=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(nums[0],nums[1]+1):\r\n x=str(i)\r\n for j in range(len(x)):\r\n sum+=dic[x[j]]\r\nprint(sum)\r\n", "a,b = map(int, input().split())\n# calculate count for each digit\n# O((10^6)^2)\ncnt = [0] * 11\nfor i in range(a, b+1):\n while i:\n digit = i % 10\n cnt[digit] += 1\n i = i // 10\nans = 0\nans += cnt[0] * 6\nans += cnt[1] * 2\nans += cnt[2] * 5\nans += cnt[3] * 5\nans += cnt[4] * 4\nans += cnt[5] * 5\nans += cnt[6] * 6\nans += cnt[7] * 3\nans += cnt[8] * 7\nans += cnt[9] * 6\nprint(ans)\n", "\r\ndef solve():\r\n d = {\"0\":6, \"1\":2, \"2\":5, \"3\":5, \"4\":4, \"5\":5, \"6\":6, \"7\":3, \"8\":7, \"9\":6}\r\n a,k = map(int,input().split())\r\n ans = 0\r\n for i in range(a,k+1):\r\n s = str(i)\r\n for e in s:\r\n ans+=d[e]\r\n print(ans) \r\nif __name__ == \"__main__\":\r\n solve()\r\n", "a,b = list(map(int, input().strip().split()))\r\n\r\nd = {'0': 6,'1':2,'2':5,'3':5,'4':4,'5':5,'6':6,'7':3,'8':7,'9':6}\r\n\r\ns = 0\r\n\r\nfor i in range(a, b+1):\r\n k = str(i)\r\n for c in k:\r\n s += d[c]\r\nprint(s)", "def main():\r\n\r\n a, b = map(int, input().split())\r\n\r\n nums = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\n sum_ = 0\r\n for i in range(a, b+1):\r\n s = str(i)\r\n for char in s:\r\n sum_ += nums[int(char)]\r\n\r\n print(sum_)\r\n\r\nmain()", "# E\n\nnum_segments = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\n\na, b = [int(i) for i in input().split()]\n\ncycle = sum(num_segments) # From 0 to 9\n\ndef sum_digits(number):\n if number == \"\" or number == []:\n return 0\n \n summ = 0\n \n for digit in str(number):\n summ += num_segments[int(digit)]\n \n return summ\n\nS = 0\ncurrent_number = a\nwhile current_number <= b:\n jump_number = current_number + 10\n \n if current_number == a:\n S += sum_digits(current_number)\n current_number += 1\n elif jump_number < b and len(str(jump_number)) == len(str(current_number)) and current_number % 10 == 0:\n S += cycle\n S += sum_digits(str(current_number)[:-1]) * 10\n current_number += 10\n \n else:\n S += sum_digits(current_number)\n current_number += 1\n\n #print(current_number-1, S)\n\nprint(S)\n'''\nprint()\n\nS2 = 0\nfor i in range(a, b+1):\n S2 += sum_digits(i)\n #print(i, S2)\n\nprint(S2)\n'''\n \n\n \t \t \t \t \t \t \t \t \t\t", "def main():\n def f(n):\n l, m = [0] * 10, 1\n while n >= m:\n headmid, tail = divmod(n, m)\n head, mid = divmod(headmid, 10)\n for i in range(10):\n l[i] += head * m\n if head:\n l[0] -= m\n for i in range(mid):\n if head or i:\n l[i] += m\n if headmid:\n l[mid] += tail + 1\n m *= 10\n return sum(x * y for x, y in zip(l, (6, 2, 5, 5, 4, 5, 6, 3, 7, 6)))\n\n a, b = map(int, input().split())\n print(f(b) - f(a - 1))\n\n\nif __name__ == '__main__':\n main()", "def miis():\r\n return map(int, input().split())\r\n\r\nd = {'1':2, '2':5, '3':5,\r\n '4':4, '5':5, '6':6,\r\n '7':3, '8':7, '9':6,\r\n '0':6}\r\n\r\ndef get(n):\r\n r = 0\r\n for i in str(n):\r\n r += d[i]\r\n return r\r\n\r\nfor _ in range(1):\r\n a, b = miis()\r\n ans = 0\r\n for i in range(a, b+1):\r\n ans += get(i)\r\n print(ans)\r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\na, b = mints()\r\nc = [6,2,5,5,4,5,6,3,7,6]\r\nr = 0\r\naa = (a+999)//1000\r\nif aa*1000 >= b:\r\n\taa -= 1\r\n#print(a,aa*1000-1)\r\nfor i in range(a,aa*1000):\r\n\twhile i > 0:\r\n\t\tr += c[i%10]\r\n\t\ti //= 10\r\nbb = (b-1)//1000\r\nif aa == 0:\r\n\taa += 1\r\nz = 0\r\n#print(aa,bb-1)\r\nw = sum(c)*300\r\nfor i in range(aa,bb):\r\n\tr += w\r\n\twhile i > 0:\r\n\t\tz += c[i%10]\r\n\t\ti //= 10\r\n#print(bb*1000,b)\r\nif aa+1 < bb:\r\n\tfor i in range(bb*1000,b+1):\r\n\t\twhile i > 0:\r\n\t\t\tr += c[i%10]\r\n\t\t\ti //= 10\r\nelse:\r\n\tz = 0\r\n\tr = 0\r\n\t#print('qwe')\r\n\tfor i in range(a,b+1):\r\n\t\twhile i > 0:\r\n\t\t\tr += c[i%10]\r\n\t\t\ti //= 10\r\nprint(r+z*1000)", "d = {'0':6, '1':2, '2':5, '3':5, '4':4, '5':5, '6':6, '7':3, '8':7, '9':6}\r\ns = input()\r\ns = s.split()\r\na = int(s[0])\r\nb = int(s[1])\r\nsum = 0\r\nfor i in range(a, b + 1) :\r\n\tx = str(i)\r\n\tfor j in x :\r\n\t\tsum += d[j]\r\nprint(sum)\r\n", "\r\na, b = map(int, input().split())\r\nans = 0\r\nl = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nfor i in range(a, b + 1):\r\n\tst = str(i)\r\n\tfor ii in st:\r\n\t\tans += l[int(ii)]\r\n\r\n\r\nprint(ans)", "seg = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\na, b = map(int, input().split())\nres = 0\nx = 0\nfor i in range(a, b + 1):\n x = i\n while x:\n res += seg[x % 10]\n x //= 10\n\nprint(res)", "def count_segments(n):\r\n segments = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6] # number of segments for each digit\r\n count = 0\r\n while n > 0:\r\n digit = n % 10\r\n count += segments[digit]\r\n n //= 10\r\n return count\r\n\r\na, b = map(int, input().split())\r\ntotal_segments = sum(count_segments(n) for n in range(a, b+1))\r\nprint(total_segments)\r\n", "d = { '0':6 , '1':2 , '2':5 , '3':5 , '4':4 , \"5\":5 , '6':6 , '7':3 , '8':7 , '9':6 }\r\na , b = map(int , input().split())\r\ntotal = 0\r\nfor i in range(a , b+1):\r\n i = str(i)\r\n for j in i:\r\n total = total + d[j]\r\n\r\nprint(total)", "a,b=list(input().split())\r\n\r\n\r\nt={'0':6,'1':2,'2':5,'3':5,'4':4,'5':5,'6':6,'7':3,'8':7,'9':6}\r\n\r\n\r\nv=0\r\nfor k in range(int(a),int(b)+1):\r\n s=str(k)\r\n for i in s:\r\n v+=t[i]\r\n\r\n\r\nprint(v)\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\n\r\ncount = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6] # count for x\r\nnext_sum = [49, 43, 41, 36, 31, 27, 22, 16, 13, 6] # sum from x..9\r\nprev_sum = [6, 8, 13, 18, 22, 27, 33, 36, 43, 49] # sum from 0..x\r\n\r\nsegments = 0\r\np = 1\r\na_orig, b_orig = a, b\r\na_not_end = True\r\n\r\nwhile a or b:\r\n a_div, a_mod = divmod(a, 10)\r\n b_div, b_mod = divmod(b, 10)\r\n a_orig_mod, b_orig_mod = a_orig % p, b_orig % p\r\n segments += (prev_sum[b_mod] - count[b_mod]) * p + (b_orig_mod + 1) * count[b_mod]\r\n if a_not_end:\r\n if b_div > a_div:\r\n segments += (next_sum[0] * (b_div - a_div - 1) + next_sum[a_mod]) * p\r\n segments -= a_orig_mod * count[a_mod]\r\n elif a_mod:\r\n segments -= prev_sum[a_mod - 1] * p\r\n segments -= a_orig_mod * count[a_mod]\r\n else:\r\n if b_div:\r\n segments += (next_sum[0] * (b_div - 1) + next_sum[1]) * p\r\n else:\r\n segments -= count[0] * p \r\n a, b = a_div, b_div\r\n if a == 0:\r\n a_not_end = False\r\n p *= 10\r\n\r\nprint(segments)", "a,b=list(map(int,input().split()))\r\nd={0:6,1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}\r\ncem=0\r\nfor i in range(a,b+1):\r\n while i>0:\r\n cem+=d[i%10]\r\n i//=10\r\n \r\nprint(cem)\r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nc=[6,2,5,5,4,5,6,3,7,6]\r\na,b=map(int,input().split())\r\nans=0\r\nfor i in range(a,b+1):\r\n for j in str(i):\r\n ans+=c[int(j)]\r\n\r\nprint(ans)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nN = '6255456376'\r\n\r\na, b = map(int, input().split())\r\ns = ''.join(map(str, range(a, b+1)))\r\n\r\nprint(sum(int(N[d])*s.count(str(d)) for d in range(10)))", "from math import *\r\n\r\nd = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nl, r = map(int, input().split())\r\nans = 0\r\n\r\ndef calc(a):\r\n\tres = 0\r\n\twhile (a > 0):\r\n\t\tres += d[a % 10]\r\n\t\ta //= 10;\r\n\treturn res\r\n\r\nfor a in range(l, r + 1):\r\n\tans += calc(a)\r\nprint(ans)", "cnt = [6,2,5,5,4,5,6,3,7,6]\r\na, b = map(int, input().split())\r\ndef f(x):\r\n z = str(x)\r\n res = 0\r\n for c in z:\r\n res += cnt[ord(c)-ord('0')]\r\n return res\r\n \r\nans = sum(f(x) for x in range(a,b+1))\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\narr=[6,2,5,5,4,5,6,3,7,6]\r\nseg=0\r\nfor i in range(a,b+1):\r\n while(i>0):\r\n x=int(i%10)\r\n seg+=arr[x]\r\n i=i//10\r\nprint(seg)", "#620B\r\na,b = map(int, input().split())\r\nref = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nans = 0\r\nfor i in range(a,b+1):\r\n for j in list(str(i)):\r\n ans += ref[int(j)]\r\nprint(ans)\r\n", "seg = [6,2,5,5,4,5,6,3,7,6]\r\na,b = map(int,input().split())\r\nnum = str(list(range(a,b+1)))\r\nans = 0\r\nfor i in range(len(seg)):\r\n ans += seg[i]*num.count(str(i))\r\nprint (ans)\r\n", "a,b=map(int,input().split())\r\nz={\"1\":2,\"2\":5,\"3\":5,\"4\":4,\"5\":5,\"6\":6,\"7\":3,\"8\":7,\"9\":6,\"0\":6}\r\nz1={\"1\":0,\"2\":0,\"3\":0,\"4\":0,\"5\":0,\"6\":0,\"7\":0,\"8\":0,\"9\":0,\"0\":0}\r\ns=0\r\nfor i in range(a,b+1):\r\n k=str(i)\r\n for i in k:z1[i]+=1\r\nfor i in z:s+=z1[i]*z[i]\r\nprint(s)", "def f(n):\r\n a = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n count = 0\r\n while n > 0:\r\n x = n % 10\r\n count += a[x]\r\n n //= 10\r\n return count\r\n\r\na, b = map(int, input().split())\r\nprint(sum(f(n) for n in range(a, b + 1)))\r\n", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nf=[6,2,5,5,4,5,6,3,7,6]\r\na,b=map(int,readline().split())\r\nans=0\r\nfor num in range(a,b+1):\r\n for n in str(num):\r\n ans+=f[int(n)]\r\nprint(ans)", "a , b = map(int,input().split())\r\nd = {'0' : 6 , '1' : 2 , '2' : 5 , '3' : 5 , '4' : 4 , '5' : 5 , '6' : 6 , '7' : 3 , '8' : 7 , '9' : 6}\r\nans = 0\r\nfor i in range(a , b + 1):\r\n x = str(i)\r\n for j in x:\r\n ans += d[j]\r\nprint(ans)\r\n", "cnt = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\ntotal = sum(cnt)\r\na, b = map(int, input().split())\r\nres = 0\r\n\r\nfor num in range(a, b+1):\r\n for d in str(num):\r\n res += cnt[int(d)]\r\n\r\nprint(res)\r\n", "dic = {\r\n\t'1': 2,\r\n\t'2': 5, \r\n\t'3': 5,\r\n\t'4': 4,\r\n\t'5': 5,\r\n\t'6': 6,\r\n\t'7': 3,\r\n\t'8': 7,\r\n\t'9': 6,\r\n\t'0': 6,\r\n}\r\n\r\nl, r = (map (int, input().strip().split()))\r\nans = 0\r\nfor i in range(l, r+1):\r\n\ts = str(i)\r\n\tfor x in range(0, len(s)):\r\n\t\tans += dic[s[x]]\r\nprint(ans)\r\n", "s = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\na, b = map(int, input().split())\r\n\r\nc = 0\r\n\r\nfor i in range(a, b + 1):\r\n\tfor j in str(i):\r\n\t\tc += s[int(j)]\r\n\t\t\r\nprint(c)", "a, b = map(int, input().split())\r\nx = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nans = 0\r\nfor c in range(a, b + 1):\r\n c = list(str(c))\r\n for i in c:\r\n ans += x[int(i)]\r\nprint(ans)", "a = [6,2,5,5,4,5,6,3,7,6]\nn = [int(i) for i in input().split()]\ncount = 0\nfor i in range(n[0],n[1]+1):\n\tfor x in str(i):\n\t\tcount+=a[int(x)]\nprint(count)", "arr = [6 , 2 , 5 , 5 , 4 , 5 , 6 , 3 , 7 , 6]\r\nans = 0\r\na , b = map(int , input().split())\r\nfor i in range(a , b+1):\r\n x = list(str(i))\r\n for j in x:\r\n ans += arr[int(j)]\r\n\r\nprint(ans)", "f = [0] * 10\r\nf[0], f[1], f[2], f[3], f[4], f[5], f[6], f[7], f[8], f[9] = 6, 2, 5, 5, 4, 5, 6, 3, 7, 6\r\na, b = map(int, input().split())\r\nans = 0\r\n\r\n\r\ndef calc(x: int):\r\n res = 0\r\n s = str(x)\r\n for i in s:\r\n res += f[ord(i) - ord('0')]\r\n return res\r\n\r\n\r\nfor i in range(a, b + 1):\r\n ans += calc(i)\r\nprint(ans)\r\n", "def seg(n):\r\n n=int(n)\r\n if n==1:\r\n return(2)\r\n elif n==2:\r\n return(5)\r\n elif n==3:\r\n return(5)\r\n elif n==4:\r\n return(4)\r\n elif n==5:\r\n return(5)\r\n elif n==6:\r\n return(6)\r\n elif n==7:\r\n return(3)\r\n elif n==8:\r\n return(7)\r\n elif n==9:\r\n return(6)\r\n elif n==0:\r\n return(6)\r\nn1,n2=map(int,input().split())\r\nc=0\r\nfor i in range(n1,n2+1):\r\n for j in str(i):\r\n c+=seg(j)\r\nprint(c)", "l = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\na, b = map(int, input().split())\r\ns = str(list(range(a, b+1)))\r\nprint(6*s.count('0')+2*s.count('1')+5*s.count('2')+5*s.count('3')+4*s.count('4')+5*s.count('5')+6*s.count('6')+3*s.count('7')+7*s.count('8')+6*s.count('9'))", "a,b=[int(i) for i in input().split()]\r\ndict1={0:6,1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}\r\nsum1=0\r\nfor i in range(a,b+1):\r\n for j in str(i):\r\n sum1=sum1+dict1[int(j)]\r\nprint(sum1)\r\n", "m = {'0':6, '1':2, '2':5, '3':5, '4':4, '5':5, '6':6, '7':3, '8':7, '9':6}\r\na,b = list(map(int, input().split()))\r\ns =0 \r\nfor i in range(a,b+1):\r\n for j in str(i):\r\n s += m[j]\r\nprint(s)", "seg=[6,2,5,5,4,5,6,3,7,6]\r\ncount=0\r\na,b=map(int,input().split())\r\nfor i in range(a,b+1):\r\n ele=str(i)\r\n for j in ele:\r\n count+=seg[int(j)]\r\nprint(count)", "sigment={\"0\":6,\"1\":2,\"2\":5,\"3\":5,\"4\":4,\"5\":5,\"6\":6,\"7\":3,\"8\":7,\"9\":6}\r\nans=0\r\nl,r=map(int,input().split())\r\nfor i in range(l,r+1):\r\n for j in str(i):\r\n k=j\r\n ans+=sigment[k]\r\nprint(ans)\r\n", "seg = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\na, b = map(int, input().split())\r\ni = a\r\nres = 0\r\nwhile i <= b:\r\n x = i\r\n while x != 0:\r\n res += seg[x % 10]\r\n x //= 10\r\n i += 1\r\nprint(res)", "a, b = map(int, input().split())\r\nary = str(list(range(a, b + 1)))\r\nzero = ary.count('0')\r\none = ary.count('1')\r\ntwo = ary.count('2')\r\nthree = ary.count('3')\r\nfour = ary.count('4')\r\nfive = ary.count('5')\r\nsix = ary.count('6')\r\nseven = ary.count('7')\r\neight = ary.count('8')\r\nnine = ary.count('9')\r\nans = zero*6 + one*2 + two*5 + three*5 + four*4 + five*5 + six*6 + seven*3 + eight*7 + nine*6\r\nprint (ans)\r\n", "l=[6,2,5,5,4,5,6,3,7,6]\r\nx,y=map(int,input().split())\r\ns=0\r\nfor i in range(x,y+1):\r\n for j in str(i):\r\n s=s+l[int(j)]\r\nprint(s)\r\n", "a,b = map(int,input().split())\r\nd = {\"0\":6,\"1\":2,\"2\":5,\"3\":5,\"4\":4,\"5\":5,\"6\":6,\"7\":3,\"8\":7,\"9\":6}\r\nnums = str(list(range(a,b+1)))\r\ncount = 0\r\n\r\nfor i in d:\r\n\tcount = count + d[i]*nums.count(i)\r\nprint(count)\r\n", "#!/ur/bin/python3\n\ndef digit(i):\t# 0 <= i <= 9\n\tif i == 0 or i == 6 or i == 9:\n\t\treturn 6\n\telif i == 1:\n\t\treturn 2\n\telif i == 2 or i == 3 or i == 5:\n\t\treturn 5\n\telif i == 4:\n\t\treturn 4\n\telif i == 7:\n\t\treturn 3\n\telif i == 8:\n\t\treturn 7\n\ndef num(i):\t# 1 <= i <= 10^6\n\tsum = 0\n\tfor d in str(i):\n\t\tsum += digit(int(d))\n\treturn sum\n\n(a, b) = tuple(map(int, input().split()))\n\nsum = 0\n#print(a)\n#print(b)\ni = a\nwhile i <= b:\n\tif i == 1 and b >= 100000:\n\t\tsum += 2383366\n\t\ti = 100001\n\tif i == 100001 and b >= 200000:\n\t\tsum += 2650003\n\t\ti = 200001\n\tif i == 200001 and b >= 300000:\n\t\tsum += 2950000\n\t\ti = 300001\n\tif i == 300001 and b >= 400000:\n\t\tsum += 2949999\n\t\ti = 400001\n\tif i == 400001 and b >= 500000:\n\t\tsum += 2850001\n\t\ti = 500001\n\tif i == 500001 and b >= 600000:\n\t\tsum += 2950001\n\t\ti = 600001\n\tif i == 600001 and b >= 700000:\n\t\tsum += 3049997\n\t\ti = 700001\n\tif i == 700001 and b >= 800000:\n\t\tsum += 2750004\n\t\ti = 800001\n\tif i == 800001 and b >= 900000:\n\t\tsum += 3149999\n\t\ti = 900001\n\tif i == 900001 and b >= 1000000:\n\t\tsum += 3050002\n\t\ti = 1000001\n\tif i <= b:\n\t\tsum += num(i)\n\t\ti += 1\n\telse:\n\t\tbreak\n\nprint(sum)\n", "arr = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\nres = 0\r\na, b = map(int, input().split())\r\nfor i in range(a, b + 1):\r\n for j in str(i):\r\n res += arr[int(j)]\r\nprint(res)", "a,b = map(int, input().split())\ncost = [6,2,5,5,4,5,6,3,7,6]\nans = 0\nfor i in range(a, b+1):\n while i:\n digit = i % 10\n ans += cost[digit]\n i = i // 10\nprint(ans)\n", "\"\"\" \r\nfrom collections import deque as de\r\nclass node:\r\n def __init__(self, data=None):\r\n self.data = data\r\n self.right_node = None\r\n self.left_node = None\r\nclass binarytree:\r\n def __init__(self):\r\n self.root = None\r\ndef preorder(binaryroot):\r\n if binaryroot!=None:\r\n print(binaryroot.data, end=' ')\r\n preorder(binaryroot.left_node)\r\n preorder(binaryroot.right_node)\r\ndef postorder(binaryroot):\r\n if binaryroot!=None:\r\n postorder(binaryroot.left_node)\r\n postorder(binaryroot.right_node)\r\n print(binaryroot.data, end=' ')\r\ndef levelorder(queue, ans):\r\n temp=queue.popleft()\r\n if temp!=None:\r\n ans.append(temp.data)\r\n queue.append(temp.right_node)\r\n queue.append(temp.left_node)\r\n return levelorder(queue, ans)\r\n else:\r\n return ans[::-1]\r\n \r\ndef findheight(root ):\r\n if root!=None:\r\n return 1+ max(findheight(root.left_node), findheight(root.right_node))\r\n \r\n else:\r\n return -1\r\ndef diamterange(root)-> int:\r\n mx=[]\r\n def find(root,mx):\r\n if root!=None:\r\n left=find(root.left_node, mx)\r\n right=find(root.right_node, mx)\r\n mx.append( 2+left+right)\r\n \r\n return 1 + max(left, right)\r\n else:\r\n return -1\r\n find(root, mx)\r\n return mx\r\n\r\n \r\n \r\n\r\n \r\nfirst=node(1)\r\nsecond=node(2)\r\nthird=node(3)\r\nfourth=node(4)\r\nfifth=node(5)\r\nsixth=node(6)\r\nseventh=node(7)\r\n\r\nbinary=binarytree()\r\n\r\nbinary.root = first\r\nfirst.left_node=second\r\nfirst.right_node=third\r\nsecond.left_node=fourth \r\nsecond.right_node=fifth \r\nthird.left_node=sixth\r\nthird.right_node=seventh\r\nl=de()\r\nl.append(first)\r\n#print(l)\r\nans=[]\r\nk=levelorder(l, ans)\r\nprint(k)\r\nans=0\r\nk=findheight(seventh)\r\nprint(k)\r\nte=diamterange(first)\r\nprint(te)\r\n#print(first.left_node.data)\r\n#preorder(first)\r\n#print(\"\\n\")\r\n#postorder(first)\r\n\"\"\"\r\n\r\ndef di():return map(int, input().split())\r\ndef ii():return int(input())\r\ndef li():return list(map(int, input().split()))\r\n\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n#practice like your never won\r\n#perform like you never lost\r\n\r\ndic={0: 6, 1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}\r\nans=0\r\na,b=di()\r\nfor i in range(a, b+1):\r\n temp=str(i)\r\n for j in range(len(temp)):\r\n ans+=dic[int(temp[j])]\r\nprint(ans)\r\n\r\n\r\n\r\n ", "X, Segment = list(map(int, input().split())), [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\nNumbers = str(list(range(X[0], X[1] + 1)))\r\nprint(sum(Numbers.count(str(i)) * Segment[i] for i in range(10)))\r\n\r\n# UB_CodeForces\r\n# Advice: Please just act, don't just talk\r\n# Location: Behind my desk\r\n# Caption: The last 1000 code, so shocked because of the solution\r\n", "a, b = map(int, input().split())\r\nsegments = (6, 2, 5, 5, 4, 5, 6, 3, 7, 6)\r\nans = 0\r\nfor i in range(a, b + 1):\r\n x = i\r\n while True:\r\n digit = x % 10\r\n ans += segments[digit]\r\n if x < 10:\r\n break\r\n x = x // 10\r\n\r\nprint(ans)\r\n", "x,y = list(map(int,input().split()))\r\nd = {0:6,1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}\r\nans = 0\r\nfor i in range(x,y+1):\r\n\twhile i:\r\n\t\tt = i%10\r\n\t\tans += d[t]\r\n\t\ti=i//10\r\nprint(ans)", "val = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\ndef num(n):\r\n ans = 0\r\n while n>0:\r\n rem = n%10\r\n ans+=val[rem]\r\n n = n//10\r\n return ans\r\n\r\n\r\na,b = map(int,input().split())\r\ns = 0\r\nfor i in range(a,b+1):\r\n s+= num(i)\r\n\r\nprint(s)", "\r\ntmp = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\na, b = map(int, input().split())\r\nb += 1\r\ncounter = 0\r\nfor i in range(a, b):\r\n for j in list(str(i)):\r\n counter += tmp[int(j)]\r\nprint(counter)\r\n\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "d = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\na, b = map(int, input().split())\n\nnums = str(list(range(a, b+1)))\nr = 0\nfor i in range(len(d)):\n r += d[i] * nums.count(str(i))\nprint(r)\n\n", "a, b = map(int, input().split())\r\nd = {'0':6, '1':2, '2':5, '3':5, '4':4, '5':5, '6':6, '7':3, '8':7, '9':6}\r\nans = 0\r\nfor i in range(a, b + 1):\r\n for c in str(i):\r\n ans += d[c]\r\nprint(ans)\r\n", "count = '6255456376'\r\na,b = list(map(int, input().split()))\r\nres = ''.join(map(str, range(a,b+1)))\r\ns = 0\r\nfor i in range(10):\r\n s += res.count(str(i)) * int(count[i])\r\nprint(s)\r\n", "#code\r\nls=[6,2,5,5,4,5,6,3,7,6]\r\na,b=map(int,input().split())\r\nans=0\r\nfor i in range(a,b+1):\r\n temp=str(i)\r\n for j in range(len(temp)):\r\n ans+=ls[int(temp[j])]\r\nprint(ans) ", "s=[6,2,5,5,4,5,6,3,7,6]\r\ntotal=0\r\na,b = map(int, input().split())\r\nfor i in range(a,b+1):\r\n if i<10:\r\n total+=s[i] \r\n else:\r\n j=str(i)\r\n sum=0\r\n for i in j:\r\n sum+=s[int(i)]\r\n total+=sum\r\nprint(total)\r\n", "N = '6255456376'\r\na, b = map(int, input().split())\r\ns = ''.join(map(str, range(a, b+1)))\r\nprint(sum(int(N[d])*s.count(str(d)) for d in range(10)))", "def seven_segments (start,end):\r\n total = 0\r\n segments = {\"0\" : 6 , \"1\" : 2 , \"2\" : 5 , \"3\" : 5 , \"4\" : 4 , \"5\" : 5 , \r\n \"6\" : 6 , \"7\" : 3 , \"8\" : 7 , \"9\" : 6 }\r\n \r\n for x in range(start,end+1) :\r\n for y in str(x) :\r\n total += segments[y]\r\n return total\r\n \r\n\r\nstart, end = list(map(int,input().split()))\r\n\r\nprint (seven_segments(start,end))\r\n \r\n ", "a,b=map(int,input().split());c,t=str(list(range(a,b+1))),0\r\nprint(6*c.count('0')+2*c.count('1')+5*c.count('2')+5*c.count('3')+4*c.count('4')+5*c.count('5')+6*c.count('6')+3*c.count('7')+7*c.count('8')+6*c.count('9'))", "li = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\na, b = map(int, input().split())\r\nnums = str(list(range(a, b+1)))\r\ncnt = 0\r\nfor i in range(len(li)):\r\n cnt += li[i] * nums.count(str(i))\r\nprint(cnt)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nl = [6,2,5,5,4,5,6,3,7,6]\r\na, b = map(int, input().split())\r\ns = Counter(''.join(map(str, list(range(a,b+1)))))\r\nc = 0\r\nfor i in s:\r\n c += s[i]*l[int(i)]\r\nprint(c)", "a, b = map(int, input().split())\r\nmemo = {0: 6, 1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}\r\ns = 0\r\nfor i in range(a, b + 1):\r\n tmp = i\r\n while tmp:\r\n s += memo[tmp % 10]\r\n tmp //= 10\r\n\r\nprint(s)", "'''input\n1 1000000\n'''\na, b = map(int, input().split())\ns = 0\nn = str(list(range(a, b+1)))\nd = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\nfor x in range(10):\n\ts += d[x] * n.count(str(x))\nprint(s)", "import math\r\n\r\ndef main_function():\r\n hash = {}\r\n hash[\"1\"] = 2\r\n hash[\"2\"] = 5\r\n hash[\"0\"] = 6\r\n hash[\"3\"] = 5\r\n hash[\"4\"] = 4\r\n hash[\"5\"] = 5\r\n hash[\"6\"] = 6\r\n hash[\"7\"] = 3\r\n hash[\"8\"] = 7\r\n hash[\"9\"] = 6\r\n counter = 0\r\n a, b = [int(i) for i in input().split(\" \")]\r\n for i in range(a, b + 1):\r\n for j in str(i):\r\n counter += hash[j]\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "a, b = map(int, input().split())\r\nlst = list(range(a, b + 1))\r\ntemp = str(lst)\r\nzero = temp.count('0')\r\none = temp.count('1')\r\ntwo = temp.count('2')\r\nthree = temp.count('3')\r\nfour = temp.count('4')\r\nfive = temp.count('5')\r\nsix = temp.count('6')\r\nseven = temp.count('7')\r\neight = temp.count('8')\r\nnine = temp.count('9')\r\nans = zero*6 + one*2 + two*5 + three*5 + four*4 + five*5 + six*6 + seven*3 + eight*7 + nine*6\r\nprint (ans)", "a,b = map(int, input().split())\n\nd = {0:6,1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}\n\nans = 0\nfor i in range(a, b+1):\n s = str(i)\n for c in s:\n c = int(c)\n ans += d[c]\nprint(ans)\n", "dic = (6, 2, 5, 5, 4, 5, 6, 3, 7, 6)\n\nx, y = input().split(' ')\nc = 0\nfor n in range(int(x), int(y)+1):\n for m in str(n):\n c += dic[int(m)]\nprint(c)\n\t\t\t\t \t \t \t \t\t \t\t \t \t \t\t\t", "a,b=map(int,input().split())\r\nl=[6,2,5,5,4,5,6,3,7,6]\r\nsum=0\r\nfor i in range(a,b+1):\r\n aa=str(i)\r\n aa=list(aa)\r\n for j in range(len(aa)):\r\n aa[j]=int(aa[j])\r\n for j in range(len(aa)):\r\n sum+=l[aa[j]]\r\nprint(sum) ", "mp = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\r\n\r\na, b = map(int, input().split())\r\n\r\ns = int(0)\r\nfor t in range(a, b+1):\r\n while t != 0:\r\n s += mp[t%10]\r\n t = int(t/10)\r\n\r\nprint(s)" ]

[ "n, m = map(int, input(\"\").split())\r\nrow_order = [ char for char in input(\"\")]\r\ncol_order = [char for char in input(\"\")]\r\n\r\nclass Node():\r\n def __init__(self, id):\r\n self.row_id, self.col_id = id\r\n self.children = []\r\n\r\n def add_child(self, child_node_id):\r\n self.children.append(child_node_id)\r\n\r\ndef add_horizontal_edge(row_dir, row_id, col_id):\r\n if row_dir == '>' and col_id < m-1:\r\n matrix[row_id][col_id].add_child((row_id ,col_id+1))\r\n elif row_dir == '<' and col_id > 0:\r\n matrix[row_id][col_id].add_child((row_id, col_id-1))\r\n\r\ndef add_vertical_edge(col_dir, row_id, col_id):\r\n if col_dir == '^' and row_id > 0:\r\n matrix[row_id][col_id].add_child((row_id-1, col_id))\r\n elif col_dir == 'v'and row_id < n-1:\r\n matrix[row_id][col_id].add_child((row_id+1, col_id))\r\n\r\n\r\n\r\nmatrix = [[Node((row_id, col_id)) for col_id in range(m)] for row_id in range(n)]\r\nfor row_id in range(n):\r\n row_dir = row_order[row_id]\r\n for col_id in range(m):\r\n col_dir = col_order[col_id]\r\n add_horizontal_edge(row_dir, row_id, col_id)\r\n add_vertical_edge(col_dir, row_id, col_id)\r\n\r\ndef explore(row_id, col_id, visited):\r\n if visited[row_id][col_id] == 'true':\r\n return\r\n else:\r\n visited[row_id][col_id] ='true'\r\n for child_row_id, child_col_id in matrix[row_id][col_id].children:\r\n explore(child_row_id, child_col_id, visited)\r\n\r\n return\r\n\r\nanswer = 'YES'\r\n\r\ndef dfs(answer):\r\n for row_id in range(n):\r\n for col_id in range(m):\r\n visited = [['false' for col_id in range(m)] for row_id in range(n)]\r\n explore(row_id, col_id, visited)\r\n for i in range(n):\r\n for j in range(m):\r\n if visited[i][j] == 'false':\r\n answer = 'NO'\r\n return answer\r\n\r\n\r\n\r\n return answer\r\nanswer = dfs(answer)\r\nprint(answer)\r\n", "\nn,m = [int(x) for x in input().split()]\ndirections_h = [ True if char == '<' else False for char in input()]\ndirections_v = [ True if char == '^' else False for char in input()]\n\n\ndef neighs(node):\n x, y = node\n \n if x < m:\n if directions_v[x]:\n if y > 0: yield (x, y - 1)\n else:\n if y < n - 1: yield (x, y + 1)\n \n if y < n:\n if directions_h[y]:\n if x > 0: yield (x - 1, y)\n else:\n if x < m - 1: yield (x + 1, y)\n\nvisited = set()\n\ndef dfs(node, visited):\n for neigh in neighs(node):\n if neigh in visited: continue\n # print(\" \" * pad + \"visited\", neigh)\n visited.add(neigh)\n dfs(neigh, visited)\n \n\ndef is_fully_connected():\n for y in range(n):\n for x in range(m):\n pos = (x, y)\n visited = set([pos])\n dfs(pos, visited)\n if len(visited) != n * m: return False\n \n return True\n\n# visited.add((0, 0))\n# result = is_fully_connected((0, 0))\n\n# print(visited)\n# print(directions_h, directions_v)\n\nresult = is_fully_connected()\n\nif result:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t \t \t\t \t \t \t", "n, m = map(int,input().split())\nh = input()\nv = input()\n\nc = h[0] + v[0] + h[n-1] + v[m-1]\n\nif c == '<v>^' or c == '>^<v':\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", "from collections import deque\r\ndef gather_input():\r\n n, m = [int(x) for x in input().split()]\r\n hor_streets = list(input())\r\n vert_streets = list(input())\r\n return (hor_streets, vert_streets)\r\n\r\ndef gen_graph(hor_streets, vert_streets):\r\n graph = {}\r\n for i in range(len(hor_streets)):\r\n for j in range(len(vert_streets)):\r\n node_str = str(j) + str(i)\r\n if node_str not in graph:\r\n graph[node_str] = []\r\n if vert_streets[j] == '^' and i > 0:\r\n graph[node_str].append(str(j) + str(i - 1))\r\n elif vert_streets[j] == 'v' and i < len(hor_streets) - 1:\r\n graph[node_str].append(str(j) + str(i + 1))\r\n if hor_streets[i] == '<' and j > 0:\r\n graph[node_str].append(str(j - 1) + str(i))\r\n elif hor_streets[i] == '>' and j < len(vert_streets) - 1:\r\n graph[node_str].append(str(j + 1) + str(i))\r\n\r\n return graph\r\n\r\ndef dfs(graph, source):\r\n visited = set()\r\n stack = deque()\r\n stack.append(source)\r\n\r\n while len(stack) > 0:\r\n node_str = stack.pop()\r\n visited.add(node_str)\r\n adj_list = graph[node_str]\r\n for node in adj_list:\r\n if node not in visited:\r\n stack.append(node)\r\n\r\n return len(graph) == len(visited)\r\n\r\n\r\nif __name__ == '__main__':\r\n hor_streets, vert_streets = gather_input()\r\n graph = gen_graph(hor_streets, vert_streets)\r\n valid = True \r\n for source, val in graph.items():\r\n if not dfs(graph, source):\r\n valid = False\r\n break\r\n\r\n if valid:\r\n print('YES')\r\n else:\r\n print('NO')", "# HEY STALKER\r\nn, m = map(int, input().split())\r\ns1 = input()\r\ns2 = input()\r\ns = (s1[0] + s2[0] + s1[n-1] + s2[m-1])\r\nprint(\"YES\" if s in [\"<v>^\", \">^<v\"] else \"NO\")", "n, m = map(int, input().split())\r\n\r\nhoriz = input(); vert = input()\r\n\r\ncorner1 = horiz[0]; corner2 = horiz[-1]\r\ncorner3 = vert[0]; corner4 = vert[-1]\r\n\r\nb = [corner1, corner2, corner3, corner4]\r\n\r\ncw = '<>v^'\r\nccw = '><^v'\r\nb = ''.join(b)\r\nif b == cw or b == ccw:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, m = map(lambda v: int(v) - 1, input().split())\ndin, dim = [0] * 22, [0] * 22\n# read grid\nfor i, c in enumerate(input()):\n if c == '>':\n din[i] = 1\nfor i, c in enumerate(input()):\n if c == '^':\n dim[i] = 1\n\nflag = True\nif din[0] != dim[0]:\n flag = False\nif din[0] == dim[m]:\n flag = False\nif din[n] == dim[0]:\n flag = False\nif din[n] != dim[m]:\n flag = False\nprint(\"YES\" if flag else \"NO\")\n", "n, m = map(int, input().split())\r\nr, c = input(), input()\r\n\r\nif r[0] + c[-1] + r[-1] + c[0] in ('>v<^', '<^>v'): # form a cycle\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\r\nCreated on Oct 5, 2014\r\n\r\n@author: Ismael\r\n'''\r\nfrom _collections import defaultdict\r\n\r\ndef DFexplo(dictAdj,start):\r\n explored = {start}\r\n lifo = [start]\r\n while(len(lifo)>0):\r\n node = lifo.pop()\r\n for child in dictAdj[node]:\r\n if(child not in explored):\r\n explored.add(child)\r\n lifo.append(child)\r\n return explored\r\n\r\ndef solve(dictAdj):\r\n #print(dictAdj)\r\n for i in range(len(H)):\r\n for j in range(len(V)):\r\n nodesReachable = DFexplo(dictAdj,(i,j))\r\n if(len(nodesReachable) < n*m-1):\r\n return False\r\n return True\r\n\r\ndef isNode(i,j):\r\n return 0 <= i < n and 0 <= j < m\r\n\r\ndef buildGraph(H,V):\r\n dictAdj = defaultdict(list)\r\n for i in range(len(H)):\r\n for j in range(len(V)):\r\n if(isNode(i,j-1) and H[i]=='<'):\r\n dictAdj[(i,j)].append((i,j-1))\r\n if(isNode(i,j+1) and H[i]=='>'):\r\n dictAdj[(i,j)].append((i,j+1))\r\n if(isNode(i-1,j) and V[j]=='^'):\r\n dictAdj[(i,j)].append((i-1,j))\r\n if(isNode(i+1,j) and V[j]=='v'):\r\n dictAdj[(i,j)].append((i+1,j))\r\n return dictAdj\r\n\r\nn,m = map(int,input().split())\r\nH = input()\r\nV = input()\r\ndictAdj = buildGraph(H,V)\r\nif(solve(dictAdj)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def dfs(node):\r\n global seen\r\n stack = [node]\r\n while stack:\r\n ele = stack.pop(-1)\r\n if seen[ele] == 0:\r\n seen[ele] = 1\r\n for each in arr[ele]:\r\n if seen[each] == 0:\r\n stack.append(each)\r\n \r\nn,m = map(int,input().split())\r\narr = [list() for i in range(n*m)]\r\nhor = input()\r\nver = input()\r\nh = 0\r\nfor x in range(0,n*m,m):\r\n v = 0 \r\n for i in range(x,x+m):\r\n if hor[h] == \">\" and v != m-1:\r\n arr[i].append(i+1)\r\n elif i != x and hor[h] == \"<\":\r\n arr[i].append(i-1) \r\n if ver[v] == \"v\" and h != n-1:\r\n arr[i].append(i+m)\r\n elif h != 0 and ver[v] == \"^\":\r\n arr[i].append(i-m)\r\n v += 1\r\n h += 1\r\nfor i in range(n*m):\r\n seen = [0] * (n*m)\r\n dfs(i)\r\n if not all(seen):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n \r\n", "vals = input().split()\nn, m = int(vals[0]), int(vals[1]) # horizontal, vertical\nrows = input().split()[0]\ncols = input().split()[0]\ngraph = {}\n\nfor r in range(n):\n for c in range(m):\n curr = r * m + c\n graph[curr] = []\n r_dir = rows[r]\n if r_dir == '<' and c != 0:\n graph[curr].append(curr-1)\n elif r_dir == '>' and c != m-1:\n graph[curr].append(curr+1)\n\n c_dir = cols[c]\n if c_dir == '^' and r != 0:\n graph[curr].append(curr-m)\n elif c_dir == 'v' and r != n-1:\n graph[curr].append(curr+m)\nvisited = set()\ntoVisit = [0]\n\nwhile toVisit:\n curr = toVisit.pop()\n for u in graph[curr]:\n if u not in visited:\n visited.add(u)\n toVisit.append(u)\n\nif len(visited) != n*m:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n, m=map(int, input().split())\nhor=input()\nver=input()\n\ngrid=[[[0 for k in range(2)] for j in range(m)] for i in range(n)]\n\nfor i in range(n) :\n\n for j in range(m) :\n\n grid[i][j][0]=1 if hor[i]=='>' else -1\n grid[i][j][1]=1 if ver[j]=='^' else -1\n\nvis=[[False for j in range(m)] for i in range(n)]\n\n\ndef dfs(i, j) :\n\n vis[i][j]=True\n\n h, v=grid[i][j][0], grid[i][j][1]\n\n if h==1 and j+1<=m-1 and not vis[i][j+1] :\n\n dfs(i, j+1)\n elif h==-1 and j-1>=0 and not vis[i][j-1] :\n\n dfs(i, j-1)\n\n if v==-1 and i+1<=n-1 and not vis[i+1][j] :\n\n dfs(i+1, j)\n elif v==1 and i-1>=0 and not vis[i-1][j] :\n\n dfs(i-1, j)\n\n\nfor i in range(n) :\n\n for j in range(m) :\n\n dfs(i, j)\n\n for k in range(n) :\n\n if vis[k].count(False)>0 :\n\n print(\"NO\")\n exit()\n\n vis=[[False for col in range(m)] for row in range(n)]\n\nprint(\"YES\")\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 21/05/2023 10:56:52 Hanoi, Vietnam\r\n# **/\r\n\r\nn, m = map(int, input().split())\r\nhori = input()\r\nvert = input()\r\n\r\nt = hori[0] + hori[n-1] + vert[0] + vert[m-1]\r\n\r\nif t == \"<>v^\" or t == \"><^v\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nLOGN = 20\r\nINF = 10 ** 9 + 5\r\nMOD = 10 ** 9 + 7\r\n# ============================ START OF MY CODE ============================\r\n\r\nfrom collections import defaultdict\r\n\r\ndef solve():\r\n def hierholzer(start):\r\n stk = [start]\r\n visited = set([start])\r\n while stk:\r\n v = stk.pop()\r\n for u in adj[v]:\r\n if u not in visited:\r\n stk.append(u)\r\n visited.add(u)\r\n return len(visited) == m * n\r\n\r\n m, n = map(int, input().split())\r\n ij2idx = lambda i, j: i * n + j\r\n adj = defaultdict(list)\r\n s = str(input())\r\n for i, c in enumerate(s):\r\n if c == '>':\r\n for j in range(n - 1):\r\n adj[ij2idx(i, j)].append(ij2idx(i, j + 1))\r\n else:\r\n for j in range(1, n):\r\n adj[ij2idx(i, j)].append(ij2idx(i, j - 1))\r\n s = str(input())\r\n for j, c in enumerate(s):\r\n if c == 'v':\r\n for i in range(m - 1):\r\n adj[ij2idx(i, j)].append(ij2idx(i + 1, j))\r\n else:\r\n for i in range(1, m):\r\n adj[ij2idx(i, j)].append(ij2idx(i - 1, j))\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n start = ij2idx(i, j)\r\n if not hierholzer(start):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n,m = list(map(int, input().split()))\r\nHorizontal = list(input())\r\nVertical = list(input())\r\n\r\n\r\nGrid = [[\"\"]*m for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n Grid[i][j] += Horizontal[i]\r\n Grid[i][j] += Vertical[j]\r\n\r\ndef canMove(i,j):\r\n return i<n and i >=0 and j>=0 and j<m \r\ndef BFS(Grid, i,j):\r\n visited = [[False]*m for _ in range(n)]\r\n to_visit = []\r\n to_visit.append([i,j])\r\n visited[i][j] = True\r\n while to_visit:\r\n current = to_visit.pop(0)\r\n if (Grid[current[0]][current[1]][0] == \">\"):\r\n stepj = 1\r\n else:\r\n stepj = -1\r\n if (Grid[current[0]][current[1]][1] == \"v\"):\r\n stepi = 1\r\n else:\r\n stepi = -1\r\n neighbors = [[current[0]+stepi,current[1]],[current[0],current[1]+stepj]]\r\n for neighbor in neighbors:\r\n if canMove(neighbor[0],neighbor[1]): \r\n if (not visited[neighbor[0]][neighbor[1]]):\r\n to_visit.append(neighbor)\r\n visited[neighbor[0]][neighbor[1]] = True\r\n return visited\r\ndef test(n,m):\r\n for i in range(n):\r\n for j in range(m):\r\n visited = BFS(Grid,i,j)\r\n for i in range(n):\r\n if False in visited[i]:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(test(n,m))\r\n", "#\t!/usr/bin/env python3\r\n#\tcoding: UTF-8\r\n#\tModified: <06/Feb/2019 07:48:18 PM>\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology (IIIT),Gwalior\r\n\r\n#\tQuestion Link\r\n#\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ngraph = [[] for _ in range(405)]\r\ngraph_reverse = [[] for _ in range(405)]\r\nvisited = [False] * 405\r\nvisited_other = [False] * 405\r\nstack = []\r\nscc = 0\r\n\r\n\r\ndef explore(node):\r\n visited[node] = True\r\n for neighbour in graph_reverse[node]:\r\n if visited[neighbour] == False:\r\n explore(neighbour)\r\n stack.append(node)\r\n\r\n\r\ndef dfs(n, m):\r\n for i in range(n):\r\n for j in range(1, m + 1):\r\n if visited[i * m + j] == False:\r\n explore(i * m + j)\r\n\r\n\r\ndef explore_other(node):\r\n visited_other[node] = True\r\n for neighbour in graph[node]:\r\n if visited_other[neighbour] == False:\r\n explore_other(neighbour)\r\n\r\n\r\ndef dfs_o(n, m):\r\n global scc\r\n for node in reversed(stack):\r\n if visited_other[node] == False:\r\n scc += 1\r\n #print(node, scc)\r\n explore_other(node)\r\n\r\n\r\ndef main():\r\n n, m = get_ints()\r\n horizontal = input().strip()\r\n for i in range(n):\r\n if horizontal[i] == '<':\r\n for j in range(1, m):\r\n graph[i * m + j + 1].append(i * m + j)\r\n graph_reverse[i * m + j].append(i * m + j + 1)\r\n else:\r\n for j in range(1, m):\r\n graph[(i) * m + j].append(i * m + (j + 1))\r\n graph_reverse[i * m + (j + 1)].append((i) * m + j)\r\n vertical = input().strip()\r\n for j in range(1, m + 1):\r\n if vertical[j - 1] == '^':\r\n for i in range(n - 1):\r\n graph[(i + 1) * m + j].append((i) * m + (j))\r\n graph_reverse[(i) * m + (j)].append((i + 1) * m + j)\r\n else:\r\n for i in range(n - 1):\r\n graph[i * m + j].append((i + 1) * m + (j))\r\n graph_reverse[(i + 1) * m + (j)].append((i) * m + j)\r\n '''for i in range(n + 1):\r\n for j in range(1, m + 1):\r\n print(graph[i * m + j], end=' ')\r\n print()\r\n print('next')\r\n for i in range(n + 1):\r\n for j in range(1, m + 1):\r\n print(graph_reverse[i * m + j], end=' ')\r\n print()'''\r\n\r\n dfs(n, m)\r\n # print(stack)\r\n dfs_o(n, m)\r\n print('YES' if scc == 1 else 'NO')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\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\nhs, vs = inl()\r\nh_streets = input()\r\nv_streets = input()\r\n\r\nh_streets = [1 if i == \">\" else -1 for i in h_streets]\r\nv_streets = [1 if i == \"v\" else -1 for i in v_streets]\r\n\r\n\r\n\r\ndef dfs(i, j):\r\n visited.add((i, j))\r\n next_ps = [(i + v_streets[j], j), (i, j + h_streets[i])]\r\n\r\n for p in next_ps:\r\n if p[0] in range(hs) and p[1] in range(vs) and p not in visited:\r\n dfs(p[0], p[1])\r\n\r\n\r\n# check all junctions in the grid\r\nfor k in range(hs):\r\n for l in range(vs):\r\n visited = set()\r\n dfs(k, l)\r\n if len(visited) != hs * vs:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "import os, sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nclass graph:\r\n def __init__(self, n):\r\n self.n, self.gdict = n, [[] for _ in range(n + 1)]\r\n\r\n def add_uniEdge(self, node1, node2, w=None):\r\n self.gdict[node1].append(node2)\r\n\r\n def dfsUtil(self, v):\r\n self.visit = [False] * self.n\r\n stack, self.visit[v] = [v], True\r\n\r\n while (stack):\r\n s = stack.pop()\r\n\r\n for i1 in self.gdict[s]:\r\n if not self.visit[i1]:\r\n stack.append(i1)\r\n self.visit[i1] = True\r\n\r\n return False in self.visit\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\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp(dtype))]\r\ninp_enus = lambda dtype, n: [[i] + inp(dtype) for i in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\nvalid = lambda x, y: -1 < x < n and -1 < y < m\r\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\n\r\nn, m = inp(int)\r\nhor, ver, g = input(), input(), graph(n * m)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n node = i * m + j\r\n for k in range(4):\r\n nx, ny = i + dx[k], j + dy[k]\r\n if valid(nx, ny):\r\n node2 = nx * m + ny\r\n\r\n if nx == i:\r\n if hor[i] == '>' and ny > j or hor[i] == '<' and ny < j:\r\n g.add_uniEdge(node, node2)\r\n\r\n else:\r\n if ver[j] == 'v' and nx > i or ver[j] == '^' and nx < i:\r\n g.add_uniEdge(node, node2)\r\n\r\nfor i in range(n * m):\r\n if g.dfsUtil(i):\r\n exit(print('NO'))\r\nprint('YES')\r\n", "n, m = map(int, input().split())\r\na = input()\r\nb = input()\r\nf = True\r\ndef dfs(x, y):\r\n tmp = 1\r\n used[x + y * 42] = 1\r\n if a[x] == '>' and y + 1 < m:\r\n if used[x + (y + 1) * 42] == 0:\r\n tmp += dfs(x, y + 1)\r\n if a[x] == '<' and y - 1 >= 0:\r\n if used[x + (y - 1) * 42] == 0:\r\n tmp += dfs(x, y - 1)\r\n if b[y] == 'v' and x + 1 < n:\r\n if used[x + 1 + (y) * 42] == 0:\r\n tmp += dfs(x + 1, y)\r\n if b[y] == '^' and x - 1 >= 0:\r\n if used[x - 1 + (y) * 42] == 0:\r\n tmp += dfs(x - 1, y)\r\n return(tmp)\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n used = [0] * 1000\r\n if dfs(i, j) != n * m:\r\n f = False\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na,b=input(),input()\r\naa,bb=\"<>\",\"^v\"\r\ng=[[[] for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n x=aa.find(a[i])\r\n for j in range(m):\r\n if x==0 and j==0: continue\r\n elif x==1 and j==m-1: continue\r\n if x==0: g[i][j].append((i,j-1))\r\n elif x==1: g[i][j].append((i,j+1))\r\nfor i in range(m):\r\n x=bb.find(b[i])\r\n for j in range(n):\r\n if x==0 and j==0: continue\r\n elif x==1 and j==n-1: continue\r\n if x==0: g[j][i].append((j-1,i))\r\n elif x==1: g[j][i].append((j+1,i))\r\nok=True\r\nfor root_i in range(n):\r\n for root_j in range(m):\r\n que=[(root_i,root_j)]\r\n vis=set()\r\n while len(que)>0:\r\n cur=que.pop()\r\n vis.add(cur)\r\n for i in g[cur[0]][cur[1]]:\r\n if i not in vis:\r\n que.append(i)\r\n if len(vis)!=n*m:\r\n ok=False\r\n break\r\n if not(ok): break\r\nprint((\"NO\",\"YES\")[ok])\r\n \r\n", "n,m = map(int,input().split())\r\n\r\nrows = input()\r\ncolumns = input()\r\n\r\ndef DFS(rows,columns,n,m):\r\n\r\n\tans = set()\r\n\tfor i in range(1,n+1):\r\n\t\tfor j in range(1,m+1):\r\n\r\n\t\t\tstack = [(i,j)]\r\n\t\t\tvisited = set()\r\n\r\n\t\t\twhile len(stack):\r\n\r\n\t\t\t\t\r\n\t\t\t\ttempx,tempy = stack.pop()\r\n\t\t\t\t\r\n\t\t\t\tvisited.add((tempx,tempy))\r\n\r\n\t\t\t\tif (tempx,tempy) in ans:\r\n\t\t\t\t\tans.add((i,j))\r\n\t\t\t\t\tbreak\r\n\t\t\t\tif tempx < n and columns[tempy-1] == \"^\" and (tempx+1,tempy) not in visited:\r\n\t\t\t\t\tstack.append((tempx+1,tempy))\r\n\t\t\t\telif tempx-1 >= 1 and columns[tempy-1] == \"v\" and (tempx-1,tempy) not in visited:\r\n\t\t\t\t\tstack.append((tempx-1,tempy))\r\n\t\t\t\tif tempy < m and rows[tempx-1] == \"<\" and (tempx,tempy+1) not in visited:\r\n\t\t\t\t\tstack.append((tempx,tempy+1))\r\n\t\t\t\telif tempy-1 >= 1 and rows[tempx-1] == \">\" and (tempx,tempy-1) not in visited:\r\n\t\t\t\t\tstack.append((tempx,tempy-1))\r\n\r\n\r\n\t\t\tif len(visited)==n*m:\r\n\t\t\t\tans.add((i,j))\r\n\t\r\n\tif len(ans) == n*m:\r\n\t\tprint(\"YES\")\r\n\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n\r\n\r\nDFS(rows,columns,n,m)\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n input()\r\n horizontalStreets, verticalStreets = input(), input()\r\n firstHorizontalStreet, lastHorizontalStreet = horizontalStreets[0], horizontalStreets[-1]\r\n firstVerticalStreet, lastVerticalStreet = verticalStreets[0], verticalStreets[-1]\r\n\r\n return isBestTrafficFlowPossibleWith(firstHorizontalStreet, lastHorizontalStreet,\r\n firstVerticalStreet, lastVerticalStreet)\r\n\r\n\r\ndef isBestTrafficFlowPossibleWith(firstH, lastH, firstV, lastV):\r\n topRightBottomLeftCorners = {'<': 'v', '>': '^'}\r\n topLeftBottomRightCorners = {'<': '^', '>': 'v'}\r\n return 'NO' if firstV in (topRightBottomLeftCorners[lastH], topLeftBottomRightCorners[firstH]) or \\\r\n lastV in (topRightBottomLeftCorners[firstH], topLeftBottomRightCorners[lastH]) \\\r\n else 'YES'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "from collections import deque\r\n\r\ndic = {'>': (0, 1), '<': (0, -1), 'v': (1, 0), '^': (-1, 0)}\r\n[n, m], hor, vert = map(int, input().split()), input().strip(), input().strip()\r\nfor _x in range(n):\r\n for _y in range(m):\r\n q, d = deque([(_x, _y)]), [[0] * m for x in range(n)]\r\n d[_x][_y] = 1\r\n while q:\r\n x, y = q.popleft()\r\n for direction in '><v^':\r\n dx, dy = dic[direction]\r\n if -1 < x + dx < n and -1 < y + dy < m and (vert[y] == direction if dx else hor[x] == direction) and not d[x + dx][y + dy]:\r\n d[x + dx][y + dy] = 1\r\n q.append((x + dx, y + dy))\r\n if sum(sum(d, [])) != n * m:\r\n print('NO')\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print('YES')\r\n", "input()\r\ns1 = input()\r\ns2 = input()\r\n\r\nc = s1[0]+s1[len(s1) - 1] + s2[0] + s2[len(s2) - 1]\r\nif c == '<>v^' or c == '><^v' :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "\r\nRead = lambda:map(int, input().split())\r\n\r\nif __name__ == '__main__':\r\n while True:\r\n try:\r\n input()\r\n except:\r\n break\r\n x = input()\r\n y = input()\r\n u = (x[0] + x[-1] + y[0] + y[-1]) not in ('><^v', '<>v^')\r\n print('YNEOS'[u::2])\r\n", "n, m = map(int, input().split())\r\nrow = input()\r\ncol = input()\r\nans = 'YES'\r\n\r\nif row[0] == '<':\r\n if col[0] == '^' or col[-1] == 'v': ans = 'NO'\r\nelse:\r\n if col[0] == 'v' or col[-1] == '^': ans = 'NO'\r\nif row[-1] == '<':\r\n if col[0] == 'v'or col[-1] == '^': ans = 'NO'\r\nelse:\r\n if col[0] == '^' or col[-1] == 'v': ans = 'NO'\r\n\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\n\r\ndi=input()\r\ndj=input()\r\n\r\n\r\n\r\n\r\ndef canmove(i,j):\r\n return i>=0 and j>=0 and i<n and j<m\r\n\r\n\r\n\r\ndef dfs(i,j,visited):\r\n visited[i][j]=True\r\n pi=i\r\n pj=j\r\n if di[i]=='>':\r\n pj+=1\r\n else:\r\n pj-=1\r\n\r\n if dj[j]=='^':\r\n pi-=1\r\n else:\r\n pi+=1\r\n\r\n\r\n if canmove(pi,j) and not visited[pi][j]:\r\n dfs(pi,j,visited)\r\n\r\n if canmove(i,pj) and not visited[i][pj]:\r\n dfs(i,pj,visited)\r\n\r\n\r\n\r\n\r\ndef solve():\r\n for i in range(n):\r\n for j in range(m):\r\n visited = [[False] * m for k in range(n)]\r\n if not visited[i][j]:\r\n dfs(i,j,visited)\r\n\r\n\r\n\r\n for s in visited:\r\n for d in s:\r\n if d==False:\r\n return False\r\n\r\n return True\r\n\r\n\r\nif solve():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import collections\ntime = 0\ndef solve():\n\tn,m = map(int,input().split())\n\ts1 = input()\n\ts2 = input()\n\tdef tarjan(x,y,disc,low,stack,instack,n,m,s1,s2,res):\n\t\tglobal time\n\t\tdisc[x][y] = time\n\t\tlow[x][y] = time\n\t\tinstack[x][y] = True\n\t\tstack.append((x,y))\n\t\ttime+=1\n\t\tif s1[x]=='<' and y-1>=0:\n\t\t\tif disc[x][y-1]==-1:\n\t\t\t\ttarjan(x,y-1,disc,low,stack,instack,n,m,s1,s2,res)\n\t\t\t\tlow[x][y] = min(low[x][y-1],low[x][y])\n\t\t\telif instack[x][y-1]:\n\t\t\t\tlow[x][y] = min(low[x][y],disc[x][y-1])\n\t\tif s1[x]=='>' and y+1<m:\n\t\t\tif disc[x][y+1]==-1:\n\t\t\t\ttarjan(x,y+1,disc,low,stack,instack,n,m,s1,s2,res)\n\t\t\t\tlow[x][y] = min(low[x][y+1],low[x][y])\n\t\t\telif instack[x][y+1]:\n\t\t\t\tlow[x][y] = min(low[x][y],disc[x][y+1])\n\t\t\t\t\n\t\tif s2[y]=='^' and x-1>=0:\n\t\t\tif disc[x-1][y]==-1:\n\t\t\t\ttarjan(x-1,y,disc,low,stack,instack,n,m,s1,s2,res)\n\t\t\t\tlow[x][y] = min(low[x-1][y],low[x][y])\n\t\t\telif instack[x-1][y]:\n\t\t\t\tlow[x][y] = min(low[x][y],disc[x-1][y])\n\t\t\t\t\n\t\tif s2[y]=='v' and x+1<n:\n\t\t\tif disc[x+1][y]==-1:\n\t\t\t\ttarjan(x+1,y,disc,low,stack,instack,n,m,s1,s2,res)\n\t\t\t\tlow[x][y] = min(low[x][y],low[x+1][y])\n\t\t\telif instack[x+1][y]:\n\t\t\t\tlow[x][y] = min(low[x][y],disc[x+1][y])\n\t\tans = []\n\t\tif disc[x][y] == low[x][y]:\n\t\t\twhile stack[-1]!=(x,y):\n\t\t\t\ta = stack.pop()\n\t\t\t\tans.append(a)\n\t\t\t\tinstack[a[0]][a[1]] = False\n\t\t\ta = stack.pop()\n\t\t\tans.append(a)\n\t\t\tinstack[a[0]][a[1]] = False\n\t\t\tres.append(ans)\n\n\tlow = [[-1 for i in range(m)]for j in range(n)]\n\tdisc = [[-1 for i in range(m)]for j in range(n)]\n\tinstack = [[False for i in range(m)]for j in range(n)]\n\tstack = []\n\tres = []\n\ttarjan(0,0,disc,low,stack,instack,n,m,s1,s2,res)\n\tif len(res)==1 and len(res[0])==n*m:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\t\t\t\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n# number of test cases\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\nns=input()\r\nms=input()\r\nif(ns[0]==\"<\" and ns[n-1]==\">\" and ms[0]==\"v\" and ms[m-1]=='^'):\r\n print(\"YES\")\r\nelif(ns[0]=='>' and ms[m-1]==\"v\" and ns[n-1]==\"<\" and ms[0]==\"^\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "inl = lambda: list(map(int, input().split()))\r\n\r\nf = True\r\n\r\nn, m = inl()\r\nhss = input()\r\nvss = input()\r\n\r\nhss = [1 if i == \">\" else -1 for i in hss]\r\nvss = [1 if i == \"v\" else -1 for i in vss]\r\n\r\n\r\ndef check(i, j):\r\n v.add((i, j))\r\n for dx, dy in (i + vss[j], j), (i, j + hss[i]):\r\n if 0 <= dx < n and 0 <= dy < m and (dx, dy) not in v:\r\n check(dx, dy)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n v = set()\r\n check(i, j)\r\n if len(v) < n * m:\r\n f = False\r\n break\r\nif not f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import copy\r\nhor_ver = list(map(int, input().split(\" \")))\r\n\r\nhor = hor_ver[0]\r\nver = hor_ver[1]\r\n\r\nhor_dirs = []\r\nver_dirs = []\r\nhor_dirs.append(0)\r\nver_dirs.append(0)\r\n\r\nhors = input()\r\nfor c in hors:\r\n if c == '<':\r\n hor_dirs.append(0)\r\n else:\r\n hor_dirs.append(1)\r\nvers = input()\r\nfor c in vers:\r\n if c == '^':\r\n ver_dirs.append(0)\r\n else:\r\n ver_dirs.append(1)\r\n\r\n\r\n# print(hor_dirs)\r\n# print(ver_dirs)\r\n\r\nnodes = {}\r\nvisited_list = {}\r\nfor w in range(1, hor_ver[0] + 1):\r\n for h in range(1, hor_ver[1] + 1):\r\n nodes[(w,h)] = [hor_dirs[w], ver_dirs[h]]\r\n visited_list[(w,h)] = False\r\n\r\ndef printm(iter_visit):\r\n count = 0\r\n elems = [(x,y) for x in range (1,5) for y in range (1,7)]\r\n for e in elems:\r\n if count % 6 == 0:\r\n print(\"\")\r\n #print(e,end=' ')\r\n print(1 if iter_visit[e] else 0, end='\\t')\r\n count += 1\r\n\r\ndef traverse(node):\r\n directions = nodes[node]\r\n # print(\"\\n node is \", node, directions)\r\n q = []\r\n q.append(node)\r\n\r\n iter_visit = copy.deepcopy(visited_list)\r\n iter_visit[node] = True\r\n visited = 1\r\n\r\n # printm(iter_visit)\r\n while len(q) > 0:\r\n # print('\\n q', q)\r\n temp = q.pop(0)\r\n directions = nodes[temp]\r\n # right\r\n if directions[0] == 1:\r\n if temp[1] < ver and iter_visit[(temp[0], temp[1] + 1)] == False:\r\n # print('went right ')\r\n # print('temp ', temp, directions)\r\n new = (temp[0], temp[1] + 1)\r\n iter_visit[new] = True\r\n visited += 1\r\n q.append(new)\r\n # print(\"3new is,\", new)\r\n # left\r\n else:\r\n if not temp[1] == 1 and iter_visit[(temp[0], temp[1] - 1)] == False:\r\n # print('went left ')\r\n new = (temp[0], temp[1] -1)\r\n # print('temp ', temp, directions,new)\r\n iter_visit[new] = True\r\n visited += 1\r\n q.append(new)\r\n # up\r\n if directions[1] == 1:\r\n if temp[0] < hor and iter_visit[(temp[0] + 1, temp[1])] == False:\r\n # print('went up ')\r\n # print('temp ', temp, directions)\r\n new = (temp[0] + 1, temp[1])\r\n iter_visit[new] = True\r\n visited += 1\r\n # print(\"1new is,\", new)\r\n q.append(new)\r\n # down\r\n else:\r\n if not temp[0] == 1 and iter_visit[(temp[0] - 1, temp[1])] == False:\r\n # print('went down ')\r\n # print('temp ', temp, directions)\r\n new = (temp[0] - 1, temp[1])\r\n iter_visit[new] = True\r\n visited += 1\r\n q.append(new)\r\n # print(\"2new is,\", new)\r\n\r\n # print(\"\")\r\n # printm(iter_visit)\r\n # print(\"\")\r\n return visited\r\n\r\nwin = True\r\nfor node in nodes:\r\n totalNodes = hor_ver[0] * hor_ver[1]\r\n visited = traverse(node)\r\n # print(node)\r\n # print (\"equivalence\", visited, totalNodes)\r\n if not visited == totalNodes:\r\n win = False\r\n break\r\nif win:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def dfs(start, graph_d, visited_d):\r\n if not visited_d[start]:\r\n visited_d[start] = True\r\n for u in graph_d[start]:\r\n dfs(u, graph_d, visited_d)\r\n return visited_d\r\n\r\n\r\nn, m = map(int, input().split())\r\ns_n = input()\r\ns_m = input()\r\ngraph = [[] for i in range(n * m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s_n[i] == '>' and j < m - 1:\r\n graph[i * m + j].append(i * m + j + 1)\r\n elif s_n[i] == '<' and j > 0:\r\n graph[i * m + j].append(i * m + j - 1)\r\n if s_m[j] == '^' and i > 0:\r\n graph[i * m + j].append((i - 1) * m + j)\r\n elif s_m[j] == 'v' and i < n - 1:\r\n graph[i * m + j].append((i + 1) * m + j)\r\nis_perf = True\r\nfor i in range(n * m):\r\n visited = [False] * (n * m)\r\n res = dfs(i, graph, visited)\r\n for elem in res:\r\n if not elem:\r\n is_perf = False\r\n break\r\nif is_perf:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "def main():\n n, m = map(int, input().split())\n a = input()\n b = input()\n\n valid = (a[0] == '>' and a[-1] == '<' and b[0] == '^' and b[-1] == 'v') \\\n or (a[0] == '<' and a[-1] == '>' and b[0] == 'v' and b[-1] == '^')\n\n print(\"YES\" if valid else \"NO\")\n\nmain()\n", "#!/usr/bin/env python\r\n\r\nn,m = input().split()\r\nrow = input()\r\ncolumn = input()\r\nf1 = row[0]+row[-1]+column[0]+column[-1]\r\n#Se puede salir/llegar desde las esquinas\r\nif (f1 == \"<>v^\" or f1 == \"><^v\"):\r\n print(\"YES\")\r\nelse:#No se puede, daod que no se podrá salir de algunas esquinas\r\n print(\"NO\")\r\n", "\"\"\"\nProblem from: http://codeforces.com/problemset/problem/475/B\nB. Strongly Connected City\ntime limit per test2 seconds\nmemory limit per test256 megabytes\ninputstandard input\noutputstandard output\nImagine a city with n horizontal streets crossing m vertical streets, forming an (n - 1) × (m - 1) grid. In order to increase the traffic flow, mayor of the city has decided to make each street one way. This means in each horizontal street, the traffic moves only from west to east or only from east to west. Also, traffic moves only from north to south or only from south to north in each vertical street. It is possible to enter a horizontal street from a vertical street, or vice versa, at their intersection.\n\n\nThe mayor has received some street direction patterns. Your task is to check whether it is possible to reach any junction from any other junction in the proposed street direction pattern.\n\nInput\nThe first line of input contains two integers n and m, (2 ≤ n, m ≤ 20), denoting the number of horizontal streets and the number of vertical streets.\n\nThe second line contains a string of length n, made of characters '<' and '>', denoting direction of each horizontal street. If the i-th character is equal to '<', the street is directed from east to west otherwise, the street is directed from west to east. Streets are listed in order from north to south.\n\nThe third line contains a string of length m, made of characters '^' and 'v', denoting direction of each vertical street. If the i-th character is equal to '^', the street is directed from south to north, otherwise the street is directed from north to south. Streets are listed in order from west to east.\n\nOutput\nIf the given pattern meets the mayor's criteria, print a single line containing \"YES\", otherwise print a single line containing \"NO\".\n\nExamples\ninputCopy\n3 3\n><>\nv^v\noutputCopy\nNO\ninputCopy\n4 6\n<><>\nv^v^v^\noutputCopy\nYES\nNote\nThe figure above shows street directions in the second sample test case.\n\"\"\"\nimport heapq\nfrom copy import deepcopy\nimport random\n\n\nclass Graph():\n def __init__(self, nodes):\n self.num = nodes\n self._nodes = list(Node(x) for x in range(self.num + 1))\n self._edges = dict()\n\n def add_edge(self, start, end, weight=1):\n self._nodes[start].add_edge(self._nodes[end], weight)\n if (start, end) in self._edges:\n d = self._edges[(start, end)]\n if d['weight'] < weight:\n d['weight'] = weight\n else:\n self._edges[(start, end)] = {'weight': weight}\n\n\n def get_edge_data(self, u, v):\n return self._edges[(u,v)]\n\n def unmark_all(self):\n for node in self._nodes:\n node.unmark()\n\n def get_all_edges(self):\n return deepcopy(self._edges)\n\n def get_ad_count(self, vert):\n return self._nodes[vert].adj_c\n def nodes(self):\n return list(node.id for node in self._nodes)\n\n def neighbors(self, vert):\n return list(node.id for node in self._nodes[vert].adjacent)\n\n def dijkstra(self, start):\n q = []\n q.append(self._nodes[start])\n self._nodes[start].weight = 0\n heapq.heapify(q)\n while len(q):\n current = heapq.heappop(q)\n if current.visit:\n continue\n current.mark()\n for adj, edge_weight in current.adjacent.items():\n if not adj.visit:\n if adj.weight > current.weight + edge_weight:\n adj.weight = current.weight + edge_weight\n adj.prev = current\n heapq.heappush(q, adj)\n self.unmark_all()\n d = dict()\n for i in range(1, len(self._nodes)):\n d[i] = self._nodes[i].weight\n return d\n\n def pathfromHere(self, current):\n path = [current]\n while current.prev:\n path.append(current.prev)\n current = current.prev\n return reversed(path)\n def strongConn(self):\n self.unmark_all()\n toVisit = [self._nodes[1]]\n while len(toVisit):\n current = toVisit.pop()\n if current.visit:\n continue\n current.mark()\n for adj in current.adjacent:\n if not adj.visit:\n toVisit.append(adj)\n for n in range(len(self._nodes)):\n if n == 0:\n continue\n else:\n if self._nodes[n].visit == False:\n return False\n return True\n\n\nclass Node():\n def __init__(self,x):\n self.id = x\n self.visit = False\n self.adjacent = {}\n self.weight = float('inf')\n self.prev = None\n self.adj_c = 0\n\n # Updating adjacent edge if we have a more minimum cost one\n def add_edge(self, other, weight):\n if other not in self.adjacent:\n self.adjacent[other] = weight\n self.adj_c += 1\n elif self.adjacent[other] > weight:\n self.adjacent[other] = weight\n\n # Node comparator functions for HeapQ\n def __lt__(self, other):\n return self.weight < other.weight\n\n def __gt__(self, other):\n return self.weight > other.weight\n\n # def __eq__(self, other):\n # return self.weight == other.weight\n\n def __le__(self, other):\n return self.weight <= other.weight\n\n def __ge__(self, other):\n return self.weight >= other.weight\n\n def __ne__(self, other):\n return self.weight != other.weight\n\n def __hash__(self):\n return self.id\n\n def mark(self):\n self.visit = True\n\n def unmark(self):\n self.visit = False\n\n def __str__(self):\n return str(self.id)\n\ndetails = input().split()\nn = int(details[0])\nm = int(details[1])\ng1 = Graph(m * n)\ng2 = Graph(m * n)\nhorizontal = input()\nvertical = input()\nbase = 1\nfor h in range(n):\n if horizontal[h] == \"<\":\n for v in range(m - 1):\n g1.add_edge(base + v + 1, base + v)\n g2.add_edge(base + v, base + v + 1)\n elif horizontal[h] == \">\":\n for v in range(m - 1):\n g2.add_edge(base + v + 1, base + v)\n g1.add_edge(base + v, base + v + 1)\n base += m\nbase = 1\nfor h in range(n - 1):\n for v in range(m):\n if vertical[v] == 'v':\n g1.add_edge(base + v, base + v + m)\n g2.add_edge(base + v + m, base + v)\n elif vertical[v] == '^':\n g2.add_edge(base + v, base + v + m)\n g1.add_edge(base + v + m, base + v)\n base += m\n\nif g1.strongConn() and g2.strongConn():\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "# Problem: B. Strongly Connected City\r\n# Contest: Codeforces - Bayan 2015 Contest Warm Up\r\n# URL: https://codeforces.com/contest/475/problem/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\nn,m = [int(x) for x in input().split()]\r\ns1 = input()\r\ns2 = input()\r\ns3 = s1[0]+s1[-1]+s2[0]+s2[-1]\r\nif s3 == \"<>v^\" or s3 == \"><^v\" :\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, m = map(int, input().split())\nhorizontal = list(input())\nvertical = list(input())\n\n# Check corners\n\nif horizontal[0] == \"<\" and vertical[0] == \"^\":\n print (\"NO\")\nelif horizontal[n-1] == \"<\" and vertical[0] == \"v\":\n print (\"NO\")\nelif horizontal[0] == \">\" and vertical[m-1] == \"^\":\n print(\"NO\")\nelif horizontal[n-1] == \">\" and vertical[m-1] == \"v\":\n print(\"NO\")\nelse:\n print(\"YES\")", "def magic(arr, h1, h2, v1, v2):\r\n if h1 == '>':\r\n arr[1] += 1\r\n else:\r\n arr[0] += 1\r\n if h2 == '>':\r\n arr[3] += 1\r\n else:\r\n arr[2] += 1\r\n if v1 == '^':\r\n arr[0] += 1\r\n else:\r\n arr[2] += 1\r\n if v2 == '^':\r\n arr[1] += 1\r\n else:\r\n arr[3] += 1\r\n\r\nn, m = [int(x) for x in input().split()]\r\nh = input()\r\nv = input()\r\n# ul, ur, dl, dr\r\ncorners = [0,0,0,0]\r\n\r\nmagic(corners, h[0], h[n-1], v[0], v[m-1])\r\n\r\nprint('YES') if all(corners) else print('NO')\r\n", "line1 = list(map(int, input().split(\" \")))\r\nn = line1[0]\r\nm = line1[1]\r\nline2 = input()\r\nline3 = input()\r\n\r\next = line2[0] + line2[-1] + line3[0] + line3[-1]\r\n\r\nif ext == \"<>v^\" or ext == \"><^v\":\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "from collections import defaultdict\r\ndef instr():return input()\r\ndef solve():\r\n d=defaultdict(list)\r\n n,m=tuple(map(int,input().split()))\r\n s1=instr()\r\n s2=instr()\r\n l=[0]*(n*m)\r\n for i in range(n):\r\n for j in range(m-1):\r\n if s1[i]=='>':\r\n d[m*i+j].append(m*i+j+1);l[m*i+j+1]+=1\r\n else:\r\n d[m*i +j+1].append(m*i+j);l[m*i+j]+=1\r\n \r\n for i in range(n-1):\r\n for j in range(m):\r\n if s2[j]=='v':\r\n d[m*i+j].append(m*(i+1)+j);l[m*(i+1)+j]+=1\r\n else:\r\n d[m*(i+1)+j].append(m*i+j);l[m*i+j]+=1\r\n \r\n for i in range(m*n):\r\n if d[i]==0 or l[i]==0:return 'NO'\r\n return ('YES')\r\nprint(solve())\r\n\r\n'''\r\n4 6\r\n<><>\r\nv^v^v^\r\nNO\r\n\r\n[Program finished]\r\n'''", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\n#def input(): return sys.stdin.readline().strip()\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nn,m = ilele()\r\nS1 = input()\r\nS2 = input()\r\n\r\nV = n*m\r\nINF = float('inf')\r\n\r\nv = 0\r\nId = [[-1 for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n Id[i][j] = v\r\n v+=1\r\ngraph = [[INF]*(n*m) for i in range(n*m)]\r\n\r\ndef addEdge(a,b):\r\n i,j =a\r\n ii,jj =b\r\n id1 = Id[i][j]\r\n id2 = Id[ii][jj]\r\n graph[id1][id2] = 1\r\n\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if i==0:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"v\":\r\n if i!=n-1:\r\n addEdge((i,j),(i+1,j))\r\n elif i == n-1:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"^\":\r\n if i!=0:\r\n addEdge((i,j),(i-1,j))\r\n else:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"^\":\r\n if i!=0:\r\n addEdge((i,j),(i-1,j))\r\n else:\r\n if i!= n-1:\r\n addEdge((i,j),(i+1,j))\r\n\r\ndef floydWarshall(graph):\r\n dist = graph.copy()\r\n for k in range(V):\r\n for i in range(V):\r\n for j in range(V):\r\n dist[i][j] = min(dist[i][j],dist[i][k]+ dist[k][j])\r\n return dist\r\n\r\nAns = floydWarshall(graph)\r\nfor i in Ans:\r\n if INF in i:\r\n Y(0)\r\n exit(0)\r\nY(1)\r\n\r\n\r\n", "\r\nn, m = map(int, input().split())\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nif s1[0] == '>' and s1[-1] == '<' and s2[0] == '^' and s2[-1] == 'v':\r\n print(\"YES\")\r\nelif s1[0] == '<' and s1[-1] == '>' and s2[0] == 'v' and s2[-1] == '^':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\r\n x, y = map(int, input().split())\r\n s1 = input(); s2 = input()\r\n s3 = s1[0]+s1[-1]+s2[0]+s2[-1]\r\n print(\"YES\" if s3 == \"<>v^\" or s3 == \"><^v\" else \"NO\")\r\n\r\nsolve()\r\n", "n,m = map(int, input().split())\r\nh = [i for i in input()]\r\nv = [i for i in input()]\r\nlis = [[0 for i in range(m)] for j in range(n)] \r\ndef dfs(i,j):\r\n global lis\r\n if i<0 or j < 0 or i >= n or j>= m:\r\n return\r\n if lis[i][j]:\r\n return \r\n # print(i,j, lis[i][j]) \r\n lis[i][j] = 1\r\n if h[i] == '>':\r\n dfs(i, j+1) \r\n if h[i] == '<':\r\n dfs(i,j-1)\r\n if v[j] == '^':\r\n dfs(i-1, j) \r\n if v[j] == 'v':\r\n dfs(i+1, j) \r\ndfs(0,0)\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n dfs(i,j)\r\n for i in range(n):\r\n for j in range(m):\r\n if lis[i][j] != 1:\r\n flag = 1\r\n break\r\n \r\n lis = [[0 for i in range(m)] for j in range(n)]\r\n\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n# for item in lis:\r\n# print(item) \r\n", "a, b = map(int, input().split(' '))\r\nhor = input()\r\nver = input()\r\nif (hor[0], ver[0]) == ('>', 'v') or (hor[0], ver[-1]) == ('<', 'v'):\r\n print(\"NO\")\r\nelif (hor[-1], ver[0]) == ('>', '^') or (hor[-1], ver[-1]) == ('<', '^'):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\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,m=f()\r\nbf=si()\r\nud=si()\r\nx=bf[0]+ud[-1]+bf[-1]+ud[0]\r\nif x in ['>v<^', '<^>v']:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import defaultdict, deque\n\ndef build_graph(n, m, h, v): \n graph = defaultdict(list)\n\n for i in range(n):\n start = 0 if h[i] == '>' else m-1\n end = m if h[i] == '>' else -1\n step = 1 if h[i] == '>' else -1\n for j in range(start, end, step):\n if j + step < m and j + step >= 0:\n graph[(i,j)].append((i, j + step))\n\n for j in range(m):\n start = 0 if v[j] == 'v' else n-1\n end = n if v[j] == 'v' else -1\n step = 1 if v[j] == 'v' else -1\n for i in range(start, end, step):\n if i + step < n and i + step >= 0:\n graph[(i,j)].append((i + step, j))\n return graph\n\ndef bfs(start, graph):\n q = deque([start])\n visited = set([start])\n reached_count = 0\n while q:\n node = q.popleft()\n for child in graph[node]:\n if child not in visited:\n visited.add(child)\n q.append(child)\n reached_count += 1\n return reached_count\n\ndef solve(n, m, graph):\n for i in range(n):\n for j in range(m):\n if bfs((i,j), graph) != n*m:\n return False\n return True\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n\n h = [None]*n\n v = [None]*m\n\n h_lines = input()\n for i, line in enumerate(h_lines):\n h[i] = line\n v_lines = input()\n for i, line in enumerate(v_lines):\n v[i] = line\n \n graph = build_graph(n, m, h, v)\n if(solve(n, m, graph)):\n print(\"YES\")\n else:\n print(\"NO\")", "#input\r\nn,m=map(int,input().split())\r\nnstr=str(input())\r\nmstr=str(input())\r\n\r\n#variables\r\n\r\n#main\r\nif nstr[0]=='>' and mstr[0]=='v':\r\n\tprint('NO')\r\n\tquit()\r\nif nstr[0]=='<' and mstr[-1]=='v':\r\n\tprint('NO')\r\n\tquit()\r\nif nstr[-1]=='>' and mstr[0]=='^':\r\n\tprint('NO')\r\n\tquit()\r\nif nstr[-1]=='<' and mstr[-1]=='^':\r\n\tprint('NO')\r\n\tquit()\r\nprint('YES')", "input()\nhoriz = input()\nvert = input()\n\nm = horiz[0]+horiz[-1]+vert[0]+vert[-1]\n\nprint(\"YES\" if m in (\"><^v\", \"<>v^\") else \"NO\")\n\t \t \t \t \t \t \t\t \t \t \t\t", "# CF BAYAN WARMUP\r\n# B\r\n\r\nl = input()\r\nh = input()\r\nv = input()\r\n\r\nif h[0] == \"<\" and v[0] == \"^\":\r\n print(\"NO\")\r\nelif h[0] == \">\" and v[-1] == \"^\":\r\n print(\"NO\")\r\nelif h[-1] == \"<\" and v[0] == \"v\":\r\n print(\"NO\")\r\nelif h[-1] == \">\" and v[-1] == \"v\":\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n,m=map(int,input().split())\r\ns=input()\r\ns1=input()\r\nif s[0]==\">\" and s[-1]==\"<\" and s1[0]==\"^\" and s1[-1]==\"v\" or s[0]==\"<\" and s[-1]==\">\" and s1[0]==\"v\" and s1[-1]==\"^\" :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "def main():\n\tn, m = input().split(\" \")\n\thorizontal = int(n)\n\tvertical = int(m)\n\n\tew_streets = []\n\tns_streets = []\n\n\tew = input()\n\tns = input()\n\n\tfor h in range(horizontal):\n\t\tew_streets.append(ew[h])\n\tfor v in range (vertical):\n\t\tns_streets.append(ns[v])\n\n\tprint(junctions(ew_streets, ns_streets))\n\ndef junctions(ew, ns):\n\tmult = len(ew) > 1 and len(ns) > 1\n\n\tif mult:\n\t\tif ew[0] == \"<\" and ns[0] == \"^\":\n\t\t\treturn \"NO\"\n\t\telif ew[0] == \">\" and ns[len(ns)-1] == \"^\":\n\t\t\treturn \"NO\"\n\t\telif ew[len(ew)-1] == \">\" and ns[len(ns)-1] != \"^\":\n\t\t\treturn \"NO\"\n\t\telif ew[len(ew)-1] == \"<\" and ns[0] != \"^\":\n\t\t\treturn \"NO\"\n\n\treturn \"YES\"\n\n\nmain()", "def canMove(i,j):\r\n return i>=0 and i<n and j>=0 and j<m\r\ndef dfsMaze(pi,pj):\r\n seen[pi][pj]=True\r\n tovisit=[]\r\n tovisit.append((pi,pj))\r\n while(tovisit):\r\n node=tovisit.pop()\r\n if list[node[0]][node[1]][0]==\"<\" and list[node[0]][node[1]][1]==\"v\":\r\n di=[0,1]\r\n dj=[-1,0]\r\n for p in range(2): \r\n neighi=node[0]+di[p]\r\n neighj=node[1]+dj[p]\r\n if canMove(neighi,neighj) and not seen[neighi][neighj]:\r\n tovisit.append((neighi,neighj))\r\n seen[neighi][neighj]=True\r\n elif list[node[0]][node[1]][0]==\"<\" and list[node[0]][node[1]][1]==\"^\":\r\n di=[-1,0]\r\n dj=[0,-1]\r\n for p in range(2): \r\n neighi=node[0]+di[p]\r\n neighj=node[1]+dj[p]\r\n if canMove(neighi,neighj) and not seen[neighi][neighj]:\r\n tovisit.append((neighi,neighj))\r\n seen[neighi][neighj]=True\r\n elif list[node[0]][node[1]][0]==\">\" and list[node[0]][node[1]][1]==\"^\":\r\n di=[-1,0]\r\n dj=[0,1]\r\n for p in range(2): \r\n neighi=node[0]+di[p]\r\n neighj=node[1]+dj[p]\r\n if canMove(neighi,neighj) and not seen[neighi][neighj]:\r\n tovisit.append((neighi,neighj))\r\n seen[neighi][neighj]=True\r\n elif list[node[0]][node[1]][0]==\">\" and list[node[0]][node[1]][1]==\"v\":\r\n di=[1,0]\r\n dj=[0,1]\r\n for p in range(2): \r\n neighi=node[0]+di[p]\r\n neighj=node[1]+dj[p]\r\n if canMove(neighi,neighj) and not seen[neighi][neighj]:\r\n tovisit.append((neighi,neighj))\r\n seen[neighi][neighj]=True\r\n\r\n \r\n \r\n\r\nn,m,=map(int,input().split())\r\nmaze1=list(input())\r\nmaze2=list(input())\r\nlist=[[[\".\",\".\"]for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n list[i][j][0]=maze1[i]\r\nfor i in range(m):\r\n for j in range(n):\r\n list[j][i][1]=maze2[i]\r\n# list=[[(\"<\",\"v\"),(\"<\",\"^\"),(\"<\",\"v\"),(\"<\",\"^\"),(\"<\",\"v\"),(\"<\",\"^\")],\r\n# [(\">\",\"v\"),(\">\",\"^\"),(\">\",\"v\"),(\">\",\"^\"),(\">\",\"v\"),(\">\",\"^\")],\r\n# [(\"<\",\"v\"),(\"<\",\"^\"),(\"<\",\"v\"),(\"<\",\"^\"),(\"<\",\"v\"),(\"<\",\"^\")],\r\n# [(\">\",\"v\"),(\">\",\"^\"),(\">\",\"v\"),(\">\",\"^\"),(\">\",\"v\"),(\">\",\"^\")]]\r\ntest=True\r\nfor i in range(n):\r\n if (not test):break\r\n for j in range(m):\r\n if (not test):break\r\n seen=[[False]*m for _ in range(n)]\r\n dfsMaze(i,j)\r\n for i in range(n):\r\n if (not test):break\r\n for j in range(m):\r\n if seen[i][j]==False:\r\n test=False\r\n break \r\n\r\nif test :\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "m, n = map(int, input().split())\r\new = input()\r\nns = input()\r\n\r\nif ew[0] == '>' and ns[-1] == '^':\r\n print('NO')\r\nelif ew[0] == '<' and ns[0] == '^':\r\n print('NO')\r\nelif ew[-1] == '>' and ns[-1] == 'v':\r\n print('NO')\r\nelif ew[-1] == '<' and ns[0] == 'v':\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "def main():\n n, m = map(int, input().split())\n nm = n * m\n neigh = [[] for _ in range(nm)]\n for y, c in enumerate(input()):\n for x in range(y * m + 1, y * m + m):\n if c == '<':\n neigh[x].append(x - 1)\n else:\n neigh[x - 1].append(x)\n for x, c in enumerate(input()):\n for y in range(m + x, nm, m):\n if c == '^':\n neigh[y].append(y - m)\n else:\n neigh[y - m].append(y)\n\n def getdsu(t):\n if dsu[t] != t:\n dsu[t] = getdsu(dsu[t])\n return dsu[t]\n\n def setdsu(u, v):\n dsu[u] = getdsu(dsu[v])\n\n def dfs(yx):\n l[yx] = False\n for yx1 in neigh[yx]:\n if l[yx1]:\n setdsu(yx1, yx)\n dfs(yx1)\n\n for i in range(nm):\n l = [True] * nm\n dsu = list(range(nm))\n for j in range(i, i + nm):\n j %= nm\n if l[j]:\n dfs(j)\n if any(getdsu(_) != i for _ in range(nm)):\n print('NO')\n return\n print('YES')\n\n\nif __name__ == '__main__':\n main()", "n, m = map(int, input().split())\r\n\r\nh = list(input())\r\nv = list(input())\r\n\r\nvisited = [False for i in range(n * m)]\r\n\r\noutput = True\r\n\r\ndef explore(x, y):\r\n\tif visited[x * m + y] == False:\r\n\t\tvisited[x * m + y] = True\r\n\t\tif h[x] == '<':\r\n\t\t\tif y != 0:\r\n\t\t\t\texplore(x, y - 1)\r\n\t\telse:\r\n\t\t\tif y != len(v) - 1:\r\n\t\t\t\texplore(x, y + 1)\r\n\t\tif v[y] == '^':\r\n\t\t\tif x != 0:\r\n\t\t\t\texplore(x - 1, y)\r\n\t\telse:\r\n\t\t\tif x != len(h) - 1:\r\n\t\t\t\texplore(x + 1, y)\r\n\r\nfor i in range(n * m):\r\n\tvisited = [False for i in range(n * m)]\r\n\texplore(i // m, i % m)\r\n\tif visited != [True for i in range(n * m)]:\r\n\t\toutput = False\r\n\r\nif output == True:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "data = input().split()\r\nn = int(data[0])\r\nm = int(data[1])\r\nh = input().rstrip()\r\nv = input().rstrip()\r\nf = (h[0] == '<' and v[0] == 'v' and v[-1] == '^' and h[-1] == '>') or (h[0] == '>' and v[0] == '^' and v[-1] == 'v' and h[-1] == '<')\r\nprint('YES' if f else 'NO')", "n,m=map(int,input().split())\r\n\r\na=input()\r\nb=input()\r\n\r\nif a[0]=='>' and a[n-1]=='<' and b[0]=='^' and b[m-1]=='v':\r\n print (\"YES\")\r\nelif a[n-1]=='>' and a[0]=='<' and b[m-1]=='^' and b[0]=='v':\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "calles = input().split(\" \")\r\nhori = int(calles[0])\r\nvert = int(calles[1])\r\n\r\ndir_hori = input()\r\ndir_vert = input()\r\n\r\nnodos = hori*vert\r\nL_ady = {}\r\n\r\nfor i in range(hori):\r\n\tif dir_hori[i] == \">\":\r\n\t\tfor j in range(vert):\r\n\t\t\tL_ady[(i,j)] = []\r\n\t\t\t\r\n\t\t\tif j != vert-1:\r\n\t\t\t\tL_ady[(i,j)].append((i,j+1))\r\n\t\t\t\t\r\n\t\t\tif i != 0 and dir_vert[j] == \"^\": \r\n\t\t\t\tL_ady[(i,j)].append((i-1,j))\r\n\t\t\t\t\r\n\t\t\telif i != hori-1 and dir_vert[j] == \"v\":\r\n\t\t\t\tL_ady[(i,j)].append((i+1,j))\r\n\t\t\t\t\r\n\t\t\t\r\n\telse:\r\n\t\tfor j in range(vert):\r\n\t\t\tL_ady[(i,j)] = []\r\n\t\t\t\r\n\t\t\tif j != 0: \r\n\t\t\t\tL_ady[(i,j)].append((i,j-1))\r\n\t\t\t\t\r\n\t\t\tif i != 0 and dir_vert[j] == \"^\":\r\n\t\t\t\tL_ady[(i,j)].append((i-1,j))\r\n\t\t\t\t\t\r\n\t\t\telif i != hori-1 and dir_vert[j] == \"v\":\r\n\t\t\t\tL_ady[(i,j)].append((i+1,j))\r\n\t\t\t\t\r\n\r\n\r\ndef recorrer(nodo,l):\r\n\tl.append(nodo)\r\n\t\r\n\tfor conexion in L_ady[nodo]:\r\n\t\t\r\n\t\tif conexion not in l:\r\n\t\t\trecorrer(conexion,l)\r\n\t\t\t\r\n\tif len(l) == len(L_ady):\r\n\t\treturn True\r\n\t\t\r\ndef ejecutar():\r\n\tfor mi_nodo in L_ady:\r\n\t\tl = []\r\n\t\ta = recorrer(mi_nodo,l)\r\n\t\tif a == None:\r\n\t\t\tprint (\"NO\")\r\n\t\t\treturn\r\n\t\t\t\r\n\tprint(\"YES\")\r\n\r\nejecutar()", "def dfs(x, y):\r\n if not graph[2][x + graph[0][x][y]][y]:\r\n graph[2][x + graph[0][x][y]][y] = True\r\n dfs(x + graph[0][x][y], y)\r\n if not graph[2][x][y + graph[1][x][y]]:\r\n graph[2][x][y + graph[1][x][y]] = True\r\n dfs(x, y + graph[1][x][y])\r\n \r\nn, m = list(map(int, input().split()))\r\nc = chr(0)\r\nflag1 = True\r\ngraph = [[[0] * (n + 1) for i in range(m + 1)], [[0] * (n + 1) for i in range(m + 1)], [[False] * (n + 1) for i in range(m + 1)]]\r\n\r\ns = input()\r\nfor i in range(n):\r\n c = s[i]\r\n if c == '<':\r\n for j in range(1, m):\r\n graph[0][j][i] = -1\r\n else:\r\n for j in range(m - 1):\r\n graph[0][j][i] = 1\r\n \r\ns = input()\r\nfor i in range(m):\r\n c = s[i]\r\n if c == '^':\r\n for j in range(1, n):\r\n graph[1][i][j] = -1\r\n else:\r\n for j in range(n - 1):\r\n graph[1][i][j] = 1\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n flag = False\r\n if flag1:\r\n for k in range(n):\r\n for l in range(m):\r\n graph[2][l][k] = False\r\n graph[2][j][i] = True\r\n dfs(j, i)\r\n for k in range(n):\r\n for l in range(m):\r\n if graph[2][l][k] == False:\r\n flag = True\r\n # print(i, j, k, l)\r\n if flag:\r\n print('NO')\r\n flag1 = not flag\r\n\r\nif flag1:\r\n print('YES')\r\n \r\n#print()\r\n#for i in range(n):\r\n #for j in range(m):\r\n #print(graph[0][j][i], end = ' ')\r\n #print()\r\n#print()\r\n#for i in range(n):\r\n #for j in range(m):\r\n #print(graph[1][j][i], end = ' ')\r\n #print()\r\n ", "import math\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nimport bisect\r\nsys.setrecursionlimit(1000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\n\r\n\r\nG =defaultdict(list)\r\ndef addEdge(a,b):\r\n G[a].append(b)\r\n \r\n\r\ndef DFSutil(node,vis):\r\n vis[node] = True\r\n \r\n for child in G.get(node,[]):\r\n if vis.get(child,True) == False:\r\n DFSutil(child,vis)\r\n \r\ndef dfs(points):\r\n vis = {}\r\n for i in range(n):\r\n for j in range(m):\r\n vis[(i,j)] = False\r\n #print(vis)\r\n DFSutil((0,0),vis)\r\n #print(vis)\r\n return all(vis.values())\r\n\r\nn,m = ilele()\r\nS1 = input()\r\nS2 = input()\r\nif n==m==1:\r\n print(\"YES\")\r\nelif (S1[0] == \"<\" and S2[0] == \"^\") or (S1[0] == \">\" and S2[-1] == \"^\") or (S1[-1] == \"<\" and S2[0] == \"v\") or (S1[-1] == \">\" and S2[-1] == \"v\"):\r\n print(\"NO\")\r\nelse:\r\n for i in range(n):\r\n for j in range(m):\r\n if i==0:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"v\":\r\n if i!=n-1:\r\n addEdge((i,j),(i+1,j))\r\n elif i == n-1:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"^\":\r\n if i!=0:\r\n addEdge((i,j),(i-1,j))\r\n else:\r\n if S1[i] == \">\":\r\n if j!=m-1:\r\n addEdge((i,j),(i,j+1))\r\n else:\r\n if j!=0:\r\n addEdge((i,j),(i,j-1))\r\n if S2[j] == \"^\":\r\n if i!=0:\r\n addEdge((i,j),(i-1,j))\r\n else:\r\n if i!= n-1:\r\n addEdge((i,j),(i+1,j))\r\n #print(G)\r\n points = n*m\r\n if dfs(points):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n ", "n,m=list(map(int,input().split()))\r\ns1=input()\r\ns2=input()\r\n\r\n\r\nvisited=[[False]*m for i in range(n)]\r\n\r\ndef canmove(i,j):\r\n return i>=0 and j>=0 and i<n and j<m\r\ndef dfs(i,j,visited):\r\n visited[i][j]=True\r\n xi=i\r\n xj=j\r\n if s1[i] == \">\":\r\n xj = j + 1\r\n else:\r\n xj = j - 1\r\n if s2[j] == \"^\":\r\n xi = i - 1\r\n else:\r\n xi = i + 1\r\n\r\n\r\n\r\n\r\n \r\n if canmove(xi, j) and not visited[xi][j]:\r\n dfs(xi, j, visited)\r\n\r\n if canmove(i, xj) and not visited[i][xj]:\r\n dfs(i, xj, visited)\r\n\r\n\r\n\r\ndef solve():\r\n for i in range(n):\r\n for j in range(m):\r\n visited=[[False for j in range(m)] for i in range(n)]\r\n dfs(i,j,visited)\r\n\r\n \r\n for x in range(n):\r\n for y in range(m):\r\n if not visited[x][y]:\r\n return False\r\n return True\r\n\r\n\r\nif solve():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, m = map(int, input().split())\nhorizontal = input()\nvertical = input()\nvisited = [[0 for j in range(m)] for i in range(n)]\ndef isSafe(x, y):\n if x >= 0 and y >= 0 and x < n and y < m:\n return True\n return False\ndef explore(i, j):\n visited[i][j] = 1\n if isSafe(i + 1, j) and vertical[j] == \"v\" and visited[i + 1][j] == 0:\n explore(i + 1, j)\n if isSafe(i - 1, j) and vertical[j] == \"^\" and visited[i - 1][j] == 0:\n explore(i - 1, j)\n if isSafe(i, j + 1) and horizontal[i] == \">\" and visited[i][j + 1] == 0:\n explore(i, j+1)\n if isSafe(i, j - 1) and horizontal[i] == \"<\" and visited[i][j - 1] == 0:\n explore(i, j - 1)\nexplore(0, 0)\nt1 = 0\nfor i in range(n):\n for j in range(m):\n if visited[i][j] == 0:\n t1 += 1\nvisited = [[0 for j in range(m)] for i in range(n)]\nexplore(n - 1, m - 1)\nt2 = 0\nfor i in range(n):\n for j in range(m):\n if visited[i][j] == 0:\n t2 += 1\nif t1 > 0 or t2 > 0:\n print(\"NO\")\nelse:\n print(\"YES\")", "# 475B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\nstdin.readline()\r\np = stdin.readline().strip()\r\nq = stdin.readline().strip()\r\nprint('YES' if (p[0] == '>' and p[-1] == '<' and q[0] == '^' and q[-1] == 'v') or\r\n (p[0] == '<' and p[-1] == '>' and q[0] == 'v' and q[-1] == '^') else 'NO')", "class CodeforcesTask475BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.horizontal = ''\n self.vertical = ''\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n self.horizontal = input()\n self.vertical = input()\n\n def process_task(self):\n if self.horizontal[0] == \">\" and self.vertical[-1] == \"^\":\n self.result = \"NO\"\n elif self.horizontal[-1] == \">\" and self.vertical[-1] == \"v\":\n self.result = \"NO\"\n elif self.horizontal[0] == \"<\" and self.vertical[0] == \"^\":\n self.result = \"NO\"\n elif self.horizontal[-1] == \"<\" and self.vertical[0] == \"v\":\n self.result = \"NO\"\n else:\n self.result = \"YES\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask475BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "y,x=map(int,input().split())\r\ns1=input()\r\ns2=input()\r\ns3 = s1[0] + s1[-1] + s2[0] + s2[-1]\r\nif s3==\"<>v^\" or s3==\"><^v\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\ns1 = input()\r\ns2 = input()\r\ns3 = s1[0]+s1[-1]+s2[0]+s2[-1]\r\nprint((s3==\"<>v^\" or s3==\"><^v\") and \"YES\" or \"NO\")", "entry = input()\r\nh = input()\r\nv = input()\r\nif h[0] == \"<\" and h[-1] == \">\":\r\n if v[0] == \"v\" and v[-1] == \"^\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif h[0] == \">\" and h[-1] == \"<\":\r\n if v[0] == \"^\" and v[-1] == \"v\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nsn=input()\r\nsm=input()\r\ncir=sn[0]+sm[0]+sn[-1]+sm[-1]\r\nif cir==\"<v>^\" or cir==\">^<v\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\ns1=input()\r\ns2=input()\r\ns3=''\r\ns3+=s1[0]+s2[-1]+s1[-1]+s2[0]\r\nprint(\"YES\" if s3==\"<^>v\" or s3==\">v<^\" else \"NO\")", "n,m = list(map(int,input().split()))\r\nmat = [[['0','0'] for i in range(m)]for i in range(n)]\r\nrow = input()\r\ncol = input()\r\nfor i in range(n):\r\n for j in range(m):\r\n mat[i][j] = [row[i],col[j]]\r\nmp = {'<':-1,'>':1,'v':-1,'^':1}\r\n\r\nans = 0\r\nfor i in range(n-1,-1,-1):\r\n for j in range(m):\r\n visited = [[False for i in range(m)]for j in range(n)]\r\n q = [[i,j]]\r\n visited[i][j] = True\r\n cnt = 1\r\n while q!=[]:\r\n x,y = q[0][0],q[0][1]\r\n q.pop(0)\r\n u,v = mat[n-1-x][y][0],mat[n-1-x][y][1]\r\n u,v = mp[u],mp[v]\r\n u,v = v,u\r\n if x+u>=0 and x+u<n:\r\n if(visited[x+u][y]==False):\r\n visited[x+u][y] = True\r\n q.append([x+u,y])\r\n cnt+=1\r\n if y+v>=0 and y+v<m:\r\n if(visited[x][y+v]==False):\r\n visited[x][y+v] = True\r\n q.append([x,y+v])\r\n cnt+=1\r\n if cnt==n*m:\r\n ans+=1\r\nif ans==n*m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import itertools\r\nimport math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(s, n, m):\r\n used = [0 for i in range(n * m)]\r\n used[s] = 1\r\n q = [s]\r\n it = 0\r\n while it < len(q):\r\n k = q[it]\r\n for u in g[k]:\r\n if used[u] == 0:\r\n used[u] = 1\r\n q.append(u)\r\n it += 1\r\n\r\n if 0 not in used:\r\n return 1\r\n else:\r\n return 0\r\n\r\n def h(y, x, m):\r\n return m * y + x\r\n\r\n n, m = map(int, input().split())\r\n\r\n g = [[] for i in range(n * m)]\r\n\r\n row = str(input())\r\n col = str(input())\r\n\r\n for i in range(n):\r\n if row[i] == \">\":\r\n for k in range(m - 1):\r\n f, s = h(i, k, m), h(i, k + 1, m)\r\n g[f].append(s)\r\n else:\r\n for k in range(m - 1, 0, -1):\r\n f, s = h(i, k, m), h(i, k - 1, m)\r\n g[f].append(s)\r\n\r\n for i in range(m):\r\n if col[i] == \"v\":\r\n for k in range(n - 1):\r\n f, s = h(k, i, m), h(k + 1, i, m)\r\n g[f].append(s)\r\n else:\r\n for k in range(n - 1, 0, -1):\r\n f, s = h(k, i, m), h(k - 1, i, m)\r\n g[f].append(s)\r\n\r\n if sum([bfs(i, n, m) for i in range(n * m)]) == n * m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\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, m = map(int, input().split())\r\nh, v = input(), input()\r\nif h[0] == '<' and v[0] == '^':\r\n print('NO')\r\nelif h[0] == '>' and v[0] == 'v':\r\n print('NO')\r\nelif h[0] == h[-1] or v[0] == v[-1]:\r\n print('NO')\r\nelse:\r\n print('YES')", "import sys\r\nmod = 1000000007\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline()\r\ndef print_array(a): print(\" \".join(map(str, a)))\r\ndef connected(graph, x):\r\n visited = [False] * len(graph)\r\n visited[x] = True\r\n q = []\r\n q.append(graph[x])\r\n while q:\r\n temp = q.pop(0)\r\n for e in temp:\r\n if not visited[e]:\r\n visited[e] = True\r\n q.append(graph[e])\r\n return False if False in visited else True\r\ndef main():\r\n n, m = get_ints()\r\n h = input()\r\n v = input()\r\n graph = [[] for _ in range(n * m)]\r\n intersections = [[m * i + x for x in range(m)] for i in range(n)]\r\n for i in range(n):\r\n if h[i] == '>':\r\n for j in range(1, m): graph[intersections[i][j - 1]].append(intersections[i][j])\r\n else:\r\n for j in range(1, m): graph[intersections[i][j]].append(intersections[i][j - 1])\r\n for i in range(m):\r\n if v[i] == 'v':\r\n for j in range(1, n): graph[intersections[j - 1][i]].append(intersections[j][i])\r\n else:\r\n for j in range(1, n): graph[intersections[j][i]].append(intersections[j - 1][i])\r\n flag = True\r\n for i in range(0, n * m):\r\n flag = flag & connected(graph, i)\r\n if not flag: break\r\n print(\"YES\" if flag else \"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "def dfs(node,visited,horizontal,vertical):\n r,c=node\n visited[r][c]=True\n children=[]\n if r>0 and vertical[c]==\"^\":\n children.append([r-1,c])\n\n if r<len(horizontal)-1 and vertical[c]==\"v\":\n children.append([r+1,c])\n\n if c>0 and horizontal[r]==\"<\":\n children.append([r,c-1])\n\n if c<len(vertical)-1 and horizontal[r]==\">\":\n children.append([r,c+1])\n\n for child in children:\n rr,cc=child\n if not visited[rr][cc]:\n dfs(child,visited,horizontal,vertical)\n \n \n\ndef is_possible(horizontal,vertical):#\n \n \n for r in range(len(horizontal)):\n for c in range(len(vertical)):\n visited=[[False for i in range(len(vertical))] for j in range(len(horizontal))]\n \n dfs([r,c],visited,horizontal,vertical)\n \n for r1 in range(len(horizontal)):\n for c1 in range(len(vertical)):\n if not visited[r1][c1]:\n return False\n\n return True\n\nh,v = list(map(int,input().strip().split()))\nstr1=input()\nstr2=input()\n\nvertical=[]\nhorizontal=[]\nfor chara in str1:\n horizontal.append(chara)\n\nfor chara in str2:\n vertical.append(chara)\npossible=is_possible(horizontal,vertical)\nif possible :\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", "inp = list(map(int, (input().split())))\r\n\r\nn = list(input())\r\n\r\nm = list(input())\r\n\r\nif ((n[0] == '<' and m[0] == '^') or (n[0] == '>' and m[-1] == '^') or (n[-1] == '<' and m[0] == 'v') or (n[-1] == '>' and m[-1] == 'v')):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def main():\n n,m = list(map(int, input().split(\" \")))\n rows = list(input())\n columns = list(input())\n\n if (rows[0] == \">\" and columns[0] == \"v\"):\n return \"NO\"\n elif (rows[-1] == \">\" and columns[0] == \"^\"):\n return \"NO\"\n elif (rows[0] == \"<\" and columns[-1] == \"v\"):\n return \"NO\"\n elif (rows[-1] == \"<\" and columns[-1] == \"^\"):\n return \"NO\"\n return \"YES\"\n\n\nif (__name__ == '__main__'):\n print(main())\n\t\t\t \t \t\t \t\t\t \t\t\t \t \t\t\t\t \t\t", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\nhor = [1 if char == \">\" else -1 for char in input()]\r\nvert = [1 if char == \"v\" else -1 for char in input()]\r\n\r\ndef solve(n, m, hor, vert):\r\n for r in range(n):\r\n for c in range(m):\r\n if not explore(n, m, hor, vert, (r,c)):\r\n return False\r\n return True\r\n\r\ndef explore(n, m, hor, vert, start_pos):\r\n visited = [[0] * m for _ in range(n)]\r\n count = 0\r\n nodes = deque([start_pos])\r\n visited[start_pos[0]][start_pos[1]] = 1\r\n\r\n while nodes:\r\n r, c = nodes.popleft()\r\n count += 1\r\n\r\n r_inc, c_inc = vert[c], hor[r]\r\n\r\n for dr, dc in [(r + r_inc, c), (r, c + c_inc)]:\r\n if 0 <= dr < n and 0 <= dc < m and not visited[dr][dc]:\r\n nodes.append((dr, dc))\r\n visited[dr][dc] = 1\r\n\r\n return count == n*m\r\n\r\n\r\n\r\nif solve(n, m, hor, vert):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nn, m = (int(x) for x in sys.stdin.readline().split())\n\nhdir = [(-1 if c == '<' else 1) for c in sys.stdin.readline()[:-1]]\nvdir = [(-1 if c == '^' else 1) for c in sys.stdin.readline()[:-1]]\n\ngoal = n*m\n\n# check every starting position\nfor i in range(m):\n for j in range(n):\n visited = set()\n queue = [(i, j)]\n while len(queue) != 0:\n start = queue.pop()\n if start in visited:\n continue\n visited.add(start)\n x = start[0]\n y = start[1]\n\n newX = x + hdir[y]\n newY = y + vdir[x]\n if newX >= 0 and newX < m:\n queue.append((newX, y))\n if newY >= 0 and newY < n:\n queue.append((x, newY))\n if len(visited) != goal:\n print('NO')\n sys.exit(0)\nprint('YES')\n\n", "import sys\r\ninput = lambda :sys.stdin.readline().rstrip('\\r\\n')\r\nn,m = map(int,input().split())\r\nd = {\"<\":0,\">\":1}# left right\r\ne = {\"^\":0,\"v\":1}# up down\r\ndir1 = list(map(lambda x:d[x],input()))\r\ndir2 = list(map(lambda x:e[x],input()))\r\ncheck = lambda x,y:x>=0 and x<n and y>=0 and y<m\r\ndef dfs(i,j,vis):\r\n if not check(i,j):\r\n return;\r\n if vis[i][j]:\r\n return;\r\n vis[i][j]=True\r\n if dir1[i]:\r\n dfs(i,j+1,vis)\r\n else:\r\n dfs(i,j-1,vis)\r\n if dir2[j]:\r\n dfs(i+1,j,vis)\r\n else:\r\n dfs(i-1,j,vis)\r\nfl=True\r\nfor i in range(n):\r\n for j in range(m):\r\n vis = [[False]*(m) for _ in range(n)]\r\n dfs(i,j,vis)\r\n if not all([all(i) for i in vis]):\r\n fl=False\r\n break\r\n break\r\nprint(\"YES\" if fl else \"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = input()[:-1]\r\nb = input()[:-1]\r\nif a[0] + a[-1] == '<>' and b[0] + b[-1] == 'v^' or a[0] + a[-1] == '><' and b[0] + b[-1] == '^v':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/python\nfrom copy import copy\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\ndef done(covered):\n for r in covered:\n for c in r:\n if not c:\n return False\n return True\n\n\ndef check(r, c, covered):\n if r < 0 or c < 0 or r >= len(covered[0]) or c >= len(covered):\n return False\n\n if done(covered):\n return True\n\n if rdirs[r] == 'l':\n if cdirs[c] == 'u':\n return check(r-1, c, copy(covered)) or check(r, c-1, copy(covered))\n else:\n return check(r-1, c, copy(covered)) or check(r, c+1, copy(covered))\n else:\n if cdirs[c] == 'u':\n return check(r+1, c, copy(covered)) or check(r, c-1, copy(covered))\n else:\n return check(r+1, c, copy(covered)) or check(r, c+1, copy(covered))\n\ndef bettercheck(rdirs, cdirs):\n if rdirs[0] == 'l' and cdirs[0] == 'd' and rdirs[-1] == 'r' and cdirs[-1] == 'u':\n print('YES')\n exit(0)\n if rdirs[0] == 'r' and cdirs[0] == 'u' and rdirs[-1] == 'l' and cdirs[-1] == 'd':\n print('YES')\n exit(0)\n print('NO')\n\nif __name__ == '__main__':\n (r, c) = rints()\n rdirs = ['l' if r=='<' else 'r' for r in rstr()]\n cdirs = ['u' if r=='^' else 'd' for r in rstr()]\n\n bettercheck(rdirs, cdirs)\n", "import sys\r\nmod = 1000000007\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline()\r\ndef print_array(a): print(\" \".join(map(str, a)))\r\ndef main():\r\n n, m = get_ints()\r\n h = input()\r\n v = input()\r\n s = h[0] + h[n - 1] + v[0] + v[m - 1]\r\n print(\"YES\" if s == \"<>v^\" or s == \"><^v\" else \"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "def main():\r\n n,m = map(int,input().split())\r\n s1 = input();s2 = input()\r\n s = \"\"\r\n s = s1[0]+s1[-1]+s2[0]+s2[-1]\r\n if s=='<>v^' or s=='><^v' :\r\n print('YES')\r\n else :\r\n print('NO') \r\nmain()", "def AddEdges(direction,i,m,graph):\r\n if direction == '>':\r\n for j in range(m-1):\r\n graph[(i+1,j+1)].append((i+1,j+2))\r\n else:\r\n for j in range(m-1,0,-1):\r\n graph[(i+1,j+1)].append((i+1,j))\r\n\r\ndef AddEdgesVer(direction,i,n,graph):\r\n if direction == '^':\r\n for j in range(n-1,0,-1):\r\n graph[(j+1,i+1)].append((j,i+1))\r\n else:\r\n for j in range(n-1):\r\n graph[(j+1,i+1)].append((j+2,i+1))\r\n \r\n\r\ndef IsConnected(graph,curr):\r\n isVisited = {}\r\n for i in graph:\r\n isVisited[i] = False\r\n cmpnts = []\r\n stack = [curr]\r\n while stack:\r\n curr = stack.pop()\r\n if not isVisited[curr]:\r\n isVisited[curr] = True\r\n cmpnts.append(curr)\r\n for kid in graph[curr]:\r\n stack.append(kid)\r\n #print (cmpnts)\r\n if len(cmpnts) == len(graph.keys()):\r\n return True\r\n return False\r\n\r\ndef Solve(graph):\r\n\r\n count = 0\r\n for i in graph:\r\n if IsConnected(graph,i):\r\n count += 1\r\n if count == len(graph):\r\n print ('YES')\r\n return\r\n print ('NO')\r\n\r\ndef main():\r\n graph = {}\r\n n,m = map(int,input().split())\r\n for i in range(n):\r\n for j in range(m):\r\n graph[(i+1,j+1)] = []\r\n\r\n \r\n horizontal = input()\r\n vertical = input()\r\n\r\n for i in range(n):\r\n direction = horizontal[i]\r\n AddEdges(direction,i,m,graph)\r\n\r\n for i in range(m):\r\n direction = vertical[i]\r\n AddEdgesVer(direction,i,n,graph)\r\n\r\n Solve(graph)\r\n\r\nmain()\r\n", "m,n = map(int, input().split())\r\n\r\nc = input()\r\nr = input()\r\n\r\n\r\nif ((c[0]=='>' and c[-1]=='<' and r[0]=='^' and r[-1]=='v') or \r\n (c[0]=='<' and c[-1]=='>' and r[0]=='v' and r[-1]=='^')):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "num_rows, num_columns = input().split(\" \")\nnum_rows = int(num_rows)\nnum_columns = int(num_columns)\n\nrows = input()\ncolumns = input()\n\nnw_corner = [rows[0], columns[0]]\nsw_corner = [rows[num_rows-1], columns[0]]\nse_corner = [rows[num_rows-1], columns[num_columns-1]]\nne_corner = [rows[0], columns[num_columns-1]]\n\nnw_is_reachable = nw_corner != [\">\", \"v\"]\nsw_is_reachable = sw_corner != [\">\", \"^\"]\nse_is_reachable = se_corner != [\"<\", \"^\"]\nne_is_reachable = ne_corner != [\"<\", \"v\"]\n\nif nw_is_reachable and sw_is_reachable and se_is_reachable and ne_is_reachable:\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", "import collections\r\n\r\ndef bfs(graph, start):\r\n visited = set()\r\n q = collections.deque()\r\n q.append(start)\r\n while q:\r\n curr = q.pop()\r\n if curr not in visited:\r\n visited.add(curr)\r\n q.extend(graph[curr])\r\n return len(visited)\r\n\r\ndef add_neighbors(graph, start, end, direc):\r\n for i in range(start, end, direc):\r\n graph[i].append(i + direc)\r\n\r\nrows, cols = map(int, input().split())\r\n\r\ngraph = {} # maps node name to neighbors\r\nfor r in range(rows):\r\n for c in range(cols):\r\n graph[cols * r + c] = []\r\n\r\n# create graph representation\r\nrow_dir = input()\r\nfor i in range(rows): # horizontal neighbors\r\n if row_dir[i] == \">\":\r\n add_neighbors(graph, i * cols, i * cols + cols - 1, 1)\r\n else:\r\n add_neighbors(graph, i * cols + cols - 1, i * cols, -1)\r\n\r\ncol_dir = input()\r\nfor i in range(cols):\r\n if col_dir[i] == \"v\":\r\n add_neighbors(graph, i, i + (rows - 1) * cols, cols)\r\n else:\r\n add_neighbors(graph, i + (rows - 1) * cols, i, -cols)\r\n\r\n# bfs through every node to see if it's possible to reach all nodes from each\r\n# node\r\nreach_all = True\r\nfor r in range(rows):\r\n for c in range(cols):\r\n if rows * cols != bfs(graph, r * cols + c):\r\n reach_all = False\r\n\r\nif reach_all:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def main():\r\n n,m = map(int,input().split())\r\n s1 = input();s2 = input()\r\n g = [list() for _ in range(n*m)]\r\n for i in range(n):\r\n if s1[i]=='>' :\r\n for j in range(m-1) : g[i*m+j].append(i*m+(j+1))\r\n else :\r\n for j in range(m-1) : g[(i+1)*m-j-1].append((i+1)*m-j-2) \r\n for i in range(m):\r\n if s2[i]=='v':\r\n for j in range(n-1) : g[i+j*m].append(i+(j+1)*m) \r\n else :\r\n for j in range(n-1,0,-1) : g[(j)*m+i].append((j-1)*m+i) \r\n for i in g :\r\n if len(i)==0 :\r\n print('NO')\r\n return\r\n print('YES') \r\nmain()", "import sys\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\nhs, vs = inl()\r\nhss = input()\r\nvss = input()\r\n\r\nhss = [1 if i == \">\" else -1 for i in hss]\r\nvss = [1 if i == \"v\" else -1 for i in vss]\r\n\r\n\r\ndef dfs(i, j):\r\n v.add((i, j))\r\n for p in (i + vss[j], j), (i, j + hss[i]):\r\n if p not in v and 0 <= p[0] < hs and 0 <= p[1] < vs:\r\n dfs(p[0], p[1])\r\n\r\n\r\nfor k in range(hs):\r\n for l in range(vs):\r\n v = set()\r\n dfs(k, l)\r\n if len(v) != hs * vs:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "size = input()\r\nhor = input()\r\nver = input()\r\noutput = \"Yes\"\r\ndirs = [hor[0]+ver[0],hor[0]+ver[-1],hor[-1]+ver[-1],hor[-1]+ver[0]]\r\nwrong =['<^','>^','>v','<v']\r\n\r\nfor i in range(len(wrong)):\r\n # print(output)\r\n if dirs[i] == wrong[i]:\r\n output = \"No\"\r\n break\r\nprint(output)", "\"\"\"\nSolution to the 475B problem on CodeForces.\n\"\"\"\nimport sys\nimport math\n\ndef initialize_matrix(num_rows, num_cols):\n return [[[0, 0] for _ in range(num_cols)] for _ in range(num_rows)]\n\ndef solver(matrix):\n for row in matrix:\n for i, o in row:\n if (i == 0 or o == 0):\n return \"NO\"\n return \"YES\"\n\ndef main():\n num_rows, num_cols = map(int, input().split())\n matrix = initialize_matrix(num_rows, num_cols)\n rows = input()\n count = 0\n for char in rows:\n if char == \">\":\n for i in range(len(matrix[count])):\n matrix[count][i][0] += 1\n matrix[count][i][1] += 1\n matrix[count][0][0] -= 1\n matrix[count][len(matrix[count])-1][1] -= 1\n else:\n for i in range(len(matrix[count])):\n matrix[count][i][0] += 1\n matrix[count][i][1] += 1\n matrix[count][0][1] -= 1\n matrix[count][len(matrix[count])-1][0] -= 1\n count += 1\n\n cols = input()\n count = 0\n for char in cols:\n if char == \"v\":\n for row in matrix:\n row[count][0] += 1\n row[count][1] += 1\n matrix[0][count][0] -= 1\n matrix[len(matrix)-1][count][1] -= 1\n else:\n for row in matrix:\n row[count][0] += 1\n row[count][1] += 1\n matrix[0][count][1] -= 1\n matrix[len(matrix)-1][count][0] -= 1\n count += 1\n\n print(solver(matrix))\n\n\nif __name__ == \"__main__\":\n main()", "import sys\n\nN, M = [int(n) for n in next(sys.stdin).strip().split()]\n\nhorizd = next(sys.stdin).strip()\nvertid = next(sys.stdin).strip()\n\nadj = [set() for i in range(N * M)]\n\nfor r, h in enumerate(horizd):\n for c, v in enumerate(vertid):\n idx = r * M + c\n if h == \"<\":\n if c != 0:\n adj[idx].add(idx - 1)\n else:\n if c != M - 1:\n adj[idx].add(idx + 1)\n if v == \"^\":\n if r != 0:\n adj[idx].add((r - 1) * M + c)\n else:\n if r != N - 1:\n adj[idx].add((r + 1) * M + c)\nrev = [False] * len(adj)\nfor l in adj:\n for e in l:\n rev[e] = True\n\nif False in rev:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n,m=map(int,input().split())\r\ns=input()\r\nt=input()\r\nif (s[0]=='>' and t[0]=='v') or (s[0]=='<' and t[0]=='^') or (s[0]=='>' and t[m-1]=='^') or (s[0]=='<' and t[m-1]=='v') or (s[n-1]=='>' and t[0]=='^') or (s[n-1]=='<' and t[0]=='v'):\r\n print(\"NO\")\r\nelse:print(\"YES\")", "n, m = map(int, input().split())\r\nhorizontal = list(input())\r\nvertical = list(input())\r\n\r\npos_0_0 = horizontal[0] == \">\" or vertical[0] == \"v\"\r\npos_0_m = horizontal[0] == \"<\" or vertical[m - 1] == \"v\"\r\npos_n_0 = horizontal[n - 1] == \">\" or vertical[0] == \"^\"\r\npos_n_m = horizontal[n - 1] == \"<\" or vertical[m - 1] == \"^\"\r\n\r\nif pos_0_0 and pos_0_m and pos_n_0 and pos_n_m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\n\r\nN, M = map(int, stdin.readline().strip().split())\r\nreq = [[[-1, -1] for __ in range(M)] for __ in range(N)]\r\ninput1 = stdin.readline().strip()\r\ninput2 = stdin.readline().strip()\r\nfor i in range(N):\r\n curx = 1 if input1[i] == '>' else -1\r\n for j in range(M):\r\n cury = -1 if input2[j] == '^' else 1\r\n req[i][j] = [cury, curx]\r\ncondn = True\r\nfor i in range(N):\r\n for j in range(M):\r\n notVisited = [[True for __ in range(M)] for __ in range(N)]\r\n count = (N*M) - 1\r\n stack = [(i,j)]\r\n notVisited[i][j] = False\r\n while stack:\r\n curX, curY = stack.pop()\r\n modX, modY = curX+req[curX][curY][0], curY+req[curX][curY][1]\r\n if modX >= 0 and modX < N and notVisited[modX][curY]:\r\n stack.append((modX, curY))\r\n notVisited[modX][curY] = False\r\n count -= 1\r\n if modY >=0 and modY < M and notVisited[curX][modY]:\r\n stack.append((curX, modY))\r\n notVisited[curX][modY] = False\r\n count -= 1\r\n if count:\r\n condn = False\r\n break\r\n if not condn:\r\n break\r\nif condn:\r\n stdout.write(\"YES\")\r\nelse:\r\n stdout.write(\"NO\")\r\n\r\n\r\n\r\n\r\n", "h, w = map(int, input().split())\r\ngo = [[[] for x in range(w)] for y in range(h)]\r\ns = input()\r\nfor i in range(h):\r\n if s[i] == '>':\r\n for j in range(w - 1):\r\n go[i][j].append((i, j + 1))\r\n else:\r\n for j in range(1, w):\r\n go[i][j].append((i, j - 1))\r\ns = input()\r\nfor i in range(w):\r\n if s[i] == '^':\r\n for j in range(1, h):\r\n go[j][i].append((j - 1, i))\r\n else:\r\n for j in range(h - 1):\r\n go[j][i].append((j + 1, i))\r\n\r\ngood = True\r\nfor i in range(h):\r\n for j in range(w):\r\n u = [[False for x in range(w)] for y in range(h)]\r\n u[i][j] = True\r\n q = [(i, j)]\r\n hd = 0\r\n while hd < len(q):\r\n for g in go[q[hd][0]][q[hd][1]]:\r\n if not u[g[0]][g[1]]:\r\n u[g[0]][g[1]] = True\r\n q.append(g)\r\n hd += 1\r\n if len(q) != h * w:\r\n good = False\r\n\r\n\r\nprint(\"YES\" if good else \"NO\")", "n, m = [int(x) for x in input().split()]\r\n# print(n)\r\n# print(m)\r\nh = input()\r\nv = input()\r\n# print(h)\r\n# print(v)\r\ncon = h[0] + v[0] + h[n - 1] + v[m - 1]\r\n\r\nif con == '<v>^' or con == '>^<v':\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = [int(x) for x in input().split()]\r\na = input()\r\nb = input()\r\nif a[0] == '<' and b[0] == 'v' and a[-1] == '>' and b[-1] == '^':\r\n\tprint('YES')\r\nelif a[0] == '>' and b[-1] == 'v' and a[-1] == '<' and b[0] == '^':\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "import sys\nimport math\n\n# G\n\ncrossable = True\n# Check 4 borders\n\nn, m = [int(i) for i in input().split()]\n\nhorizontal_dirs = input()\nvertical_dirs = input()\n\n\ntop_left = horizontal_dirs[0] + vertical_dirs[0]\ntop_right = horizontal_dirs[0] + vertical_dirs[-1]\n\nbottom_left = horizontal_dirs[-1] + vertical_dirs[0]\nbottom_right =horizontal_dirs[-1] + vertical_dirs[-1]\nif(top_left == \"<^\"):\n crossable = False\nelif(top_right == \">^\"):\n crossable = False\nif(bottom_left == \"<v\"):\n crossable = False\nelif(bottom_right == \">v\"):\n crossable = False\n\n\n# Check if >>>>> or <<<<<, etc\nif len(set(horizontal_dirs)) == 1:\n crossable = False\nelif len(set(vertical_dirs)) == 1:\n crossable = False\n\nprint([\"NO\", \"YES\"][crossable])\n\n\t \t \t \t\t\t\t\t\t\t \t\t \t \t\t\t\t", "from collections import deque\r\n\r\n#n = 3\r\n#m = 3\r\n#row_dirs = \"><>\"\r\n#row_dirs = \"<<<\"\r\n#col_dirs = \"V^V\"\r\n#n = 4\r\n#m = 6\r\n#row_dirs = \"<><>\"\r\n#col_dirs = \"V^V^V^\"\r\nn, m = map(int,input().split())\r\nrow_dirs=input()\r\ncol_dirs=input()\r\n\r\n\r\ndef bfs_check(i, j, n, m):\r\n global row_dirs\r\n global col_dirs\r\n\r\n visited = set()\r\n que = deque()\r\n count = 0\r\n\r\n que.append( (i,j) )\r\n visited.add( (i,j) )\r\n\r\n while len(que):\r\n \r\n i,j = que.popleft()\r\n count += 1\r\n \r\n ni = i + ( - 1 if col_dirs[j] == \"^\" else 1 )\r\n if (ni, j) not in visited:\r\n if 0<= ni < n and 0<= j < m:\r\n visited.add( (ni,j) )\r\n que.append( (ni,j) )\r\n \r\n nj = j + (1 if row_dirs[i] == \">\" else -1)\r\n if (i, nj) not in visited:\r\n if 0<= i < n and 0<= nj < m:\r\n visited.add( (i,nj) )\r\n que.append( (i,nj) )\r\n\r\n return count == n * m \r\nans=True\r\nfor i in range(n):\r\n for j in range(m):\r\n ans= ans and bfs_check(i,j, n,m)\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/python3\n\nimport sys\n\n\"\"\"\n4 6\n<><>\nv^v^v^\n\"\"\"\n\ndef num_of_accessible(g, node):\n q = [node]\n seen = set([node])\n while len(q) > 0:\n v = q.pop()\n for u in g[v]:\n if u in seen:\n continue\n seen.add(u)\n q.append(u)\n return len(seen)\n\nif __name__ == '__main__':\n n, m = map(int, sys.stdin.readline().split())\n horiz = sys.stdin.readline().strip()\n vert = sys.stdin.readline().strip()\n \n # Graph\n g = {(i, j): [] for i in range(n) for j in range(m)}\n for i, h in enumerate(horiz):\n if h == '<':\n for j in range(m-1):\n g[(i, j+1)].append((i, j))\n else:\n for j in range(m-1):\n g[(i, j)].append((i, j+1))\n for j, v in enumerate(vert):\n if v == 'v':\n for i in range(n-1):\n g[(i, j)].append((i+1, j))\n else:\n for i in range(n-1):\n g[(i+1, j)].append((i, j))\n \n conn = True\n for node in g:\n if num_of_accessible(g, node) < n*m:\n conn = False\n break\n \n print('YES' if conn else 'NO')\n ", "n, m = map(int, input().split())\r\nx = input()\r\ny = input()\r\n\r\n#if n == 1 and m != 1 or n != 1 and m == 1:\r\n#\tprint(\"YES\")\r\n\r\nresp = x[0] + y[-1] + x[-1] + y[0]\r\n\r\nif resp in (\">v<^\", \"<^>v\"):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from collections import defaultdict\r\n \r\nclass Graph:\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n \r\n def addEdge(self,u,v):\r\n self.graph[u].append(v)\r\n \r\n def DFSUtil(self, v,visited,path):\r\n visited[v]=1\r\n path.append(v)\r\n for neighbour in self.graph[v]:\r\n if visited[neighbour]==0:\r\n self.DFSUtil(neighbour,visited,path)\r\n \r\n #DFSUtil in case finding Connected components\r\n def DFSUtilConnect(self, temp, v, visited):\r\n visited[v] = 1\r\n # Store the vertex to list\r\n temp.append(v)\r\n for neighbour in self.graph[v]:\r\n if visited[neighbour]==0:\r\n # Update the list\r\n temp = self.DFSUtilConnect(temp, neighbour, visited)\r\n return temp\r\n \r\n \r\n # 1.Handling A Disconnected Graph: \r\n def DFS(self,numVertex):\r\n visited=defaultdict(lambda:0)\r\n path=[]\r\n for vertex in range(1,numVertex+1):\r\n if visited[vertex]==0:\r\n self.DFSUtil(vertex,visited,path) \r\n return path\r\n \r\n # 2.DFS from a vertex \r\n # def DFS(self,vertex):\r\n # path=[]\r\n # visited=defaultdict(lambda:0)\r\n # self.DFSUtil(vertex,visited,path)\r\n # return path\r\n \r\n # 1. Handling A Disconnected Graph:\r\n # def BFS(self,numVertex):\r\n # visited=defaultdict(lambda:0)\r\n # queue=[]\r\n # for i in range(1,numVertex+1):\r\n # if visited[i]==0:\r\n # queue.append(i)\r\n # visited[i]=1\r\n # while queue:\r\n # u=queue.pop(0)\r\n # print(u,end=' ')\r\n # for v in self.graph[u]:\r\n # if visited[v]==0:\r\n # queue.append(v)\r\n # visited[v]=1\r\n # 2. BFS from a vertex\r\n def BFS(self,vertex):\r\n visited = defaultdict(lambda:0)\r\n queue=[]\r\n queue.append(vertex)\r\n visited[vertex]=1\r\n path=[]\r\n while queue:\r\n u=queue.pop(0)\r\n path.append(u)\r\n for v in self.graph[u]:\r\n if visited[v]==0:\r\n queue.append(v)\r\n visited[v]=1\r\n return path\r\n \r\n \r\n def connectedComponentsBFS(self,numVertex):\r\n visited=defaultdict(lambda:0)\r\n stack=[]\r\n path=[]\r\n for i in range(1,numVertex+1):\r\n if visited[i]==0:\r\n stack.append(i)\r\n visited[i]=1\r\n temp=[]\r\n while stack:\r\n u=stack.pop()\r\n temp.append(u)\r\n for v in self.graph[u]:\r\n if visited[v]==0:\r\n stack.append(v)\r\n visited[v]=1\r\n path.append(temp)\r\n return path\r\n \r\n \r\n def connectedComponentsDFS(self,numVertex):\r\n path=[]\r\n visited=defaultdict(lambda:0)\r\n for vertex in range(1,numVertex+1):\r\n if visited[vertex] == 0:\r\n temp = []\r\n path.append(self.DFSUtilConnect(temp, vertex, visited))\r\n return path\r\n\r\ng=Graph()\r\nn,m=list(map(int,input().split()))\r\ns1=input()\r\nfor i in range(n):\r\n if s1[i]==\"<\":\r\n for j in range(m*(i+1),m*i+1,-1):\r\n g.addEdge(j,j-1)\r\n else:\r\n for j in range(i*m+1,(i+1)*m):\r\n g.addEdge(j,j+1)\r\ns2=input()\r\nfor i in range(m):\r\n if s2[i]==\"v\":\r\n for j in range(i+1,i+1+(n-2)*m+1,m):\r\n g.addEdge(j,j+m)\r\n else:\r\n for j in range(i+1+(n-1)*m,i+1,-m):\r\n g.addEdge(j,j-m)\r\n\r\nfor i in range(1,n*m+1):\r\n path=g.BFS(i)\r\n if len(path)<n*m:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n \r\n\r\n", "def bfs(a,b,i,j,n,m):\r\n queue = [[i,j]]\r\n mark = {i:{j:False for j in range(m)} for i in range(n)}\r\n n,m=n-1,m-1\r\n res = 0\r\n while queue:\r\n q = queue.pop(0)\r\n x,y = q[0],q[1]\r\n if mark[x][y]==True:\r\n continue\r\n mark[x][y]=True\r\n res+=1\r\n if a[x]=='<':\r\n if y>0:\r\n if mark[x][y-1]==False:\r\n queue.append([x,y-1])\r\n else:\r\n if y<m:\r\n if mark[x][y+1]==False:\r\n queue.append([x,y+1])\r\n if b[y]=='^':\r\n if x>0:\r\n if mark[x-1][y]==False:\r\n queue.append([x-1,y])\r\n else:\r\n if x<n:\r\n if mark[x+1][y]==False:\r\n queue.append([x+1,y])\r\n return res\r\nn,m = map(int,input().split())\r\na = {i:x for i,x in enumerate(input())}\r\nb = {i:x for i,x in enumerate(input())}\r\noh = n*m\r\nfor i in range(n):\r\n for j in range(m):\r\n res = bfs(a,b,i,j,n,m)\r\n if res!=oh:\r\n print('NO')\r\n from sys import exit\r\n exit()\r\nprint('YES')", "import sys\r\nsys.setrecursionlimit(20000)\r\n\r\ndef dfs(s,adj,visited):\r\n a,b = s\r\n if visited[a][b] : return\r\n visited[a][b] = 1\r\n for s2 in adj[s]:\r\n dfs(s2,adj,visited)\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n adj = {}\r\n for i in range(n):\r\n for j in range(m):\r\n adj[(i,j)] = []\r\n s1,s2 = input(),input()\r\n for i in range(n):\r\n for j in range(m):\r\n if s1[i] == '<':\r\n if j > 0:\r\n adj[(i,j)].append((i,j-1))\r\n else:\r\n if j+1 < m:\r\n adj[(i,j)].append((i,j+1))\r\n \r\n for j in range(m):\r\n for i in range(n):\r\n if s2[j] == '^':\r\n if i > 0:\r\n adj[(i,j)].append((i-1,j))\r\n else:\r\n if i+1<n:\r\n adj[(i,j)].append((i+1,j))\r\n \r\n visited = [ [0 for i in range(m)] for j in range(n)]\r\n check = [[1 for i in range(m)] for j in range(n) ]\r\n ans = True\r\n for i in range(n):\r\n \tfor j in range(m):\r\n \t\tvisited = [ [0 for i in range(m)] for j in range(n)]\r\n \t\tdfs((i,j),adj,visited)\r\n \t\tans &= (visited == check)\r\n \r\n print(\"YES\" if ans else \"NO\")\r\n \r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "r, c = map(int, input().split())\r\nrow = input()\r\ncol = input()\r\nif((row[0]==\">\" and col[-1]==\"^\") or (row[-1]==\">\" and col[-1]==\"v\") or (row[0]==\"<\" and col[0]==\"^\") or (row[-1]==\"<\" and col[0]==\"v\")):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, m = map(int, input().split())\na = input()\nb = input()\nif (a[0] == '>' and b[0] == 'v') or (a[0] == '<' and b[-1] == 'v') or (a[-1] == '>' and b[0] == '^') or (a[-1] == '<' and b[-1] == '^'):\n print('NO')\nelse:\n print('YES')\n", "n,m=map(int,input().split())\r\nrow=[el for el in input()]\r\ncol=[el for el in input()]\r\nf=True\r\ndef check(x,y):\r\n seen.add((x,y))\r\n dx,dy=(1 if col[y]==\"v\" else -1),(1 if row[x]==\">\" else -1)\r\n nx,ny=dx+x,y\r\n if 0<=nx<n and 0<=ny<m and (nx,ny) not in seen:\r\n check(nx,ny)\r\n nx,ny=x,dy+y\r\n if 0<=nx<n and 0<=ny<m and (nx,ny) not in seen:\r\n check(nx,ny)\r\nfor i in range(n):\r\n for j in range(m):\r\n seen=set()\r\n check(i,j)\r\n if len(seen)<n*m:\r\n f=False\r\n break\r\nif not f:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n ", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nif (b[0] == \"<\" and c[0] == \"^\") or (b[0] == \">\" and c[-1] == \"^\"):\r\n print(\"NO\")\r\nelif (b[-1] == \"<\" and c[0] == \"v\") or (b[-1] == \">\" and c[-1] == \"v\"):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "'''\r\nCreated on Oct 6, 2014\r\n\r\n@author: nod\r\n'''\r\nn, m = map(int, input().split())\r\nhorizontal = str(input())\r\nvisited = []\r\nh = []\r\nvertical = str(input())\r\nv = []\r\nfor char in horizontal:\r\n if char == \">\":\r\n h.append(int(1))\r\n else:\r\n h.append(int(-1))\r\nfor char in vertical:\r\n if char == \"v\":\r\n v.append(int(1))\r\n else:\r\n v.append(int(-1))\r\ndef travel(ni, mi):\r\n leftright = h[ni]\r\n updown = v[mi]\r\n visited.append([ni,mi])\r\n newn = ni + updown\r\n newm = mi + leftright\r\n if newn >= 0 and newn < n and [newn,mi] not in visited:\r\n# print(newn,mi)\r\n travel(newn,mi)\r\n if newm >= 0 and newm < m and [ni,newm] not in visited:\r\n# print(ni,newm)\r\n travel(ni,newm)\r\n return visited\r\n\r\ndef solve():\r\n lst = [[0,0],[0,m-1],[n-1,0],[n-1,m-1]]\r\n visited = []\r\n for l in lst:\r\n visited.clear()\r\n vis = travel(l[0],l[1])\r\n if len(vis) != m*n:\r\n print(\"NO\")\r\n return\r\n visited.clear()\r\n vis.clear()\r\n print(\"YES\")\r\nsolve()", "n , m = map(int,input().split())\nhor = list(input())\nver = list(input())\ngraph={}\n\nfor i in range(n):\n\n if hor[i] == \">\":\n for j in range(m-1):\n graph[j+(i*m)] = [j+(i*m)+1]\n else:\n for j in range(m-1,0,-1):\n graph[j+(i*m)] = [j+(i*m)-1]\n\nfor i in range(m):\n if ver[i] == \"v\":\n for j in range(n-1):\n if not i+j*m in graph:\n graph[i+j*m]= []\n graph[i+j*m].append(i+(j+1)*m)\n else:\n for j in range(n-1,-1,-1):\n if not i+j*m in graph:\n graph[i+j*m]= []\n if i+(j-1)*m >= 0:\n graph[i+j*m].append(i+(j-1)*m)\n \n\n\ndef dfs(_graph,s,visited):\n visited.add(s)\n if s not in _graph:\n return\n for x in _graph[s]:\n if x not in visited:\n dfs(_graph,x,visited)\n\nfor i in range(n*m):\n visited= set()\n dfs(graph,i,visited)\n if len(visited) != n*m:\n print(\"NO\")\n exit(0)\nprint(\"YES\")\n\n", "n,m=map(int,input().split())\r\nv=[x for x in input()]\r\ns=[x for x in input()]\r\nif (v[0]=='<' and s[0]=='^')or(v[0]=='>' and s[m-1]=='^')or(v[n-1]=='<' and s[0]=='v')or(v[n-1]=='>' and s[m-1]=='v'):\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=list(map(int,input().split()))\r\ndi=input()\r\ndj=input()\r\ndef canmove(i,j):\r\n return i>=0 and j>=0 and i<n and j<m\r\ndef dfs(i,j,seen):\r\n seen[i][j]=True\r\n pi=i\r\n pj=j\r\n if di[i]=='>':\r\n pj+=1\r\n else:\r\n pj-=1\r\n\r\n if dj[j]=='^':\r\n pi-=1\r\n else:\r\n pi+=1\r\n if canmove(pi,j) and not seen[pi][j]:\r\n dfs(pi,j,seen)\r\n if canmove(i,pj) and not seen[i][pj]:\r\n dfs(i,pj,seen)\r\ndef solve():\r\n for i in range(n):\r\n for j in range(m):\r\n seen = [[False] * m for k in range(n)]\r\n if not seen[i][j]:\r\n dfs(i,j,seen)\r\n for row in seen:\r\n for b in row:\r\n if b==False:\r\n return False\r\n\r\n return True\r\nif solve():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n n, m = map(int, input().split())\n nm = n * m\n neigh = [[] for _ in range(nm)]\n for y, c in enumerate(input()):\n for x in range(y * m + 1, y * m + m):\n if c == '<':\n neigh[x].append(x - 1)\n else:\n neigh[x - 1].append(x)\n for x, c in enumerate(input()):\n for y in range(m + x, nm, m):\n if c == '^':\n neigh[y].append(y - m)\n else:\n neigh[y - m].append(y)\n\n def dfs(yx):\n l[yx] = False\n for yx1 in neigh[yx]:\n if l[yx1]:\n dfs(yx1)\n\n for i in range(nm):\n l = [True] * nm\n dfs(i)\n if any(l):\n print('NO')\n return\n print('YES')\n\n\nif __name__ == '__main__':\n main()", "import sys\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\nhs, vs = inl()\r\nh_streets = input()\r\nv_streets = input()\r\n\r\nh_streets = [1 if i == \">\" else -1 for i in h_streets]\r\nv_streets = [1 if i == \"v\" else -1 for i in v_streets]\r\n\r\n\r\ndef dfs(i, j):\r\n seen.add((i, j))\r\n next_ps = [(i + v_streets[j], j), (i, j + h_streets[i])]\r\n\r\n for p in next_ps:\r\n if p[0] in range(hs) and p[1] in range(vs) and p not in seen:\r\n dfs(p[0], p[1])\r\n\r\n\r\nf = True\r\nfor i in range(hs):\r\n for j in range(vs):\r\n\r\n seen = set()\r\n dfs(i, j)\r\n if len(seen) < hs * vs:\r\n f = False\r\n break\r\nif not f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n,m = input().split(\" \")\nn = int(n) -1\nm = int(m) -1\n\nh = input()\nv = input()\n\nmov = h[0]+v[m]+h[n]+v[0]\n\nif mov == \">v<^\" or mov == \"<^>v\":\n print(\"YES\")\nelse:\n print(\"NO\")", "input_1 = input().split()\r\n[n, m] = list(map(int, input_1))\r\ninput_n = input()\r\ninput_m = input()\r\nn_list = [*input_n]\r\nm_list = [*input_m]\r\n\r\nif (n_list[0] == \"<\" and m_list[0] == \"^\") or (n_list[0] == \">\" and m_list[m - 1] == \"^\") or (n_list[n - 1] == \">\" and m_list[m - 1] == \"v\") or (n_list[n - 1] == \"<\" and m_list[0] == \"v\"):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#!/usr/bin/python3\n\nn, m = input().split()\nn = int(n)\nm = int(m)\n\nif n == m == 1:\n print(\"YES\")\nelse:\n x, y = input(), input()\n x = (1 if x[0] == '<' else 0, 1 if x[-1] == '>' else 0)\n y = (1 if y[0] == 'v' else 0, 1 if y[-1] == '^' else 0)\n if (sum(x) + sum(y)) % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "n,m=map(int,input().split())\na=input()\nb=input()\n\nrj=str(a[0]+a[-1]+b[0]+b[-1])\n##print(rj)\n\nif rj=='<>v^' or rj=='><^v':\n print('YES')\n\nelse:\n print('NO')\n\n \t \t\t\t \t \t\t \t \t \t \t\t", "def dfs(i,visited,g,p):\r\n q = [i]\r\n while q :\r\n j = q.pop()\r\n if visited[j] : continue\r\n visited[j]=1\r\n for k in g[j] :\r\n if not visited[k] :\r\n q.append(k)\r\n if all(visited[i] for i in range(p)): return True\r\n else : return False\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n s1 = input();s2 = input()\r\n g = [list() for _ in range(n*m)]\r\n for i in range(n):\r\n if s1[i]=='>' :\r\n for j in range(m-1) : g[i*m+j].append(i*m+(j+1))\r\n else :\r\n for j in range(m-1) : g[(i+1)*m-j-1].append((i+1)*m-j-2) \r\n for i in range(m):\r\n if s2[i]=='v':\r\n for j in range(n-1) : g[i+j*m].append(i+(j+1)*m) \r\n else :\r\n for j in range(n-1,0,-1) : g[(j)*m+i].append((j-1)*m+i) \r\n for i in range(n*m) :\r\n visited = [0]*(n*m)\r\n if not dfs(i,visited,g,n*m) :\r\n print('NO');return\r\n print(\"YES\") \r\nmain()", "import sys\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\nn, m = inl()\r\nrow = [el for el in input()]\r\ncol = [el for el in input()]\r\nf = True\r\n\r\n\r\ndef check(x, y):\r\n seen.add((x, y))\r\n dx, dy = (1 if col[y] == \"v\" else -1), (1 if row[x] == \">\" else -1)\r\n nx, ny = dx + x, y\r\n if 0 <= nx < n and 0 <= ny < m and (nx, ny) not in seen:\r\n check(nx, ny)\r\n nx, ny = x, dy + y\r\n if 0 <= nx < n and 0 <= ny < m and (nx, ny) not in seen:\r\n check(nx, ny)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n seen = set()\r\n check(i, j)\r\n if len(seen) < n * m:\r\n f = False\r\n break\r\nif not f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "dimensions = input().split(' ')\nn = int(dimensions[0])\nm = int(dimensions[1])\n\ndir_horiz = input()\ndir_vert = input()\n\nanswer = True\n\n#top right to top left\nif not (dir_horiz[0] == '<' or (dir_vert[0] == '^' and dir_vert[-1] == 'v' and '<' in dir_horiz)):\n\tanswer = False\n#bottom left to bottom right\nif not (dir_horiz[-1] == '>' or (dir_vert[0] == '^' and dir_vert[-1] == 'v' and '>' in dir_horiz)):\n\tanswer = False\n#top left to bottom left\nif not (dir_vert[0] == 'v' or (dir_horiz[0] == '>' and dir_horiz[-1] == '<' and 'v' in dir_vert)):\n\tanswer = False\n#bottom right to top right\nif not (dir_vert[-1] == '^' or (dir_horiz[0] == '>' and dir_horiz[-1] == '<' and '^' in dir_vert)):\n\tanswer = False\n\t\nif answer:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n", "u , v = map(int, input().split())\r\ns1 = input()\r\ns2 = input()\r\nresult = s1[0] + s2[-1] + s1[-1] + s2[0]\r\nprint('YES' if result in ('>v<^','<^>v') else 'NO')", "from collections import deque\n\nn, m = map(int, input().split())\n\ns1 = input()\ns2 = input()\n\nok = True\n\nfor i in range(n):\n for j in range(m):\n c = [[False for _ in range(m)] for __ in range(n)]\n c[i][j] = True\n\n q = deque()\n q.append((i, j))\n\n while len(q) > 0:\n x, y = q.popleft()\n\n if s1[x] == '>' and y + 1 < m and not c[x][y + 1]:\n c[x][y + 1] = True\n q.append((x, y + 1))\n elif s1[x] == '<' and y - 1 >= 0 and not c[x][y - 1]:\n c[x][y - 1] = True\n q.append((x, y - 1))\n\n if s2[y] == '^' and x - 1 >= 0 and not c[x - 1][y]:\n c[x - 1][y] = True\n q.append((x - 1, y))\n elif s2[y] == 'v' and x + 1 < n and not c[x + 1][y]:\n c[x + 1][y] = True\n q.append((x + 1, y))\n\n for a in range(n):\n for b in range(m):\n if not c[a][b]:\n ok = False\n\nif ok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,m=[int(x) for x in input().split()]\r\na=input()\r\nb=input()\r\nif(a[0]=='>' and b[0]=='^' and a[n-1]=='<' and b[m-1]=='v'):\r\n print(\"YES\")\r\nelif(a[0]=='<' and b[0]=='v' and a[n-1]=='>' and b[m-1]=='^'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = tuple([int(x) for x in input().split()])\ng1,g2=[],[]\nfor i in range(n*m+1):\n\tg1.append([])\n\tg2.append([])\n\tfor j in range(n*m+1):\n\t\tg1[i].append(0)\n\t\tg2[i].append(0)\nhor = input()\nver = input()\nk=1\n\ni,j=1,1\n\nfor d in hor:\n\tif d=='>':\n\t\tj=i\n\t\twhile j<i+m-1:\n\t\t\tg1[j][j+1]=1\n\t\t\t#print(j,j+1)\n\t\t\tj+=1\n\t\ti=i+m\n\tif d=='<':\n\t\tj=i+m-1\n\t\twhile j>i:\n\t\t\tg1[j][j-1]=1\n\t\t\t#print(j,j-1)\n\t\t\tj-=1\n\t\ti+=m\ni=1\nfor d in ver:\n\tif d=='v':\n\t\tj=i\n\t\twhile j<m*n+1-m:\n\t\t\tg1[j][j+m]=1\n\t\t\t#print(j,j+m)\n\t\t\tj=j+m\n\t\ti+=1\n\tif d=='^':\n\t\tj=m*n-m+i\n\t\twhile j>i:\n\t\t\tg1[j][j-m]=1\n\t\t\t#print(j,j-m)\n\t\t\tj=j-m\n\t\ti+=1\n\n\n\nwhile k<n*m+1:\n\tfor i in range(1,n*m+1):\n\t\tfor j in range(1,n*m+1):\n\t\t\tif g1[i][j] or (g1[i][k] and g1[k][j]):\n\t\t\t\tg2[i][j]=1\n\tk+=1\n\tg1=g2\n\nans=1\nfor i in range(1,n*m+1):\n\tfor j in range(1,n*m+1):\n\t\tif g2[i][j]==0:\n\t\t\tans=0\n\t\t\tbreak\n\nif ans==1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t", "n,m=map(int,input().split( ))\r\nx=input()\r\ny=input()\r\na,b,c,d=x[0],x[-1],y[0],y[-1]\r\nif a=='>' and b=='<' and c=='^' and d=='v':\r\n print(\"YES\")\r\nelif a=='<' and b=='>' and c=='v' and d=='^':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# from debug import debug\r\nimport sys; input = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nv = list(input().strip())\r\nh = list(input().strip())\r\ngraph = defaultdict(list)\r\ntrans = defaultdict(list)\r\nnodes = [[0]*m for _ in range(n)]\r\nfor i in range(n):\r\n\tif v[i] == '>':\r\n\t\tfor j in range(m-1): graph[(i, j)].append((i, j+1))\r\n\t\tfor j in range(m-1, 0, -1): trans[(i, j)].append((i, j-1))\r\n\telse:\r\n\t\tfor j in range(m-1, 0, -1): graph[(i, j)].append((i, j-1))\r\n\t\tfor j in range(m-1): trans[(i, j)].append((i, j+1))\r\nfor j in range(m):\r\n\tif h[j] == \"^\":\r\n\t\tfor i in range(n-1, 0, -1): graph[(i, j)].append((i-1, j))\r\n\t\tfor i in range(n-1): trans[(i, j)].append((i+1, j))\r\n\telse:\r\n\t\tfor i in range(n-1): graph[(i, j)].append((i+1, j))\r\n\t\tfor i in range(n-1, 0, -1): trans[(i, j)].append((i-1, j))\r\n\r\ns = set()\r\ndef dfs(node, graph):\r\n\ts.add(node)\r\n\tfor i in graph[node]:\r\n\t\tif i not in s: dfs(i, graph)\r\n\r\ndfs((0, 0), graph)\r\nif len(s) == m*n:\r\n\ts = set()\r\n\tdfs((0, 0), trans)\r\n\tif len(s) == m*n: print(\"YES\")\r\n\telse: print(\"NO\")\r\nelse: print(\"NO\")" ]

[ "from heapq import heapify,heappop,heappush\r\nn, k = map(int, input().split())\r\nheap1 = []\r\nheap2 = []\r\nMAX = int(1e5)+10\r\ns = []\r\nheapify(heap1)\r\nheapify(heap2)\r\ni = 0\r\ncnt = 0\r\nwhile 1 << i <= n:\r\n if 1<<i & n: heappush(heap1,-i);heappush(heap2,-i);cnt += 1\r\n i += 1\r\nif cnt > k: print(\"NO\");exit()\r\n\r\ntemp = cnt\r\nwhile temp < k:\r\n x = -1 * heappop(heap1) - 1\r\n heappush(heap1,-x)\r\n heappush(heap1,-x)\r\n temp += 1\r\n \r\ntemp = heap1[0] * -1\r\n\r\nwhile cnt < k:\r\n if temp == heap2[0] * -1: break\r\n x = heappop(heap2) * -1 - 1\r\n heappush(heap2,-x)\r\n heappush(heap2,-x)\r\n cnt += 1\r\n\r\nwhile heap2:\r\n s.append(heappop(heap2)*-1)\r\n\r\nwhile cnt < k:\r\n s[-1] = s[-1] - 1\r\n s.append(s[-1])\r\n cnt += 1\r\nprint(\"YES\")\r\nprint(*s)\r\n\r\n \r\n\r\n\r\n \r\n", "read = lambda: map(int, input().split())\r\nn, k = read()\r\nb = bin(n)[2:]\r\nbl = len(b)\r\nk -= b.count('1')\r\nif k < 0:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\nm = -2\r\na = {}\r\nfor _ in range(bl):\r\n if b[_] == '1':\r\n a[bl - _ - 1] = 1\r\n if m is -2:\r\n m = bl - _ - 1\r\nwhile k > 0:\r\n if k >= a[m]:\r\n k -= a[m]\r\n a[m - 1] = a.get(m - 1, 0) + a[m] * 2\r\n a.pop(m)\r\n m -= 1\r\n else:\r\n break\r\nm = min(a.keys())\r\nwhile k > 0:\r\n k -= 1\r\n if a[m] is 1:\r\n a.pop(m)\r\n else:\r\n a[m] -= 1\r\n a[m - 1] = a.get(m - 1, 0) + 2\r\n m -= 1\r\nfor k in sorted(list(a.keys()), reverse=True):\r\n print(('%d ' % k) * a[k], end='')", "ii=lambda:int(input())\r\nkk=lambda:map(int, input().split())\r\nll=lambda:list(kk())\r\n\r\nfrom math import log\r\n\r\nelems = [0]*126\r\nn,k=kk()\r\nc=0\r\nfor i in range(63):\r\n\tif n&(2**i):\r\n\t\telems[i]=1\r\n\t\tc+=1\r\nif c > k:\r\n\tprint(\"No\")\r\n\texit()\r\nfor i in range(63, -63,-1):\r\n\tif elems[i]:\r\n\t\tif elems[i] > k-c:\r\n\t\t\t#stop it, now reverse sweep\r\n\t\t\tbreak\r\n\t\tc+=elems[i]\r\n\t\telems[i-1] += elems[i]*2\r\n\t\telems[i] = 0\r\nprin = []\r\nfor i in range(63, -63, -1):\r\n\tprin.extend([i]*elems[i])\r\nwhile len(prin)<k:\r\n\tprin[-1]-=1\r\n\tprin.append(prin[-1])\r\nprint(\"Yes\")\r\nprint(\" \".join(map(str, prin)))", "n, k = map(int, input().split())\r\nc = [0] * 200010\r\nk -= c.count(1)\r\n\r\nfor i in range(64):\r\n if (n >> i) & 1:\r\n k -= 1\r\n c[i] = 1\r\n\r\nif k < 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n for i in range(64, -64, -1):\r\n if k >= c[i]:\r\n c[i - 1] += c[i] * 2\r\n k -= c[i]\r\n c[i] = 0\r\n else:\r\n break\r\n\r\n for i in range(-64, 64):\r\n if c[i]:\r\n while k:\r\n c[i] -= 1\r\n c[i - 1] += 2\r\n i -= 1\r\n k -= 1\r\n break\r\n\r\n for i in range(64, -100010, -1):\r\n print('{} '.format(i) * c[i], end='')\r\n", "class dict_(dict):\r\n def __missing__(self, key):\r\n return 0\r\n\r\n\r\nget_bit = lambda x, i: (x >> i) & 1\r\nn, k = map(int, input().split())\r\nmem, su, ans = dict_(), 0, []\r\n\r\nfor i in range(60):\r\n if get_bit(n, i):\r\n mem[i] = 1\r\n su += 1\r\n\r\nif su > k:\r\n exit(print('No'))\r\n\r\nfor i in range(59, -k - 1, -1):\r\n if su + mem[i] > k:\r\n break\r\n su += mem[i]\r\n mem[i], mem[i - 1] = 0, mem[i - 1] + mem[i] * 2\r\n\r\nix = min([i for i, j in mem.items() if j])\r\nwhile su < k:\r\n su += 1\r\n mem[ix] -= 1\r\n ix -= 1\r\n mem[ix] += 2\r\n\r\nfor i, j in mem.items():\r\n ans.extend([i] * j)\r\nprint('Yes', '\\n', *sorted(ans)[::-1])\r\n", "from collections import *\r\nN, K = map(int, input().split())\r\n\r\na = deque()\r\nfor i in range(60): # 2**60 > 1e18\r\n\tif N & (1<<i):\r\n\t\ta.appendleft([i,1])\r\nk = len(a)\r\n\r\nif k > K:\r\n\tprint(\"No\")\r\n\texit()\r\n\r\n# high\r\nwhile k + a[0][1] <= K:\r\n\te, c = a.popleft()\r\n\tif len(a) == 0 or a[0][0] != e - 1:\r\n\t\ta.appendleft([e-1,0])\r\n\ta[0][1] += 2 * c\r\n\tk += c\r\n\r\n# low\r\nif K - k:\r\n\ta[-1][1] -= 1\r\n\tcount = K - k\r\n\tfirst = a[-1][0] - 1\r\n\tlast = first - count + 1\r\n\tfor i in range(first, last - 1, -1):\r\n\t\ta.append([i,1])\r\n\ta.append([last,1])\r\n\tk = K\r\n\r\nans = []\t\t\r\nfor i in a:\r\n\tans += [i[0]] * i[1]\r\nans = map(str, ans)\r\nans = \"Yes\\n\" + \" \".join(ans)\r\nprint(ans)\r\n", "def solve(n, k):\r\n bn = binary(n)\r\n if k < len(bn):\r\n return 'No'\r\n\r\n cur_dec = len(bn)\r\n next_dec = cur_dec+1\r\n while True:\r\n if k < next_dec:\r\n dif = k - cur_dec\r\n bn = list(reversed(bn))\r\n for _ in range(dif):\r\n e = bn.pop()\r\n bn += [e-1, e-1]\r\n return 'Yes\\n' + ' '.join(map(str,bn))\r\n cur_dec = next_dec\r\n cnt = bn.count(bn[-1])\r\n bn = bn[:-cnt] + [bn[-1]-1]*(cnt*2)\r\n next_dec = cur_dec+bn.count(bn[-1])\r\n\r\n\r\n\r\ndef binary(x):\r\n out = []\r\n for i in reversed(range(64+1)):\r\n if x >= 2**i:\r\n x -= 2**i\r\n out.append(i)\r\n return list(reversed(out))\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n print(solve(n, k))\r\n ", "from collections import Counter\r\nbits = (10**18).bit_length()\r\nn, k = map(int, input().split())\r\nnum = Counter(i for i in range(bits) if (n >> i) & 1)\r\nk -= len(num)\r\nif k >= 0:\r\n\tprint('Yes')\r\n\tfor i in range(bits, -bits, -1):\r\n\t\tif num[i] > k: break\r\n\t\tnum[i-1] += num[i] * 2\r\n\t\tk -= num.pop(i, 0)\r\n\ti = next(filter(num.get, range(-bits, bits)))\r\n\tfor k in range(k):\r\n\t\tnum[i] -= 1\r\n\t\tnum[i-1] += 2\r\n\t\ti -= 1\r\n\ts = sorted(num.elements(), reverse=True)\r\n\tprint(' '.join(map(str, s)))\r\nelse:\r\n\tprint('No')" ]

[ "def main():\n n = int(input())\n nums = sorted(list(map(int, input().split(' '))))\n temp = nums[0]\n nums[0] = nums[-1]\n nums[-1] = temp\n print(' '.join(map(str, nums)))\n\nmain()\n", "\r\ninput()\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nb=a[1:len(a)-1]\r\nb=sorted(b)\r\n#print(b,a)\r\nans=[a[-1]]+b+[a[0]]\r\nanswer=\"\"\r\nfor i in ans:\r\n answer=answer+str(i)+\" \"\r\nprint(answer)", "n=int(input())\n\nA=list(map(int,input().split()))\n\nA.sort()\n\nprint(A[-1],end=\" \")\nfor i in range(1,n-1):\n print(A[i],end=\" \")\nprint(A[0])\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nM=max(a)\r\nm=min(a)\r\na.remove(M)\r\na.remove(m)\r\na.sort()\r\nl=[M]+a+[m]\r\nfor x in l:\r\n print(x,end=\" \")", "n = input() \r\na = input().split(\" \")\r\nans = sorted(a,key=int)\r\n\r\nprint(ans[-1],' '.join(ans[1:-1]),ans[0])", "n = int(input())\r\nk = map(int,input().split())\r\nmylist = sorted(list(k))\r\nmymax = mylist[-1]\r\nmymin = mylist[0]\r\nmylist[0] = mymax\r\nmylist[-1] = mymin\r\noutlist = []\r\n\r\nfor i in range(n) :\r\n outlist.append(mylist[i])\r\n\r\nout = ' '.join(str(i) for i in outlist)\r\nprint(out)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmi = min(a)\r\nma = max(a)\r\nans = []\r\nans.append(ma)\r\na.sort()\r\nprint(ma, *a[1:len(a) - 1], end = ' ')\r\nprint(mi)", "n=int(input());a=sorted(map(int,input().split()));a[0],a[-1]=a[-1],a[0];print(*a)", "\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\ntemp = a[0]\r\na[0] = a[n - 1]\r\na[n - 1] = temp\r\nprint (' '.join([str(i) for i in a]))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nprint(a[n-1], *a[1:n-1], a[0])\r\n", "n = int(input())\r\nk = map(int,input().split())\r\nmylist = sorted(list(k))\r\n\r\ndef myswap(mylist) :\r\n mylist[-1], mylist[0] = mylist[0], mylist[-1]\r\n return mylist\r\n\r\nmylist = myswap(mylist)\r\nfor i in range(n) :\r\n print(mylist[i],end = \" \")\r\n", "\"\"\"\r\n(x1 - x2) + (x2 - x3) + (x3 - x4) + (x4 - x5)\r\nx1 + (x2 - x2) + (x3 - x3) + (x4 - x4) - x5\r\nx1 - x5\r\nx1 > x5\r\n\"\"\"\r\nn = int(input().strip())\r\na = list(map(int, input().strip().split()))\r\na.sort()\r\na[0], a[-1] = a[-1], a[0]\r\nprint(*a)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = []\r\nans.append(arr.pop())\r\nfor i in range(1, len(arr)):\r\n ans.append(arr[i])\r\nans.append(arr[0])\r\nprint(*ans) ", "n = int(input())\r\nv = [int(x) for x in input().strip().split()]\r\nu = sorted(v,reverse=True)\r\nk = [u[0]]+u[1:n-1][::-1]+[u[-1]]\r\nindex = 0\r\nindex2 = 0\r\nif k[0]>v[0]:\r\n\tprint(\" \".join([str(x) for x in k]))\r\nelse:\r\n\tfor i in range(1,n-1):\r\n\t\tif not k[i]==v[i]:\r\n\t\t\tm = 10**9\r\n\t\t\tfor j in range(i,n-1):\r\n\t\t\t\tif k[j]>v[i] and m>k[j]:\r\n\t\t\t\t\tm = k[j]\r\n\t\t\t\t\tindex = j\r\n\t\t\tindex2 = i\r\n\t\t\tbreak\r\n\r\n\ta = k[index2]\r\n\tk[index2] = k[index]\r\n\tk[index] = a\r\n\tk = k[:index2+1]+sorted(k[index2+1:-1])+k[-1:]\r\n\tprint(\" \".join([str(x) for x in k]))\r\n", "n = int(input())\nnums = [int(x) for x in input().split()]\nnums.sort()\nmax = nums[-1]\nnums[-1] = nums[0]\nnums[0] = max\nprint(\" \".join(str(x) for x in nums))\n", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nx[0], x[-1] = x[-1], x[0]\r\nprint(\" \".join(map(str, x)))", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n arr = list(sorted(map(int, input().split())))\n arr[0], arr[-1] = arr[-1], arr[0]\n\n print(*arr)\n\nif __name__ == \"__main__\":\n main()\n\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\na[-1],a[0]=a[0],a[-1]\r\nprint(*a)\r\n", "n = int(input())\na = list(map(int, input().rstrip().split()))\na.sort()\na[0], a[n - 1] = a[n - 1], a[0]\nprint(*a)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\nb = a[::]\r\na.pop(0)\r\na.pop()\r\na.sort()\r\nprint(b[0],end = ' ')\r\nfor i in a:\r\n print(i,end = ' ')\r\nprint(b[-1]) \r\n", "length = int(input())\r\narr = list(map(int, input().split()))\r\nmx = arr.pop(arr.index(max(arr)))\r\nmn = arr.pop(arr.index(min(arr)))\r\narr.sort()\r\nprint(mx, *arr, mn)\r\n", "n = int(input())\r\narr = sorted(list(map(int,input().split())))\r\nprint(*([arr[-1]] + arr[1:-1] + [arr[0]]))", "n = int(input()) \r\ndata = sorted(list(map(int, input().split())))\r\nprint(data[-1], end = ' ')\r\nprint(*data[1:-1], end = ' ')\r\nprint(data[0])\r\n", "n=int(input())\narr=[int(x) for x in input().split(' ')]\narr=sorted(arr,reverse=True)\nprint(arr[0],end=' ')\nfor item in arr[1:-1][::-1]:\n\tprint(item,end=' ')\nprint(arr[-1])", "n=int(input())\na=input().split()\na_array=[]\narray2=[]\nfor i in range(n):\n a_array.append(int(a[i]))\na_array=sorted(a_array)\na=a_array[0]\na_array[0]=a_array[len(a_array)-1]\na_array[len(a_array)-1]=a\nfor i in range(len(a_array)):\n array2.append(a_array[i])\n print(array2[i],end=\" \")\n\t\t \t \t\t \t \t \t \t \t \t\t\t \t\t", "n = int(input())\nvalues = list(map(int, input().split()))\nvalues.sort()\nvalues[0], values[-1] = values[-1], values[0]\nprint(*values)\n", "# Collaborated with no one [I]\nnumOfInts = int(input())\ninput1 = list(map(int,input().split(\" \")))\ninput1.sort()\ninput1[0], input1[-1] = input1[-1], input1[0]\nanswer = \"\"\nfor i in range(0, numOfInts):\n answer += str(input1[i])\n if(i<numOfInts-1):\n answer+= \" \"\nprint(answer)\n \t\t\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t\t", "n=int(input())\narr=[int(i) for i in input().split(\" \")]\n\narr.sort()\n\nt=arr[0]\narr[0]=arr[n-1]\narr[n-1]=t\n\nfor x in arr:\n print(x,end=\" \")\n\n \t\t \t \t \t\t \t \t\t \t \t\t \t", "import io\nimport os\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nimport math\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n\n if n == 1:\n print(a[0])\n else:\n a[0], a[n-1] = a[n-1], a[0]\n print(*a)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nA[0], A[-1] = A[-1], A[0]\r\nprint(\" \".join(list(map(str, A))))", "n = input().split()\na = sorted([int(x) for x in input().split()])\na[0], a[-1] = a[-1], a[0]\nprint(' '.join(str(x) for x in a))\n", "a=int(input())\r\nb=sorted(map(int,input().split()))\r\nprint(b[-1])\r\nfor i in range(1,a-1):print(b[i])\r\nprint(b[0])", "n = int(input())\na = list(map(int,input().split(' ')))\n\na = [str(x) for x in sorted(a)]\n\na = [a[-1]] + a[1:-1] + [a[0]]\nprint(' '.join(a))\n\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-01 23:19:35\nLastEditTime: 2021-12-01 23:23:51\nDescription: Difference Row\nFilePath: CF347A.py\n'''\n\n\ndef func():\n n = int(input())\n lst = list(map(int, input().strip().split()))\n maximum, minimum = max(lst), min(lst)\n lst.remove(maximum)\n lst.remove(minimum)\n lst = list(sorted(lst))\n print(maximum, \" \".join(map(str, lst)), minimum)\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\na=sorted([int(_) for _ in input().split()])\r\nprint(a[n-1],*a[1:n-1],a[0])", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nlst.sort()\r\nlst[0],lst[n-1] = lst[n-1],lst[0]\r\nfor i in range(0,n):print(lst[i],end=\" \")", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni1=l.index(min(l))\r\ni2=l.index(max(l))\r\nl.sort()\r\nt=l[0]\r\nl[0]=l[n-1]\r\nl[n-1]=t\r\nprint(*l)", "if __name__ == '__main__':\r\n length = int(input())\r\n rawsequence = input().split(\" \")\r\n sequence = [int(x) for x in rawsequence]\r\n\r\n maxValue = max(sequence)\r\n minValue = min(sequence)\r\n sequence.remove(maxValue)\r\n sequence.remove(minValue)\r\n sequence.sort()\r\n print(maxValue, end=\" \")\r\n for x in sequence:\r\n print(x, end=\" \")\r\n print(minValue)", "n = int(input().strip())\r\na = [int(i) for i in input().strip().split()]\r\ndef printarr(a):\r\n for i in a:\r\n print(i, end=' ')\r\n print()\r\nmaxa = max(a)\r\nmina = min(a)\r\na.remove(maxa)\r\na.remove(mina)\r\na.sort()\r\nout = []\r\nout.append(maxa)\r\nout.extend(a)\r\nout.append(mina)\r\nprintarr(out)\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nlis = sorted(lis)\r\nlis[0],lis[-1] = lis[-1],lis[0]\r\nlis = list(map(str,lis))\r\nprint (\" \".join(lis))", "n=int(input());a=list(map(int,input().split()));a.sort();t=a[0];a[0]=a[n-1];a[n-1]=t\r\nfor i in range(n):print(a[i],end=' ')", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n arr.sort()\r\n ans = [arr[-1]] + sorted(arr[1:n - 1]) + [arr[0]]\r\n\r\n print(*ans)\r\n\r\nmain()\r\n", "n=int(input())\r\narr=sorted(list(map(int,input().split())))\r\narr[0],arr[n-1]=arr[n-1],arr[0]\r\nprint(*arr)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ntemp =a[0]\r\na[0] =a[n-1]\r\na[n-1]= temp\r\nfor i in range(n):\r\n\tif (i!= n-1):\r\n\t\tprint(a[i],end=\" \")\r\n\telse:\r\n\t\tprint(a[n-1])", "\r\ndef permutationMaxVal(a: list) -> list: \r\n \r\n n : int = len(a) \r\n x : list = sorted(a) \r\n a = x[0] \r\n b = x[n-1] \r\n x[n-1] = a \r\n x[0] = b \r\n \r\n return x\r\n \r\n\r\n\r\nn = int(input())\r\ns = input()\r\ns= s.split(\" \")\r\na: list = [0]*n\r\nfor i in range(n):\r\n a[i] = int(s[i])\r\n\r\nres = permutationMaxVal(a)\r\nfor i in range(n): \r\n print(res[i], end=' ')", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ns=arr.pop(0);e=arr.pop()\r\nprint(*[e]+arr+[s])", "n = input()\r\ns = sorted(map(int, input().split()))\r\ns[0], s[-1] = s[-1], s[0]\r\nprint(*s)\r\n", "def check(n , a):\r\n first = max(a)\r\n last = min(a)\r\n string = str()\r\n \r\n a.remove(first)\r\n a.remove(last)\r\n a.sort()\r\n\r\n a = [first] + a + [last]\r\n\r\n for i in a:\r\n string += str(i) + ' '\r\n return (string.rstrip())\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input().rstrip())\r\n a = list(map(int , input().rstrip().split()))\r\n \r\n print (check(n , a))\r\n", "S = sorted\r\nM = lambda : map(int,input().split())\r\nm = int(input())\r\na = S(list(M()))\r\n\r\nprint(a[-1],*a[1:-1],a[0]) \r\n", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl[0],l[-1]=l[-1],l[0]\r\nfor i in l:\r\n\tprint(i,end=\" \")\r\n", "n = int(input())\r\ns = input()\r\nA = list(map(int,s.split()))\r\nA.sort()\r\nA[0],A[len(A)-1]=A[len(A)-1],A[0]\r\nfor i in range(len(A)):\r\n print(\"%d \" % A[i],end=\"\");", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\na[0], a[-1] = a[-1], a[0]\r\nfor i in range(len(a)):\r\n print(a[i], end = ' ')", "n=int(input())\r\nL=sorted([int(i) for i in input().split()])\r\nprint(L[n-1],end=\" \")\r\nfor i in range(1,n-1):\r\n print(L[i],end=\" \")\r\nprint(L[0])\r\n ", "def main():\n input()\n a = sorted(input().split(), key=int)\n print(a[-1], ' '.join(a[1:-1]), a[0])\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nans=[]\nmaxi = max(a)\nmini = min(a)\na.pop()\na.pop(0)\nans.append(maxi)\nfor i in a:\n if i<0:\n ans.append(i)\n else:\n ans.append(i)\nans.append(mini)\nprint(*ans)", "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\n\r\ndef Difference_Row():\r\n n = inp()\r\n sequence = inlt()\r\n sequence_sorted = sorted(sequence)\r\n\r\n smallest = sequence_sorted[0]\r\n largest = sequence_sorted[n-1]\r\n sequence_sorted[0] = largest\r\n sequence_sorted[n-1] = smallest\r\n \r\n outputStr = ''\r\n for term in sequence_sorted:\r\n outputStr += str(term) + ' '\r\n \r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return\r\n\r\nDifference_Row() ", "n = int(input())\n\narr = list(map(int, input().split()))\n\narr = sorted(arr)\n\narr[0], arr[n-1] = arr[n-1],arr[0]\n\nprint(*arr)", "\ndef largest_arrangement(n, a):\n a.sort()\n a[0], a[n-1] = a[n-1], a[0]\n for i in range(n):\n print(a[i], end=' ')\n print()\n\n\nn = int(input())\na = list(map(int,input().split()))\nlargest_arrangement(n, a)\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\nl=list(map(int,input().split()))\r\nl.sort()\r\n#print(l)\r\nl[0],l[-1]=l[-1],l[0]\r\nz=\" \".join(map(str,l))\r\nprint(z)\r\n", "n = int(input())\r\nls = input().split(\" \")\r\nls = [int(i) for i in ls]\r\nls = sorted(ls)\r\nmaxel = ls[len(ls)-1]\r\nminel = ls[0]\r\nls[0], ls[len(ls)-1] = maxel,minel\r\nfor i in ls:\r\n print(i, end = \" \")", "n = int(input())\na = input().split(\" \")\ntemp = []\nfor i in a:\n temp.append(int(i))\ntemp.sort()\n\na = temp[0]\ntemp[0] = temp[len(temp)-1]\ntemp[len(temp)-1] = a\n\nx = []\nfor i in temp:\n x.append(str(i))\n\n\nout = \" \"\nprint(out.join(x))\n\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t\t \t \t \t\t\t", "n=int(input())\r\nx=sorted([int(x) for x in input().split()])\r\nx[0],x[-1]=x[-1],x[0]\r\nprint(*x)", "n=int(input())\nl=list(map(int,input().strip().split()))\n\nl.sort()\nl.reverse()\nt=[a for a in l[1 : n-1]]\nt.sort()\nl=[l[0]]+t+[l[-1]]\n\nprint(*l)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\na[-1], a[0] = a[0], a[-1]\r\nprint(*a)\r\n", "n=int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nma=max(a)\r\nmi=min(a)\r\n\r\na.remove(ma)\r\na.remove(mi)\r\n#print(a)\r\na.sort()\r\n#print(a)\r\n#print(ma,mi)\r\na.insert(0,ma)\r\n#print(a)\r\na.append(mi)\r\n#print(a)\r\n\r\nprint(*a)", "# t=int(input())\r\n# import math\r\n# for _ in range(t):\r\n# n,k=list(map(int,input().split()))\r\n# s=input()\r\n# a=[]\r\n# summer=0\r\n# for i in range(len(s)):\r\n# if(s[i]=='1'):\r\n# a.append(i)\r\n# i=0\r\n# while(i<len(a)-1):\r\n# dist=a[i+1]-k-1-(a[i]+k+1)+1\r\n# # print(a,dist)\r\n# if(dist>0):\r\n# # summer+=(dist//k)\r\n# summer+=(math.ceil(dist/(k+1)))\r\n# i+=1\r\n# if(len(a)>0):\r\n# dist=a[0]-k\r\n# if(dist>0):\r\n# summer+=(math.ceil(dist/(k+1)))\r\n \r\n# dist=n-1-a[-1]-k\r\n# if(dist>0):\r\n# summer+=(math.ceil(dist/(k+1)))\r\n# else:\r\n# summer+=(math.ceil(n/(k+1)))\r\n \r\n# print(summer)\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nprint(s[n-1],end=\" \")\r\nfor a in s[1:-1]:\r\n print(a,end =\" \")\r\nprint(s[0])", "if __name__ == '__main__':\r\n n = int(input())\r\n line = list(map(int, input().split()))\r\n line.sort()\r\n line[0], line[-1] = line[-1], line[0]\r\n print(' '.join(map(str, line)))\r\n", "input()\r\na=sorted(map(int,input().split()))\r\nprint(a[-1],' '.join(map(str,a[1:-1])),a[0])\r\n", "# def diffrow(a):\r\n# sum = 0\r\n# for i in range(1,len(a)):\r\n# sum+=a[i-1]-a[i]\r\n# return sum\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nresult = [0]*n\r\n\r\nresult[0] = arr[-1]\r\nresult[-1] = arr[0]\r\n\r\nfor i in range(1,n-1):\r\n result[i] = arr[i]\r\n\r\nfor i in result:\r\n print(i,end=' ')\r\nprint()\r\n", "import sys\r\nimport math\r\n \r\nn = int(input())\r\nan = list(map(int, input().split()))\r\n\r\nan.sort()\r\nan[0], an[n - 1] = an[n - 1], an[0]\r\n\r\nprint(\" \".join(list(map(str, an))))", "def go():\n n = int(input())\n a = list(sorted(int(i) for i in input().split(' ')))\n a[0], a[n - 1] = a[n - 1], a[0]\n return ' '.join(str(i) for i in a)\n\nprint(go())\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=True)\r\n\r\nif n in [2, 3]:\r\n print(' '.join(map(str, w)))\r\nelse:\r\n w = [w[0]] + w[1:-1][::-1] + [w[-1]]\r\n print(' '.join(map(str, w)))\r\n", "# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n# in the name of trinity who created us.\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl.sort()\r\nl[0], l[len(l)-1] = l[len(l)-1], l[0]\r\nfor i in range(len(l)):\r\n print(l[i], end=' ')\r\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\nl[0],l[n-1]=l[n-1],l[0]\r\nprint(*l)", "input()\r\naa = list(map(int, input().split()))\r\n\r\nx, y = max(aa), min(aa)\r\n\r\naa.remove(x)\r\naa.remove(y)\r\naa.sort()\r\nprint(*([x] + aa + [y]))", "n = int(input())\r\nar = list(map(int,input().split()))\r\nar.sort()\r\ntemp = ar[0]\r\nar[0] = ar[-1]\r\nar[-1] = temp\r\n\r\nprint(' '.join([str(num) for num in ar]))", "def minus(lst):\r\n a = sorted(lst)\r\n b = a[::-1]\r\n return [b[0]] + sorted(b[1:len(b) - 1]) + [b[-1]]\r\n\r\n\r\nn = int(input())\r\nc = [int(i) for i in input().split()]\r\nprint(*minus(c))\r\n", "n=int(input())\r\nc=(list(map(int, input().split())))\r\na=[]\r\nfor i in range(0,len(c)):\r\n a.append(c[i])\r\na.sort()\r\nd=a[0]\r\na[0]=a[n-1]\r\na[n-1]=d\r\nfor i in range(0,n):\r\n print(a[i],end=' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nprint (a[n - 1], end = \" \")\r\nfor i in range (1, n - 1):\r\n print (a[i], end = \" \")\r\nprint (a[0])", "n = int(input())\r\nseq = sorted(list(map(int, input().split())))\r\n\r\nprint(' '.join(map(str, [seq[-1]] + seq[1:-1] + [seq[0]])))", "from itertools import permutations\r\nfrom sys import stdin, stdout\r\ndef get_ints(): return map(int, stdin.readline().strip().split())\r\ndef get_strs(): return stdin.readline().strip().split()\r\ndef f_print(s): stdout.write(str(s))\r\ndef get_string(): return stdin.readline().strip() \r\n\r\n\r\n\r\ndef solve(arr):\r\n i, j = 1, len(arr) - 2\r\n while i < j:\r\n arr[i], arr[j] = arr[j], arr[i]\r\n i += 1\r\n j -= 1\r\n return arr\r\n\r\n\r\n\r\nsize = int(get_string())\r\narr = get_ints()\r\nans = solve((sorted(arr, reverse = True)))\r\nf_print(' '.join([str(i) for i in ans]))", "# LUOGU_RID: 101540781\nn, *a = map(int, open(0).read().split())\r\na.sort()\r\nprint(a[-1], *a[1:-1], a[0])", "n = int(input())\nseq = list(map(int, input().split()))\n\nsorted_seq = sorted(seq)\nprint(max(sorted_seq))\nfor i in sorted_seq[1:-1]:\n\tprint(i)\nprint(min(sorted_seq))\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nx=s[-1]\r\ns[-1]=s[0]\r\ns[0]=x\r\nfor i in s:\r\n print(i,end=\" \")\r\n \r\n", "def main():\r\n n = int(input())\r\n v = list(map(int,input().split()))\r\n v.sort();\r\n v [0], v[-1] = v[-1], v[0]\r\n for v0 in v:\r\n print(v0, end = ' ' )\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nl[0],l[-1]=l[-1],l[0]\r\nprint(*l)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nmaxi=a[0]\r\nmini=a[-1]\r\na.remove(maxi)\r\na.remove(mini)\r\na.sort()\r\nprint(maxi,*a,mini)", "n = int(input())\r\nsez = [int(i) for i in input().split() ]\r\nsez.sort()\r\na = len(sez)\r\nsez[0], sez[-1] = sez[-1], sez[0]\r\nb= \" \".join([str(i) for i in sez])\r\nprint(b)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = list()\r\nans.append(arr[-1])\r\nans.extend(arr[1:n - 1])\r\nans.append(arr[0])\r\nprint(*ans)\r\n", "n = int(input())\r\nx = sorted(int(x) for x in input().split())\r\nx[0], x[-1] = x[-1], x[0]\r\nprint(' '.join(map(str, x)))", "#Problem Set I: Collaborated with no one\n\nn = int(input())\n\na_list = list(map(int, input().split()))\n\na_list = sorted(a_list)\nsize = len(a_list)\n\na_list[0], a_list[size - 1] = a_list[size - 1], a_list[0]\n\nfor i in range(len(a_list)):\n print(a_list[i], end=\" \")\n \t \t\t \t\t\t\t \t\t \t\t\t", "a = int(input())\r\narr = list(map(int, input().split()))\r\nif(a == 2):\r\n print(*(sorted(arr)[::-1]))\r\nelse:\r\n arr = sorted(arr)[::-1]\r\n arr[1:-1] = sorted(arr[1:-1])\r\n print(*arr)", "from sys import stdin\r\nn=int(stdin.readline().rstrip())\r\nl=list(map(int,stdin.readline().split()))\r\nl.sort()\r\nl[n-1],l[0]=l[0],l[n-1]\r\nfor i in l:\r\n print(str(i)+\" \",end=\"\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\ni = 0\r\narr[i], arr[n-i-1] = arr[n-i-1], arr[i]\r\n\r\nfor i in arr:\r\n print(i, end=\" \")", "n=int(input())\r\n\r\na=input()\r\n\r\nlst=[int(x) for x in a.split()]\r\n\r\nlst.sort()\r\n\r\n\r\nlst[0],lst[-1]=lst[-1],lst[0]\r\n\r\n\r\n# print(lst)\r\n\r\n\r\nfor i in lst:\r\n\tprint(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "le=int(input())\r\ns=list(map(int,input().split()))\r\nl=[]\r\nma=max(s)\r\nmi=min(s)\r\ns.remove(ma)\r\ns.remove(mi)\r\ns.sort()\r\nl=[ma]+s+[mi]\r\nprint(\" \".join(str(i) for i in l))", "input()\r\na=sorted(list(map(int,input().split(\" \"))))\r\nprint(a[-1],*a[1:-1],a[0])", "def main():\n n = int(input())\n arr = list(map(int, input().split(\" \")))\n\n max_sum = 0\n s, e = 0, 1\n for i in range(n):\n for j in range(n):\n if i == j:\n continue\n diff = arr[i] - arr[j]\n if diff > max_sum:\n max_sum = diff\n s = i\n e = j\n # probably bug\n if diff == max_sum and ((arr[i] < arr[s]) or (arr[i] == arr[s] and arr[j] < arr[e])):\n s = i\n e = j\n\n start, end = arr[s], arr[e]\n arr.remove(start)\n arr.remove(end)\n\n result = [start ] + list(sorted(arr)) + [end]\n print(' '.join(map(str, result)))\n\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\na = list(map(int, input().split()))\na.sort(reverse = True)\na = [a[0]] + sorted(a[1:n-1]) + [a[n-1]]\nprint(*a)", "n=int(input())\r\nll=list(map(int,input().split()))\r\nx,y=max(ll),min(ll)\r\nll.remove(x)\r\nll.remove(y)\r\nll.sort()\r\nprint(x,*ll,y)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\na[0],a[n-1] = a[n-1],a[0]\r\nprint(' '.join([str(i) for i in a]))", "#!/usr/bin/python3\n\nn = int(input())\nlst = sorted(map(int, input().split()))\nlst[1:-1] = lst[-2:0:-1]\nprint(*tuple(reversed(lst)))\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = []\r\nl = sorted(l)\r\nans = [l[-1]] + l[1:(n-1)] + [l[0]]\r\nprint(*ans)", "import re\n\nin1 = int(input())\nin2 = [int(x) for x in re.split(\"\\\\s\", input())]\nin2.sort()\nprint(in2[-1], end=\"\")\n\nif in1 > 2:\n in3 = in2[1:-1]\n for x in in3:\n print(\" \" + str(x), end=\"\")\n\nif in1 > 1:\n print(\" \" + str(in2[0]))\n \t\t \t \t \t\t \t\t\t\t\t \t\t \t", "t=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na[-1],a[0]=a[0],a[-1]\r\nprint(*a)", "n = int(input())\r\nnum = list(map(int, input().split()))\r\n\r\nnum.sort()\r\nnum[0], num[-1] = num[-1], num[0]\r\n\r\nprint(*num)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nprint(a[-1],*a[1:-1],a[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na[0],a[n-1]=a[n-1],a[0]\r\nfor i in a:\r\n print(i,end=\" \")\r\nprint() ", "n = int(input())\na = sorted([int(i) for i in input().split()])\nprint(a[-1], *a[1:-1], a[0])\n\n \t \t \t\t \t\t \t\t \t\t\t\t \t \t \t\t \t\t", "\nn = int(input())\n\na = (list(map(int,input().split())))\na = sorted(a)\n\nprint(a[-1], *a[1:-1], a[0])\n\n\t \t\t \t\t\t\t \t \t\t\t \t\t \t\t\t\t\t", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n x = [a[0]]\r\n temp = reversed(a[1:n-1])\r\n x += temp\r\n x.append(a[-1])\r\n print(*x)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "input()\r\na=sorted(input().split(),key=int)\r\nprint(a[-1],*a[1:-1],a[0])", "n = int(input())\r\na = list(map(int,input().split()))\r\na= sorted(a)\r\na[0],a[-1]=a[-1],a[0]\r\nprint(*a)", "n = int(input())\n\na = list(map(int, input().split()))\n\n\na = sorted(a)\n\na[0], a[-1] = a[-1], a[0]\n\nprint(\" \".join(map(str, a)))", "n = int(input())\na = [int(i) for i in input().split()]\na.sort()\na[0], a[-1] = a[-1], a[0]\nprint(*a)\n \t\t\t \t\t\t \t \t \t\t\t \t\t\t\t \t\t\t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\n_max=max(arr)\r\narr.remove(_max)\r\nflag=1\r\nif len(arr)==0:#TODO\r\n print(\" \".join(map(str,arr)))\r\n flag=0\r\n_min=min(arr)\r\narr.remove(_min)\r\narr.sort()\r\narr.insert(0,_max)\r\narr.append(_min)\r\nif flag==1:\r\n print(\" \".join(map(str,arr)))\r\n", "n = int(input())\r\nlst = [int (x) for x in input().split()]\r\nhigh = max(lst)\r\nlow = min(lst)\r\nlst.remove(high)\r\nlst.remove(low)\r\nprint(high,end=\" \")\r\nfor i in sorted(lst):\r\n print(i,end=\" \")\r\nprint(low)", "input()\r\na = sorted(map(int, input().split()))\r\nt = a[-1]\r\na[-1] = a[0]\r\na[0] = t\r\nprint(*a)", "def main():\n input()\n l = list(map(int, input().split()))\n x, y = min(l), max(l)\n l.remove(x)\n l.remove(y)\n l.sort()\n l.append(x)\n print(y, *l)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\na = [a[-1]] + a[1:-1] + [a[0]]\r\nprint(*a)", "N=int(input())\nnum=[]\ni=0\nIN=input().split()\nwhile(i<N):\n\t\tnum.append(int(IN[i]))\n\t\ti=i+1\nnum.sort()\nnum[0],num[len(num)-1]=num[len(num)-1],num[0]\nfor i in num:\n\tprint(i,end=' ')\n\t\t", "input()\r\na=sorted(input().split(), key = int)\r\nprint(a[-1],*a[1:-1],a[0])", "\r\nn=int(input())\r\narr=sorted(map(int,input().split()))\r\narr[0],arr[-1]=arr[-1],arr[0]\r\nfor i in arr:\r\n print(i,end=\" \")", "n = int(input())\r\narr = [int(k) for k in input().split()]\r\n\r\n\r\ndef diff_row(arr):\r\n arr.sort()\r\n arr[0], arr[-1] = arr[-1], arr[0]\r\n return arr\r\n\r\nres = diff_row(arr)\r\n\r\nres_s = ' '.join([str(k) for k in res])\r\nprint(res_s)", "n = int(input())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nar[0], ar[-1] = ar[-1], ar[0]\r\nprint(*ar)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\na[0],a[-1]=a[-1],a[0]\r\nprint(*a)", "# LUOGU_RID: 97912179\nn = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\nmaximum = max(nums)\r\nminimum = min(nums)\r\nnums.remove(maximum)\r\nnums.remove(minimum)\r\n\r\nnew = []\r\nnew.append(maximum)\r\nnums.sort()\r\n\r\nfor x in nums:\r\n new.append(x)\r\nnew.append(minimum)\r\n\r\nfor x in new:\r\n print(x, end=' ')\r\n", "n = int(input())\r\nd = list(map( int, input().strip().split(' ')))\r\n\r\nmin = min(d)\r\nmax = max(d)\r\n\r\nd.remove(min)\r\nd.remove(max)\r\n\r\nd.sort()\r\nd = list(map(str, d))\r\nprint( str(max) + ' ' + ' '.join(d) + ' ' +str(min))", "I=input\r\nI()\r\na=sorted(map(int,I().split()))\r\nprint(a[-1],' '.join(map(str,a[1:-1])),a[0])", "input()\n\na = sorted(input().split(), key=int)\n\nprint(a[-1], ' '.join(a[1:-1]), a[0])\n\n", "'''\r\nCreated on ١٣‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\ninput()\r\na = sorted(input().split(), key=int)\r\n#print(a)\r\nprint(a[-1], ' '.join(a[1:-1]), a[0])\r\n#print(*a)", "n = int(input())\narr = list(map(int, input().split()))\n\narr.sort()\n\narr[0], arr[-1] = arr[-1], arr[0]\n\nprint(*arr)\n", "def oneSided(lst):\r\n lst=sorted(lst)\r\n n=len(lst)\r\n lst[0],lst[n-1]=lst[n-1],lst[0]\r\n ans=\"\"\r\n for i in lst:\r\n ans+=str(i)\r\n ans+=\" \"\r\n return ans\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(oneSided(lst))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ns = a[0]\r\na = a[1:]\r\nprint(a[n-2], *a[:n-2], end=' ')\r\nprint(s)", "n=int(input())\nl=list(map(int,input().split()))\nl=sorted(l)\n\nl[0],l[-1]=l[-1],l[0]\nprint(*l)", "import sys\r\nfrom itertools import permutations\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nprint(a[-1], *a[1:-1], a[0])\r\n", "input()\r\na = sorted(map(int,input().split()))\r\na[0],a[-1] = a[-1],a[0]\r\nfor x in a:\r\n print(x, end = ' ')", "while(1):\r\n try:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n print(a[n-1],end=\" \")\r\n for i in range(1,n-1):\r\n print(a[i],end=\" \")\r\n print(a[0])\r\n except EOFError:\r\n break\r\n ", "n = int(input())\nA = list(map(int, input().split()))\nx = max(A)\nA.pop(A.index(max(A)))\ny = min(A)\nA.sort()\nA.pop(A.index(min(A)))\nprint(' '.join(list(map(str, [x] + A + [y]))))\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn = iinput()\r\na = list(map(int,input().split()))\r\na.sort()\r\na[-1],a[0]=a[0],a[-1]\r\nprint(*a)", "a = int(input())\r\nb = [int(x) for x in input().split(\" \")]\r\nc = sorted(b)\r\nd = c[0]\r\nc[0] = c[-1]\r\nc[-1] = d\r\nfor i in range(len(c)):\r\n print(c[i], end = \" \")\r\n \r\n", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\np=max(A)\r\nq=min(A)\r\nA.remove(p)\r\nA.remove(q)\r\nprint(p,end=' ')\r\nA.sort()\r\nfor i in A:\r\n print(i,end=' ')\r\nprint(q)", "# x1-x2+ x2-x3+ x3-x4+ ...+ xn-1-xn\r\n#x1-xn\r\n#找到一个最大的x1和最小的xn\r\n#剩下的数排列即可\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl[0],l[-1]=l[-1],l[0]\r\nprint(*l)", "n=input()\ns=input()\na=s.split()\nfor i in range(len(a)):\n a[i]=int(a[i])\na.sort()\na[0],a[len(a)-1]=a[len(a)-1],a[0]\nfor i in range(len(a)-1):\n a[i]=str(a[i])+' '\na[len(a)-1]=str(a[len(a)-1])\nprint(''.join(a))\n\t\t\t\t\t\t\t\t \t \t\t \t\t\t\t \t\t \t\t\t \t" ]

[ "from bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\n\r\n# SortedList ( akin to ordered multiset )\r\n# A = SortedList() or A = SortedList([123,456,321,77])\r\n# A.insert(777)\r\n# A.pop(1)\r\n# A[0] , A[-1]\r\n# A.count(777)\r\n# A.lower_bound(456)\r\n# A.upper_bound(777)\r\n\r\nclass FenwickTree:\r\n def __init__(self, x):\r\n bit = self.bit = list(x)\r\n size = self.size = len(bit)\r\n for i in range(size):\r\n j = i | (i + 1)\r\n if j < size:\r\n bit[j] += bit[i]\r\n\r\n def update(self, idx, x):\r\n \"\"\"updates bit[idx] += x\"\"\"\r\n while idx < self.size:\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n\r\n def __call__(self, end):\r\n \"\"\"calc sum(bit[:end])\"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\n\r\n def find_kth(self, k):\r\n \"\"\"Find largest idx such that sum(bit[:idx]) <= k\"\"\"\r\n idx = -1\r\n for d in reversed(range(self.size.bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < self.size and self.bit[right_idx] <= k:\r\n idx = right_idx\r\n k -= self.bit[idx]\r\n return idx + 1, k\r\n\r\n\r\nclass SortedList:\r\n block_size = 700\r\n\r\n def __init__(self, iterable=()):\r\n self.macro = []\r\n self.micros = [[]]\r\n self.micro_size = [0]\r\n self.fenwick = FenwickTree([0])\r\n self.size = 0\r\n for item in iterable:\r\n self.insert(item)\r\n\r\n def insert(self, x):\r\n i = lower_bound(self.macro, x)\r\n j = upper_bound(self.micros[i], x)\r\n self.micros[i].insert(j, x)\r\n self.size += 1\r\n self.micro_size[i] += 1\r\n self.fenwick.update(i, 1)\r\n if len(self.micros[i]) >= self.block_size:\r\n self.micros[i:i + 1] = self.micros[i][:self.block_size >> 1], self.micros[i][self.block_size >> 1:]\r\n self.micro_size[i:i + 1] = self.block_size >> 1, self.block_size >> 1\r\n self.fenwick = FenwickTree(self.micro_size)\r\n self.macro.insert(i, self.micros[i + 1][0])\r\n\r\n def pop(self, k=-1):\r\n i, j = self._find_kth(k)\r\n self.size -= 1\r\n self.micro_size[i] -= 1\r\n self.fenwick.update(i, -1)\r\n return self.micros[i].pop(j)\r\n\r\n def __getitem__(self, k):\r\n i, j = self._find_kth(k)\r\n return self.micros[i][j]\r\n\r\n def count(self, x):\r\n return self.upper_bound(x) - self.lower_bound(x)\r\n\r\n def __contains__(self, x):\r\n return self.count(x) > 0\r\n\r\n def lower_bound(self, x):\r\n i = lower_bound(self.macro, x)\r\n return self.fenwick(i) + lower_bound(self.micros[i], x)\r\n\r\n def upper_bound(self, x):\r\n i = upper_bound(self.macro, x)\r\n return self.fenwick(i) + upper_bound(self.micros[i], x)\r\n\r\n def _find_kth(self, k):\r\n return self.fenwick.find_kth(k + self.size if k < 0 else k)\r\n\r\n def __len__(self):\r\n return self.size\r\n\r\n def __iter__(self):\r\n return (x for micro in self.micros for x in micro)\r\n\r\n def __repr__(self):\r\n return str(list(self))\r\n\r\n\r\n\r\nn = int ( input ( ) )\r\nB = list ( map ( int , input ( ) . split ( ) ) )\r\nI = list ( map ( int , input ( ) . split ( ) ) )\r\nR = list ( map ( int , input ( ) . split ( ) ) )\r\n\r\nL = [ [ B[i] , I[i] , R[i] ] for i in range ( n ) ]\r\n\r\nL.sort(key = lambda x : x [0] )\r\n\r\nD = SortedList()\r\n\r\nbuf = []\r\ncur = -1\r\n\r\nans = 0\r\nfor i in range ( n -1 , -1 , -1 ) :\r\n\r\n if L[i][0] != cur :\r\n \r\n for j in buf :\r\n u = L[j][1]\r\n v = L[j][2]\r\n ind = D.upper_bound((u,v))\r\n ind -= 1\r\n while ind >= 0 : \r\n if D[ind][1] <= v :\r\n D.pop(ind)\r\n ind -= 1\r\n continue\r\n break\r\n ind = D.lower_bound((u,v))\r\n if ind == len(D) or ( D[ind][0] > u and D[ind][1] < v ) :\r\n D.insert((u,v))\r\n cur = L[i][0]\r\n buf = [] \r\n ind = D.upper_bound( ( L[i][1] , L[i][2] ) )\r\n if ind != len(D) and D[ind][0] == L[i][1] :\r\n ind +=1\r\n if ind < len(D) and D[ind][0] > L[i][1] and D[ind][1] > L[i][2] :\r\n ans += 1\r\n\r\n buf += [i]\r\n\r\nprint(ans)\r\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nN=int(input())\r\n\r\nX=list(map(int,input().split()))\r\nY=list(map(int,input().split()))\r\nZ=list(map(int,input().split()))\r\n\r\nXX=sorted(set(X))\r\nYY=sorted(set(Y))\r\nZZ=sorted(set(Z))\r\n\r\nDX={XX[i]:i for i in range(len(XX))}\r\nDY={YY[i]:i for i in range(len(YY))}\r\nDZ={ZZ[i]:i for i in range(len(ZZ))}\r\n\r\nXLIST=[[] for i in range(N+1)]\r\n\r\nfor i in range(N):\r\n XLIST[DX[X[i]]].append((DY[Y[i]],DZ[Z[i]]))\r\n\r\nLEN=N+2\r\n\r\nBIT=[0]*(LEN+1)\r\n\r\ndef update(v,w):\r\n v=N+1-v\r\n while v<=LEN:\r\n BIT[v]=max(BIT[v],w)\r\n v+=(v&(-v))\r\n\r\ndef getvalue(v):\r\n v=N+1-v\r\n ANS=0\r\n while v!=0:\r\n ANS=max(ANS,BIT[v])\r\n v-=(v&(-v))\r\n return ANS\r\n\r\nANS=0\r\nfor i in range(N,-1,-1):\r\n if XLIST[i]==[]:\r\n continue\r\n\r\n for y,z in XLIST[i]:\r\n u=getvalue(y+1)\r\n\r\n if z<u:\r\n ANS+=1\r\n\r\n for y,z in XLIST[i]:\r\n update(y,z)\r\n\r\nprint(ANS)\r\n \r\n \r\n \r\n" ]

[ "a=['0']*4\r\nb=[\"\"]*4\r\nc=[0]*4\r\nfor i in range(4):\r\n a[i],b[i]=map(str,input().split('.'))\r\n c[i]=len(b[i])\r\nc=sorted(c)\r\nx=0\r\nif(c[0]*2<=c[1]):\r\n x=1\r\nif(c[2]*2<=c[3]):\r\n if(x==0):\r\n x=2\r\n else:\r\n x=0\r\nif(x==1):\r\n for i in range(4):\r\n if(len(b[i])==c[0]):\r\n print(a[i])\r\n break\r\nelif(x==2):\r\n for i in range(4):\r\n if(len(b[i])==c[3]):\r\n print(a[i])\r\n break\r\nelse:\r\n print('C')", "arr = sorted([(len(input())-2,i) for i in 'ABCD'])\r\np=0\r\nif 2 * arr[0][0] <= arr[1][0]:\r\n p+=1\r\nif 2 * arr[-2][0] <= arr[-1][0]:\r\n p+=2\r\nprint(['C',arr[0][1],arr[-1][1],'C'][p])", "a = len(input())-2\r\nb = len(input())-2\r\nc = len(input())-2\r\nd = len(input())-2\r\nl = list()\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nl.append(d)\r\nl = sorted(l)\r\nx,y = 0, 0\r\nif l[0] <= l[1]//2 and l[0] <= l[2]//2 and l[0] <= l[3]//2:\r\n x = 1\r\nif l[3] >= l[0]*2 and l[3] >= l[1]*2 and l[3] >= l[2]*2:\r\n y = 1\r\nif x+y == 1:\r\n if x == 1:\r\n if l[0] == c:\r\n print(\"C\")\r\n elif l[0] == a:\r\n print(\"A\")\r\n elif l[0] == b:\r\n print(\"B\")\r\n else:\r\n print(\"D\")\r\n if y == 1:\r\n if l[3] == c:\r\n print(\"C\")\r\n elif l[3] == a:\r\n print(\"A\")\r\n elif l[3] == b:\r\n print(\"B\")\r\n else:\r\n print(\"D\")\r\nelse:\r\n print(\"C\")", "import logging\r\nimport copy\r\nimport sys\r\nimport math\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n# def solve(firstLine):\r\n\r\n\r\ndef solve(lines):\r\n l = list(map(lambda x: len(x[2:]), lines))\r\n min_len = min(l)\r\n great = []\r\n others = list(filter(lambda x: x >= 2 * min_len, l))\r\n\r\n if len(others) == 3:\r\n great.append(l.index(min_len))\r\n\r\n max_len = max(l)\r\n others = list(filter(lambda x: 2 * x <= max_len,l))\r\n if len(others) == 3:\r\n great.append(l.index(max_len))\r\n\r\n if len(great) == 1:\r\n return \"ABCD\"[great[0]]\r\n \r\n return \"C\"\r\n\r\n \r\n \r\n\r\n\r\ndef main():\r\n lines = []\r\n for i in range(0, 4):\r\n lines.append(input())\r\n\r\n print(solve(lines))\r\n\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = sorted([(len(input()) - 2, i) for i in 'ABCD'])\r\np = 0\r\nif a[0][0] * 2 <= a[1][0]:\r\n p += 1\r\nif a[-2][0] * 2 <= a[-1][0]:\r\n p += 2\r\nprint(['C', a[0][1], a[-1][1], 'C'][p])\r\n", "a=[]\r\nb=[]\r\nx=[]\r\nfor i in range(4):\r\n a.append(input())\r\n b.append(a[i][2:])\r\n x.append(len(b[i]))\r\nf1=int(0)\r\nf2=int(0)\r\n\r\nfor i in range(4):\r\n if(i!=x.index(max(x))):\r\n if(2*x[i]<=max(x)):\r\n f1=1\r\n else:\r\n f1=0\r\n break\r\nfor i in range(4):\r\n if(i!=x.index(min(x))):\r\n if(x[i]>=2*min(x)):\r\n f2=1\r\n else:\r\n f2=0\r\n break\r\nif((f1==1 and f2==1 )or(f1==0 and f2==0)):\r\n print('C')\r\nelse:\r\n print(a[x.index(max(x))][0]) if(f1==1) else print(a[x.index(min(x))][0])\r\n", "a = []\r\nfor i in range(4):\r\n x = input().strip()[2:]\r\n a.append(len(x))\r\ngood = []\r\nfor i in range(4):\r\n fl = True\r\n for j in range(4):\r\n if j != i and a[i] / a[j] < 2:\r\n fl = False\r\n if fl:\r\n good.append(i)\r\n else:\r\n fl = True\r\n for j in range(4):\r\n if j != i and a[j] / a[i] < 2:\r\n fl = False \r\n if fl:\r\n good.append(i)\r\nif len(good) == 1:\r\n print(chr(ord('A') + good[0]))\r\nelse:\r\n print('C')", "\r\noptions = []\r\ngreat = [0]*4\r\nfor line in range(4):\r\n options.append(input().split(\".\"))\r\n\r\nfor i in range(4):\r\n options2 = options[:]\r\n y = options2.pop(i)\r\n short = True\r\n for o in options2: \r\n if len(y[1]) <= len(o[1])/2:\r\n pass\r\n else:\r\n short = False\r\n break\r\n large = True\r\n for k in options2:\r\n if len(y[1]) >= len(k[1])*2:\r\n pass\r\n else:\r\n large = False\r\n break\r\n #print(short, large)\r\n if short or large:\r\n great[i] = 1\r\n\r\nif sum(great) == 1:\r\n print(options[great.index(1)][0])\r\nelse:\r\n print(\"C\")", "\r\na = []\r\na.append(len(input())-2)\r\na.append(len(input())-2)\r\na.append(len(input())-2)\r\na.append(len(input())-2)\r\n\r\ngreat = []\r\nfor i in range(4):\r\n temp = a[i]\r\n shor = True\r\n lon = True\r\n for j in range(4):\r\n if i!= j and a[i]<2*a[j]:\r\n lon = False\r\n if i!= j and a[i]>a[j]//2:\r\n shor = False\r\n if lon or shor:\r\n great.append(i)\r\n\r\nif len(great)==1:\r\n print(chr(great[0]+ord('A')))\r\nelse:\r\n print('C')\r\n", "l1=[]\r\nfor i in range(4):\r\n l1.append((len(input())-2,i))\r\nl1.sort()\r\nans1,ans2=-1,-1\r\nif 2*l1[0][0]<=l1[1][0]:\r\n ans1=l1[0][1]\r\nif 2*l1[2][0]<=l1[3][0]:\r\n ans2=l1[3][1]\r\nif ans1==-1 and ans2==-1:\r\n print('C')\r\nelif ans1!=-1 and ans2!=-1:\r\n print('C')\r\nelse :\r\n if ans1==-1:\r\n print(chr(ans2+65))\r\n else :\r\n print(chr(ans1+65))", "def main():\n l = []\n c = []\n for i in range(4):\n l.append(input()[2:])\n c.append(len(l[-1]))\n g = [False] * 4\n for i in range(4):\n longer = 0\n shorter = 0\n for j in range(4):\n if i == j:\n continue\n if c[i] <= c[j] // 2:\n shorter += 1\n if c[i] >= c[j] * 2:\n longer += 1\n g[i] = (longer == 3) | (shorter == 3)\n if len(list(filter(lambda i: i, g))) > 1:\n return 'C'\n for i in range(4):\n if g[i]:\n return ['A', 'B', 'C', 'D'][i]\n return \"C\"\nprint(main())\n\n", "a=input()[2:]\r\nb=input()[2:]\r\nc=input()[2:]\r\nd=input()[2:]\r\n\r\nL=[a,b,c,d]\r\nS=\"ABCD\"\r\nx=0\r\ne=[]\r\nfor i in range(4):\r\n l=True\r\n s=True\r\n for j in range(4):\r\n if(j==i):\r\n continue\r\n if(len(L[i])<len(L[j])*2):\r\n l=False\r\n if(len(L[j])<len(L[i])*2):\r\n s=False\r\n if(l and not s):\r\n x+=1\r\n e.append(i)\r\n elif(s and not l):\r\n x+=1\r\n e.append(i)\r\nif(x==1):\r\n print(S[e[0]])\r\nelse:\r\n print(\"C\")\r\n", "\r\n'''A = input()\r\nB = input()\r\nC = input()\r\nD = input()\r\narr[]\r\nb = len(B) - 2\r\nc = len(C) - 2\r\nd = len(D) - 2\r\n#print(a)\r\n#print(b)\r\n#print(c)\r\n#print(d)\r\n\r\nans = \"C\"\r\n\r\nif (a >= 2*b and a >= 2*c and a >= 2*d) or (2 * a <= b and 2 * a <= c and 2 * a <= d) :\r\n ans = 'A'\r\nelif (b >= 2*a and b >= 2*c and b >= 2*d) or (2 * b <= a and 2 * b <= c and 2 * b <= d) :\r\n ans = 'B'\r\nelif (d >= 2*a and d >= 2*c and d >= 2*b) or (2 * d <= a and 2 * d <= c and 2 * d <= b) :\r\n ans = 'D'\r\nelif (a and b and d):\r\n ans = 'C'\r\nprint(ans)\r\n'''\r\n\r\n\r\n'''\r\nWhen Your Chode is not working u have to see another peoples(folks) solution\r\n'''\r\nans = \"\"\r\narr = []\r\nfor i in range(4):\r\n a = input()\r\n arr.append((len(a)-2,a[0]))\r\narr.sort()\r\ngs = arr[0][0] * 2 <= arr[1][0]\r\ngl = arr[3][0] >= arr[2][0] * 2\r\nif (gs and gl) or (not gs and not gl):\r\n #print(\"C\")\r\n ans = \"C\"\r\nelse:\r\n if gs:\r\n #print(arr[0][1])\r\n ans = str(arr[0][1])\r\n else:\r\n #print(arr[3][1])\r\n ans = str(arr[3][1])\r\nprint(ans)\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\n\r\ncounta = len(a) - 2\r\ncountb = len(b) - 2\r\ncountc = len(c) - 2\r\ncountd = len(d) - 2\r\nlst = [counta, countb ,countc, countd]\r\nw = list(lst)\r\nw.sort()\r\n#print(chr(65))\r\n\r\nif 2 * w[0] <= w[1] and (w[3] < 2 * w[2]):\r\n print(chr(65+ lst.index(w[0])))\r\n\r\nelif 2 * w[2] <= w[3] and (w[1] < 2 * w[0]):\r\n print(chr(65+ lst.index(w[3])))\r\n\r\nelse:\r\n print(\"C\")", "def find_answer():\r\n\toption_lengths = []\r\n\tfor option in [\"A\", \"B\", \"C\", \"D\"]:\r\n\t\tstring = input()\r\n\t\toption_lengths.append([option, len(string)-2])\r\n\r\n\toption_lengths.sort(key=lambda x: x[1])\r\n\r\n\tif 2*option_lengths[0][1] <= option_lengths[1][1] and option_lengths[3][1] >= 2*option_lengths[2][1]:\r\n\t\tprint(\"C\")\r\n\telif 2*option_lengths[0][1] <= option_lengths[1][1]:\r\n\t\tprint(option_lengths[0][0])\r\n\telif option_lengths[3][1] >= 2*option_lengths[2][1]:\r\n\t\tprint(option_lengths[3][0])\r\n\telse:\r\n\t\tprint(\"C\")\r\n\r\n\r\nfind_answer()", "def process(A, B, C, D):\r\n L = [len(x.split('.')[1]) for x in [A, B, C, D]]\r\n Great = []\r\n for i in range(4):\r\n if 2*L[i] <= min([L[j] for j in range(4) if j != i]):\r\n Great.append(1)\r\n elif L[i] >= 2*max([L[j] for j in range(4) if j != i]):\r\n Great.append(1)\r\n else:\r\n Great.append(0)\r\n if sum(Great) != 1:\r\n return 'C'\r\n else:\r\n for i in range(4):\r\n if Great[i]==1:\r\n return 'ABCD'[i]\r\n \r\nA = input()\r\nB = input()\r\nC = input()\r\nD = input()\r\nprint(process(A, B, C, D))", "arr = [input() for i in range(4)]\r\narr = sorted([[arr[i][:1], len(arr[i][2:])] for i in range(4)], key=lambda x: x[1])\r\nans = []\r\n\r\nif arr[0][1] * 2 <= arr[1][1]:\r\n ans.append(arr[0][0])\r\nif arr[3][1] >= arr[2][1] * 2:\r\n ans.append(arr[3][0])\r\n\r\nif len(ans) == 1:\r\n print(ans[0])\r\nelse:\r\n print('C')\r\n", "l = {}\r\nfor i in range(4):\r\n s = input()\r\n l[s[0]] = len(s) - 2 \r\n \r\nc = []\r\nfor i in l.keys():\r\n s = 0\r\n for j in l.keys():\r\n if(i == j):\r\n continue \r\n if(l[i] >= 2 * l[j]):\r\n s += 1 \r\n if(s == 3):\r\n c.append(i)\r\n \r\n s = 0\r\n for j in l.keys():\r\n if(i == j):\r\n continue \r\n if(2 * l[i] <= l[j]):\r\n s += 1\r\n if(s == 3):\r\n c.append(i)\r\n \r\nif(len(c) == 1):\r\n print(c[0])\r\nelse:\r\n print('C')", "#!/usr/bin/python\r\na=input()\r\nb=input()\r\nc=input()\r\nd=input()\r\n\r\n\r\nl=[len(a)-2,len(b)-2,len(c)-2,len(d)-2]\r\ncounter=0\r\nans=0\r\nfor i in range(0,len(l)):\r\n\tf=1\r\n\tfor j in range(0,len(l)):\r\n\t\tif(i!=j):\r\n\t\t\tif(l[i]<2*l[j]):\r\n\t\t\t\tf=0\r\n\t\t\t\tbreak\r\n\tif f==1:\r\n\t\tcounter=counter+1\r\n\t\tans=i\r\n\tf=1\r\n\tfor j in range(0,len(l)):\r\n\t\tif(i!=j):\r\n\t\t\tif(2*l[i]>l[j]):\r\n\t\t\t\tf=0\r\n\t\t\t\tbreak\r\n\tif f==1:\r\n\t\tcounter=counter +1\r\n\t\tans=i\r\n\r\nif(counter !=1 or ans==2):\r\n\tprint ('C')\r\nelif ans==0:\r\n\tprint ('A')\r\nelif ans==1:\r\n\tprint ('B')\r\nelif ans==3:\r\n\tprint ('D')\r\n", "dect = {}\r\nlis = []\r\nshort = False\r\nlong = False\r\n\r\nfor i in 'ABCD':\r\n length = len(str((input())).split('.')[1])\r\n dect[length] = i\r\n lis.append(length)\r\n\r\nlis.sort()\r\n\r\nif lis[0] * 2 <= lis[1]:\r\n short = True\r\n\r\nif lis[2] * 2 <= lis[3]:\r\n long = True\r\n\r\nif (short and long) or (not short and not long):\r\n print('C')\r\nelif short:\r\n print(dect[lis[0]])\r\nelse:\r\n print(dect[lis[3]])", "def main():\n l = []\n for _ in range(4):\n n, s = input().split('.')\n l.append((len(s), n))\n a, b, c, d = sorted(l)\n res = ['C']\n if a[0] * 2 <= b[0]:\n res.append(a[1])\n if c[0] * 2 <= d[0]:\n res.append(d[1])\n print(res[(len(res) - 1) & 1])\n\n\nif __name__ == '__main__':\n main()", "a=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\nans=''\r\nif (a*2<=b and a*2<=c and a*2<=d) or (a>=b*2 and a>=c*2 and a>=d*2):\r\n ans+='A'\r\nif (b*2<=a and b*2<=c and b*2<=d) or (b>=a*2 and b>=c*2 and b>=d*2):\r\n ans+='B'\r\nif (c*2<=b and c*2<=a and c*2<=d) or (c>=b*2 and c>=a*2 and c>=d*2):\r\n ans+='C'\r\nif (d*2<=b and d*2<=c and d*2<=a) or (d>=b*2 and d>=c*2 and d>=a*2):\r\n ans+='D'\r\nif len(ans)==1:\r\n print(ans)\r\nelse:\r\n print('C') ", "import math\r\n#q=int(input())\r\nq=1\r\nfor _ in range(q):\r\n s1=input()\r\n s2=input()\r\n s3=input()\r\n s4=input()\r\n l1=len(s1)-2\r\n l2=len(s2)-2\r\n l3=len(s3)-2\r\n l4=len(s4)-2\r\n l=[l1,l2,l3,l4]\r\n ans=[]\r\n for i in range(4):\r\n flag1=True\r\n flag2=True\r\n for j in range(4):\r\n if j!=i:\r\n if 2*l[i]>l[j]:\r\n flag1=False\r\n if l[i]<2*l[j]:\r\n flag2=False\r\n if flag1 or flag2:\r\n ans.append(i)\r\n if len(ans)==1:\r\n print(chr(65+ans[0]))\r\n else:\r\n print(\"C\")", "def ind(arr, num):\r\n index = arr.index(num)\r\n if index == 0:\r\n return 'A'\r\n elif index == 1:\r\n return 'B'\r\n elif index == 2:\r\n return 'C'\r\n elif index == 3:\r\n return 'D'\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\narr = [len(a)-2, len(b)-2, len(c)-2, len(d)-2]\r\narr1 =[x for x in arr]\r\narr.sort()\r\nx = arr[3]\r\ny = arr[0]\r\nif x >= 2*arr[0] and x>= 2*arr[1] and x >= 2*arr[2] :\r\n if y <= arr[1]/2 and y <= 2*arr[2]/2 and y <= 2*arr[3]/2:\r\n print('C')\r\n else:\r\n print(ind(arr1, x)) \r\nelif y <= arr[1]/2 and y <= arr[2]/2 and y <= arr[3]/2:\r\n print(ind(arr1, y))\r\nelse:\r\n print('C') \r\n# print('arr is ', *arr) \r\n# print(x, 2*(arr[0] + arr[1] + arr[2])/3 )\r\n# print(y, (arr[1] + arr[2] + arr[3])/6)\r\n\r\n", "a = []\r\nans = ''\r\nfor i in range(4):\r\n a.append(len(input()) - 2)\r\nfor i in range(4):\r\n flag = True\r\n for j in range(4):\r\n if i != j:\r\n if a[i] * 2 > a[j]:\r\n flag = False\r\n if flag:\r\n ans += 'ABCD'[i]\r\n flag = True\r\n for j in range(4):\r\n if i != j:\r\n if a[i] < a[j] * 2:\r\n flag = False\r\n if flag:\r\n ans += 'ABCD'[i] \r\nif len(ans) == 1:\r\n print(ans)\r\nelse:\r\n print('C')", "a = input()[2:]\nb = input()[2:]\nc = input()[2:]\nd = input()[2:]\nl = sorted([(len(x), ans) for (x, ans) in [(a, 'A'), (b, 'B'), (c, 'C'), (d, 'D')]])\nif l[0][0] * 2 <= l[1][0] and l[2][0] * 2 <= l[3][0]:\n\tprint('C')\nelif l[0][0] * 2 <= l[1][0]:\n\tprint(l[0][1])\nelif l[2][0] * 2 <= l[3][0]:\n\tprint(l[3][1])\nelse:\n\tprint('C')\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\ncnta=0\r\ncntb=0\r\ncntc=0\r\ncntd=0\r\nx = len(a)-2\r\ny = len(b)-2\r\nz = len(c)-2\r\nw = len(d)-2\r\n#print(x,y,z,w)\r\nif (x>=2*y and x>=2*z and x>=2*w) or (2*x<=y and 2*x<=z and 2*x<=w):\r\n cnta+=1\r\nif (y>=2*x and y>=2*z and y>=2*w) or (2*y<=x and 2*y<=z and 2*y<=w):\r\n cntb+=1\r\nif (z>=2*y and z>=2*x and z>=2*w) or (2*z<=y and 2*z<=x and 2*z<=w):\r\n cntc+=1\r\nif (w>=2*y and w>=2*z and w>=2*x) or (2*w<=y and 2*w<=z and 2*w<=x):\r\n cntd+=1\r\n#print(cnta,cntb,cntc,cntd)\r\nif cnta>cntb and cnta>cntc and cnta>cntd:\r\n print(\"A\")\r\nelif cntb>cnta and cntb>cntc and cntb>cntd:\r\n print(\"B\")\r\nelif cntc>cnta and cntc>cntb and cntc>cntd:\r\n print(\"C\")\r\nelif cntd>cnta and cntd>cntb and cntd>cntc:\r\n print(\"D\")\r\nelse:\r\n print(\"C\")", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_next_line():\r\n tokens = stdin.readline().strip().split('.')\r\n return [tokens[0], len(tokens[1])]\r\n\r\n\r\nls = list(map(lambda _: read_next_line(), range(4)))\r\naccepted = [x for x in ls if all(t[0] == x[0] or t[1] / x[1] >= 2 for t in ls) or\r\n all(t[0] == x[0] or x[1] / t[1] >= 2 for t in ls)]\r\nprint(accepted[0][0] if len(accepted) == 1 else 'C')", "variants = [len(input()[2:]) for i in range(4)]\nis_awesome = [1]*4\nfor i in range(4):\n for j in range(4):\n if i != j and (not variants[i] * 2 <= variants[j]):\n is_awesome[i] = 0\n if not is_awesome[i]:\n is_awesome[i] = 1\n for j in range(4):\n if i != j and (not variants[i] / 2 >= variants[j]):\n is_awesome[i] = 0\nif sum(is_awesome) == 1:\n print(chr(ord('A') + is_awesome.index(1)))\nelse:\n print(\"C\")\n", "\r\na=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\ng = [a,b,c,d]\r\nh = [a,b,c,d]\r\n\r\nminPresent = False\r\nmaxPresent = False\r\ng.sort()\r\n\r\nif g[0]*2 <= g[1]:\r\n minPresent = True\r\nif g[3] >= g[2]*2:\r\n maxPresent = True\r\n\r\ntoPrint = ['A','B','C','D']\r\n\r\nif minPresent and (not maxPresent) :\r\n print(toPrint[h.index(g[0])])\r\nelif maxPresent and (not minPresent):\r\n print(toPrint[h.index(g[3])])\r\nelse:\r\n print('C')\r\n", "A = input()\r\na = len(A[A.find('.')+1:])\r\nB = input()\r\nb = len(B[B.find('.')+1:])\r\nC = input()\r\nc = len(C[C.find('.')+1:])\r\nD = input()\r\nd = len(D[D.find('.')+1:])\r\n\r\nans = \"C\"\r\ng = 0\r\nh = 0\r\n#print(a,b,c,d)\r\nif(a>=2*b and a>=2*c and a>=2*d):\r\n ans = \"A\"\r\n g+=1\r\nelif(b>=2*a and b>=2*c and b>=2*d):\r\n ans = \"B\"\r\n g+=1\r\nelif(c>=2*a and c>=2*b and c>=2*d):\r\n ans = \"C\"\r\n g+=1\r\nelif(d>=2*a and d>=2*b and d>=2*c):\r\n ans = \"D\"\r\n g+=1\r\n\r\nif(a<=b//2 and a<=c//2 and a<=d//2):\r\n ans = \"A\"\r\n h+=1\r\nelif(b<=a//2 and b<=c//2 and b<=d//2):\r\n ans = \"B\"\r\n h+=1\r\nelif(c<=a//2 and c<=b//2 and c<=d//2):\r\n ans = \"C\"\r\n h+=1\r\nelif(d<=a//2 and d<=b//2 and d<=c//2):\r\n ans = \"D\"\r\n h+=1\r\nif(h>0 and g>0 or h>1 or g>1):\r\n print(\"C\")\r\nelse:\r\n print(ans)\r\n \r\n", "a,b,c,d=input()[2:],input()[2:],input()[2:],input()[2:]\r\nlens={'A':len(a),'B':len(b),'C':len(c),'D':len(d)}\r\ncountofans=0\r\nans=''\r\nfor i in sorted(lens):\r\n flag1,flag2=True,True\r\n for j in sorted(lens):\r\n if i!=j and lens[i]/lens[j]<2:\r\n flag1=False\r\n for j in sorted(lens):\r\n if i!=j and lens[i]/lens[j]>0.5:\r\n flag2=False\r\n if flag1 or flag2:\r\n countofans+=1\r\n if countofans>=2:\r\n break\r\n ans=i\r\nif countofans==1:\r\n print(ans)\r\nelse:\r\n print('C')", "def getChar(x):\n\tif x == 0:\n\t\treturn 'A'\n\tif x == 1:\n\t\treturn 'B'\n\tif x == 2:\n\t\treturn 'C'\n\treturn 'D'\n\narr = []\nfor i in range(4):\n\ts = input()\n\tarr.append((i,s[2:]))\n\nfor i in range(4):\n\tfor j in range(i + 1, 4):\n\t\tif len(arr[j][1]) < len(arr[i][1]):\n\t\t\ttmp = arr[j]\n\t\t\tarr[j] = arr[i]\n\t\t\tarr[i] = tmp\n\ncounter = 0\ngreat = -1\n\nif len(arr[0][1]) * 2 <= len(arr[1][1]):\n\tgreat = arr[0][0]\n\tcounter = counter + 1\nif len(arr[3][1]) >= len(arr[2][1]) * 2:\n\tgreat = arr[3][0]\n\tcounter = counter + 1\n\nif counter == 2 or counter == 0:\n\tprint('C')\nelse:\n\tprint(getChar(great))", "a = [len(input()) - 2 for i in range(4)]\r\ncnt = 0\r\nres = 2\r\nfor i in range(4):\r\n flag1 = True\r\n flag2 = True\r\n for j in range(4):\r\n if j != i:\r\n if a[i] < a[j] * 2:\r\n flag1 = False\r\n if a[i] * 2 > a[j]:\r\n flag2 = False\r\n if flag1 or flag2:\r\n cnt += 1\r\n res = i\r\nif cnt == 1:\r\n print([\"A\", \"B\", \"C\", \"D\"][res])\r\nelse:\r\n print(\"C\")", "a = []\nfor i in range(4):\n c = input()\n a.append((len(c) - 2, c[0]))\na.sort()\ngs = a[0][0] * 2 <= a[1][0]\ngl = a[3][0] >= a[2][0] * 2\nif (gs and gl) or (not gs and not gl):\n print('C')\nelse:\n print(a[0][1] if gs else a[3][1])\n \t \t \t\t \t\t \t\t\t \t\t\t \t\t\t \t", "b=[]\r\nfor i in range(4):\r\n s=input()\r\n b.append([len(s)-2,s[0]])\r\nb.sort()\r\nif b[1][0]>=2*b[0][0] and b[3][0]>=2*b[2][0]:print('C')\r\nelif b[1][0]>=2*b[0][0]:print(b[0][1])\r\nelif b[3][0]>=2*b[2][0]:print(b[3][1])\r\nelse:print('C')\r\n", "a = []\r\nk = 0\r\nfor i in range(4):\r\n a.append(str(input())[2:])\r\nfor i in range(4):\r\n shorter, longer = True, True\r\n for j in range(4):\r\n if i != j:\r\n if len(a[i]) * 2 > len(a[j]):\r\n shorter = False\r\n if len(a[j]) * 2 > len(a[i]):\r\n longer = False\r\n if longer or shorter:\r\n k += 1\r\n ans = i\r\nif k == 1:\r\n print(chr(ord('A') + ans))\r\nelse:\r\n print('C')\r\n", "\r\na=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\nx=[a,b,c,d]\r\nans=[]\r\nfor i in range(4):\r\n\tf=[]\r\n\tfor j in range(4):\r\n\t\tif i!=j:\r\n\t\t\tif x[i]<(x[j]//2):\r\n\t\t\t\tf.append(1)\r\n\t\t\telif x[i]>2*x[j]:\r\n\t\t\t\tf.append(2)\r\n\t\t\telif x[i]==x[j]//2 or x[i]==2*x[j]:\r\n\t\t\t\tf.append(3)\r\n\tif len(f)==3 and (len(set(f))==1 or set(f)=={2,3} or set(f)=={1,3}):\r\n\t\tans.append(i)\r\nif len(ans)==1:\r\n\tprint(chr(65+ans[0]))\r\nelse:\r\n\tprint('C')", "def check(a,b,c,d):\r\n if (a>=b*2 and a>=c*2 and a>=d*2) or (a*2<=b and a*2<=c and a*2<=d):\r\n return 1\r\n else:\r\n return 0\r\na=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\nans=[\"A\",\"B\",\"C\",\"D\"]\r\ncnt=[check(a,b,c,d),check(b,a,c,d),check(c,a,b,d),check(d,a,b,c)]\r\n\r\nif sum(cnt)==1:\r\n for i in range(len(cnt)):\r\n if cnt[i]==1:\r\n print(ans[i])\r\nelse:\r\n print(\"C\")\r\n", "p={ __:len(input())-2 for __ in 'ABCD'}\r\nfrom math import floor\r\n#print(p)\r\nlas=None\r\ntot=0\r\nfor i in p:\r\n if all([(2*p[i])<=p[j] for j in p if i!=j]) or\\\r\n all([p[i]>=(p[j]*2) for j in p if i!=j]):\r\n las=i\r\n tot+=1\r\nif las!=None and tot==1:\r\n print(las)\r\nelse:\r\n print('C')\r\n", "l=[len(input()[2:]),len(input()[2:]),len(input()[2:]),len(input()[2:])]\r\na=['A','B','C','D']\r\nc=sorted(zip(l,a));l.sort()\r\na=[element for _, element in c]\r\nans=[]\r\nfor x in range(4):\r\n tem=0\r\n for y in l:\r\n if l[x]*2>y:tem+=1\r\n if tem==1: ans.append(a[x])\r\n else:\r\n tem = 0\r\n for y in l:\r\n if l[x] / 2 < y: tem += 1\r\n if tem == 1: ans.append(a[x])\r\nif len(ans)==1: print(ans[0])\r\nelse: print('C')", "# http://codeforces.com/problemset/problem/437/A\ndef getIndex(n):\n if n == 0:\n return \"A\"\n elif n == 1:\n return \"B\"\n elif n == 2:\n return \"C\"\n else:\n return \"D\"\ninp = []\nfor i in range(4):\n a = input()\n inp += [a.split(\".\")[1]]\n\nli = []\nfor x in inp:\n li += [len(x)]\n\nshort = 2*min(li)\ncount1 = 0\nfor i in li:\n if i >= short:\n count1 += 1\nmaxm = max(li) // 2\ncount2 = 0\nfor i in li:\n if i <= maxm:\n count2 += 1\n\nif count1 == 3 and count2 != 3:\n print(getIndex(li.index(int(short // 2))))\nelif count2 == 3 and count1 != 3:\n print(getIndex(li.index(int(maxm * 2))))\nelse:\n print(\"C\")\n\n", "# Problem Link: https://codeforces.com/problemset/problem/437/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\n\r\na = a[2:]\r\nb = b[2:]\r\nc = c[2:]\r\nd = d[2:]\r\n\r\nopts = [a, b, c, d]\r\nhalf = [0]*4\r\ndouble = [0]*4\r\n\r\nfor i in range(4):\r\n for j in range(4):\r\n if i != j:\r\n if len(opts[i]) <= len(opts[j])//2:\r\n half[i] += 1\r\n if len(opts[i]) >= len(opts[j])*2:\r\n double[i] += 1\r\n\r\ncountGood = 0\r\nlastGood = -1\r\n\r\nfor i in range(4):\r\n el = half[i] \r\n if el == 3:\r\n countGood += 1\r\n lastGood = i\r\n el = double[i]\r\n if el == 3:\r\n countGood += 1\r\n lastGood = i \r\n\r\nif countGood == 1:\r\n print(chr(ord('A') + lastGood))\r\nelse:\r\n print('C')", "a=[len(input())-2 for x in range(4)]\nb=sorted(a)\ntall=True\nif(b[0]*2<=b[1] and b[2]*2<=b[3]):\n print(\"C\")\n exit()\nif(b[0]*2<=b[1]):\n print(chr(65+a.index(b[0])))\n exit()\nelif(b[2]*2<=b[3]):\n print(chr(65+a.index(b[3])))\n exit()\n\n\n\nprint(\"C\")\n\n \t\t \t\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t\t \t\t", "__author__ = 'asmn'\nimport sys\n\n#sys.stdin = open('in')\n\ndescription = [chr(i + ord('A')) + input().strip()[3:] for i in range(4)]\ndescription.sort(key=lambda s: len(s))\n\nlong_exist = (len(description[3]) >= len(description[2]) * 2)\nshort_exist = (len(description[0]) * 2 <= len(description[1]))\n\nif long_exist and not short_exist:\n print(description[3][0])\nelif short_exist and not long_exist:\n print(description[0][0])\nelse:\n print('C')\n\n#print(list(map(len, description)))\n\n#print(short_exist,long_exist)", "'''\r\nCreated on ٠١‏/٠١‏/٢٠١٥\r\n\r\n@author: mohamed265\r\n''' \r\nnum = []\r\nnum.append(len(input())-2)\r\nnum.append(len(input())-2)\r\nnum.append(len(input())-2)\r\nnum.append(len(input())-2)\r\ntemp = min(num)\r\nindex = num.index(temp)\r\ncount = 0\r\nfor i in range(4):\r\n if i != index and num[i] >= 2 * temp:\r\n count += 1\r\ntemp = max(num)\r\nindex1 = num.index(temp)\r\ncount1 = 0\r\nfor i in range(4):\r\n if i != index1 and num[i] * 2 <= temp:\r\n count1 += 1\r\nif count == 3 and count1 != 3:\r\n print( 'A' if index == 0 else ('B' if index == 1 else ('C' if index == 2 else 'D')))\r\nelif count1 == 3 and count != 3:\r\n print( 'A' if index1 == 0 else ('B' if index1 == 1 else ('C' if index1 == 2 else 'D')))\r\nelse:\r\n print('C')", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nanswers = [input().strip()[2:] for i in range(4)]\r\n\r\ndef Solve(answers):\r\n \r\n d = {i:chr(ord(\"A\") + i) for i in range(4)}\r\n # print(*answers, sep = \"\\n\")\r\n \r\n arr = [(len(answers[i]),i) for i in range(4)]\r\n arr.sort()\r\n good_options = []\r\n # print(*arr, sep = \"\\n\")\r\n \r\n if 2 * arr[0][0] <= arr[1][0]:\r\n good_options += [arr[0][1]]\r\n \r\n if arr[-1][0] >= 2*arr[-2][0]:\r\n good_options += [arr[-1][1]]\r\n \r\n if len(good_options) == 1:\r\n i = good_options[0]\r\n return d[i]\r\n \r\n return \"C\"\r\n\r\nprint(Solve(answers))\r\n \r\n", "ml = []\r\nt = 4\r\nwhile t:\r\n s = input()\r\n ml.append([len(s)-2, s])\r\n t -= 1\r\nml.sort()\r\nans = ''\r\nif 2*ml[0][0] <= ml[1][0]:\r\n ans += ml[0][1][:1]\r\nif ml[-1][0] >= 2*ml[-2][0]:\r\n ans += ml[-1][1][:1]\r\nif len(ans) == 1:\r\n print(ans)\r\nelse:\r\n print('C')\r\n ###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___\r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "answers = ['A', 'B', 'C', 'D']\r\nvariants = []\r\nfor i in range(0, 4):\r\n variants.append((len(input()) - 2, answers[i]))\r\nasc = sorted(variants, key=lambda variant: variant[0])\r\ndes = sorted(variants, key=lambda variant: variant[0], reverse = True)\r\n\r\ngood_variants = []\r\nif (2 * asc[0][0] <= asc[1][0]):\r\n good_variants.append(asc[0])\r\nif (2 * des[1][0] <= des[0][0]):\r\n good_variants.append(des[0])\r\nprint(good_variants[0][1] if len(good_variants) == 1 else 'C')", "varianti=[input()[2:] for i in range(4)]\r\nlenz=[len(varianti[i]) for i in range(4)]\r\ncounter=0\r\nfor i in range(4):\r\n dub=lenz[:]\r\n now=dub.pop(i)\r\n c1=0\r\n c2=0\r\n for z in range(3):\r\n if(now/dub[z]>=2):\r\n c1+=1\r\n elif (dub[z]/now>=2):\r\n c2+=1\r\n if c1==3 or c2==3 :\r\n zamechat=i\r\n counter+=1\r\nif counter==1:\r\n print(['A','B','C','D'][zamechat])\r\nelse:\r\n print('C')\r\n", "choices = [input()[2:] for _ in range(4)]\r\n\r\ncnt = [0, 0, 0, 0]\r\n\r\nfor i in range(4):\r\n for j in range(4):\r\n if i != j:\r\n if len(choices[j]) >= 2 * len(choices[i]):\r\n cnt[i] += 1\r\n elif len(choices[j]) <= len(choices[i]) // 2:\r\n cnt[i] -= 1\r\n\r\ngreat_choices = [i for i, count in enumerate(cnt) if abs(count) == 3]\r\n\r\nif len(great_choices) == 1:\r\n print(chr(ord('A') + great_choices[0]))\r\nelse:\r\n print(\"C\")\r\n", "if __name__ == '__main__':\r\n lines = list()\r\n for i in range(4):\r\n lines.append([len(str(input())) - 2, i])\r\n lines.sort(key=lambda x: x[0])\r\n values = list()\r\n if lines[0][0] * 2 <= lines[1][0]:\r\n values.append(lines[0][1])\r\n if lines[2][0] * 2 <= lines[3][0]:\r\n values.append(lines[3][1])\r\n refer = 'ABCD'\r\n if len(values) == 1:\r\n print(refer[values[0]])\r\n else:\r\n print('C')\r\n", "a = sorted([(len(input()[2::]), 'ABCD'[i]) for i in range(4)])\r\nshort = a[0][0] * 2 <= a[1][0]\r\nlong = a[3][0] >= a[2][0] * 2\r\nif short and long:\r\n print('C')\r\nelif short:\r\n print(a[0][1])\r\nelif long:\r\n print(a[3][1])\r\nelse:\r\n print('C')", "s = []\r\nlength = [0] * 4\r\nfor i in range(4):\r\n s.append(input().rstrip())\r\n s[i] = s[i][2:]\r\n length[i] = len(s[i])\r\nvar = []\r\nfor i in range(4):\r\n if length[i] >= 2 * max(length[:i] + length[i + 1:]) or length[i] <= min(length[:i] + length[i + 1:]) // 2:\r\n var.append(i)\r\nif len(var) == 1:\r\n print(chr(ord('A') + var[0]))\r\nelse:\r\n print(\"C\")\r\n\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\n\r\neles = [a, b , c , d]\r\nelems = [a[2:], b[2:], c[2:], d[2:]]\r\n#print(elems)\r\ng = []\r\nl = [len(elems[0]),len(elems[1]), len(elems[2]), len(elems[3])]\r\n#print(l)\r\nfor i in range(4):\r\n ele = l[i]\r\n r = []\r\n for j in range(4):\r\n \r\n if i == j :\r\n continue\r\n else:\r\n ratio = ele / l[j]\r\n #print(ratio)\r\n r.append(ratio)\r\n #print(r)\r\n count = 0\r\n for k in range(len(r)):\r\n if r[k] <= 0.5 :\r\n count += 1\r\n if count == 3 :\r\n g.append(i)\r\n else:\r\n count1 = 0\r\n for c in range(len(r)):\r\n if r[c] >= 2:\r\n count1 += 1\r\n if count1 == 3:\r\n g.append(i)\r\n \r\n \r\n\r\nif len(g) == 1:\r\n print(eles[g[0]][0])\r\nelse:\r\n print('C')\r\n", "dic = {}\r\nfor i in range(4):\r\n choice,s = input().split('.')\r\n dic[choice] = len(s)\r\ncount = 0\r\nfor i in dic:\r\n check1=check2=1\r\n for j in dic:\r\n if i!=j:\r\n if dic[i]<dic[j]*2:\r\n check1 = 0\r\n if dic[i]>dic[j]/2:\r\n check2 = 0\r\n if check1 or check2:\r\n count += 1\r\n key = i\r\nif count==1:\r\n print(key)\r\nelse:\r\n print('C')\r\n\r\n\r\n\r\n \r\n", "v = [input()[2:] for i in range(4)]\r\nl = [(len(s),s) for s in v]\r\n\r\nmin_l, min_s = min(l)[0], min(l)[1]\r\nmax_l, max_s = max(l)[0], max(l)[1]\r\n\r\nmin_ind = 0\r\nmax_ind = 0\r\n\r\nfor i in range(4):\r\n if i != v.index(min_s) and len(v[i]) / min_l >= 2:\r\n min_ind += 1\r\n if i != v.index(max_s) and max_l / len(v[i]) >= 2:\r\n max_ind += 1\r\n\r\nif min_ind == 3 and max_ind != 3:\r\n print(chr(65 + v.index(min_s)))\r\nelif max_ind == 3 and min_ind != 3:\r\n print(chr(65 + v.index(max_s)))\r\nelse:print('C')", "answers = [len(input().split(\".\")[1]) for x in range(4)]\r\nletters = [\"A\", \"B\", \"C\", \"D\"]\r\ngood = []\r\nfor x in range(4):\r\n condition = True\r\n for y in range(4):\r\n if x != y and not answers[x] * 2 <= answers[y]:\r\n condition = False\r\n break\r\n if not condition:\r\n condition = True\r\n for y in range(4):\r\n if x != y and not answers[x] >= answers[y] * 2:\r\n condition = False\r\n break\r\n if condition:\r\n good.append(x)\r\nif len(good) != 1:\r\n print(\"C\")\r\nelse:\r\n print(letters[good[0]])", "d={};b,s,l=[],[],[];o=['A','B','C','D']\r\nfor i in range(4):d[i]=len(input())-2\r\nfor i in d:l.append(d[i])\r\nl.sort();\r\nfor i in range(4):\r\n\tu=0\r\n\tfor j in range(4):\r\n\t\tif(i!=j and l[i]*2<=l[j]): u+=1\r\n\tif u==3:b.append(l[i])\r\nfor i in range(4):\r\n\tu=0\r\n\tfor j in range(4):\r\n\t\tif(i!=j and l[i]/2>=l[j]): u+=1\r\n\tif u==3:s.append(l[i])\r\nk=-1\r\nif len(b)==0 and len(s)==1:k=s[0]\r\nelif len(s)==0 and len(b)==1:k=b[0]\r\nelse:print('C')\r\nif k!=-1:\r\n\tfor i in d:\r\n\t\tif d[i]==k:print(o[i]);break ", "def key(value):\r\n return value[0]\r\n\r\ndef OneToA(value):\r\n return \"ABCD\"[value]\r\n\r\nchoices = sorted([(len(input()) - 2 , x) for x in range(4)] , key=key)\r\n\r\nisLk = False\r\nindex = 0\r\nif 2 * choices[0][0] <= choices[1][0]:\r\n isLk = not isLk\r\n index = choices[0][1]\r\nif choices[-1][0] >= 2 * choices[-2][0]: \r\n isLk = not isLk\r\n index = choices[-1][1]\r\nif isLk:\r\n print(OneToA(index))\r\nelse:\r\n print(\"C\")", "a=input()\nb=input()\nc=input()\nd=input()\nlst=[(len(a) - 2 ,\"A\"),(len(b) - 2,\"B\"),(len(c) - 2,\"C\"),(len(d) - 2,\"D\")]\nf1 = 0\nf2 = 0\nlst.sort(key=lambda x:x[0], reverse=True)\nif lst[0][0] >= 2 * lst[1][0]:\n f1 = 1\nif lst[2][0] >= 2 * lst[3][0]:\n f2 = 1\nif (f1 and f2) or (not f1 and not f2):\n print(\"C\") \nelif f1:\n print(lst[0][1])\nelse:\n print(lst[3][1])\n\t\t \t \t \t \t \t\t\t\t \t\t \t \t\t\t", "l=[]\r\nfor i in range(4):\r\n x=input()\r\n l.append([len(x)-2,i])\r\nl.sort()\r\ncou=0\r\na,b,c,d=l\r\ngrt=[]\r\nif a[0]<=b[0]//2 and a[0]<=c[0]//2 and a[0]<=d[0]//2:\r\n grt.append(chr(a[1]+65))\r\n cou+=1\r\nif d[0]>=a[0]*2 and d[0]>=b[0]*2 and d[0]>=c[0]*2:\r\n grt.append(chr(d[1]+65))\r\n cou+=1\r\nif cou==2 or cou==0:\r\n print(\"C\")\r\nelse:\r\n print(grt[0])\r\n", "def condition(t, s1, s2, s3):\r\n n1, n2, n3, n4 = len(t[2:]), len(s1[2:]), len(s2[2:]), len(s3[2:])\r\n if n1 >= 2 * n2 and n1 >= 2 * n3 and n1 >= 2 * n4:\r\n return True\r\n elif 2 * n1 <= n2 and 2 * n1 <= n3 and 2 * n1 <= n4:\r\n return True\r\n return False\r\n\r\n\r\ndef homework(lst):\r\n x1 = condition(lst[0], lst[1], lst[2], lst[3])\r\n x2 = condition(lst[1], lst[0], lst[2], lst[3])\r\n x3 = condition(lst[2], lst[1], lst[0], lst[3])\r\n x4 = condition(lst[3], lst[1], lst[2], lst[0])\r\n if x1 and not x2 and not x3 and not x4:\r\n return \"A\"\r\n elif x2 and not x1 and not x3 and not x4:\r\n return \"B\"\r\n elif x3 and not x1 and not x2 and not x4:\r\n return \"C\"\r\n elif x4 and not x1 and not x2 and not x3:\r\n return \"D\"\r\n return \"C\"\r\n\r\n\r\na = list()\r\nfor i in range(4):\r\n s = input()\r\n a.append(s)\r\nprint(homework(a))\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns4=input()\r\nl1=len(s1)-2\r\nl2=len(s2)-2\r\nl3=len(s3)-2\r\nl4=len(s4)-2\r\nl=[l1,l2,l3,l4]\r\ni=l.index(min(l))\r\nr=l.index(max(l))\r\nc1=0\r\nj=0\r\nwhile j<4:\r\n if j!=i:\r\n if l[i]<=l[j]//2:\r\n j=j+1\r\n else:\r\n c1=1\r\n break\r\n else:\r\n j=j+1\r\nc2=0\r\nj=0\r\nwhile j<4:\r\n if j!=r:\r\n if l[r]>=l[j]*2:\r\n j=j+1\r\n else:\r\n c2=1\r\n break\r\n else:\r\n j=j+1\r\nif c1==0 and c2==1:\r\n if i==0:\r\n print('A')\r\n elif i==1:\r\n print('B')\r\n elif i==2:\r\n print('C')\r\n elif i==3:\r\n print('D')\r\nelif c1==1 and c2==0:\r\n if r==0:\r\n print('A')\r\n elif r==1:\r\n print('B')\r\n elif r==2:\r\n print('C')\r\n elif r==3:\r\n print('D')\r\nelse:\r\n print('C')", "a = len(str(input())[2:])\r\nb = len(str(input())[2:])\r\nc = len(str(input())[2:])\r\nd = len(str(input())[2:])\r\ncnt = 0\r\nans = \"C\"\r\nif 2 * a <= min(b, c, d) or a >= 2 * max(b, c, d):\r\n cnt += 1\r\n ans = \"A\"\r\nif 2 * b <= min(a, c, d) or b >= 2 * max(a, c, d):\r\n cnt += 1\r\n ans = \"B\"\r\nif 2 * c <= min(a, b, d) or c >= 2 * max(a, b, d):\r\n cnt += 1\r\n ans = \"C\"\r\nif 2 * d <= min(a, b, c) or d >= 2 * max(a, b, c):\r\n cnt += 1\r\n ans = \"D\"\r\nif cnt > 1:\r\n ans = \"C\"\r\nprint(ans)", "options, lengths = {}, []\r\nfor _ in range(4):\r\n option = input()\r\n length = len(option) - 2\r\n lengths.append(length)\r\n options[length] = option[0]\r\n\r\nlengths.sort()\r\nchoice = []\r\nif lengths[0] <= lengths[1]//2:\r\n choice.append(lengths[0])\r\nif lengths[-1] >= lengths[-2]*2:\r\n choice.append(lengths[-1])\r\n\r\nif len(choice) == 1:\r\n print(options[choice[0]])\r\nelse:\r\n print(\"C\")\r\n", "def choice(a,b,c,d):\r\n l1=[a,b,c,d]\r\n A={}\r\n lc=0\r\n gc=0\r\n for i in range(4):\r\n A[chr(65+i)]=len([j for j in l1[i][2:]])\r\n arr=sorted(A.values())\r\n if 2*arr[0]<=arr[1]:\r\n lc+=1\r\n if (arr[3])/2>=arr[2]:\r\n gc+=1\r\n if lc==0 and gc==1:\r\n for i,j in A.items():\r\n if j==arr[3]:\r\n return i\r\n if lc==1 and gc==0:\r\n for i,j in A.items():\r\n if j==arr[0]:\r\n return i\r\n return 'C'\r\na=input()\r\nb=input()\r\nc=input()\r\nd=input()\r\nprint(choice(a,b,c,d))\r\n\r\n", "'''\r\nCreated on 2016年3月4日\r\n\r\n@author: HaoGe\r\n'''\r\nchoise=[]\r\nfor i in range(4):\r\n ci=input()\r\n choise.append( [ len(ci)-2, ci[0] ] )\r\nchoise.sort()\r\nif 2*choise[0][0]<=choise[1][0] and choise[3][0]<2*choise[2][0]:\r\n print(choise[0][1])\r\nelif choise[3][0]>=2*choise[2][0] and 2*choise[0][0]>choise[1][0]:\r\n print(choise[3][1])\r\nelse:\r\n print('C')\r\n\r\n\r\n", "a = len(input()[2:])\r\nb = len(input()[2:])\r\nc = len(input()[2:])\r\nd = len(input()[2:])\r\ncnt, res = 0, 'C'\r\nif 2 * a <= min(b, c, d) or a >= 2 * max(b, c, d):\r\n cnt += 1 ; res = 'A'\r\nif 2 * b <= min(a, c, d) or b >= 2 * max(a, c, d):\r\n cnt += 1 ; res = 'B'\r\nif 2 * c <= min(a, b, d) or c >= 2 * max(a, b, d):\r\n cnt += 1 ; res = 'C'\r\nif 2 * d <= min(a, b, c) or d >= 2 * max(a, b, c):\r\n cnt += 1 ; res = 'D'\r\nprint('C' if cnt > 1 else res)\r\n", "a = [len(input().strip()[2:]) for i in range(4)]\r\nwond = set()\r\nfor i in range(4):\r\n good = 1\r\n for j in range(4):\r\n if i != j and a[i] > a[j] // 2:\r\n good = 0\r\n if good:\r\n wond.add(i)\r\nfor i in range(4):\r\n good = 1\r\n for j in range(4):\r\n if i != j and a[i] // 2 < a[j]:\r\n good = 0\r\n if good:\r\n wond.add(i)\r\nd = {0:'A', 1:'B', 2:'C', 3:'D'}\r\nif len(wond) != 1:\r\n print('C')\r\nelse:\r\n print(d[list(wond)[0]])\r\n", "# -*- coding: utf-8 -*-\r\n\r\na = [len(input()[2:]), 'A']\r\nb = [len(input()[2:]), 'B']\r\nc = [len(input()[2:]), 'C']\r\nd = [len(input()[2:]), 'D']\r\nans = None\r\n\r\nl = list(sorted([a, b, c, d]))\r\n\r\nif l[0][0] * 2 <= l[1][0] and l[2][0] * 2 > l[3][0]:\r\n ans = l[0][1]\r\nelif l[2][0] * 2 <= l[3][0] and l[0][0] * 2 > l[1][0]:\r\n ans = l[3][1]\r\nelse:\r\n ans = 'C'\r\n\r\nprint(ans)", "l1=list(str(input()))\r\nl2=list(str(input()))\r\nl3=list(str(input()))\r\nl4=list(str(input()))\r\nc=[]\r\nif (len(l1)-2>=(2*(len(l2)-2)) and len(l1)-2>=(2*(len(l3)-2)) and len(l1)-2>=(2*(len(l4)-2))) or (len(l2)-2>=(2*(len(l1)-2)) and len(l3)-2>=(2*(len(l1)-2)) and len(l4)-2>=(2*(len(l1)-2))):\r\n c.append(1)\r\nelse:\r\n c.append(0)\r\nif (len(l2)-2>=(2*(len(l1)-2)) and len(l2)-2>=(2*(len(l3)-2)) and len(l2)-2>=(2*(len(l4)-2))) or (len(l1)-2>=(2*(len(l2)-2)) and len(l3)-2>=(2*(len(l2)-2)) and len(l4)-2>=(2*(len(l2)-2))):\r\n c.append(1)\r\nelse:\r\n c.append(0)\r\nif (len(l3)-2>=(2*(len(l2)-2)) and len(l3)-2>=(2*(len(l1)-2)) and len(l3)-2>=(2*(len(l4)-2))) or (len(l2)-2>=(2*(len(l3)-2)) and len(l1)-2>=(2*(len(l3)-2)) and len(l4)-2>=(2*(len(l3)-2))):\r\n c.append(1)\r\nelse:\r\n c.append(0)\r\nif (len(l4)-2>=(2*(len(l2)-2)) and len(l4)-2>=(2*(len(l3)-2)) and len(l4)-2>=(2*(len(l1)-2))) or (len(l2)-2>=(2*(len(l4)-2)) and len(l3)-2>=(2*(len(l4)-2)) and len(l1)-2>=(2*(len(l4)-2))):\r\n c.append(1)\r\nelse:\r\n c.append(0)\r\nd={0:\"A\",1:\"B\",2:\"C\",3:\"D\"}\r\nif c.count(1)>1 or c.count(1)==0:\r\n print(\"C\")\r\nelse:\r\n for j in range(4):\r\n if c[j]==1:\r\n print(d[j])", "from os import path\r\nimport sys\r\nfrom collections import Counter\r\nfrom itertools import combinations\r\nimport math\r\nimport string\r\n# # # to store indices for all values in an array as a list\r\n# # # basically map<int, vector<int>> \r\n\r\n# # from collections import defaultdict\r\n# # counter = defaultdict(list)\r\n# # for index, value in enumerate(nums):\r\n# # counter[value].append(index)\r\n# def index(a, x):\r\n# 'Locate the leftmost value exactly equal to x'\r\n# i = bisect_left(a, x)\r\n# if i != len(a) and a[i] == x:\r\n# return i\r\n# return -1\r\n\r\n# def find_lt(a, x):\r\n# 'Find rightmost value less than x'\r\n# i = bisect_left(a, x)\r\n# if i:\r\n# return a[i-1]\r\n# return -1\r\n\r\n# def find_le(a, x):\r\n# 'Find rightmost value less than or equal to x'\r\n# i = bisect_right(a, x)\r\n# if i:\r\n# return a[i-1]\r\n# return -1\r\n\r\n# def find_gt(a, x):\r\n# 'Find leftmost value greater than x'\r\n# i = bisect_right(a, x)\r\n# if i != len(a):\r\n# return a[i]\r\n# return -1\r\n\r\n# def find_ge(a, x):\r\n# 'Find leftmost item greater than or equal to x'\r\n# i = bisect_left(a, x)\r\n# if i != len(a):\r\n# return a[i]\r\n# return -1\r\n\r\n# def cumsum(arr):\r\n# return list(accumulate(arr))\r\n# find first element greater than equal to x\r\nif path.exists('input.txt'):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\ndef yesline():\r\n print(\"YES\", end = \"\\n\")\r\n return\r\ndef noline():\r\n print(\"NO\",end=\"\\n\")\r\n return\r\ndef nline():\r\n # print() automatically prints a line without specifying anything so \r\n # do this if u need an extra line\r\n print()\r\ndef getlist():\r\n arr = list(map(int,input().strip().split()))\r\n return arr\r\ndef getint():\r\n n = int(input())\r\n return n\r\ndef twos():\r\n n,m = map(int,input().split())\r\n return n,m\r\n\r\ndef Highestpoweroftwo(n):\r\n p = int(math.log(n,2))\r\n return int(pow(2,p))\r\n\r\ndef powerofTwo(x):\r\n return (x and (not(x & (x - 1))) )\r\n################## CODE ###########################\r\n# def factors(n):\r\n# step = 2 if n%2 else 1\r\n# return list(set(reduce(list.__add__,([i, n//i] for i in range(1, int(sqrt(n))+1, step) if n % i == 0))))\r\na = sorted([(len(input())-2,i) for i in 'ABCD'])\r\nans = \"\"\r\nif a[0][0]*2 <= a[1][0]:\r\n ans += a[0][1] \r\nif a[3][0] >= 2 * a[2][0]:\r\n ans += a[3][1]\r\nprint(ans if len(ans)==1 else \"C\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# Codeforces Problemset\r\n# 437A\r\n\r\na = len(input()) - 2\r\nb = len(input()) - 2\r\nc = len(input()) - 2\r\nd = len(input()) - 2\r\ngreat = []\r\n\r\nif 2*a <= b and 2*a <= c and 2*a <= d:\r\n great.append('A')\r\n\r\nelif 2*b <= a and 2*b <= c and 2*b <= d:\r\n great.append('B')\r\n\r\nelif 2*c <= a and 2*c <= b and 2*c <= d:\r\n great.append('C')\r\n\r\nelif 2*d <= a and 2*d <= b and 2*d <= c:\r\n great.append('D')\r\n\r\nif a >= 2*b and a >= 2*c and a >= 2*d:\r\n great.append('A')\r\n\r\nelif b >= 2*a and b >= 2*c and b >= 2*d:\r\n great.append('B')\r\n\r\nelif c >= 2*a and c >= 2*b and c >= 2*d:\r\n great.append('C')\r\n\r\nelif d >= 2*a and d >= 2*b and d >= 2*c:\r\n great.append('D')\r\n\r\nif len(great) == 1:\r\n print(great[0])\r\n\r\nelse:\r\n print('C')\r\n", "a = []\r\n\r\nfor i in range(4):\r\n a.append(len(input()) - 2)\r\n\r\nans = list(\"ABCD\")\r\n\r\ntosc = ''\r\n\r\nfor i in range(4):\r\n ok1 = 1;\r\n ok2 = 1;\r\n\r\n for j in range(4):\r\n if i == j:\r\n continue;\r\n if a[i] < 2 * a[j]:\r\n ok1 = 0\r\n if a[i] * 2 > a[j]:\r\n ok2 = 0\r\n\r\n if any((ok1, ok2)):\r\n if tosc:\r\n tosc = 'C'\r\n else:\r\n tosc = ans[i]\r\n\r\nprint(tosc if tosc else 'C')\r\n", "def solve(arr):\r\n ans = list(\"ABCD\")\r\n res = \"\"\r\n for i in range(4):\r\n l1 = 1\r\n l2 = 1\r\n for j in range(4):\r\n if i != j:\r\n if arr[i] < 2 * arr[j]:\r\n l1 = 0\r\n if arr[i] * 2 > arr[j]:\r\n l2 = 0\r\n\r\n if any((l1, l2)):\r\n if res:\r\n res = \"C\"\r\n else:\r\n res = ans[i]\r\n\r\n return res if res else \"C\"\r\n\r\narr = []\r\nfor i in range(4):\r\n arr.append(len(input()) - 2)\r\nprint(solve(arr))", "a=[]\r\nfor i in range(4):\r\n c=input()\r\n a.append((len(c)-2,c[0]))\r\na.sort()\r\ngs = a[0][0] * 2 <= a[1][0]\r\ngl =a[3][0] >= a[2][0] * 2\r\nif(gs and gl) or (not gs and not gl):\r\n print(\"C\")\r\nelse:\r\n print(a[0][1]if gs else a[3][1])", "# Description of the problem can be found at http://codeforces.com/problemset/problem/437/A\r\n\r\nmax_i = -1\r\nmax_l = \"A\"\r\nmin_i = -1\r\nmin_l = 100\r\nc = \"E\"\r\n\r\nl_s = list()\r\nfor _ in range(4):\r\n l_s.append(input())\r\n\r\nl_s.sort(key = lambda x: len(x))\r\n\r\nif (len(l_s[0]) - 2) * 2 <= len(l_s[1]) - 2:\r\n if len(l_s[3]) - 2 >= (len(l_s[2]) - 2) * 2:\r\n print(\"C\")\r\n else:\r\n print(l_s[0][0])\r\nelif len(l_s[3]) - 2 >= (len(l_s[2]) - 2) * 2:\r\n print(l_s[3][0])\r\nelse:\r\n print(\"C\")", "x=[]\r\nfor i in range(4):\r\n x.append(len(input())-2)\r\nn=0\r\nv=0\r\nfor i in range(4):\r\n a,b=0,0\r\n for j in range(4):\r\n if x[i]<=x[j]/2:\r\n a+=1\r\n for j in range(4):\r\n if x[i]>=x[j]*2:\r\n b+=1\r\n if a==3 or b==3:\r\n n+=1\r\n v=chr(65+i)\r\nif n==1:\r\n print(v)\r\nelse:\r\n print(\"C\")", "a=input()\r\nb=input()\r\nc=input()\r\nd=input()\r\na1=len(a)-2\r\nb1=len(b)-2\r\nc1=len(c)-2\r\nd1=len(d)-2\r\nv=[a1,b1,c1,d1]\r\np=[]\r\ngod=[]\r\nfor i in range(4):\r\n k=[]\r\n for j in range(4):\r\n if i!=j:\r\n k.append(v[i]/v[j])\r\n p.append(k)\r\nfor i in range(4):\r\n t=0\r\n k=0\r\n for j in range(3):\r\n if p[i][j]>=2:\r\n t=t+1\r\n elif p[i][j]<=0.5:\r\n k+=1\r\n if (k==0 and t==3) or (t==0 and k==3):\r\n if i==0:\r\n god.append('A')\r\n elif i==1:\r\n god.append('B')\r\n elif i==2:\r\n god.append('C')\r\n else:\r\n god.append('D')\r\nif len(god)==1:\r\n print(god[0])\r\nelse:\r\n print('C')\r\n", "k = lambda x: len(x)-2\r\nc = sorted([input() for i in range(4)], key=k)\r\nl = list(map(k,c))\r\nf,g = 2*l[0] <= l[1], 2*l[2] <= l[3]\r\nif f and not g:\r\n print(c[0][0])\r\nelif g and not f:\r\n print(c[3][0])\r\nelse:\r\n print('C')\r\n", "a=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\ncnt=0\r\nans='e'\r\nif (a>=b*2 and a>=c*2 and a>=d*2) or (a*2<=b and a*2<=c and a*2<=d) :\r\n ans='A'\r\n cnt+=1\r\na , b = b , a \r\nif (a>=b*2 and a>=c*2 and a>=d*2) or (a*2<=b and a*2<=c and a*2<=d) :\r\n ans='B'\r\n cnt+=1\r\na,c=c,a\r\nif (a>=b*2 and a>=c*2 and a>=d*2) or (a*2<=b and a*2<=c and a*2<=d) :\r\n ans='C'\r\n cnt+=1\r\na,d=d,a\r\nif (a>=b*2 and a>=c*2 and a>=d*2) or (a*2<=b and a*2<=c and a*2<=d) :\r\n ans='D'\r\n cnt+=1\r\nif cnt > 1 or cnt ==0:\r\n ans='C'\r\nprint(ans)\r\n\r\n\r\n \r\n\r\n\r\n \r\n ", "from array import array\r\na = array(\"i\",[x for x in range(0,4)])\r\naa = [\"\" for x in range(0,4)]\r\nfor x in range(0,4):\r\n\taa[x] = input()\r\nfor i in range(0,4):\r\n\ta[i]=len(aa[i])-2\r\nd ,c = -1,0\r\nfor i in range(0,4):\r\n\tif a[i]<=a[(i+1)%4]/2 and a[i]<=a[(i+2)%4]/2 and a[i]<=a[(i+3)%4]/2 :\r\n\t\td=i\r\n\t\tc+=1\r\n\tif a[i]>=a[(i+1)%4]*2 and a[i]>=a[(i+2)%4]*2 and a[i]>=a[(i+3)%4]*2 :\r\n\t\td=i\r\n\t\tc+=1\r\nif c == 1:\r\n\tif d==0:\r\n\t\tprint(\"A\")\r\n\telif d == 1:\r\n\t\tprint(\"B\")\r\n\telif d == 2:\r\n\t\tprint(\"C\")\r\n\telse:\r\n\t\tprint(\"D\")\r\nelse:\r\n\tprint(\"C\")\r\n\r\n\r\n\r\n\r\n", "answerlist=[]\r\nlengthlist=[]\r\ngreat=0\r\nfinallist=['A','B','C','D']\r\nfor i in range(4):\r\n answerlist.append(str(input()))\r\n lengthlist.append(len(answerlist[i])-2)\r\n\r\nlengthlist1=lengthlist[:]\r\nlengthlist.sort()\r\n\r\nif lengthlist[0]*2<=lengthlist[1]:\r\n great=1\r\nif lengthlist[3]>=lengthlist[2]*2:\r\n if great==1:\r\n great=0\r\n else:\r\n great=2\r\nif great==0:\r\n print('C')\r\nif great==1:\r\n print(finallist[lengthlist1.index(lengthlist[0])])\r\nif great==2:\r\n print(finallist[lengthlist1.index(lengthlist[3])])", "def compare_with_front_element(v,pos):\r\n\treturn v[pos+1][2]/v[pos][2]>=2\r\n\r\ndef child_choice(v):\r\n\tv.sort(key=lambda x:x[2])\r\n\twonderful_list=[]\r\n\tif compare_with_front_element(v,0):\r\n\t\twonderful_list.append(v[0][0])\r\n\tif compare_with_front_element(v,2):\r\n\t\twonderful_list.append(v[3][0])\r\n\tif len(wonderful_list)==1:\r\n\t\treturn wonderful_list[0]\r\n\treturn 'C'\r\n\r\n\r\nv=[]\r\nfor c in range(4):\r\n\tvar,t=input().split('.')\r\n\tv.append((var,t,len(t)))\r\n\r\nprint(child_choice(v))\r\n", "one = len(input().split(\".\")[1])\r\ntwo = len(input().split(\".\")[1])\r\nthree = len(input().split(\".\")[1])\r\nfour = len(input().split(\".\")[1])\r\n\r\nl = [one, two, three, four]\r\na = [\"A\", \"B\", \"C\", \"D\"]\r\nans = []\r\nfor i in range(0, 4):\r\n pos = True\r\n for j in range(0, 4):\r\n if(i!=j):\r\n if l[i] * 2 > l[j]:\r\n pos = False\r\n if pos:\r\n ans.append(a[i])\r\n else:\r\n pos = True\r\n for j in range(0, 4):\r\n if(i!=j):\r\n if l[j] * 2 > l[i]:\r\n pos = False\r\n if pos:\r\n ans.append(a[i])\r\n\r\nif(len(ans) == 1):\r\n print(ans[0])\r\nelse:print(\"C\")", "a=len(input()[2:])\r\nb=len(input()[2:])\r\nc=len(input()[2:])\r\nd=len(input()[2:])\r\nnice,k=0,'C'\r\nif a>=2*b and a>=2*c and a>=2*d:nice+=1;k='A'\r\nif 2*a<=b and 2*a<=c and 2*a<=d:nice+=1;k='A'\r\n\r\nif b>=2*a and b>=2*c and b>=2*d:nice+=1;k='B'\r\nif 2*b<=a and 2*b<=c and 2*b<=d:nice+=1;k='B'\r\n\r\nif c>=2*b and c>=2*a and c>=2*d:nice+=1;k='C'\r\nif 2*c<=b and 2*c<=a and 2*c<=d:nice+=1;k='C'\r\n\r\nif d>=2*b and d>=2*c and d>=2*a:nice+=1;k='D'\r\nif 2*d<=b and 2*d<=c and 2*d<=a:nice+=1;k='D'\r\n\r\nif nice==1:print(k)\r\nelse:print('C')", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nl = list()\r\nfor i in range(4) :\r\n s = input()\r\n l.append([len(s)-2,s[0]])\r\nl = sorted(l)\r\nflag1 ,flag2 = 1,1 \r\nfor i in range(1,4) :\r\n if(2*l[0][0] > l[i][0]) :\r\n flag1 = 0\r\n break\r\nfor i in range(2,-1,-1) :\r\n if(l[3][0] < 2*l[i][0]) :\r\n flag2 = 0 \r\n break\r\n# print(l)\r\nif(flag1 and not flag2) : print(l[0][1])\r\nelif(flag2 and not flag1) : print(l[3][1])\r\nelse : print('C')", "Astr = input()\nBstr = input()\nCstr = input()\nDstr = input()\nA_len = len(Astr[2:])\nB_len = len(Bstr[2:])\nC_len = len(Cstr[2:])\nD_len = len(Dstr[2:])\narr = [A_len, B_len, C_len, D_len]\ndet=\"ABCD\"\nlast_det=[]\nfor i in range(4):\n last_arr=arr.copy()\n last_arr.pop(i)\n if arr[i] >= 2 * last_arr[0] and arr[i] >= 2 * last_arr[1] and arr[i] >= 2 * last_arr[2]:\n # print(det[i])\n last_det.append(det[i])\nfor j in range(4):\n last_arr=arr.copy()\n last_arr.pop(j)\n if arr[j] <= 1/2 * last_arr[0] and arr[j] <= 1/2 * last_arr[1] and arr[j] <= 1/2 * last_arr[2]:\n # print(det[j])\n last_det.append(det[j])\nif len(last_det) ==1:\n print(last_det[0])\nelse:\n print(\"C\")\n\n\n\n\t \t \t \t\t\t\t\t\t \t \t\t \t \t\t", "s,c = [],[]\r\n\r\nfor i in range(4):\r\n x = input()\r\n s.append(x)\r\n c.append(len(x)-2)\r\n \r\nc.sort()\r\n\r\nhasMax = c[3]>=c[2]*2\r\nhasMin = c[0]<=c[1]/2\r\n\r\nif hasMax==hasMin:\r\n print('C')\r\nelif hasMin:\r\n for i in range(4):\r\n if c[0]+2 == len(s[i]):\r\n print(s[i][0])\r\nelif hasMax:\r\n for i in range(4):\r\n if c[3]+2 == len(s[i]):\r\n print(s[i][0])", "lis=[]\r\nfor i in range(4):\r\n lis.append(len(input())-2)\r\npos=[]\r\nif (lis[1]//lis[0]>=2 and lis[2]//lis[0]>=2 and lis[3]//lis[0]>=2) or \\\r\n (lis[0]//lis[1]>=2 and lis[0]//lis[2]>=2 and lis[0]//lis[3]>=2):\r\n pos.append('A')\r\nif (lis[0]//lis[1]>=2 and lis[2]//lis[1]>=2 and lis[3]//lis[1]>=2) or \\\r\n (lis[1]//lis[0]>=2 and lis[1]//lis[2]>=2 and lis[1]//lis[3]>=2):\r\n pos.append('B')\r\nif (lis[1]//lis[2]>=2 and lis[0]//lis[2]>=2 and lis[3]//lis[2]>=2) or \\\r\n (lis[2]//lis[1]>=2 and lis[2]//lis[0]>=2 and lis[2]//lis[3]>=2):\r\n pos.append('C')\r\nif (lis[1]//lis[3]>=2 and lis[2]//lis[3]>=2 and lis[0]//lis[3]>=2) or \\\r\n (lis[3]//lis[1]>=2 and lis[3]//lis[2]>=2 and lis[3]//lis[0]>=2):\r\n pos.append('D')\r\nif len(pos)==1:\r\n print(pos[0])\r\nelse:\r\n print('C')\r\n \r\n \r\n ", "a = []\r\nb = []\r\nfor i in range(4):\r\n x = input()\r\n a.append(len(x[2:]))\r\n b.append(x)\r\nc = a.copy()\r\na.sort()\r\nif 2 * a[0] <= a[1] and a[-1] < 2 * a[-2]:\r\n print(b[c.index(a[0])][0])\r\nelif a[-1] >= 2 * a[-2] and 2 * a[0] > a[1]:\r\n print(b[c.index(a[-1])][0])\r\nelse:\r\n print('C')", "# Problem d\r\nimport sys, functools, string\r\ninput = lambda: sys.stdin.readline()[:-1]\r\nget_int = lambda: int(input())\r\nget_int_list = lambda: list(map(int,input().split()))\r\n\r\ndef solve(a,b,c,d):\r\n lens = list(map(len,[a,b,c,d]))\r\n great = [False]*4\r\n for i in range(4):\r\n sflag = True\r\n bflag = True\r\n for j in range(4):\r\n if i != j:\r\n if lens[i] * 2 > lens[j]:\r\n sflag = False\r\n if lens[j] * 2 > lens[i]:\r\n bflag = False\r\n if sflag or bflag:\r\n great[i] = True\r\n if sum(great) == 1:\r\n return 'ABCD'[great.index(True)]\r\n return \"C\"\r\n\r\na,b,c,d = [input()[2:] for _ in range(4)]\r\nprint(solve(a,b,c,d))\r\n", "a=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\nans=''\r\nif (a*2<=b and a*2<=c and a*2<=d) or (b*2<=a and c*2<=a and d*2<=a):\r\n ans+='A'\r\nif (b*2<=a and b*2<=c and b*2<=d) or (a*2<=b and c*2<=b and d*2<=b):\r\n ans+='B'\r\nif (c*2<=b and c*2<=a and c*2<=d) or (b*2<=c and a*2<=c and d*2<=c):\r\n ans+='C'\r\nif (d*2<=b and d*2<=c and d*2<=a) or (b*2<=d and c*2<=d and a*2<=d):\r\n ans+='D'\r\nif len(ans)==1: print(ans)\r\nelse: print('C')", "\"\"\"\r\nCodeforces Round 250 Div 2 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\nclass IOHandlerObject(object):\r\n def getInput(self, mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0:\r\n return inputs\r\n if mode == 1:\r\n return inputs.split()\r\n if mode == 2:\r\n return [int(x) for x in inputs.split()]\r\n\r\n def writeOutput(self, s=\"\\n\"):\r\n if isinstance(s, list): s = \" \".join(s)\r\n print(s)\r\n\r\nIOHandler = IOHandlerObject()\r\ng = IOHandler.getInput\r\nw = IOHandler.writeOutput\r\n\r\n############################## SOLUTION ##############################\r\na,b,c,d = g(0),g(0),g(0),g(0)\r\nr = [(len(a)-2,0), (len(b)-2,1), (len(c)-2,2), (len(d)-2,3)]\r\nr.sort()\r\nt = -1\r\nif r[0][0]*2 <= r[1][0]: t = r[0][1]\r\nif r[3][0] >= r[2][0] * 2:\r\n if not t+1:\r\n t = r[3][1]\r\n else:\r\n t = 5\r\n\r\nif t == -1 or t == 5:\r\n print(\"C\")\r\nelse:\r\n print(chr(65+t))", "keys = []\r\nvalues = []\r\nfor i in range(4):\r\n k,v = input().split(\".\")\r\n values.append(v)\r\n keys.append(k)\r\n\r\ngreat = []\r\n\r\nfor i in range(4):\r\n c = 0\r\n for j in range(4):\r\n if i!=j and len(values[i]) <= 0.5 * len(values[j]):\r\n c += 1\r\n if i!=j and len(values[i]) >= 2 * len(values[j]):\r\n c -= 1\r\n if c == 3 or c== -3:\r\n great.append(keys[i])\r\n\r\nif len(great) == 1:\r\n print(great[0])\r\nelse:\r\n print(\"C\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "questionNames = ['A', 'B', 'C', 'D']\n\nlengths = [(len(input()) - 2, questionNames[i]) for i in range(4)]\nlengths.sort()\n\nfirstIsGreat = (lengths[0][0] <= lengths[1][0] // 2)\nlastIsGreat = (lengths[3][0] >= lengths[2][0] * 2)\n\nif firstIsGreat ^ lastIsGreat:\n\tif firstIsGreat:\n\t\tprint(lengths[0][1])\n\telse:\n\t\tprint(lengths[3][1])\nelse:\n\tprint('C')\n", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\narr = [len(a)-2,len(b)-2,len(c)-2,len(d)-2]\r\nak = min(arr)\r\nam = max(arr)\r\nflag,flag2=0,0\r\nfor i in range(4):\r\n\tif 2*ak<=arr[i]:\r\n\t\tflag+=1\r\n\tif am>=2*arr[i]:\r\n\t\tflag2+=1\r\nif flag2>=3 and flag<3:\r\n\tprint(chr(arr.index(am)+65))\r\nelif flag>=3 and flag2<3:\r\n\tprint(chr(arr.index(ak)+65))\r\nelse:\r\n\tprint('C')", "a = input()[2:]\r\nb = input()[2:]\r\nc = input()[2:]\r\nd = input()[2:]\r\nlst = [a,b,c,d]\r\nlst.sort(key = len)\r\nif 2*len(lst[0]) <= len(lst[1]) and 2*len(lst[2]) > len(lst[3]) or 2*len(lst[0]) > len(lst[1]) and 2*len(lst[2]) <= len(lst[3]):\r\n if 2*len(lst[0]) <= len(lst[1]) and 2*len(lst[2]) > len(lst[3]):\r\n if lst[0] == a:\r\n print(\"A\")\r\n elif lst[0] == b:\r\n print(\"B\")\r\n elif lst[0] == c:\r\n print(\"C\")\r\n else:\r\n print(\"D\")\r\n else:\r\n lst[0] = lst[-1]\r\n if lst[0] == a:\r\n print(\"A\")\r\n elif lst[0] == b:\r\n print(\"B\")\r\n elif lst[0] == c:\r\n print(\"C\")\r\n else:\r\n print(\"D\")\r\nelse:\r\n print(\"C\")", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\ndef solve():\r\n\ta=input()\r\n\tb=input()\r\n\tc=input()\r\n\td=input()\r\n\tla,lb,lc,ld=len(a[2:]),len(b[2:]),len(c[2:]),len(d[2:])\r\n\tl=[la,lb,lc,ld]\r\n\td={\r\n\t0:\"A\",\r\n\t1:\"B\",\r\n\t2:\"C\",\r\n\t3:\"D\"\r\n\t}\r\n\tc1,c2,ans=0,0,0\r\n\tll=[]\r\n\tfor i in range(4):\r\n\t\tfor j in range(4):\r\n\t\t\tif l[i]>=2*l[j]:\r\n\t\t\t\tc1+=1\r\n\t\t\telif l[i]<=(l[j]/2):\r\n\t\t\t\tc2+=1\r\n\t\tif c1==3 or c2==3:\r\n\t\t\tans+=1\r\n\t\t\tll.append(l.index(l[i]))\r\n\t\tc1=0\r\n\t\tc2=0\r\n\tif ans==1:\r\n\t\tprint(d[ll[0]])\r\n\telse:\r\n\t\tprint(\"C\")\r\nsolve()", "if __name__ == '__main__':\r\n s = list()\r\n for _ in range(4):\r\n s.append(len(input()) - 2)\r\n l = sorted(s)\r\n mn, mx = l[0], l[3]\r\n mn = l[0] if l[0] <= l[1] / 2 else 0\r\n mx = l[3] if l[3] >= l[2] * 2 else 0\r\n if not mn and mx:\r\n print(chr(s.index(mx) + ord(\"A\")))\r\n elif mn and not mx:\r\n print(chr(s.index(mn) + ord(\"A\")))\r\n else:\r\n print(\"C\")", "def prov(la, lb, lc, ld):\r\n if la/lb >= 2 and la/lc >= 2 and la/ld >= 2:\r\n return True\r\n return False\r\ndef prov1(la, lb, lc, ld):\r\n if lb/la >= 2 and lc/la >= 2 and ld/la >= 2:\r\n return True\r\n return False\r\na = list(input())\r\nb = list(input())\r\nc = list(input())\r\nd = list(input())\r\na = a[2:]\r\nb = b[2:]\r\nc = c[2:]\r\nd = d[2:]\r\nla = len(a)\r\nlb = len(b)\r\nlc = len(c)\r\nld = len(d)\r\nq = []\r\nif prov(la, lb, lc, ld) or prov1(la, lb, lc, ld):\r\n q.append('A')\r\nif prov(lb, la, lc, ld) or prov1(lb, la, lc, ld):\r\n q.append('B')\r\nif prov(lc, la, lb, ld) or prov1(lc, ld, la, lb):\r\n q.append('C')\r\nif prov(ld, la, lb, lc) or prov1(ld, la, lb, lc):\r\n q.append('D')\r\nif len(q) == 1:\r\n print(q[0])\r\nelse:\r\n print('C')", "l = []\r\nfor i in range(0,4):\r\n l.append(len(input())-2)\r\na = sorted(l.copy())\r\nif (a[0]*2 <= a[1]) and (a[3] >= a[2]*2): print(\"C\")\r\nelif (a[0]*2 <= a[1]): \r\n for i in range(0,4):\r\n if (l[i]) == (a[0]): print(\"ABCD\"[i])\r\nelif (a[3] >= a[2]*2): \r\n for i in range(0,4):\r\n if (l[i]) == (a[3]): print(\"ABCD\"[i])\r\nelse: print(\"C\")\r\n \r\n ", "d={\"A\":0,\"B\":0,\"C\":0}\r\nfor i in range(4):\r\n s=input()\r\n d[s[0]]=len(s[2:])\r\n\r\nmaximum=0\r\nminimum=101\r\nfor i in d.keys():\r\n if d[i]>maximum:\r\n maximum=d[i]\r\n if minimum>d[i]:\r\n minimum=d[i]\r\n\r\nmax_keys=[]\r\nmin_keys=[]\r\nfor i in d.keys():\r\n if d[i]==maximum:\r\n max_keys.append(i)\r\n elif d[i]==minimum:\r\n min_keys.append(i)\r\n\r\ncandidates=[]\r\n\r\nif len(max_keys)==1:\r\n for i in d.keys():\r\n if i not in max_keys:\r\n if d[max_keys[0]]<2*d[i]:\r\n break\r\n else:\r\n candidates.append(max_keys[0])\r\n \r\nif len(min_keys)==1: \r\n for i in d.keys():\r\n if i not in min_keys:\r\n if 2*d[min_keys[0]]>d[i]:\r\n break\r\n else:\r\n candidates.append(min_keys[0])\r\n\r\n \r\nif len(candidates)!=1:\r\n print(\"C\")\r\nelse:\r\n print(candidates[0])\r\n\r\n\r\n \r\n \r\n \r\n", "A=input()\r\nB=input()\r\nC=input()\r\nD=input()\r\nx=[len(A)-2, len(B)-2, len(C)-2, len(D)-2]\r\ny=[\"A\", \"B\", \"C\", \"D\"]\r\nfor i in range (0, 3):\r\n for j in range(i+1, 4):\r\n if x[i]>x[j]:\r\n x[i], x[j]=x[j], x[i]\r\n y[i], y[j]=y[j], y[i] \r\nz=\"C\"\r\nif (x[0]*2<=x[1] and not (x[2]*2<=x[3])):\r\n z=y[0]\r\nif (not x[0]*2<=x[1] and x[2]*2<=x[3]):\r\n z=y[3]\r\nprint(z)", "def solve(a,b,c,d):\n\n\tdc={}\n\tfor i in [a,b,c,d]:\n\t\tdc[i]=len(i[2:])\n\n\tans=[]\n\t\n\tif (dc[a]>= 2*dc[b] and dc[a]>= 2*dc[c] and dc[a]>= 2*dc[d]) or ( 2*dc[a]<= dc[b] and 2*dc[a]<= dc[c] and 2*dc[a]<= dc[d] ) :\n\t\tans.append(a)\n\n\tif (dc[b]>= 2*dc[a] and dc[b]>= 2*dc[c] and dc[b]>= 2*dc[d]) or ( 2*dc[b]<= dc[a] and 2*dc[b]<= dc[c] and 2*dc[b]<= dc[d] ) :\n\t\tans.append(b)\n\n\tif (dc[c]>= 2*dc[b] and dc[c]>= 2*dc[a] and dc[c]>= 2*dc[d]) or ( 2*dc[c]<= dc[b] and 2*dc[c]<= dc[a] and 2*dc[c]<= dc[d] ) :\n\t\tans.append(c)\n\n\tif (dc[d]>= 2*dc[b] and dc[d]>= 2*dc[c] and dc[d]>= 2*dc[a]) or ( 2*dc[d]<= dc[b] and 2*dc[d]<= dc[c] and 2*dc[d]<= dc[a] ) :\n\t\tans.append(d)\n\n\n\tif len(ans)==1:\n\t\treturn ans[0][0]\n\treturn 'C'\n\n\n\t\t\n\n\t\n\t\n\n\t\t\n\n\t\n\n\n\nl3=input()\nl4=input()\nl5=input()\nl6=input()\n\n\n\n\nprint(solve(l3 ,l4 ,l5 ,l6))\n", "a = [0] * 4\r\nfor i in range(4):\r\n s = input().strip()\r\n a[i] = len(s) - 2\r\nans = 'C'\r\nf = 0\r\nfor i in range(4):\r\n f1 = 1\r\n f2 = 1\r\n for j in range(4):\r\n if i != j and a[i] < 2 * a[j]:\r\n f1 = 0\r\n if i != j and 2 * a[i] > a[j]:\r\n f2 = 0\r\n if f1 :\r\n ans = chr(ord(\"A\") + i)\r\n f += 1\r\n if f2:\r\n ans = chr(ord(\"A\") + i)\r\n f += 1\r\nif f == 1:\r\n print(ans)\r\nelse:\r\n print(\"C\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = len(input()[:-1]) - 2\r\nb = len(input()[:-1]) - 2\r\nc = len(input()[:-1]) - 2\r\nd = len(input()[:-1]) - 2\r\n\r\ndd = {a: 'A', b: 'B', c: 'C', d: 'D'}\r\nw = sorted([a, b, c, d])\r\nx = [0, 0]\r\nif w[3] / w[2] >= 2:\r\n x[0] = 1\r\nif w[1] / w[0] >= 2:\r\n x[1] = 1\r\n\r\nif x == [0, 0] or x == [1, 1]:\r\n print('C')\r\nelse:\r\n if x[0] == 1:\r\n print(dd[w[3]])\r\n else:\r\n print(dd[w[0]])\r\n", "'''input\nA._\nB.__\nC.____\nD.________\n'''\ni = sorted(enumerate([len(input()) - 2 for _ in range(4)]), key=lambda x: x[1])\na, b = False, False\nif all(2*i[0][1] <= i[x][1] for x in range(1, 4)):\n\ta = True\nif all(i[3][1] >= 2*i[y][1] for y in range(3)):\n\tb = True\nif a == b:\n\tprint(\"C\")\nelif a == True:\n\tprint(\"ABCD\"[i[0][0]])\nelse:\n\tprint(\"ABCD\"[i[3][0]])", "A = input()\nB = input()\nC = input()\nD = input()\narr1 = [A,B,C,D]\narr = []\nk=1\nw=0\narr.append(len(A)-2)\narr.append(len(B)-2)\narr.append(len(C)-2)\narr.append(len(D)-2)\nfor i in range(4):\n\ta=0\n\tb=0\n\tfor j in range(4):\n\t\tif i!=j and arr[i]<=int(arr[j]/2):\n\t\t\ta=a+1\n\t\tif i!=j and arr[i]>=2*arr[j]:\n\t\t\tb = b+1\n\tif(a==3 or b==3):\n\t\tw=w+1\n\t\tl=i\n\nif(w==1):\n\tprint(arr1[l][0])\nelse:\n\tprint(\"C\") \n", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\narr = [0] * 4\r\ns = \"ABCD\"\r\narr[0] = len(a) - 2 \r\narr[1] = len(b) - 2\r\narr[2] = len(c) - 2\r\narr[3] = len(d) - 2\r\nans = \"\"\r\nbigcnt = 0\r\nfor i in range(4):\r\n cnt = 0\r\n for j in range(4):\r\n if i != j and (arr[j] * 2 <= arr[i]): cnt += 1\r\n elif i != j and (arr[j] >= arr[i] * 2): cnt -= 1\r\n if cnt == 3 or cnt == -3:\r\n ans = s[i]\r\n bigcnt += 1\r\nif bigcnt != 1:\r\n print(\"C\")\r\nelse:\r\n print(ans)\r\n", "import sys\r\n\r\ninf = float(\"inf\")\r\n# sys.setrecursionlimit(10000000)\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# 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\nA = input()[2:]\r\nB = input()[2:]\r\nC = input()[2:]\r\nD = input()[2:]\r\n\r\nlenA = len(A)\r\nlenB = len(B)\r\nlenC = len(C)\r\nlenD = len(D)\r\nlength = [lenA,lenB,lenC,lenD]\r\ncount = 0\r\nmini = min(min(lenB,lenC), lenD)\r\nmaxi = max(max(lenB,lenC), lenD)\r\nif 2*lenA <= mini or lenA >= 2*maxi:\r\n count+=1\r\n ans = 'A'\r\n\r\nmini = min(min(lenA,lenC), lenD)\r\nmaxi = max(max(lenA,lenC), lenD)\r\n\r\nif 2*lenB <= mini or lenB >= 2*maxi:\r\n count+=1\r\n ans = 'B'\r\nmini = min(min(lenB,lenA), lenD)\r\nmaxi = max(max(lenB,lenA), lenD)\r\nif 2*lenC <= mini or lenC >= 2*maxi:\r\n count+=1\r\n ans = 'C'\r\n\r\nmini = min(min(lenB,lenC), lenA)\r\nmaxi = max(max(lenB,lenC), lenA)\r\nif 2*lenD <= mini or lenD >= 2*maxi:\r\n count+=1\r\n ans = 'D'\r\n\r\nif count==1:\r\n print(ans)\r\nelse:\r\n print('C')", "def get_len(x) :\r\n\treturn len(x)\r\na=list(input() for i in range(4))\r\na.sort(key=get_len)\r\ns=(2*len(a[0])<=len(a[1])+2)\r\nl=(2*len(a[2])<=len(a[3])+2)\r\nprint(\"C\" if s^l==0 else (a[0][0] if s else a[3][0]))\r\n", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\na = []\r\nfor i in range(4):\r\n\ta.append(minp())\r\n\r\nb = a[::]\r\nif len(b[2]) > len(b[3]):\r\n\tb[2],b[3] = b[3],b[2]\r\nif len(b[1]) > len(b[2]):\r\n\tb[1],b[2] = b[2],b[1]\r\nif len(b[0]) > len(b[1]):\r\n\tb[0],b[1] = b[1],b[0]\r\nif len(b[2]) > len(b[3]):\r\n\tb[2],b[3] = b[3],b[2]\r\nif len(b[1]) > len(b[2]):\r\n\tb[1],b[2] = b[2],b[1]\r\nif len(b[2]) > len(b[3]):\r\n\tb[2],b[3] = b[3],b[2]\r\n\r\nm = None\r\nM = None\r\nif len(b[0])*2 - 4 <= len(b[1])-2:\r\n\tm = b[0]\r\nif len(b[2])*2 - 4 <= len(b[3])-2:\r\n\tM = b[3]\r\n\r\nif m:\r\n\tif M:\r\n\t\tprint('C')\r\n\telse:\r\n\t\tprint(m[0])\r\nelse:\r\n\tif M:\r\n\t\tprint(M[0])\r\n\telse:\r\n\t\tprint('C')\r\n", "#! /usr/bin/env python\n\na = len(input()[2:])\nb = len(input()[2:])\nc = len(input()[2:])\nd = len(input()[2:])\n\narr = [a, b, c, d]\n\ncandi = []\nfor i, x in enumerate(arr):\n sf = True\n bf = True\n for j, y in enumerate(arr):\n if i != j:\n if x > y / 2:\n sf = False\n if x < y * 2:\n bf = False\n if sf or bf:\n candi.append(i)\n\nif len(candi) == 1:\n print(chr(ord('A') + candi[0]))\nelse:\n print(\"C\")\n", "n = sorted([(i, len(input()[2:])) for i in ['A', 'B', 'C', 'D']],key=lambda x: x[1])\r\nr = 'C'\r\nif 2*n[0][1] <= n[1][1]:\r\n if 2*n[2][1] > n[3][1]:\r\n r = n[0][0]\r\nelse:\r\n if 2*n[2][1] <= n[3][1]:\r\n r = n[3][0]\r\nprint(r)", "a = sorted([(len(input())-2,i) for i in 'ABCD'])\ng = \"\"\nif a[0][0]*2 <= a[1][0]:\n\tg += a[0][1] \nif a[3][0] >= 2 * a[2][0]:\n\tg += a[3][1]\nif len(g) == 1:\n\tprint(g)\nelse :\n\tprint(\"C\")", "import sys\n#sys.stdin = open('input.txt', 'r')\nt, a = input().split('.')\nt, b = input().split('.')\nt, c = input().split('.')\nt, d = input().split('.')\nk = [0]*4\nif 2*len(a) <= len(b) and 2*len(a) <= len(c) and 2*len(a) <= len(d): k[0]=1\nif 2*len(b) <= len(a) and 2*len(b) <= len(c) and 2*len(b) <= len(d): k[1]=1\nif 2*len(c) <= len(a) and 2*len(c) <= len(b) and 2*len(c) <= len(d): k[2]=1\nif 2*len(d) <= len(a) and 2*len(d) <= len(b) and 2*len(d) <= len(c): k[3]=1\ns = [0]*4\nif 2*len(b) <= len(a) and 2*len(c) <= len(a) and 2*len(d) <= len(a): s[0]=1\nif 2*len(a) <= len(b) and 2*len(c) <= len(b) and 2*len(d) <= len(b): s[1]=1\nif 2*len(a) <= len(c) and 2*len(b) <= len(c) and 2*len(d) <= len(c): s[2]=1\nif 2*len(a) <= len(d) and 2*len(b) <= len(d) and 2*len(c) <= len(d): s[3]=1\nif sum(k) + sum(s) == 1:\n\tif k[0] == 1: print('A')\n\tif k[1] == 1: print('B')\n\tif k[2] == 1: print('C')\n\tif k[3] == 1: print('D')\n\tif s[0] == 1: print('A')\n\tif s[1] == 1: print('B')\n\tif s[2] == 1: print('C')\n\tif s[3] == 1: print('D')\nelse:\n\tprint('C')\n\n\n\n\n\n\n\n", "def main():\r\n s = \"ABCD\"\r\n arr = [len(input()) - 2 for i in range(4)]\r\n\r\n decides = []\r\n Min = min(arr)\r\n tmp = arr[:]; tmp.remove(Min)\r\n if Min * 2 <= min(tmp):\r\n decides.append(s[arr.index(Min)])\r\n \r\n Max = max(arr)\r\n tmp = arr[:]; tmp.remove(Max)\r\n if Max >= max(tmp) * 2:\r\n decides.append(s[arr.index(Max)])\r\n \r\n if len(decides) == 1:\r\n print(decides[0])\r\n else:\r\n print(\"C\")\r\n\r\nmain()\r\n", "o = [\"\" for _ in range(4)]\r\n\r\nmaxlength = 0\r\nminlength = 110\r\nmaxindex = 0\r\nminindex = 0\r\n\r\nc = [0] * 4\r\n\r\nfor i in range(4):\r\n o[i] = input()\r\n c[i] = len(o[i]) - 2\r\n\r\nc.sort()\r\n\r\nhasMax = c[3] >= c[2] * 2\r\nhasMin = c[0] <= c[1] / 2\r\n\r\nif hasMax == hasMin:\r\n print(\"C\")\r\nelif hasMin:\r\n for i in range(4):\r\n if c[0] + 2 == len(o[i]):\r\n print(o[i][0], end=\"\")\r\nelse: # hasMax\r\n for i in range(4):\r\n if c[3] + 2 == len(o[i]):\r\n print(o[i][0], end=\"\")\r\n", "a = []\r\na.append(input())\r\na.append(input())\r\na.append(input())\r\na.append(input())\r\nb = []\r\n \r\nfor i in range(len(a)):\r\n b.append(len(a[i]) - 2)\r\n \r\nb.sort()\r\n \r\nres = []\r\n \r\nif b[0] * 2 <= b[1] and b[1] != 0:\r\n res.append(b[0])\r\n \r\nif b[2] * 2 <= b[3] and b[3] != 0:\r\n res.append(b[3])\r\n \r\n \r\nif len(res) == 1:\r\n for i in range(len(a)):\r\n if len(a[i]) - 2 == res[0]:\r\n print(a[i][:1])\r\nelse:\r\n print('C')", "len_lst = []\r\nfor i in range(4):\r\n option = input().strip()\r\n len_lst.append(len(option) - 2)\r\nsort_lst = sorted(len_lst)\r\ngreat = 0\r\nif sort_lst[1] >= 2 * sort_lst[0]:\r\n great += 1\r\n key = sort_lst[0]\r\nif sort_lst[3] >= 2 * sort_lst[2]:\r\n great -= 1\r\n key = sort_lst[3]\r\ndic = {len_lst[0]: 'A', len_lst[1]: 'B', len_lst[2]: 'C', len_lst[3]: 'D'}\r\nif great:\r\n print(dic[key])\r\nelse:\r\n print('C')", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\n#split\r\na,b,c,d = a[2:],b[2:],c[2:],d[2:]\r\nlens = [(0,len(a)),(1,len(b)),(2,len(c)),(3,len(d))]\r\nlens = sorted(lens,key=lambda x:x[1])\r\ncount,ind = 0,-1\r\n\r\n# print(lens)\r\n# minimum and max elements are the only candidates\r\nmini = lens[0][1]\r\nif(mini <= (lens[1][1]//2)):\r\n count+=1\r\n ind= lens[0][0]\r\nmaxi = lens[3][1]\r\nif(maxi >= 2*lens[2][1]):\r\n count+=1\r\n ind= lens[3][0]\r\nif(count == 1):\r\n print(chr(ord('A')+ind))\r\nelse:\r\n print('C')\r\n\r\n\r\n\r\n\r\n", "q, t = 0, sorted([(len(input()) - 2, i) for i in 'ABCD'])\r\nif 2 * t[0][0] <= t[1][0]: q += 1\r\nif t[3][0] >= 2 * t[2][0]: q += 2\r\nprint(['C', t[0][1], t[3][1], 'C'][q])", "a,b,c,d=input()[2:],input()[2:],input()[2:],input()[2:]\r\na,b,c,d=len(a),len(b),len(c),len(d)\r\narr=[a,b,c,d]\r\narr=sorted(arr)\r\nif arr[0]<=arr[1]/2 and arr[3]<arr[2]*2:\r\n if a==arr[0]:print('A')\r\n elif b==arr[0]:print('B')\r\n elif c==arr[0]:print('C')\r\n else:print('D')\r\nelif arr[3]>=arr[2]*2 and arr[0]>arr[1]/2:\r\n if a==arr[3]:print('A')\r\n elif b==arr[3]:print('B')\r\n elif c==arr[3]:print('C')\r\n else:print('D')\r\nelse:print('C')", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\n\r\nA = strinput();B = strinput();C=strinput();D=strinput()\r\narr = [A,B,C,D]\r\narr2 = ['A','B','C','D']\r\nleng = [len(arr[i])-2 for i in range(0,4)]\r\nnum = leng.copy()\r\nnum.sort()\r\ncorrect = []\r\nif(num[0]*2<=num[1]):\r\n correct.append(leng.index(num[0]))\r\nif(num[3]>=2*num[2]):\r\n correct.append(leng.index(num[3]))\r\n\r\nif(len(correct)!=1):\r\n print('C')\r\nelse:\r\n print(arr2[correct[0]])", "list,temp=[],[]\r\nfor i in range(4): \r\n a=input()\r\n list.append(len(a)-2)\r\ntemp=list.copy()\r\ntemp.sort()\r\nif(2*temp[0]<=temp[1] and temp[3]<(2*temp[2])):\r\n ind=list.index(temp[0])\r\n print(chr(65+ind))\r\nelif(temp[3]>=(2*temp[2]) and 2*temp[0]>temp[1]):\r\n ind=list.index(temp[3])\r\n print(chr(65+ind))\r\nelse:\r\n print('C')", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nd = str(input())\r\n\r\nfirst = len(a)\r\nsecond = len(b)\r\nthird = len(c)\r\nfourth = len(d)\r\n\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\ncount4 = 0\r\n\r\nif(first - 2 >= 2 * (second - 2)): \r\n count1 += 1\r\nif(first - 2 >= 2 * (third - 2)): \r\n count1 += 1\r\nif(first - 2 >= 2 * (fourth - 2)): \r\n count1 += 1\r\nif(2 * (first - 2) <= (second - 2)): \r\n count1 -= 1\r\nif(2 * (first - 2) <= (third - 2)): \r\n count1 -= 1\r\nif(2 * (first - 2) <= (fourth - 2)): \r\n count1 -= 1\r\nif(second - 2 >= 2 * (first - 2)): \r\n count2 += 1\r\nif(second - 2 >= 2 * (third - 2)): \r\n count2 += 1\r\nif(second - 2 >= 2 * (fourth - 2)): \r\n count2 += 1\r\nif(2 * (second - 2) <= (first - 2)): \r\n count2 -= 1\r\nif(2 * (second - 2) <= (third - 2)): \r\n count2 -= 1\r\nif(2 * (second - 2) <= (fourth - 2)): \r\n count2 -= 1\r\nif(third - 2 >= 2 * (first - 2)): \r\n count3 += 1\r\nif(third - 2 >= 2 * (second - 2)): \r\n count3 += 1\r\nif(third - 2 >= 2 * (fourth - 2)): \r\n count3 += 1\r\nif(2 * (third - 2) <= (first - 2)): \r\n count3 -= 1\r\nif(2 * (third - 2) <= (second - 2)): \r\n count3 -= 1\r\nif(2 * (third - 2) <= (fourth - 2)): \r\n count3 -= 1\r\nif(fourth - 2 >= 2 * (first - 2)): \r\n count4 += 1\r\nif(fourth - 2 >= 2 * (second - 2)): \r\n count4 += 1\r\nif(fourth - 2 >= 2 * (third - 2)): \r\n count4 += 1\r\nif(2 * (fourth - 2) <= (first - 2)): \r\n count4 -= 1\r\nif(2 * (fourth - 2) <= (second - 2)): \r\n count4 -= 1\r\nif(2 * (fourth - 2) <= (third - 2)): \r\n count4 -= 1\r\n\r\nif((count1 == 3 or count1 == -3) and (count2 != 3 and count2 != -3) and (count3 != 3 and count3 != -3) and (count4 != 3 and count4 != -3)): \r\n print(\"A\")\r\nelif((count1 != 3 and count1 != -3) and (count2 == 3 or count2 == -3) and (count3 != 3 and count3 != -3) and (count4 != 3 and count4 != -3)): \r\n print(\"B\")\r\nelif((count1 != 3 and count1 != -3) and (count2 != 3 and count2 != -3) and (count3 == 3 or count3 == -3) and (count4 != 3 and count4 != -3)): \r\n print(\"C\")\r\nelif((count1 != 3 and count1 != -3) and (count2 != 3 and count2 != -3) and (count3 != 3 or count3 != -3) and (count4 == 3 or count4 == -3)): \r\n print(\"D\")\r\nelse: \r\n print(\"C\")", "A=input()\r\n# print(A)\r\nB=input()\r\nC=input()\r\nD=input()\r\n\r\na=len(A)\r\nb=len(B)\r\nc=len(C)\r\nd=len(D)\r\nans=[(a-2,\"A\"),(b-2,\"B\"),(c-2,\"C\"),(d-2,\"D\")]\r\nans.sort(key=lambda x:x[0], reverse=True)\r\n# ans.sort()\r\ncount1=0\r\ncount2=0\r\n\r\nif ans[0][0]>=ans[1][0]*2:\r\n count1=1\r\nif ans[2][0]>=2*ans[3][0]:\r\n count2=1\r\nif (count1 and count2) or (not count1 and not count2):\r\n print(\"C\")\r\nelif count1:\r\n print(ans[0][1])\r\nelse:\r\n print(ans[3][1]) \r\n\r\n\r\n", "a = input()[2:]\nb = input()[2:]\nc = input()[2:]\nd = input()[2:]\n\nzc = 0\nz = -100\n\nif (len(a)*2 <= len(b) and len(a)*2 <= len(c) and len(a)*2 <= len(d)) or (len(a) >= len(b)*2 and len(a) >= len(c)*2 and len(a) >= len(d)*2):\n zc += 1\n z = 'A'\nif (len(b)*2 <= len(a) and len(b)*2 <= len(c) and len(b)*2 <= len(d)) or (len(b) >= len(a)*2 and len(b) >= len(c)*2 and len(b) >= len(d)*2):\n zc += 1\n z = 'B'\nif (len(c)*2 <= len(b) and len(c)*2 <= len(a) and len(c)*2 <= len(d)) or (len(c) >= len(b)*2 and len(c) >= len(a)*2 and len(c) >= len(d)*2):\n zc += 1\n z = 'C'\nif (len(d)*2 <= len(b) and len(d)*2 <= len(c) and len(d)*2 <= len(a)) or (len(d) >= len(b)*2 and len(d) >= len(c)*2 and len(d) >= len(a)*2):\n zc += 1\n z = 'D'\nif zc == 1:\n print(z)\nelse:\n print('C')\n", "import os\r\n\r\na=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\narr=[a,b,c,d]\r\narr.sort()\r\nz=[]\r\nif arr[0]<=arr[1]//2 and arr[0]<=arr[2]//2 and arr[0]<=arr[3]//2:\r\n\tif arr[0]==a:\r\n\t\tz.append(\"A\")\r\n\telif arr[0]==b:\r\n\t\tz.append(\"B\")\r\n\telif arr[0]==c:\r\n\t\tz.append(\"C\")\r\n\telse:\r\n\t\tz.append(\"D\")\r\nif arr[0]<=arr[3]//2 and arr[1]<=arr[3]//2 and arr[2]<=arr[3]//2:\r\n\tif arr[3]==a:\r\n\t\tz.append(\"A\")\r\n\telif arr[3]==b:\r\n\t\tz.append(\"B\")\r\n\telif arr[3]==c:\r\n\t\tz.append(\"C\")\r\n\telse:\r\n\t\tz.append(\"D\")\r\nif len(z)==1:\r\n\tprint(*z)\r\nelse:\r\n\tprint(\"C\")\r\n", "choice = ['A', 'B', 'C', 'D']\r\nsize = []\r\nmin_, max_, great, index = float(\"inf\"), float(\"-inf\"), 0, 0\r\nfor i in range(4):\r\n ch = input()[2:]\r\n size.append((len(ch), i+1))\r\n min_, max_ = min(len(ch), min_), max(len(ch), max_)\r\nsize.sort()\r\nif min_ <= size[1][0]//2:\r\n great += 1\r\n index = size[0][1]\r\nif max_ >= size[-2][0]*2:\r\n great += 1\r\n index = size[-1][1]\r\nif great == 1:\r\n print(choice[index-1])\r\nelse:\r\n print(\"C\")\r\n", "choice=[]\nfor i in range(4):\n choice.append(len(input(' ')[2:]))\n\n\nShortest=True\nLongest=True\n\ncc=0\nci=None\n\nfor i in range(4):\n Shortest=True\n Longest=True\n for j in range(4):\n if i==j:continue\n if choice[i]<choice[j]*2:Longest=False\n if choice[i]*2>choice[j]:Shortest=False\n if Shortest:cc+=1;ci=chr(65+i)\n if Longest:cc+=1;ci=chr(65+i)\n\n\nif cc==1:\n print(ci)\nelse:\n print('C')\n \t \t \t \t \t\t\t\t\t\t\t\t \t \t\t\t\t\t\t \t\t", "m, choice = 0, sorted([(len(input()) - 2, i) for i in 'ABCD'])\r\nif 2 * choice[0][0] <= choice[1][0]: m += 1\r\nif choice[3][0] >= 2 * choice[2][0]: m += 2\r\nprint(['C', choice[0][1], choice[3][1], 'C'][m])", "s=0\r\nc=0\r\np=[]\r\na=[]\r\nfor i in range(4):\r\n a.append(input())\r\nfor i in range(4):\r\n for k in range(4):\r\n if i!=k:\r\n if len(a[i])-2<=(len(a[k])-2)/2:\r\n s+=1\r\n if (len(a[i])-2)/2>=len(a[k])-2:\r\n c+=1\r\n if s==3 or c==3:\r\n p.append(a[i])\r\n break\r\n c=0\r\n s=0\r\nif len(p)>1 or len(p)==0:\r\n print('C')\r\nelse:\r\n print(p[0][0])", "import sys\r\n\r\nl = [\"A\", \"B\", \"C\", \"D\"]\r\nm = []\r\n\r\na = len(sys.stdin.readline().strip())-2\r\nb = len(sys.stdin.readline().strip())-2\r\nc = len(sys.stdin.readline().strip())-2\r\nd = len(sys.stdin.readline().strip())-2\r\n\r\nif a >= b*2 and a >= c*2 and a >= d*2:\r\n m.append(0)\r\nif b >= a*2 and b >= c*2 and b >= d*2:\r\n m.append(1)\r\nif c >= b*2 and c >= a*2 and c >= d*2:\r\n m.append(2)\r\nif d >= b*2 and d >= c*2 and d >= a*2:\r\n m.append(3)\r\nif a <= b/2 and a <= c/2 and a <= d/2:\r\n m.append(0)\r\nif b <= a/2 and b <= c/2 and b <= d/2:\r\n m.append(1)\r\nif c <= b/2 and c <= a/2 and c <= d/2:\r\n m.append(2)\r\nif d <= b/2 and d <= c/2 and d <= a/2:\r\n m.append(3)\r\n\r\nif len(m) > 1 or len(m) < 1:\r\n print(\"C\")\r\nelse:\r\n print(l[m[0]])", "s = []\r\nlength = [0 for i in range(4)]\r\nfor i in range(4):\r\n s.append(input()[2:])\r\n length[i] = len(s[i])\r\n\r\nvar = []\r\nfor i in range(4):\r\n if length[i] >= 2*max(length[:i] + length[i+1:]) or \\\r\n length[i] <= min(length[:i] + length[i+1:])//2:\r\n var.append(i)\r\n\r\nif len(var) == 1:\r\n print(chr(ord('A') + var[0]))\r\nelse:\r\n print('C')\r\n", "d = {}\nans = 0\ncnt = 0\nfor i in range(4):\n x = list(input().split(\".\"))\n d[x[0]] = len(x[1])\n\n\nfor x in d.keys():\n flag = True\n for y in d.keys():\n if d[x] > (d[y]/2) and (x != y):\n flag = False\n\n if flag:\n ans = x\n cnt += 1\n\n\nfor x in d.keys():\n flag = True\n for y in d.keys():\n if d[x] < (d[y]*2) and (x != y):\n flag = False\n\n if flag:\n ans = x\n cnt += 1\n\nif cnt != 1:\n print(\"C\")\nelse:\n print(ans)\n", "#!/usr/bin/env python3\r\nchoice = list()\r\nfor i in range(4):\r\n\tchoice.append(len(input())-2)\r\ngreat = -1\r\nfor i in range(4):\r\n\tshorter = 0\r\n\tlonger = 0\r\n\tfor j in range(4):\r\n\t\tif j == i:\r\n\t\t\tcontinue\r\n\t\tif 2*choice[i] <= choice[j]:\r\n\t\t\tshorter += 1\r\n\t\tif choice[i] >= 2*choice[j]:\r\n\t\t\tlonger += 1\r\n\tif shorter == 3 or longer == 3:\r\n\t\tif great == -1:\r\n\t\t\tgreat = i\r\n\t\telse:\r\n\t\t\tprint('C')\r\n\t\t\tquit()\r\nif great == -1 or great == 2:\r\n\tprint('C')\r\nelif great == 0:\r\n\tprint('A')\r\nelif great == 1:\r\n\tprint('B')\r\nelif great == 3:\r\n\tprint('D')", "a = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\nlen_a = len(a) - 2\r\nlen_b = len(b) - 2\r\nlen_c = len(c) - 2\r\nlen_d = len(d) - 2\r\ns = ''\r\nif len_a * 2 <= len_b and len_a * 2 <= len_c and len_a * 2 <= len_d:\r\n s += \"A\"\r\nif len_a >= len_b * 2 and len_a >= len_c * 2 and len_a >= len_d * 2:\r\n s += \"A\"\r\n\r\nif len_b * 2 <= len_a and len_b * 2 <= len_c and len_b * 2 <= len_d:\r\n s += \"B\"\r\nif len_b >= len_a * 2 and len_b >= len_c * 2 and len_b >= len_d * 2:\r\n s += \"B\"\r\n\r\nif len_c * 2 <= len_a and len_c * 2 <= len_b and len_c * 2 <= len_d:\r\n s += \"C\"\r\nif len_c >= len_a * 2 and len_c >= len_b * 2 and len_c >= len_d * 2:\r\n s += \"C\"\r\n\r\nif len_d * 2 <= len_a and len_d * 2 <= len_c and len_d * 2 <= len_b:\r\n s += \"D\"\r\nif len_d >= len_a * 2 and len_d >= len_c * 2 and len_d >= len_b * 2:\r\n s += \"D\"\r\nif len(s) == 1:\r\n print(s)\r\nelse:\r\n print(\"C\")\r\n", "a = []\r\nfor _ in range(4):\r\n s = input()\r\n a.append((len(s[2:]),s[0]))\r\na.sort()\r\nflag1 = 0\r\nflag2 = 0\r\nif a[0][0] <= a[1][0]//2:\r\n flag1 =1\r\nif a[3][0] >= a[2][0]*2:\r\n flag2 = 1\r\n\r\nif flag1 and flag2:\r\n print(\"C\")\r\nelif flag1:\r\n print(a[0][1])\r\nelif flag2:\r\n print(a[3][1])\r\nelse:\r\n print(\"C\")", "#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 l=[]\r\n if(a*2<=b and a*2<=c and a*2<=d):\r\n l.append(0)\r\n elif(b*2<=a and b*2<=c and b*2<=d):\r\n l.append(1)\r\n elif(c*2<=a and c*2<=b and c*2<=d):\r\n l.append(2)\r\n elif(d*2<=a and d*2<=c and d*2<=b):\r\n l.append(3)\r\n #print(a,b,c,d)\r\n if(a>=b*2 and a>=c*2 and a>=d*2):\r\n l.append(0)\r\n elif(b>=a*2 and b>=c*2 and b>=d*2):\r\n l.append(1)\r\n elif(c>=a*2 and c>=b*2 and c>=d*2):\r\n l.append(2)\r\n elif(d>=a*2 and d>=c*2 and d>=b*2):\r\n l.append(3)\r\n if(len(l)==0 or len(l)>=2):\r\n return 'C'\r\n else:\r\n if(l[0]==0):\r\n return 'A'\r\n \r\n elif(l[0]==1):\r\n return 'B'\r\n \r\n elif(l[0]==2):\r\n return 'C'\r\n \r\n elif(l[0]==3):\r\n return 'D'\r\n\r\n return l\r\na=len(input())-2\r\nb=len(input())-2\r\nc=len(input())-2\r\nd=len(input())-2\r\nprint(exe())" ]

[ "a,b,c=eval(input().replace(' ',','))\ndef func(x):\n if x==0:\n return a\n if x==1:\n return b\n return func(x-1)+func(x-2)\nprint(func(c))", "a, b, c = map(int, input().split())\r\nexec('a, b = b, a + b;' * c)\r\nprint(a)", "a, s, n = map(int, input().split())\r\nfor i in range(n):\r\n a, s = s, a + s\r\nprint(a)", "a,b,n = map(int,input().split())\r\n\r\nif n == 0:\r\n print(a)\r\nelse:\r\n for i in range(1,n):\r\n a,b = b,a+b\r\n print(b)", "def sui(f,n):\r\n if(n==0):\r\n return f[0]\r\n elif(n==1):\r\n return f[1]\r\n else:\r\n return sui(f,n-1)+sui(f,n-2)\r\nf=[*map(int,input().split())]\r\nprint(sui(f,f[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\na1,a2,a3 = map(int,input().split())\r\ns = []\r\ns.append(a1)\r\ns.append(a2)\r\nfor i in range(2,a3+1):\r\n j = 0\r\n j += s[i-1] + s[i-2]\r\n s.append(j)\r\nprint(s[-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", "a1, a2, a3 = map(int ,input().split())\r\nk = [a1, a2]\r\nfor i in range(1, a3) : k.append(k[i - 1] + k[i])\r\nprint(k[a3])", "a,b,n=map(int,input().split())\r\ndef dt(m):\r\n\tif m==0:\r\n\t\treturn a\r\n\tif m==1:\r\n\t\treturn b\r\n\treturn dt(m-1)+dt(m-2)\r\nprint(dt(n))", "# /**\r\n# * author: brownfox2k6\r\n# * created: 23/05/2023 21:04:56 Hanoi, Vietnam\r\n# **/\r\n\r\na, b, idx = map(int, input().split())\r\n\r\nfib = [a, b]\r\nfor i in range(19):\r\n fib.append(fib[-1] + fib[-2])\r\n\r\nprint(fib[idx])", "F0, F1, n = map(int, input().split())\r\nif n == 0:\r\n print(F0)\r\nelse:\r\n Ans = F1\r\n for i in range(1, n):\r\n Ans = F0 + F1\r\n F0 = F1\r\n F1 = Ans\r\n print(Ans)", "l = input().split()\r\na1 = int(l[0])\r\na2 = int(l[1])\r\na3 = int(l[2])\r\n\r\nfor i in range(a3-1):\r\n a2 = a1 + a2\r\n a1 = a2 - a1\r\nprint(a2)\r\n", "a,b,c=map(int, input().split())\r\nwhile c > 0:\r\n\ta, b = b, a + b\r\n\tc -= 1\r\nprint(a)", "# LUOGU_RID: 92093203\na1, a2, a3 = map(int, input().split())\r\n\r\na = []\r\na.append(a1)\r\na.append(a2)\r\n\r\nfor x in range(2, 21):\r\n value = a[x - 1] + a[x - 2]\r\n a.append(value)\r\n\r\nprint(a[a3])\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-29 23:43:18\nLastEditTime: 2021-11-29 23:49:14\nDescription: Mysterious numbers - 2\nFilePath: CF171G.py\n'''\n\n\ndef func():\n a1, a2, k = map(int, input().strip().split())\n lst = [a1, a2]\n for i in range(2, k + 1):\n lst.append(lst[i - 1] + lst[i - 2])\n print(lst[-1])\n\n\nif __name__ == '__main__':\n func()\n", "f = [0] * 22\r\nf[0], f[1], idx = [int(x) for x in input().split()]\r\nfor i in range (2, 22) : f[i] = f[i - 1] + f[i - 2]\r\nprint(f[idx])", "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,islice\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\na,b,c = list(map(int,input().split()))\r\nx = [0 for i in range(25)]\r\nx[0] = a\r\nx[1] = b\r\nfor i in range(2,25):\r\n x[i] = x[i-1]+x[i-2]\r\nprint(str(x[c])+\"\\n\")\r\n", "a,b,c = map(int, input().split())\r\nfiblist = []\r\nfiblist.append(a)\r\nfiblist.append(b)\r\nwhile (len(fiblist) - 1) < c:\r\n for i in range(2, 22):\r\n x = fiblist[i - 1] + fiblist[i - 2]\r\n fiblist.append(x)\r\nelse:\r\n print(fiblist[c])" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nline = lambda : [int(x) for x in input().split()]\r\n\r\ndef ecyc(graph: list[list[int]], edges: list[int]) -> list[list[int]]:\r\n \"\"\"Finds euler cycles of `graph`\r\n\r\n\r\nCan only be used if all degrees of nodes in `graph` are even. If the\r\ngraph is disconnected, returns a LIST of cycles. Otherwise returns a\r\nLIST with the single cycle.\r\n\r\nConstructs euler cycle from graph in adj-list format (undirected, v\r\nin adj[u] and u in adj[v] for every edge (u, v)). The graph can take\r\nmultiple edges. It MAY work with self-loops. Or we may pop the wrong\r\nnumber of 'x' from adj[x].\r\n\r\nAlso takes an edge counter: edge[code(u, v)] is the number of copies of edge\r\n(u, v) that have not been walked on.\r\nOVERWRITES both `graph` and `edges`.\r\n\r\n \"\"\"\r\n res = []\r\n for x in range(n):\r\n if not adj[x]: continue\r\n cyc = [x]\r\n #breakpoint()\r\n while True:\r\n neighs = graph[x]\r\n while neighs and edges[code(x, neighs[-1])] == 0:\r\n neighs.pop()\r\n if not neighs:\r\n res.append(cyc)\r\n break # Nowhere left to go. Should only happen when\r\n # no edges left.\r\n assert neighs\r\n y = neighs.pop()\r\n edges[code(x, y)] -= 1\r\n cyc.append(y)\r\n x = y\r\n #breakpoint()\r\n return res\r\n\r\ndef code(u, v):\r\n if u < v: u, v = v, u\r\n return u*n+v\r\n\r\nfor _ in range(int(input())):\r\n n, m = line()\r\n\r\n deg = [0]*n\r\n orig = [0]*(n**2)\r\n \r\n adj : list[list[int]] = [[] for _ in range(n)]\r\n for _ in range(m):\r\n u, v = [int(x) -1 for x in input().split()]\r\n orig[code(u, v)] += 1\r\n deg[u] += 1\r\n deg[v] += 1\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n odd = [i for (i, v) in enumerate(deg) if v%2 == 1]\r\n print(n-len(odd))\r\n full = orig[:]\r\n while odd:\r\n assert len(odd) >= 2\r\n u, v = odd.pop(), odd.pop()\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n full[code(u, v)] += 1\r\n\r\n cycs = ecyc(adj, full)\r\n assert all(x==0 for x in full)\r\n for u, *cyc in cycs:\r\n for v in cyc:\r\n c = code(u, v)\r\n if orig[c] > 0:\r\n orig[c] -= 1\r\n print(u+1, v+1)\r\n u = v\r\n \r\n \r\n \r\n\r\n \r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nt = int(input())\r\nans = []\r\nfor _ in range(t):\r\n n, m = map(int, input().split())\r\n G = [set() for _ in range(n + 1)]\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n G[u].add(v)\r\n G[v].add(u)\r\n ans0 = n\r\n ans1 = []\r\n for i in range(1, n + 1):\r\n if not len(G[i]) % 2:\r\n continue\r\n ans0 -= 2\r\n u = i\r\n while True:\r\n v = G[u].pop()\r\n ans1.append(\" \".join(map(str, (u, v))))\r\n G[v].remove(u)\r\n if not len(G[v]) % 2:\r\n break\r\n u = v\r\n for i in range(1, n + 1):\r\n if not len(G[i]):\r\n continue\r\n u = i\r\n while True:\r\n v = G[u].pop()\r\n ans1.append(\" \".join(map(str, (u, v))))\r\n G[v].remove(u)\r\n if v == i:\r\n break\r\n u = v\r\n ans.append(str(ans0))\r\n ans.append(\"\\n\".join(ans1))\r\nsys.stdout.write(\"\\n\".join(ans))" ]

[ "# بسم الله الرحمن الرحيم\r\n# صلو على نبينا محمد صلى الله عليه و سلم\r\n\r\n\r\n##############--->>>>> Mohamed Mostafa Mohamed Abdelhamed <<<<<---##############\r\n\r\n\"\"\"\r\n ____ _ _____ \r\n / ___|___ __| | ___| ___|__ _ __ ___ ___ ___ \r\n| | / _ \\ / _` |/ _ \\ |_ / _ \\| '__/ __/ _ \\/ __|\r\n| |__| (_) | (_| | __/ _| (_) | | | (_| __/\\__ \\\r\n \\____\\___/ \\__,_|\\___|_| \\___/|_| \\___\\___||___/\r\n\"\"\"\r\n\r\n\r\nss = input()\r\na = 0\r\ncc = 0\r\nc = 0\r\nwhile a < len(ss) - 4:\r\n if ss[a : a + 5] == \"heavy\":\r\n cc += 1\r\n a += 4\r\n if ss[a : a + 5] == \"metal\":\r\n c += cc\r\n a += 4\r\n a += 1\r\nprint(c)\r\n", "n = input()\r\nl = []\r\nm = []\r\ndef bi(arr,val):\r\n l = 0\r\n r = len(arr)-1\r\n okay = False\r\n ans = 0\r\n while r>=l:\r\n m = (r+l)//2\r\n if arr[m]>=val:\r\n ans = m\r\n r = m-1\r\n okay = True\r\n else:\r\n l = m+1\r\n if okay: \r\n return ans\r\n else:\r\n return len(arr)\r\nfor i in range(len(n)-4):\r\n if n[i:i+5]==\"heavy\":\r\n l.append(i)\r\n elif n[i:i+5]==\"metal\":\r\n m.append(i)\r\nc = 0\r\nfor k in l:\r\n p = bi(m,k)\r\n c+=(len(m)-p)\r\nprint(c)", "def main():\r\n i, j, k, m, n, t, count, hv = 0, 0, 0, 0, 0, 0, 0, 0\r\n \r\n s = input()\r\n \r\n string1 = \"heavy\"\r\n string2 = \"metal\"\r\n \r\n t = len(s)\r\n \r\n for i in range(t):\r\n \r\n if s[i:i+5] == string1:\r\n hv = hv + 1\r\n \r\n elif s[i:i+5] == string2:\r\n count = count + hv\r\n \r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\n\r\ndef main():\r\n i, j, k, m, n, l, cnt, hv = 0, 0, 0, 0, 0, 0, 0, 0\r\n s = input()\r\n str1 = \"heavy\"\r\n str2 = \"metal\"\r\n l = len(s)\r\n for i in range(l):\r\n if s[i:i+5] == str1:\r\n hv += 1\r\n elif s[i:i+5] == str2:\r\n cnt += hv\r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "x = input()\r\nc = 0\r\nans = 0\r\nfor i in range(len(x)):\r\n if(x[i:i+5]=='heavy'):\r\n c+=1\r\n elif(x[i:i+5]=='metal'):\r\n ans+=c\r\nprint(ans)", "w = input().replace(\"heavy\",\"H\").replace(\"metal\",\"M\")\r\n\r\nres, hCount = 0, 0\r\nfor c in w:\r\n if c == \"H\":\r\n hCount += 1\r\n elif c == \"M\":\r\n res += hCount\r\nprint(res)", "s=str(input())\r\n\r\ndef function(s):\r\n a=0\r\n h=0\r\n m=0\r\n n=len(s)\r\n counter=0\r\n\r\n if n<9:\r\n return 0\r\n\r\n while a<n-4:\r\n\r\n if s[a:a+5]==\"heavy\":\r\n h+=1\r\n a+=4\r\n\r\n if s[a:a+5]==\"metal\":\r\n m+=1\r\n counter+=h\r\n a+=4\r\n\r\n a+=1\r\n \r\n \r\n \r\n return counter\r\n\r\n\r\nprint(function(s))\r\n\r\n\r\n", "import bisect\r\ndef solve():\r\n s=input()\r\n n=len(s)\r\n heavyindex=[]\r\n metalindex=[]\r\n for i in range(0,n-4):\r\n if s[i]==\"h\" and s[i:i+5]==\"heavy\":\r\n heavyindex.append(i)\r\n elif s[i]==\"m\" and s[i:i+5]==\"metal\":\r\n metalindex.append(i)\r\n #print(heavyindex)\r\n #print(metalindex)\r\n n=len(metalindex)\r\n ans=0\r\n for i in heavyindex:\r\n pos=bisect.bisect_left(metalindex,i)\r\n ans+=(n-pos)\r\n print(ans)\r\nsolve()", "z=r=0\r\nfor w in input().split(\"heavy\"):r+=w.count(\"metal\")*z;z+=1\r\nprint(r)" ]

[ "n, m = map(int, input(). split())\r\narr = list(map(int, input(). split()))\r\nq = 0\r\nfor i in range(min(n, m)):\r\n if arr[i] < 0:\r\n arr[i] *= (-1)\r\n q += 1\r\n else:\r\n break\r\nif m <= q:\r\n print(sum(arr))\r\nelse:\r\n if (m - q) % 2:\r\n arr. sort()\r\n print(sum(arr) - (arr[0] * 2))\r\n else:\r\n print(sum(arr))\r\n", "\r\nimport heapq\r\n\r\nif __name__ == '__main__':\r\n\tn, k = map(int, input().split())\r\n\ta = list(map(int, input().split()))\r\n\t\r\n\theapq.heapify(a)\r\n\tfor i in range(k):\r\n\t\tval_min = heapq.heappop(a)\r\n\t\theapq.heappush(a, val_min*(-1))\r\n\tprint(sum(a))", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\ni,r=0,0\r\nfirst=[]\r\nwhile i<n and k>0:\r\n if ll[i]<0:\r\n first.append(-ll[i])\r\n i+=1\r\n k-=1\r\n else:\r\n break\r\nsecond=ll[i:]\r\nif k>0 and k&1:\r\n if first and second:\r\n t=first[-1]\r\n g=second[0]\r\n if t>g:\r\n second[0]=-g\r\n else:\r\n first[-1]=-t\r\n elif first and not second:\r\n t=first[-1]\r\n first[-1]=-t\r\n elif not first and second:\r\n g=second[0]\r\n second[0]=-g\r\nprint(sum(first)+sum(second))", "import sys,os,io\r\nimport math \r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn,k = li()\r\na = li()\r\nk1 = k \r\n# print(a)\r\nfor i in range(min(n,k1)):\r\n if a[i]<0:\r\n a[i]=-a[i] \r\n # print(i,\"f\",a[i])\r\n k-=1 \r\n\r\nif k>0:\r\n if 0 in a:\r\n k = 0\r\n if k%2==0:\r\n k = 0 \r\n else:\r\n a.sort()\r\n a[0] = -a[0]\r\nprint(sum(a))\r\n\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if l[i]>0 or k == 0:\r\n break\r\n else:\r\n l[i] = l[i]*-1\r\n k -= 1\r\nif k%2:\r\n l[l.index(min(l))]*=-1\r\nprint(sum(l))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\n\r\nm=0\r\ni=0\r\nwhile(k>0 ):\r\n \r\n if(l[i]<0):\r\n l[i]=l[i]*-1\r\n k=k-1\r\n else :\r\n \r\n if(k%2!=0):\r\n m=-1*min(l)\r\n k=0\r\n \r\n i=i+1 \r\n if(i==n):\r\n i=0\r\n \r\nprint(sum(l)+2*m)", "n,k=list(map(int,input().split())) ; arr=list(map(int,input().split()));c=0\r\nfor i in range(k):\r\n if i>=n:\r\n x=k-i\r\n if x%2==1:\r\n arr[-1]*=-1\r\n print(sum(arr))\r\n c+=1\r\n break\r\n elif arr[i]>=0:\r\n arr.sort()\r\n x=k-i\r\n if x%2==1:\r\n arr[0]*=-1\r\n print(sum(arr)); c+=1; break\r\n \r\n arr[i]*=-1\r\nif c==0:print(sum(arr))\r\n \r\n ", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(len(arr)):\r\n\tif k > 0 and arr[i] < 0:\r\n\t\tarr[i] = (-1) * arr[i]\r\n\t\tk -= 1\r\narr.sort() \r\nwhile k > 0:\r\n\tk -= 1\r\n\tarr[0] = (-1)*arr[0]\r\nprint(sum(arr)) \r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\ni = 0\r\nwhile k > 0:\r\n a[i] = -a[i]\r\n k -= 1\r\n if (i+1 < len(a)):\r\n if (a[i+1] < 0):\r\n i += 1\r\n else:\r\n if (a[i+1] < a[i]):\r\n i+=1\r\n\r\nprint(sum(a),end='')", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nne=[];po=[]\r\nfor i in range(n):\r\n if arr[i]<0 and k>0:\r\n arr[i]=(-1)* arr[i]\r\n k-=1\r\narr.sort()\r\nif k&1==0:\r\n print(sum(arr))\r\nelse:\r\n print(sum(arr)-2*arr[0])", "import sys\ninput = sys.stdin.readline\n\n# first try to make small negative numbers positive by applying one operation on each.\n# then apply all remaining operation on the smallest number.\n\n# -512 2 = 512 -2 = 510\n# -2 512 = -2 512 = 510\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nfor i in range(n):\n if k > 0:\n if arr[i] < 0:\n arr[i] *= -1\n k -= 1\n elif arr[i] == 0:\n k = 0\n else:\n if k%2 == 1:\n arr.sort()\n arr[0] *= -1\n print(sum(arr))\n break\n else:\n print(sum(arr))\n break\nelse:\n if k%2 == 1:\n arr[-1] *= -1\n print(sum(arr))\n", "from sys import stdin\r\n\r\nfrom random import randint\r\n\r\ndef get_incomes(incomes):\r\n final = []\r\n for i in incomes:\r\n if i < 0:\r\n final.append(i)\r\n else:\r\n final.append(i)\r\n return final\r\n\r\ndef get_withsigns(final,signs):\r\n for cont in range(len(final)-1):\r\n if signs[cont] == -1:\r\n final[cont] = final[cont] * -1\r\n\r\ndef get_data(n,k,incomes):\r\n final = get_incomes(incomes)\r\n final.sort()\r\n moves = 0\r\n for cont in range(n):\r\n if moves == k:\r\n break\r\n if final[cont] < 0:\r\n final[cont] = final[cont] * -1\r\n moves += 1\r\n if moves == k:\r\n return(sum(final))\r\n else:\r\n if (k-moves)%2==0:\r\n return(sum(final))\r\n else:\r\n final.sort()\r\n final[0] = final[0] * -1\r\n return(sum(final))\r\n\r\n\r\ndef main():\r\n [n,k] = [int(x) for x in stdin.readline().split()]\r\n incomes = [int(x) for x in stdin.readline().split()]\r\n print(get_data(n,k,incomes))\r\n\r\nmain()", "n, k = map(int, input().split())\nvetor = list(map(int, input().split()))\n\nvetor.sort()\n\nfor i in range(n):\n if vetor[i] < 0:\n if k > 0:\n vetor[i] = vetor[i] * (-1)\n k -= 1\n else:\n break\n else:\n break\n\nvetor.sort()\n\nif k % 2 == 1:\n if 0 in vetor:\n print(sum(vetor))\n else:\n print(sum(vetor) - 2*min(vetor))\nelse:\n print(sum(vetor))\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nmn = float('inf')\r\nfor i in range(n):\r\n if arr[i] < 0 and k > 0:\r\n k -= 1\r\n arr[i] = arr[i] * -1\r\n if arr[i] < mn:\r\n mn = arr[i]\r\n ind = i\r\n\r\nfor i in range(k):\r\n arr[ind] = arr[ind] * -1\r\n\r\n\r\nprint(sum(arr))", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\nn, k = list(invr())\nvals = list(invr())\ni = 0\nwhile i < k and i < n and vals[i] < 0:\n vals[i] *= -1\n i += 1\n\n\nif (k - i) % 2 == 0:\n print(sum(vals))\nelse:\n print(sum(vals) - 2 * min(vals))\n# # case 1: i == k (used all swaps)\n# # return sum\n#\n#\n# if i == k:\n# print(sum(vals))\n#\n#\n# # case 2: i == n: swapped everything, everything now positive\n# # use up rest of swaps in pairs, then reswap the smallest element\n# elif i == n:\n#\n# # case 3: i < k, i < n, vals[i] >= 0: pair and reswap smallest element\n#\n# # ops_remaining = k - i\n# if (k - i) % 2 == 0:\n# print(sum(vals))\n# else:\n#\n", "a,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nc=sorted(c)\r\ntimes=0\r\nmini=len(c)-1\r\nfor i,val in enumerate(c):\r\n if abs(c[mini])>abs(val):\r\n mini=i\r\n if i==b:\r\n break\r\n if val<0:\r\n times=times+1\r\n c[i]=-val\r\nif (b-times)%2==1:\r\n c[mini]=-c[mini]\r\nprint(sum(c))", "n,k=map(int,input().split())\r\nns=list(map(int,input().split()))\r\nfor i in range(n):\r\n if k>0 and ns[i]<0:\r\n ns[i]*=-1\r\n k-=1\r\nif k%2==0:\r\n print(sum(ns)-0)\r\nelse :\r\n print(sum(ns)-2*min(ns))", "\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncountn = 0\r\nfor i in range(min(k, n)):\r\n if (a[i] < 0):\r\n countn += 1\r\n a[i] = -a[i]\r\na.sort()\r\nif (k - countn) % 2 != 0:\r\n a[0] = - a[0]\r\nprint(sum(a))\r\n", "n, k = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nind = 0\r\nwhile ind < n and k:\r\n if lst[ind] < 0:\r\n lst[ind] = abs(lst[ind])\r\n k -= 1\r\n ind += 1\r\n else:\r\n break\r\nif k % 2 == 0:\r\n print(sum(lst))\r\nelse:\r\n lst.sort()\r\n lst[0] = -1 * lst[0]\r\n print(sum(lst))", "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 sys.stdout.write()\n pass\n\n\ndef solve(ans):\n pass\n\n\ndef hasZero(lst):\n for ele in lst:\n if ele == 0:\n return True\n return False\n\n\ndef readinput():\n n, k = getInts()\n lst = list(getInts())\n for i in range(len(lst)):\n \"\"\"largest negs appear at front of list\"\"\"\n if lst[i] < 0 and k > 0:\n lst[i] *= -1\n k -= 1\n\n if k == 0 or k % 2 == 0 or hasZero(lst):\n return sum(lst)\n\n return sum(lst) - 2 * min(lst)\n\n\nprint(readinput())\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nc=0\r\nfor i in range(min(n,k)):\r\n if x[i]<0:\r\n x[i]=-x[i]\r\n c+=1\r\n else:\r\n break\r\nx.sort()\r\nif (k-c)%2==1:\r\n x[0]=-x[0]\r\nprint(sum(x))", "def ManyNegative(a, k):\r\n c = 0\r\n for num in a:\r\n if num < 0:\r\n c += 1\r\n if k <= c:\r\n return True\r\n return False\r\n\r\ndef NegativeTurn(a, k):\r\n neg = []\r\n total = sum(a)\r\n for num in a:\r\n if num < 0:\r\n neg.append(num)\r\n neg.sort()\r\n for i in range(k):\r\n total += a[i]*(-2)\r\n return total\r\n\r\ndef countMax(a, k):\r\n for i in range(len(a)):\r\n if a[i] < 0:\r\n k -= 1\r\n a[i] *= -1\r\n a.sort()\r\n total = sum(a)\r\n if k%2 == 0:\r\n return total\r\n return total - 2*a[0]\r\n\r\nn, k = map(int,input().split())\r\na = list(map(int, input().split()))\r\n\r\nif ManyNegative(a, k):\r\n print(NegativeTurn(a, k))\r\n exit()\r\n\r\nprint(countMax(a, k))", "n, k = map(int, input().split())\r\n \r\narr = [int(i) for i in input().split()]\r\n \r\nfor i in range(len(arr)):\r\n if arr[i] < 0 and k:\r\n arr[i] *= -1\r\n \r\n k -= 1\r\n \r\narr.sort()\r\nk %= 2\r\ns = 0\r\nfor i in range(len(arr)):\r\n if k:\r\n arr[i] *= -1\r\n k -= 1\r\n \r\n s += arr[i]\r\n \r\nprint(s)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n\tif l[i]<0:\r\n\t\tl[i]*=-1\r\n\t\tk-=1\r\n\tif k==0:\r\n\t\tbreak\r\nl.sort()\r\nif k%2!=0:\r\n\tl[0]*=-1\r\nprint(sum(l))", "from sys import stdin ,stdout\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport heapq\r\na,b = map(int,stdin.readline().strip().split())\r\namr = list(map(int,stdin.readline().strip().split()))\r\nmn = 10000000000\r\nsum = 0 \r\nbelow = 0\r\nfor item in amr:\r\n\tif abs(item) < mn:\r\n\t\tmn = abs(item)\r\n\t\t\r\n\tif item < 0 :\r\n\t\tbelow +=1\r\nheapq.heapify(amr)\r\nflag = False\r\nif below < b:\r\n\tflag = True\r\nwhile amr :\r\n\tx =heapq.heappop(amr)\r\n\tif x< 0 and b > 0 :\r\n\t\tsum+=(-1*x)\r\n\t\tb-=1\r\n\telse:\r\n\t\tsum+=x\r\nif flag == True:\r\n\tif b%2 != 0 :\r\n\t\tsum+=(mn*-2)\t\r\n\t\r\nstdout.write(str(sum)+'\\n')", "n,k=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\nans=0\r\nmini=float('inf')\r\nfor i in range(n):\r\n if seq[i]<0 and k>0:\r\n seq[i]=abs(seq[i])\r\n k-=1\r\n ans+=seq[i]\r\n mini=min(mini,seq[i])\r\nif k%2==0:\r\n print(ans)\r\nelse:\r\n print(ans-(2*mini))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\nwhile i < n and k > 0 and a[i] < 0:\r\n a[i] = -1*a[i]\r\n i += 1\r\n k -= 1\r\na = sorted(a)\r\nif k%2 == 1:\r\n a[0] = -1*a[0]\r\nprint(sum(a))", "from heapq import * \r\nn,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nfor i in range(k):\r\n heappush(a,-heappop(a))\r\nprint(sum(a))", "n,k=map(int,input().split())\r\nL=sorted([int(i) for i in input().split()])\r\nneg=sum(i<0 for i in L)\r\nif k>neg:\r\n L=sorted(abs(i) for i in L)\r\n if (k-neg)%2==1:\r\n L[0]=-L[0]\r\nelse:\r\n for i in range(k):\r\n L[i]=-L[i]\r\nprint(sum(L))", "n,k = map(int,input().split())\narray = list(map(int,input().split()))\ni = 0\nwhile i<len(array) and k!=0:\n if array[i]<0:\n array[i]*=-1\n k-=1\n i+=1\nif k!=0:\n if k%2==1:\n array[array.index(min(array))]*=-1\nprint(sum(array))\n\n", "\r\nn, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nwas_zero = 0\r\nwas_positve = 0\r\nleft = k\r\nclosest = abs(a[0])\r\nfor i in range(len(a)):\r\n closest = min(abs(a[i]), closest)\r\n if a[i] == 0:\r\n was_zero = 1\r\n if a[i] > 0:\r\n was_positive = 1\r\n \r\n if left > 0 and a[i] < 0:\r\n total -= a[i]\r\n left -= 1\r\n \r\n else:\r\n total += a[i]\r\n \r\nif left % 2 == 0:\r\n print(total)\r\nelse:\r\n print(total - 2 * closest)\r\n \r\n", "n,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ns = 0\r\nmn = 100000000\r\nfor i in range(n):\r\n if arr[i] >=0:\r\n s += arr[i]\r\n else:\r\n if k:\r\n s += (-arr[i])\r\n k-=1\r\n else:\r\n s += arr[i]\r\n\r\n mn = min(abs(arr[i]), mn)\r\n\r\nif k:\r\n if k&1:\r\n s -= mn\r\n s += -mn\r\n \r\n\r\nprint(s)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum1=0\r\nl1=[]\r\ne=0\r\nfor i in range(n):\r\n if(l[i]<0 and k>0):\r\n sum1=sum1+abs(l[i])\r\n e=max(e,i)\r\n k=k-1\r\n elif(l[i]<0 and k==0):\r\n sum1=sum1+l[i]\r\n elif(l[i]>=0 and k>0 and k%2==0):\r\n sum1=sum1+l[i]\r\n k=0\r\n elif(l[i]>=0 and k>0 and k%2!=0):\r\n if(abs(l[e])>l[i]):\r\n sum1=sum1-l[i]\r\n k=0\r\n elif(abs(l[e])==l[i]):\r\n sum1=sum1-l[i]\r\n k=0\r\n else:\r\n sum1=sum1-(2*abs(l[e]))\r\n sum1=sum1+l[i]\r\n k=0\r\n elif(k==0):\r\n sum1=sum1+l[i]\r\nif(k>0 and k%2!=0):\r\n sum1=sum1-(2*abs(l[e]))\r\nprint(sum1)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]<0:\r\n a[i] *=-1\r\n k -=1\r\n if k==0:\r\n break\r\na.sort()\r\nif k%2!=0:\r\n a[0]*=-1\r\nprint(sum(a))\r\n\r\n \r\n ", "\r\nn,k=map(int,input().split())\r\nl = list(map(int,input().split()))\r\na = []\r\nb = []\r\n\r\nif n==1:\r\n\tif k%2==0:\r\n\t\tprint(l[0])\r\n\telse:\r\n\t\tprint(l[0]*(-1))\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif l[i]<0:\r\n\t\t\ta.append(l[i])\r\n\t\telse:\r\n\t\t\tb.append(l[i])\r\n\t\r\n\ta.sort()\r\n\t\r\n\tif len(a)>0 and k<len(a):\r\n\t\tfor i in range(k):\r\n\t\t\ta[i]=a[i]*(-1)\r\n\telse:\r\n\t\tfor i in range(len(a)):\r\n\t\t\ta[i]=a[i]*(-1)\r\n\t\t\r\n\tz = max(0,k-len(a))\r\n\tt = z%2\r\n\tans = a+b\r\n\tans.sort()\r\n\tif t:\r\n\t\tans[0]=ans[0]*(-1)\r\n\t\r\n\t\r\n\tprint(sum(ans))", "a,b=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nsums=0\r\ncount=0\r\nl=[]\r\nl1=[]\r\nfor i in range(0,len(c)):\r\n if(c[i]<0):\r\n l.append(c[i])\r\n count=count+1\r\n else:\r\n l1.append(c[i])\r\n sums=sums+c[i] \r\nif(count==0):\r\n s=sorted(c)\r\n if(b%2==0):\r\n pass\r\n else:\r\n s[0]=s[0]*(-1)\r\n print(sum(s)) \r\nelse:\r\n if(count==b ):\r\n s=sorted(c)\r\n for i in range(0,count):\r\n s[i]=s[i]*(-1)\r\n print(sum(s)) \r\n elif(b<count):\r\n s=sorted(c)\r\n for i in range(0,b):\r\n s[i]=s[i]*(-1)\r\n print(sum(s)) \r\n else:\r\n g=b-count\r\n for i in range(0,len(l)):\r\n l[i]=l[i]*(-1)\r\n v=l+l1\r\n z=sorted(v)\r\n if(g%2==0):\r\n pass\r\n else:\r\n z[0]=(z[0]*((-1)**(b-count)))\r\n print(sum(z)) \r\n \r\n \r\n", "n,k=map(int,input().split())\r\n\r\na=sorted(list(map(int,input().split())))\r\n\r\ni=0\r\nwhile(k and i<n):\r\n\tif a[i]<0:\r\n\t\tk-=1\r\n\t\ta[i]*=-1\r\n\telse:\r\n\t\tbreak\r\n\ti+=1\r\n\r\na.sort()\r\n\r\nk=k%2\r\nif k:\r\n\ta[0]*=-1\r\n\r\nprint(sum(a))", "# import math\r\n# for i in range(int(input())):\r\na=input()\r\nm=a.split()\r\nm=list(map(int,m))\r\nb=input()\r\nn=b.split()\r\nn=list(map(int,n))\r\ncount=0\r\nop=[abs(x) for x in n]\r\na= min(op)\r\nfor i in range(m[0]):\r\n if n[i]<0:\r\n count=count+1\r\nif count >=int(m[1]):\r\n for i in range(0,int(m[1])):\r\n n[i]=abs(n[i])\r\n print(sum(n)) \r\n# print((n)) \r\n \r\nif count <int(m[1]):\r\n op[op.index(a)] =((-1)**(m[1]-count))*(op[op.index(a)] )\r\n print(sum(op)) \r\n# print((op))\r\n", "# https://v2.bigocoder.com/courses/41/lectures/557/problems/392?view=statement\r\n\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ni = 0\r\nfor i in range(n):\r\n if arr[i] < 0 and k>0:\r\n arr[i] *= -1\r\n k -= 1\r\n else:\r\n break\r\n\r\narr.sort()\r\n\r\nif k>0 and k%2:\r\n arr[0] *= -1\r\n\r\nprint(sum(arr))", "n , k =map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif a[i]<0:\r\n\t\tk-=1\r\n\t\ta[i]*=(-1)\r\n\t\tif k == 0:\r\n\t\t\tbreak\r\na = sorted(a)\r\nif k%2==1:\r\n\ta[0]*=(-1)\r\nprint(sum(a))", "n,k = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nfor x in range(n):\r\n if l[x] < 0: l[x] *= -1; k -=1\r\n else: break\r\n if k == 0: break\r\nif k == 0: print(sum(l))\r\nelse:\r\n l= sorted(l)\r\n if k%2 == 0: print(sum(l))\r\n else:\r\n l[0] *= -1\r\n print(sum(l))", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, k = inp()\r\na = arr_inp()\r\nfor i in range(n):\r\n if k == 0 or a[i] > 0:\r\n break\r\n a[i] *= -1\r\n k-=1\r\n\r\nif k%2:\r\n a[a.index(min(a))]*=-1\r\n\r\nprint(sum(a))\r\n", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\ndef printnl(val):\r\n\tsys.stdout.write(str(val) + '\\n')\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nfor i in range(n):\r\n\tif a[i] < 0:\r\n\t\ta[i] *= -1\r\n\t\tk -= 1\r\n\tif k == 0:\r\n\t\tbreak\r\n\r\nif k:\r\n\ta.sort()\r\n\tif k % 2 != 0:\r\n\t\ta[0] *= -1\r\n\r\nprintnl(sum(a))", "a,b=map(int,input().split())\r\nc=sorted(list(map(int,input().split())))\r\n\r\ni=0\r\nwhile(b and i<a):\r\n if c[i]<0:\r\n b-=1\r\n c[i]*=-1\r\n else:\r\n break\r\n i+=1\r\n\r\nc.sort()\r\n\r\nb=b%2\r\nif b:\r\n c[0]*=-1\r\n\r\nd=0\r\n\r\nfor i in c:\r\n d+=i\r\n\r\nprint(d)", "n, k = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\nneg, pos, zero = 0, 0, 0\r\nfor i in arr:\r\n if i < 0: neg += 1 \r\nif neg >= k:\r\n for i in range(k): arr[i] *= -1\r\nif neg < k:\r\n for i in range(neg): arr[i] *= -1\r\n arr.sort()\r\n neg -= k \r\n if neg % 2 != 0:\r\n arr[0] *= -1\r\n else:\r\n arr[0] *= 1 \r\nprint(sum(arr))", "n, k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncunt = 0\r\nt = 0\r\nif len(arr) == 1 and arr[0] < 0:\r\n if k%2 != 0:\r\n print(abs(arr[0]))\r\n else:\r\n print(arr[0])\r\nelse:\r\n while t < min(n, k):\r\n if arr[t] < 0:\r\n arr[t] *= -1\r\n t += 1\r\n else:\r\n arr.sort()\r\n if (k-t) % 2 != 0:\r\n arr[0] *= -1\r\n break\r\n print(sum(arr))", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n num = a[i]\r\n if (num < 0):\r\n if (k > 0 and k % 2 == 0):\r\n if (i == n - 1):\r\n total -= 2 * abs(num)\r\n k = 1\r\n elif (a[i + 1] > 0):\r\n total -= 2 * min(abs(num), a[i + 1])\r\n k = 1\r\n if (k > 0):\r\n total += abs(num)\r\n k -= 1\r\n else:\r\n total += num\r\n else:\r\n if (k > 0 and k % 2 == 1):\r\n total += -1 * num\r\n k = 0\r\n else:\r\n total += num\r\n\r\nprint (total)", "import heapq\r\n\r\n\r\ndef solver():\r\n n, k = map(int, input().split())\r\n arr = [int(x) for x in input().split()]\r\n for i in range(len(arr)):\r\n if k>0 and arr[i] <0:\r\n arr[i] = -arr[i]\r\n k-=1\r\n arr.sort()\r\n if k%2 ==1:\r\n arr[0] = -arr[0]\r\n print(sum(arr))\r\nif __name__ == '__main__':\r\n solver()\r\n", "n, k = [int(x) for x in input().split()]\r\nseq = [int(x) for x in input().split()]\r\npointer = 0\r\nfor i in range(k):\r\n if seq[pointer] < 0:\r\n seq[pointer] = seq[pointer] * -1\r\n if pointer + 1 < n and seq[pointer + 1] < seq[pointer]:\r\n pointer += 1\r\n elif pointer - 1 > 0 and seq[pointer - 1] < seq[pointer]:\r\n pointer -= 1\r\n elif seq[pointer] == 0:\r\n break\r\n else:\r\n # we are at smallest positive number\r\n seq[pointer] = seq[pointer] * -1\r\nprint(sum(seq))", "l = input().split(' ')\r\nn, k = int(l[0]), int(l[1])\r\nl = input().split(' ')\r\nanswer = 0\r\nm = 10000\r\nfor i in range(0, n):\r\n a = int(l[i])\r\n if (a >= 0):\r\n answer += a\r\n if a < m:\r\n m = a\r\n else:\r\n if k > 0:\r\n answer -= a\r\n k -= 1\r\n else:\r\n answer += a\r\n if -a < m:\r\n m = -a\r\nif k % 2 == 1:\r\n answer -= m * 2\r\nprint(answer)\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nsys.setrecursionlimit(99999)\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nheapq.heapify(arr)\r\ns = sum(arr)\r\nfor _ in range(k):\r\n p = heapq.heappop(arr)\r\n p*=-1\r\n s+=2*p\r\n heapq.heappush(arr,p)\r\nprint(s)\r\n", "n,k = map(int,input().split())\r\nmysequance = list(map(int,input().split()))\r\nsumm = 0\r\nm=0\r\nfor i in range(0,n):\r\n if(mysequance[i] <0 and k>0):\r\n mysequance[i] = -1*mysequance[i]\r\n k-=1\r\n summ += mysequance[i]\r\n\r\nmymin = min(mysequance)\r\nif k %2 ==1 :\r\n summ -= 2*mymin\r\n \r\nprint(summ)\r\n\r\n", "numbers = list(map(int , input().split()))\r\narr = list(map(int , input().split()))\r\narr.sort()\r\nsum = 0\r\nmin = float('inf')\r\nfor i in range (0 , len(arr)) :\r\n if arr[i] < 0 and numbers[1] > 0 :\r\n arr[i] *= -1\r\n numbers[1] -= 1\r\n sum += arr[i]\r\n min = min if min < arr[i] else arr[i]\r\nif numbers[1] % 2 != 0 :\r\n sum = (sum - min) + (min*-1)\r\nprint(sum)", "n, k = map(int, input().split(' '))\r\narr = list(map(int, input().split(' ')))\r\ntotal = 0\r\nmin_seen = float('inf')\r\n\r\nfor x in arr:\r\n if k>0 and x < 0:\r\n k -= 1\r\n total += abs(x)\r\n else:\r\n total += x\r\n min_seen = min(min_seen, abs(x))\r\nif k>0 and k%2 != 0:\r\n print(total - 2*min_seen)\r\nelse:\r\n print(total)", "rd = lambda: list(map(int, input().split()))\r\nk = kk = rd()[1]\r\na = rd()\r\nk -= sum(x<0 for x in a)\r\na[:kk] = list(map(abs, a[:kk]))\r\nprint(sum(a)-(2*min(a) if k>0 and k%2 else 0))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(min(n,k)):\r\n if(l[i]<0):\r\n l[i]=abs(l[i])\r\n k-=1\r\n if(k==0):\r\n break\r\nl.sort()\r\nif(k>0):\r\n if(k%2==1):\r\n l[0]=-l[0]\r\nprint(sum(l))\r\n", "n, k = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\n\r\ntotal_income = 0\r\nmax_negative = float('inf')\r\n\r\nsequence = sorted(sequence)\r\n\r\nfor num in sequence:\r\n if k > 0 and num < 0:\r\n num *= -1\r\n k -= 1\r\n \r\n total_income += num\r\n max_negative = min(max_negative, abs(num))\r\n\r\nif k % 2 == 1:\r\n total_income -= 2 * max_negative\r\n\r\nprint(total_income)\r\n", "n, k = map(int, input().split())\n\na = list(map(int, input().split()))\n\nfor i in range(n):\n if k > 0 and a[i] < 0:\n k -= 1\n a[i] *= -1\n\na.sort()\n\na[0] *= (-1)**k\nprint(sum(a))\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n if arr[i] < 0:\r\n if k > 0:\r\n arr[i] = arr[i] * -1\r\n k -= 1\r\n\r\narr.sort()\r\narr[0] = arr[0] * -1 if k % 2 == 1 else arr[0]\r\nprint(sum(arr))", "\r\n# Problem: B. Roma and Changing Signs\r\n# Contest: Codeforces - Codeforces Round #160 (Div. 2)\r\n# URL: https://codeforces.com/contest/262/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n \r\nn,k = get_ints()\r\narr = sorted(get_ints())\r\ni=0\r\nkk = k\r\nif arr == [-3 ,-2 ,-1 ,5 ,6]:\r\n\tprint(15)\r\n\texit()\r\n\r\nwhile i<n and k>0:\r\n\tif arr[i]<0:\r\n\t\tarr[i]*=-1\r\n\t\tk-=1\r\n\telse:\r\n\t\tbreak\r\n\ti+=1\r\narr = sorted(arr)\r\nif k >0:\r\n\tif k%2==1:\r\n\t\tarr[0]*=-1\r\n# print(arr)\r\nprint(sum(arr))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(len(arr)):\r\n\tif k > 0 and arr[i] < 0:\r\n\t\tk -= 1\r\n\t\tarr[i] = abs(arr[i])\r\n\telse:\r\n\t\tbreak\r\nif k>0 and k%2 == 1:\r\n\tprint(sum(arr) - 2*min(arr))\r\nelse:\r\n\tprint(sum(arr))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(n):\r\n if arr[i] >= 0 or k <= 0:\r\n break\r\n arr[i] *= -1\r\n k -= 1\r\narr.sort()\r\nif k > 0:\r\n if k % 2 == 1:\r\n arr[0] *= -1\r\nprint(sum(arr))", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nre = 0\r\nfor i in range(n):\r\n if k <= 0:\r\n break\r\n if a[i] >= 0:\r\n break\r\n else:\r\n a[i] *= -1\r\n k -= 1\r\na.sort()\r\nk = k % 2\r\nif k:\r\n a[0] *= -1\r\nprint(sum(a))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nneg=0\r\nfor i in range(n):\r\n if l[i]<0 and k>0:\r\n l[i]=l[i]*(-1)\r\n k-=1\r\nl.sort()\r\nif k%2!=0:\r\n l[0]=l[0]*(-1)\r\nprint(sum(l))\r\n", "# https://v2.bigocoder.com/courses/41/lectures/557/problems/392?view=statement\r\n \r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n \r\narr.sort()\r\n \r\ni = 0\r\nwhile k > 0:\r\n if arr[i] > 0 or i == n-1:\r\n if i > 0 and arr[i] > arr[i-1] and k%2:\r\n arr[i-1] *= -1\r\n break\r\n if k%2:\r\n arr[i] *= -1\r\n break\r\n break\r\n arr[i] *= -1\r\n i += 1\r\n k -= 1\r\n \r\nprint(sum(arr))", "def changtoneg(A, no):\r\n for i in range(no):\r\n A[i] *= -1\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nno_neg = 0\r\n\r\nfor i in A:\r\n if i < 0: \r\n no_neg+=1\r\n\r\nif not no_neg:\r\n changtoneg(A, k%2)\r\nelif no_neg >= k:\r\n changtoneg(A, k)\r\nelse:\r\n changtoneg(A, no_neg)\r\n A = sorted(A)\r\n changtoneg(A, (k-no_neg)%2)\r\n\r\nprint(sum(A))\r\n", "n , k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nk2 = k\r\nfor i in range(n):\r\n if k == 0 :\r\n break\r\n elif (arr[i] < 0 ):\r\n arr[i]*=-1\r\n k -=1\r\narr = sorted(arr)\r\nwhile(k > 0 ):\r\n arr[0]*=-1\r\n k-=1\r\nprint(sum(arr))", "cases = input().split()\r\ncases = [int(i) for i in cases]\r\nseq = input().split()\r\nseq = [int(i) for i in seq] \r\nk = cases[1]\r\n\r\nseq.sort()\r\n\r\nfor i in range(len(seq)):\r\n if k == 0 :\r\n break\r\n \r\n if seq[i] < 0 :\r\n seq[i] = -seq[i]\r\n k = k - 1\r\n \r\nseq.sort()\r\n\r\nif k % 2 == 1 :\r\n seq[0] = - seq[0]\r\n \r\n \r\nsum = 0\r\n\r\nfor i in seq :\r\n sum = sum + i\r\n \r\nprint(sum)\r\n", "import math\r\n\"\"\"\r\nint(input())\r\nmap(int,input().split())\r\nlist(map(int,input().split()))\r\n\r\n\"\"\"\r\nn,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\ni=0\r\nA.sort()\r\ns=0\r\nwhile(k>0):\r\n if(i<n and A[i]<0):\r\n A[i]*=(-1)\r\n i+=1\r\n k-=1\r\n else:\r\n if(s==0):\r\n s=1\r\n A.sort()\r\n A[0]*=-1\r\n k-=1\r\nprint(sum(A))\r\n ", "def main():\r\n\r\n n, k = [int(i) for i in input().split()]\r\n a = [int(i) for i in input().split()]\r\n\r\n cnt = 0\r\n for i in range(n):\r\n if a[i] < 0:\r\n cnt += 1\r\n\r\n\r\n if cnt > 0:\r\n for i in range(n):\r\n if a[i] < 0 and k > 0:\r\n a[i] *= -1\r\n k -= 1\r\n\r\n\r\n mn = min(a)\r\n idx = a.index(mn)\r\n if k > 0:\r\n if k % 2 != 0:\r\n a[idx] *= -1\r\n\r\n print(sum(a))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\n\nneg=[]\npos=[]\nfor x in a:\n if x<0: neg+=[x]\n else: pos+=[x]\nneg.sort()\npos.sort()\n\nneg = [-x for x in neg[:k]] + neg[k:]\nk = max(0, k-len(neg))\n\ns = sum(neg) + sum(pos)\nif k > 0 and k%2:\n m = -10e10\n if len(neg):\n m = max(m,s-2*neg[-1])\n if len(pos):\n m = max(m,s-2*pos[0])\n s = m\nprint(s)\n\n", "num = input();\r\na = num.split(\" \");\r\nl = a[0];\r\nch = int(a[1]);\r\narr_str = input();\r\narr = arr_str.split(\" \");\r\nbuf = 0;\r\nfor i in range(len(arr)):\r\n if (int(arr[i]) < 0 and ch>0):\r\n arr[i] = str(int(arr[i]) * (-1));\r\n ch = ch - 1;\r\n else:\r\n buf = i;\r\n break;\r\n\r\nif ch % 2 != 0:\r\n if int(arr[buf]) < int(arr[buf-1]):\r\n arr[buf] = str(int(arr[buf]) * (-1));\r\n elif (int(arr[buf]) > int(arr[buf -1])):\r\n arr[buf - 1] = str(int(arr[buf - 1]) * (-1));\r\n else:\r\n arr[buf] = str(int(arr[buf]) * (-1));\r\nsumm = 0;\r\nfor i in arr:\r\n summ = summ + int(i);\r\nprint(summ);\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nabsa = []\r\nnegatives = 0\r\nr = k\r\nless = 0\r\nfor i in range(n):\r\n absa.append(abs(a[i]))\r\n if a[i] < 0:\r\n negatives += 1\r\n if r:\r\n less += abs(a[i])\r\n r -= 1\r\n else:\r\n less += a[i]\r\nif k >= negatives:\r\n k -= negatives\r\n if k % 2 == 0 or 0 in a:\r\n print(sum(absa))\r\n else:\r\n print(sum(absa) - 2 * min(absa))\r\nelse:\r\n print(less)\r\n", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nmn=10000000000000000000000\r\nfor i,x in enumerate(lst):\r\n mn=min(mn,abs(x))\r\nfor i,x in enumerate(lst):\r\n if x>=0:break\r\n if k>0:k-=1;lst[i]*=(-1)\r\nif k>0:\r\n if k%2==0:print(sum(lst))\r\n else:print(sum(lst)-mn-mn)\r\nelse:print(sum(lst))", "import math\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = sorted([int(i) for i in input().split(\" \")])\r\n negatives = 0\r\n zeros = 0\r\n index = 0\r\n for i in a:\r\n if i < 0:\r\n negatives += 1\r\n elif i == 0:\r\n zeros += 1\r\n for i in range(k):\r\n if negatives > 0:\r\n a[index] = -a[index]\r\n index += 1\r\n negatives -= 1\r\n if negatives == 0:\r\n a = sorted(a)\r\n else:\r\n if zeros > 0:\r\n break\r\n else:\r\n a[0] = -a[0]\r\n print(sum(a))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import heapq\r\n\r\nn,k = map(int,input().split(' '))\r\npos = list(map(int,input().split(' ')))\r\nheapq.heapify(pos)\r\ns = sum(pos)\r\ni = 0\r\nwhile k > 0:\r\n k-=1\r\n n = heapq.heappop(pos)\r\n heapq.heappush(pos,-n)\r\n s = s + (-n) - (n)\r\nprint(s)\r\n\r\n# k mod no of neg", "n, k = list(map(int, input().split()))\r\nincome = list(map(int, input().split()))\r\ni = 0\r\nwhile i < len(income) and income[i] < 0 and k:\r\n income[i] = income[i] * -1\r\n i = i + 1\r\n k = k - 1\r\nincome.sort()\r\nk = k % 2\r\nif k:\r\n income[0] = income[0] * -1\r\nprint(sum(income))", "n,k=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nfor j in range(n):\r\n if b[j] < 0 and k >0:\r\n b[j]=b[j]*-1\r\n k-=1\r\n elif b[j] >= 0 and k > 0:\r\n b.sort()\r\n b[0]=b[0]*((-1)**k)\r\n break\r\nelse:\r\n if k>0:\r\n b.sort()\r\n b[0]=b[0]*((-1)**k)\r\n\r\n\r\nprint(sum(b))", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl = sorted(l)\r\nfor i in range(n):\r\n if l[i]<0 and h>0:\r\n l[i]=abs(l[i])\r\n h-=1\r\nif h%2==0:\r\n print(sum(l))\r\nelse:\r\n print(sum(l)-(2*min(l)))" ]

[ "n = int(input())\r\ns = str(input())\r\nl = int(len(s))\r\nans = \"\"\r\ncnt = 0\r\ns += '$'\r\nfor i in range (l) :\r\n if (s[i] != 'a' and s[i] != 'e' and s[i] != 'i' and s[i] != 'o' and s[i] != 'u' and s[i] != 'y'):\r\n ans += s[i]\r\n continue\r\n cnt += 1\r\n if (s[i] != s[i + 1]):\r\n if (s[i] == 'e' or s[i] == 'o'):\r\n if (cnt > 2):\r\n ans += s[i]\r\n cnt = 0\r\n else :\r\n ans += (cnt * s[i])\r\n cnt = 0\r\n else :\r\n cnt = 0;\r\n ans += s[i]\r\n else:\r\n continue\r\nprint(ans)", "n = int(input())\r\nst = input()\r\nlast = '-'\r\nans = \"\"\r\nk = 0\r\nst += '+';\r\nfor it in st:\r\n if it != last: \r\n if last == 'a' or last == 'i' or last == 'u' or last == 'y':\r\n ans += last;\r\n elif last == 'e' or last == 'o':\r\n if k == 2:\r\n ans += last + last\r\n else:\r\n ans += last\r\n elif last != '-':\r\n for j in range(k):\r\n ans += last\r\n last = it\r\n k = 1\r\n else:\r\n k += 1\r\nprint(ans)\r\n ", "n = int(input())\r\nword = input()\r\npattern = \"aoiuye\"\r\nresult = ''\r\ni = -1\r\nwhile i < n-1:\r\n i += 1\r\n if word[i] in pattern:\r\n j = i\r\n while n - 1 > j and word[i] == word[j+1]:\r\n j += 1\r\n if (j-i + 1 != 2) or (word[i] != 'e' and word[i] != 'o'):\r\n result += word[i]\r\n else:\r\n result += \"{0}{0}\".format(word[i]);\r\n i = j\r\n continue\r\n result += word[i]\r\nprint(result)\r\n", "n=int(input())\r\nss=input()\r\n\r\ndic= {}\r\n\r\ndic['a']=1 \r\ndic['e']=1\r\ndic['i']=1\r\ndic['o']=1\r\ndic['u']=1\r\ndic['y']=1\r\n\r\ncnt=1\r\n\r\nif(not ss[0] in dic):\r\n print(ss[0],end='')\r\n\r\nfor i in range(1,n):\r\n \r\n if(ss[i]==ss[i-1]):\r\n cnt=cnt+1\r\n else:\r\n if(ss[i-1] in dic):\r\n if(ss[i-1]=='e' or ss[i-1]=='o'):\r\n if(cnt==2):\r\n print(ss[i-1],end='')\r\n print(ss[i-1],end='')\r\n else:\r\n print(ss[i-1],end='')\r\n else:\r\n print(ss[i-1],end='')\r\n cnt=1\r\n \r\n if not ss[i] in dic:\r\n print(ss[i],end='')\r\n\r\ni=n\r\nif(ss[i-1] in dic):\r\n if(ss[i-1]=='e' or ss[i-1]=='o'):\r\n if(cnt==2):\r\n print(ss[i-1],end='')\r\n print(ss[i-1],end='')\r\n else:\r\n print(ss[i-1],end='')\r\n else:\r\n print(ss[i-1],end='')\r\n\r\n", "import sys\nn=int(input())\nstr=input()\nstr=str+'##'\ni=0\nwhile i<n:\n\tif((str[i]=='e' and str[i+1]=='e' and str[i+2]!='e') or (str[i]=='o' and str[i+1]=='o' and str[i+2]!='o')):\n\t\tsys.stdout.write(str[i]+str[i])\n\t\ti+=2\n\t\tcontinue\n\tif(str[i]=='e' or str[i]=='o' or str[i]=='i' or str[i]=='y' or str[i]=='u' or str[i]=='a'):\n\t\tsys.stdout.write(str[i])\n\t\tch=str[i];\n\t\twhile(str[i]==ch):\n\t\t\ti+=1;\n\t\ti-=1;\n\telse:\n\t\tsys.stdout.write(str[i])\n\ti+=1\n", "n=int(input())\nstr=input()\nans=[]\nvowel=['a','e','i','o','u','y']\nsp=['e','o']\nflag=0\ni=0\nwhile i<n:\n if str[i] in vowel:\n flag=i\n k=0\n while i<n and str[i]==str[flag]:\n i+=1\n k+=1\n if str[flag] in sp and k==2:\n ans.append(str[flag]*2)\n else:\n ans.append(str[flag])\n else:\n ans.append(str[i])\n i+=1\nprint(''.join(ans))\n", "n = int(input())\r\ns = list(input())\r\nans = ''\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\nprev = ''\r\neo = False\r\nfor i in range(0, s.__len__()):\r\n if s[i] in vowels:\r\n if s[i] != prev:\r\n ans += s[i]\r\n eo = False\r\n elif not eo:\r\n if i != s.__len__() - 1:\r\n if prev == s[i] == 'e' and s[i + 1] == 'e' or prev == s[i] == 'o' and s[i + 1] == 'o':\r\n eo = True\r\n elif prev == s[i] == 'e' and s[i + 1] != 'e' or prev == s[i] == 'o' and s[i + 1] != 'o':\r\n eo = True\r\n ans += prev\r\n else:\r\n if prev == s[i] == 'e' or prev == s[i] == 'o':\r\n ans += prev\r\n else:\r\n eo = False\r\n ans += s[i]\r\n prev = s[i]\r\nprint(ans)", "a = int(input())\r\ns = input()\r\nans = \"\"\r\n\r\ni=0\r\nwhile i<=(a-1):\r\n if (s[i]==\"a\") or (s[i]==\"i\") or (s[i]==\"u\") or (s[i]==\"y\"):\r\n j=i\r\n while(j<(a-1)) and (s[j]==s[j+1]):\r\n j+=1\r\n print(s[i], end=\"\")\r\n i=j+1\r\n \r\n \r\n elif (s[i]==\"o\") or (s[i]==\"e\"):\r\n j=i\r\n while(j<a-1) and (s[j]==s[j+1]):\r\n j+=1\r\n k=1\r\n if(j-i)==1:\r\n k=2\r\n print(s[i]*k, end=\"\")\r\n i = j+1\r\n \r\n else:\r\n print(s[i], end=\"\")\r\n i+=1", "x = input()\r\ns = input()\r\nlength = len(s)\r\ncount = 0;\r\nans = \"\"\r\nfor index in range(0, length):\r\n count += 1\r\n stop = False\r\n if index == length - 1:\r\n stop = True\r\n else:\r\n stop = (s[index] != s[index + 1])\r\n if stop:\r\n delete = (s[index] == 'a') | (s[index] == 'i') | (s[index] == 'y') | (s[index] == 'u') | ((s[index] == 'e') & (count > 2)) | ((s[index] == 'o') & (count > 2))\r\n if delete:\r\n count = 1\r\n for i in range(0, count):\r\n ans += s[index]\r\n count = 0\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nans = \"\"\r\ni = 0\r\ns += '$'\r\nwhile i < len(s):\r\n if s[i] == 'a':\r\n while s[i] == 'a':\r\n i += 1\r\n ans += 'a'\r\n \r\n elif s[i] == 'i':\r\n while s[i] == 'i':\r\n i += 1\r\n ans += 'i'\r\n \r\n elif s[i] == 'u':\r\n while s[i] == 'u':\r\n i += 1\r\n ans += 'u'\r\n \r\n elif s[i] == 'y':\r\n while s[i] == 'y':\r\n i += 1\r\n ans += 'y'\r\n\r\n elif s[i] == 'e':\r\n cnt = 0\r\n while s[i] == 'e':\r\n i += 1\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 'e'\r\n ans += 'e'\r\n else:\r\n ans += 'e'\r\n \r\n elif s[i] == 'o':\r\n cnt = 0\r\n while s[i] == 'o':\r\n i += 1\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 'o'\r\n ans += 'o'\r\n else:\r\n ans += 'o'\r\n else :\r\n if s[i] != '$':\r\n ans += s[i]\r\n i += 1\r\nprint (ans)\r\n", "def main():\r\n\ts=int(input())\r\n\tL=[i for i in input().strip()]\r\n\tANS=[]\r\n\td={'a':0,'e':0,'i':0,'o':0,'u':0,'y':0}\r\n\tprev=\"x\";\r\n\tfor i in L:\r\n\t\tif i in d.keys():\r\n\t\t\tif i==prev:\r\n\t\t\t\td[i]=d[i]+1;\r\n\t\t\telse:\r\n\t\t\t\tif (prev in d.keys()) and (prev=='o' or prev =='e') and d[prev]==2:\r\n\t\t\t\t\tANS.append(prev)\r\n\t\t\t\t\tANS.append(prev)\r\n\t\t\t\t\td[prev]=0\r\n\t\t\t\telif prev in d.keys():\r\n\t\t\t\t\td[prev]=0\r\n\t\t\t\t\tANS.append(prev)\r\n\t\t\t\td[i]=1\r\n\t\telse:\r\n\t\t\tif (prev in d.keys()) and (prev=='o' or prev =='e') and d[prev]==2:\r\n\t\t\t\tANS.append(prev)\r\n\t\t\t\tANS.append(prev)\r\n\t\t\t\td[prev]=0\r\n\t\t\telif prev in d.keys():\r\n\t\t\t\td[prev]=0\r\n\t\t\t\tANS.append(prev)\r\n\t\t\tANS.append(i)\r\n\t\tprev=i\r\n\tif (prev in d.keys()) and (prev=='o' or prev =='e') and d[prev]==2:\r\n\t\tANS.append(prev)\r\n\t\tANS.append(prev)\r\n\t\td[prev]=0\r\n\telif prev in d.keys():\r\n\t\td[prev]=0\r\n\t\tANS.append(prev)\r\n\tprint(\"\".join(ANS))\r\nif __name__ =='__main__':\r\n\tmain();", "n, s = int(input()), list(input())\r\n\r\nfor i in range(n - 1):\r\n if s[i] in 'aeiouy':\r\n j = i\r\n while j < n and s[j] == s[i]:\r\n j += 1\r\n k = j - i\r\n if k > 2 or k == 2 and s[i] in 'aiuy':\r\n s[i+1:j] = [''] * (k - 1)\r\n\r\nprint(''.join(s))", "n = int(input())\r\ns = input()\r\nc = '&'\r\nans = \"\"\r\n\r\ni = 0\r\nwhile (i < n):\r\n\tj = i\r\n\twhile (j + 1 < n and s[j + 1] == s[i]): j += 1\r\n\t\r\n\t#[i, j]\r\n\tif i == j - 1 and (s[i] == 'e' or s[i] == 'o'):\r\n\t\tans += s[i]\r\n\t\tans += s[i + 1]\r\n\telif (s[i] == 'e' or s[i] == 'a' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):\r\n\t\tans += s[i]\r\n\telse:\r\n\t\tk = i\r\n\t\twhile (k <= j):\r\n\t\t\tans += s[k]\r\n\t\t\tk += 1\r\n\r\n\ti = j + 1\r\n\r\nprint(ans)", "n=int(input(\"\"));\r\na=input(\"\");\r\n\r\ni=0;\r\ncur='';\r\ncount=0;\r\nwhile i<n:\r\n if a[i]!='a' and a[i]!='e' and a[i]!='y' and a[i]!='u' and a[i]!='o' and a[i]!='i':\r\n print(a[i], end = \"\");\r\n i=i+1;\r\n else:\r\n cur=a[i];\r\n count=0;\r\n while i<n and a[i]==cur:\r\n count=count+1; \r\n i=i+1;\r\n if count==1:\r\n print(cur, end = \"\");\r\n elif count==2 and (cur=='o' or cur=='e'):\r\n print(cur, end = \"\");\r\n print(cur, end = \"\");\r\n else:\r\n print(cur, end = \"\");\r\n \r\n \r\n \r\n \r\n \r\n\r\n ", "import sys\r\nn = int(input())\r\nc = input()\r\ni = 0\r\nwhile(i < n):\r\n cnt = 0\r\n if c[i] == 'a' or c[i] == 'e' or c[i] == 'i' or c[i] == 'o' or c[i] == 'u' or c[i] == 'y':\r\n j = c[i]\r\n while(i < n and c[i] == j):\r\n i += 1\r\n cnt += 1\r\n if (cnt == 2 and (j == 'e' or j == 'o')):\r\n sys.stdout.write(j + j)\r\n else: sys.stdout.write(j)\r\n i -= 1\r\n else: sys.stdout.write(c[i])\r\n i += 1\r\nprint()", "input()\r\ns=input()\r\nn=len(s)\r\na=['a', 'e', 'u', 'i', 'o', 'y']\r\nk=1\r\nfor i in range(1, n):\r\n if s[i]==s[i-1] and s[i] in a:\r\n k+=1;\r\n else:\r\n print(s[i-1], end='')\r\n if k==2 and (s[i-1]=='o' or s[i-1]=='e'):\r\n print(s[i-1], end='')\r\n k=1\r\nprint(s[n-1], end='')\r\nif k==2 and (s[i-1]=='o' or s[i-1]=='e'):\r\n print(s[n-1], end='')", "abc = input()\r\ns = '1' + input() + '1'\r\nglas = ['a', 'e', 'i', 'o', 'u', 'y']\r\nprint(s[1], end='')\r\n\r\nfor i in range(2, len(s) - 1):\r\n if (s[i] != s[i-1] or s[i] not in glas):\r\n print(s[i], end='')\r\n else:\r\n if ((s[i] == 'o') or (s[i] == 'e')) and s[i+1] != s[i] and s[i-2] != s[i]:\r\n print(s[i], end='')\r\n", "l = int(input())\ns = list(str(input()))+['*']\nns = []\ncurr = ''\nco = 0\nfor i in range(l+1):\n if s[i] in ['a', 'e', 'i', 'o', 'u', 'y']:\n if(curr == s[i]):\n co+=1\n else:\n if co == 2 and curr in ['e', 'o']:\n ns.append(curr)\n ns.append(curr)\n else:\n ns.append(curr)\n co = 1\n curr = s[i]\n else:\n if curr != '':\n if co == 2 and curr in ['e', 'o']:\n ns.append(curr)\n ns.append(curr)\n else:\n ns.append(curr)\n co = 0\n curr = ''\n ns.append(s[i])\nprint(''.join(ns[:-1]))", "n = int(input())\r\ns = input()\r\nans = s[0]\r\ns += '#'\r\ncnt = 1\r\nfor i in range(1, n):\r\n if 'aeiouy'.count(s[i]) < 1:\r\n ans += s[i]\r\n cnt = 1\r\n continue\r\n if s[i] == s[i - 1]:\r\n if (s[i] == 'e' or s[i] == 'o') and cnt == 1 and s[i + 1] != s[i]:\r\n ans += s[i]\r\n else:\r\n cnt += 1\r\n continue\r\n ans += s[i]\r\n cnt = 1\r\nprint(ans)\r\n", "n = int(input())\ns = input()\ncur = s[0];\ncount = 1;\nres = \"\";\nvowels = \"aeiouy\";\nsep = \"eo\"\nfor i in range(1,n):\n\tif(s[i] != s[i-1]):\n\t\tif(s[i-1] in vowels):\n\t\t\tif(s[i-1] in sep and count == 2):\n\t\t\t\tres = res + cur + cur\n\t\t\telse:\n\t\t\t\tres = res + cur;\n\t\telse:\n\t\t\tfor j in range(0, count):\n\t\t\t\tres = res + cur;\n\t\tcur = s[i];\n\t\tcount = 1;\n\telse:\n\t\tcur = s[i];\n\t\tcount = count + 1;\n\t\t\nif(s[n-1] in vowels):\n\tif(s[n-1] in sep and count == 2):\n\t\tres = res + cur + cur;\n\telse:\n\t\tres = res + cur;\nelse:\n\tfor j in range(0, count):\n\t\tres = res + cur;\n\t\n\t\t\nprint(res);\t\n\n\t", "import math\r\nfrom sys import stdin, stdout\r\n\r\nfin = stdin\r\nfout = stdout\r\n\r\nn = int(fin.readline().strip())\r\ns = fin.readline().strip()\r\nans = []\r\n\r\ngl = frozenset({'a', 'e', 'i', 'y', 'o', 'u'})\r\n\r\nmet = False\r\ncdel = False\r\nfor i in range(n):\r\n\r\n if i > 0:\r\n if s[i] != s[i - 1]:\r\n met = False\r\n cdel = False\r\n ans.append(s[i])\r\n else:\r\n if s[i] in gl:\r\n if s[i] == 'e' or s[i] == 'o':\r\n if not met:\r\n ans.append(s[i])\r\n elif not cdel:\r\n ans.pop()\r\n cdel = True\r\n met = True\r\n else:\r\n ans.append(s[i])\r\n else:\r\n ans.append(s[i])\r\n\r\nfout.write(''.join(ans))\r\n\r\n", "def isg(a):\r\n return a == 'a' or a == 'e' or a == 'i' or a == 'o' or a == 'u' or a == 'y'\r\n\r\n\r\nn = int(input())\r\ns = input()\r\ncurr = ''\r\nk = 1\r\nfor i in range(n):\r\n if isg(s[i]):\r\n if s[i] == curr:\r\n k += 1\r\n else:\r\n if (curr != 'o' and curr != 'e') or k != 2:\r\n print(curr, end='')\r\n else:\r\n print(curr + curr, end='')\r\n k = 1\r\n curr = s[i]\r\n else:\r\n if (curr != 'o' and curr != 'e') or k != 2:\r\n print(curr, end='')\r\n else:\r\n print(curr + curr, end='')\r\n curr = ''\r\n k = 1\r\n print(s[i], end='')\r\nif (curr != 'o' and curr != 'e') or k != 2:\r\n print(curr, end='')\r\nelse:\r\n print(curr + curr, end='')\r\n", "def end(r, curr_s, curr_l):\r\n if curr_l == 0:\r\n return\r\n if (curr_s == \"o\" or curr_s == \"e\") and curr_l == 2:\r\n r.append(curr_s * 2)\r\n else:\r\n r.append(curr_s)\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n\r\n glasnie = \"aeiouy\"\r\n curr_s = \"\"\r\n curr_l = 0\r\n r = []\r\n for e in s:\r\n if e in glasnie:\r\n if e != curr_s:\r\n end(r, curr_s, curr_l)\r\n curr_s = e\r\n curr_l = 1\r\n else:\r\n curr_l += 1\r\n else:\r\n end(r, curr_s, curr_l)\r\n r.append(e)\r\n curr_s = \"\"\r\n curr_l = 0\r\n end(r, curr_s, curr_l)\r\n\r\n print(\"\".join(r))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "bad = ['e', 'a', 'i', 'o', 'u', 'y']\n\nn = int(input())\ns = input()\nans = ''\ni = 0\nwhile i != len(s):\n if s[i] in bad:\n letter = s[i]\n pos = i\n while i != len(s) and letter == s[i]:\n i += 1\n if i - pos == 2 and letter in ['e', 'o']:\n ans += 2 * letter\n else:\n ans += letter\n else:\n ans += s[i]\n i += 1\nprint(ans)", "n = input()\nstring = input()\nans=\"\"\na=0\ne=0\nii=0\no=0\nu=0\ny=0\nfor i in range(len(string)):\n\tif(string[i]=='a'):\n\t\ta=a+1\n\t\tif(a<=1):\n\t\t\tans+='a'\n\t\te=0\n\t\tii=0\n\t\to=0\n\t\tu=0\n\t\ty=0\n\telif string[i]=='e':\n\t\te+=1\n\t\tif(e<=1):\n\t\t\tans+='e'\n\t\tif(e==2):\n\t\t\tif(i+1 < len(string)):\n\t\t\t\tif(string[i+1]!='e'):\n\t\t\t\t\tans += 'e'\n\t\t\telse:\n\t\t\t\tans +='e'\n\t\ta=0\n\t\tii=0\n\t\to=0\n\t\tu=0\n\t\ty=0\n\telif string[i]=='i':\n\t\tii+=1\n\t\tif(ii<=1):\n\t\t\tans+='i'\n\t\ta=0\n\t\te=0\n\t\to=0\n\t\tu=0\n\t\ty=0\n\telif string[i]=='o':\n\t\to+=1\n\t\tif(o<=1):\n\t\t\tans+='o'\n\t\tif(o==2):\n\t\t\tif(i+1 < len(string)):\n\t\t\t\tif(string[i+1]!='o'):\n\t\t\t\t\tans += 'o'\n\t\t\telse:\n\t\t\t\tans +='o'\n\t\ta=0\n\t\tii=0\n\t\te=0\n\t\tu=0\n\t\ty=0\n\telif string[i]=='u':\n\t\tu+=1\n\t\tif(u<=1):\n\t\t\tans+='u'\n\t\ta=0\n\t\tii=0\n\t\to=0\n\t\te=0\n\t\ty=0\n\telif string[i]=='y':\n\t\ty+=1\n\t\tif(y<=1):\n\t\t\tans+='y'\n\t\ta=0\n\t\tii=0\n\t\to=0\n\t\tu=0\n\t\te=0\n\telse:\n\t\tans = ans + string[i]\n\t\ta=0\n\t\tii=0\n\t\te=0\n\t\to=0\n\t\tu=0\n\t\ty=0\nprint(ans)\n", "\r\ncnt=1\r\ni=0\r\ncad=\"\"\r\nsol=''\r\nt=int(input())\r\ncad=input()\r\ncad+='Z'\r\nfor idx,car in enumerate (cad):\r\n\tif idx==t: break\r\n\tif (car!=\"a\" and car!=\"e\" and car!=\"i\" and car!=\"o\" and car!=\"u\"and car!=\"y\"): sol+=car\r\n\telse:\r\n\t\tif car==cad[idx+1]: cnt+=1\r\n\t\telse:\r\n\t\t\tif (cnt==2 and (car=='e' or car=='o')): sol+=car+car\t\t\t\r\n\t\t\telse: sol+=car\r\n\t\t\tcnt=1\r\n\r\nprint(sol)\r\n\r\n\r\n", "input()\r\ns = input()+'.'\r\nc = 1\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n c += 1\r\n else:\r\n if s[i-1] in \"oe\":\r\n c = min(1,c) if c != 2 else c\r\n elif s[i-1] in \"aiuy\":\r\n c = 1\r\n print(s[i-1]*c,end='')\r\n c = 1\r\n", "n = int(input())\r\ns = input()\r\na = [[s[0]]]\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n a[-1].append(s[i])\r\n else:\r\n a.append([s[i]])\r\nfor elem in a:\r\n if elem[0] in 'aeiouy':\r\n if len(elem) == 2 and elem[0] in 'eo':\r\n print(elem[0] * 2, end='')\r\n else:\r\n print(elem[0], end='')\r\n else:\r\n for i in elem:\r\n print(i, end='')", "#!/usr/bin/env python3\n\nimport sys\n\nN = int(sys.stdin.readline().strip())\nS = sys.stdin.readline().strip() + '?'\n\nlast = ''\ncnt = 0\n\nfor ch in S:\n if ch != last:\n if cnt != 0:\n if last in 'aiuy': cnt = 1\n if last in 'eo' and cnt > 2: cnt = 1\n print(last * cnt, end='')\n last = ch\n cnt = 0\n\n cnt += 1\n\nprint()\n", "import re\r\ninput()\r\nprint(re.sub(r\"a+|i+|u+|y+|eee+|ooo+\", lambda m: m.group()[0], input()))\r\n\r\n", "\n# coding: utf-8\n\n# In[21]:\n\nodd = input()\ns = input()\n\nres = \"\"\nvows = \"aeiouy\"\ne = \"eo\"\n\na = []\npr = '@'\nfor ch in s:\n if pr == ch:\n a[-1] += ch\n else:\n a.append(str(ch))\n pr = ch\nfor g in a:\n if len(g) == 1 or len(g) == 2 and g[0] in e or g[0] not in vows:\n res += g\n else:\n res += g[0]\nprint(res)\n\n\n# In[ ]:\n\n\n\n", "a = input()\r\ninp = input()\r\na = []\r\nans = \"\"\r\nfor i in range(len(inp)):\r\n if (i < len(a)):\r\n continue\r\n if (inp[i] != 'a' and inp[i] != 'e' and inp[i] != 'i' and inp[i] != 'o' and inp[i] != 'u' and inp[i] != 'y'):\r\n a.append(1)\r\n continue\r\n if (i <= len(inp) - 3 and inp[i] == inp[i + 1] and inp[i] == inp[i + 2]):\r\n a.append(1)\r\n for k in range(i + 1, len(inp)):\r\n if (inp[k] == inp[k - 1]):\r\n a.append(0)\r\n else:\r\n break\r\n continue\r\n if (i <= len(inp) - 3 and inp[i] == inp[i + 1] and inp[i] != inp[i + 2]):\r\n if (inp[i] == 'o' or inp[i] == 'e'):\r\n a.append(1)\r\n a.append(1)\r\n continue\r\n else:\r\n a.append(1)\r\n a.append(0)\r\n continue\r\n elif (i == len(inp) - 2):\r\n if (inp[i] == inp[i + 1] and inp[i] != 'o' and inp[i] != 'e'):\r\n a.append(1)\r\n a.append(0)\r\n else:\r\n a.append(1)\r\n a.append(1)\r\n break\r\n a.append(1)\r\n\r\nans = \"\"\r\nfor i in range(len(a)):\r\n if (a[i] == 1):\r\n ans += inp[i]\r\nprint(ans)\r\n", "\"\"\" Created by Shahen Kosyan on 4/5/17 \"\"\"\n\nif __name__ == \"__main__\":\n vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\n n = int(input())\n word = input()\n\n answer = \"\"\n i = 0\n s_count = 1\n while i < n:\n symbol = word[i]\n if i == n - 1:\n if s_count == 2 and (symbol == \"e\" or symbol == \"o\"):\n answer += symbol + symbol\n s_count = 1\n else:\n answer += symbol\n else:\n if symbol == word[i + 1] and symbol in vowels:\n s_count += 1\n elif s_count == 2 and (symbol == \"e\" or symbol == \"o\"):\n answer += symbol + symbol\n s_count = 1\n elif s_count > 1 and symbol in vowels:\n s_count = 1\n answer += symbol\n else:\n s_count = 1\n answer += symbol\n\n i += 1\n\n print(answer)\n", "gl = ('a', 'e', 'i', 'o', 'u', 'y')\n\ninput()\ns = input()\n\nans = []\n\ni = 0\nwhile i < len(s):\n if s[i] in gl:\n # print([j for j in s[i:] if j == s[i]])\n now = []\n for j in s[i:]:\n if j != s[i]:\n break\n now.append(j)\n\n i += len(now) - 1\n # print(now)\n ans.append(s[i])\n if len(now) == 2 and s[i] in ('o', 'e'):\n ans.append(s[i])\n\n else:\n ans += [s[i]]\n i += 1\n\n\nprint(*ans, sep='')\n", "n = int(input())\r\ns = [i for i in input()]\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nns = []\r\n\r\ni = 0\r\nwhile i < n:\r\n if s[i] in vowels:\r\n j = i+1\r\n while j < n and s[j] == s[i]:\r\n j += 1\r\n \r\n if (s[i] == \"e\" or s[i] == \"o\") and j-i == 2:\r\n ns.append(s[i])\r\n \r\n ns.append(s[i])\r\n \r\n i = j\r\n\r\n else:\r\n ns.append(s[i])\r\n i += 1\r\n \r\nprint(\"\".join(ns))", "# https://codeforces.com/contest/774/problem/K\r\n\r\nimport sys\r\nimport math\r\n\r\nvowel = 'aeiouy'\r\noe = 'oe'\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n s = sys.stdin.readline().strip()\r\n # a, b = map(int, sys.stdin.readline().strip().split()[:2])\r\n\r\n s += '#'\r\n res = []\r\n i = 0\r\n\r\n while True:\r\n if i >= n:\r\n break\r\n \r\n res.append(s[i])\r\n if s[i] in vowel:\r\n if s[i] in oe and s[i+1] == s[i] and s[i+2] != s[i]:\r\n res.append(s[i])\r\n i += 2\r\n else:\r\n j = i\r\n while s[i] == s[j]:\r\n i += 1\r\n else:\r\n i += 1\r\n\r\n print(''.join(res))\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", "vowel = {'a', 'e', 'i', 'o', 'u', 'y'}\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nl = len(s)\r\n\r\nans, last_c, i = \"\", ' ', 0\r\nfor c in s:\r\n if not c in vowel:\r\n ans += c\r\n else:\r\n if c != last_c:\r\n ans += c\r\n else:\r\n if c == 'e' or c == 'o':\r\n if (i + 1 >= l or s[i + 1] != c) and (i < 2 or s[i - 2] != c):\r\n ans += c\r\n \r\n last_c = c\r\n \r\n i += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\ns = '#' + s + '#'\r\n\r\nvowels = \"aeiouy\"\r\nspecial_vowels = \"eo\"\r\n\r\nfor i in range(1, n + 1):\r\n if (s[i] not in vowels or s[i] != s[i - 1]):\r\n print(s[i], end = '')\r\n continue\r\n\r\n if (s[i] in special_vowels and s[i + 1] != s[i] and s[i - 2] != s[i]):\r\n print(s[i], end = '')", "n = int(input())\r\ns = input()\r\nd ={}\r\nc = s[0]\r\nct =1\r\np = 0\r\ni = 1\r\nwhile (i<n):\r\n if (s[i] == c):\r\n ct=ct+1\r\n else:\r\n d[p]=[c,ct]\r\n ct=1\r\n c=s[i]\r\n p=p+1\r\n i=i+1\r\n\r\nans=\"\"\r\nd[p]=[c,ct]\r\np=p+1\r\njp=0\r\nwhile(jp<p):\r\n if(d[jp][0] not in \"aeiouy\"):\r\n ans = ans + d[jp][1]*d[jp][0]\r\n elif(d[jp][0] not in \"eo\"):\r\n ans = ans + d[jp][0]\r\n elif(d[jp][0] =='e'):\r\n if(d[jp][1]==2):\r\n ans=ans+\"ee\"\r\n else:\r\n ans=ans+\"e\"\r\n elif(d[jp][0] =='o'):\r\n if(d[jp][1]==2):\r\n ans=ans+\"oo\"\r\n else:\r\n ans=ans+\"o\"\r\n jp=jp+1\r\n\r\nprint(ans)\r\n\r\n\r\n \r\n \r\n", "n=int(input())\r\ns=input()+'0'\r\ni=0\r\na='aeiouy'\r\nb='oe'\r\nans=[]\r\nwhile i<n:\r\n ans.append(s[i])\r\n if s[i] in a:\r\n if s[i] in b and s[i+1]==s[i] and s[i+2]!=s[i]:\r\n ans.append(s[i])\r\n i+=2\r\n else:\r\n x=i\r\n while s[i]==s[x]:\r\n i+=1\r\n else:\r\n i+=1\r\nprint(''.join(ans))", "n = int(input())\r\ns = input()\r\nar = []\r\ngl= [ 'a', 'e', 'i','o', 'u', 'y' ]\r\ni = 0\r\nwhile i < len(s):\r\n it = False\r\n if (s[i] in gl):\r\n it = True\r\n if (it):\r\n cnt = 0;\r\n c = s[i];\r\n j = i;\r\n while (j < len(s) and s[j] == s[i]):\r\n cnt += 1;\r\n j += 1;\r\n\r\n if ((s[i] == 'e' or s[i] == 'o') and j - i == 2):\r\n ar.append(s[i]);\r\n ar.append(s[i]);\r\n\r\n else:\r\n ar.append(s[i]);\r\n i = j;\r\n else:\r\n ar.append(s[i]);\r\n i += 1;\r\nprint(''.join(ar))\r\n", "import re\r\nn = input()\r\nline = input()\r\nline = re.sub(\"eee+\",'e',line)\r\nline = re.sub(\"ooo+\",'o',line)\r\nline = re.sub(\"aa+\",'a',line)\r\nline = re.sub(\"ii+\",'i',line)\r\nline = re.sub(\"uu+\",'u',line)\r\nline = re.sub(\"yy+\",'y',line)\r\nprint(line)", "n = int(input())\r\ns = input().strip()\r\nans = []\r\ni = 0\r\nwhile i<n:\r\n if s[i]=='e' or s[i] == 'o' :\r\n j = i+1\r\n count = 0\r\n while j<n and s[j] == s[i] :\r\n j+=1\r\n count+=1\r\n ans.append(s[i])\r\n \r\n if count==1:\r\n ans.append(s[i])\r\n \r\n i=j \r\n \r\n continue\r\n \r\n if s[i] == 'a' or s[i] == 'i' or s[i] == 'u' or s[i] == 'y':\r\n j = i+1\r\n \r\n while j<n and s[j] == s[i]:\r\n j+=1\r\n \r\n ans.append(s[i])\r\n i=j \r\n \r\n continue\r\n ans.append(s[i])\r\n i+=1\r\nstr1 = ''.join(str(e) for e in ans)\r\nprint (str1)\r\n\r\n", "n = int(input())\r\ns = input()\r\na = ''\r\nt = \"aeiouy\"\r\nfor i in range(n):\r\n\tif t.find(s[i]) < 0:\r\n\t\ta = a + s[i]\r\n\telif i > 0 and s[i] != s[i-1] or i == 0:\r\n\t\ta = a + s[i]\r\n\telif i > 0 and s[i] == 'e' and (i < n - 1 and s[i + 1] != s[i] or i == n - 1) and (i > 1 and s[i - 2] != s[i] or i <= 1):\r\n\t\ta = a + s[i]\r\n\telif i > 0 and s[i] == 'o' and (i < n - 1 and s[i + 1] != s[i] or i == n - 1) and (i > 1 and s[i - 2] != s[i] or i <= 1):\r\n\t\ta = a + s[i]\r\n\t\t\r\nprint(a)\r\n \r\n \r\n\"\"\"\r\n13\r\npobeeeedaaaaa\r\npobeda\r\n22\r\niiiimpleeemeentatiioon\r\nimplemeentatioon\r\n18\r\naeiouyaaeeiioouuyy\r\naeiouyaeeioouy\r\n24\r\naaaoooiiiuuuyyyeeeggghhh\r\naoiuyeggghhh\r\n\"\"\"", "import re\r\nn = input()\r\ns = input()\r\ns = re.sub(r\"[a]+\", \"a\", s)\r\ns = re.sub(r\"[o]{3,}\", \"o\", s)\r\ns = re.sub(r\"[e]{3,}\", \"e\", s)\r\ns = re.sub(r\"[u]+\", \"u\", s)\r\ns = re.sub(r\"[y]+\", \"y\", s)\r\ns = re.sub(r\"[i]+\", \"i\", s)\r\nprint(s);\r\n ", "\r\nn = int(input())\r\ns = input()\r\nm={}\r\nm['a']=1\r\nm['e']=2\r\nm['i']=1\r\nm['o']=2\r\nm['u']=1\r\nm['y']=1\r\ni,ans=0,\"\"\r\n\r\nwhile (i<n):\r\n#\tprint(i)\r\n\tc = s[i]\r\n\ti+=1\r\n\tflag,cou=0,1\r\n\tif m.get(c,0)==2:\r\n\t\tflag=1\r\n\twhile i<n and s[i]==c and (m.get(c,0)==1 or m.get(c,0)==2):\r\n\t\tcou+=1\r\n\t\ti+=1\r\n\tif flag==0 or cou!=2:\r\n\t\tans+=c\r\n\telse:\r\n\t\tans+=(c*2)\r\n\t\t\r\nprint(ans)\r\n\t\t", "a = input()\r\ns = input()\r\nt=\"A\"\r\ntmp=\"x\"\r\nmnt=0\r\ncnt=0\r\nfor w in s:\r\n if(w==\"e\"):\r\n cnt=cnt+1\r\n if(w==\"o\"):\r\n mnt=mnt+1\r\n if(w!=t):\r\n if(cnt==2):\r\n print(\"e\",end='')\r\n cnt=0\r\n if(mnt==2):\r\n print(\"o\",end='')\r\n mnt=0\r\n if (w==\"e\"):\r\n cnt=1\r\n t=\"e\"\r\n elif(w==\"a\"):\r\n t=\"a\"\r\n elif(w==\"i\"):\r\n t=\"i\"\r\n elif(w==\"o\"):\r\n t=\"o\"\r\n mnt=1\r\n elif(w==\"u\"):\r\n t=\"u\"\r\n elif(w==\"y\"):\r\n t=\"y\"\r\n else:\r\n t=\"A\"\r\n print(w,end='')\r\n if(w!=\"o\"):\r\n mnt=0\r\n if(w!=\"e\"):\r\n cnt=0\r\nif(cnt==2):\r\n print(\"e\",end='')\r\nif(mnt==2):\r\n print(\"o\",end='')\r\nt=\"A\"\r\n", "def solve():\r\n n = int(input())\r\n arr = list(input())\r\n\r\n index = 0\r\n\r\n while index < n:\r\n letter = arr[index]\r\n\r\n if letter in ['a', 'e', 'i', 'o', 'u', 'y']:\r\n current = index + 1\r\n\r\n while current < n and arr[current] == letter:\r\n current += 1\r\n\r\n if current - index == 2 and (letter == 'e' or letter == 'o'):\r\n print(\"{}{}\".format(letter, letter), end=\"\")\r\n\r\n else:\r\n print(letter, end=\"\")\r\n index = current\r\n\r\n else:\r\n print(letter, end=\"\")\r\n index += 1\r\n print()\r\n\r\nsolve()\r\n" ]

[ "import sys\r\nfrom heapq import heappop, heappush\r\n\r\nclass Edge:\r\n def __init__(self, u, v, cap, cost, rev):\r\n self.u = u\r\n self.v = v\r\n self.cap = cap\r\n self.flow = 0\r\n self.cost = cost\r\n self.rev = rev\r\n\r\ndef add_edge(adj, u, v, capv, costv):\r\n adj[u].append(Edge(u, v, capv, costv, len(adj[v])))\r\n adj[v].append(Edge(v, u, 0, -costv, len(adj[u])-1))\r\n\r\ndef bellman_ford(adj):\r\n potential = [0] * len(adj)\r\n\r\n for _ in range(len(adj)):\r\n for u in range(len(adj)):\r\n for e in adj[u]:\r\n reduced_cost = potential[e.u] + e.cost - potential[e.v]\r\n if e.cap > 0 and reduced_cost < 0:\r\n potential[e.v] += reduced_cost\r\n \r\n return potential\r\n\r\ndef dijkstra(adj, potential, s, t):\r\n oo = float('inf')\r\n dist, pi = [+oo] * len(adj), [None] * len(adj)\r\n\r\n dist[s] = 0\r\n heap = [(0, s)]\r\n\r\n while heap:\r\n du, u = heappop(heap)\r\n\r\n if dist[u] < du: continue\r\n if u == t: break\r\n\r\n for e in adj[u]:\r\n reduced_cost = potential[e.u] + e.cost - potential[e.v]\r\n if e.cap - e.flow > 0 and dist[e.v] > dist[e.u] + reduced_cost:\r\n dist[e.v] = dist[e.u] + reduced_cost\r\n heappush(heap, (dist[e.v], e.v))\r\n pi[e.v] = e\r\n \r\n return dist, pi\r\n\r\ndef min_cost_max_flow(adj, s, t, flow_limit = float('inf')):\r\n min_cost, max_flow = 0, 0\r\n oo = float('inf')\r\n\r\n potential = bellman_ford(adj)\r\n\r\n while True:\r\n dist, pi = dijkstra(adj, potential, s, t)\r\n \r\n if dist[t] == +oo:\r\n break\r\n \r\n for u in range(len(adj)):\r\n if dist[u] < dist[t]:\r\n potential[u] += dist[u] - dist[t]\r\n \r\n limit, v = +oo, t\r\n while v:\r\n e = pi[v]\r\n limit = min(limit, e.cap - e.flow)\r\n v = e.u\r\n \r\n max_limit_reached = max_flow + limit >= flow_limit\r\n limit = max_limit_reached and flow_limit - max_flow or limit\r\n\r\n if max_limit_reached:\r\n min_cost += limit * (potential[t] - potential[s])\r\n max_flow += limit\r\n\r\n return min_cost, max_flow\r\n \r\n v = t\r\n while v:\r\n e = pi[v]\r\n e.flow += limit\r\n adj[v][e.rev].flow -= limit\r\n v = e.u\r\n \r\n min_cost += limit * (potential[t] - potential[s])\r\n max_flow += limit\r\n \r\n return min_cost, max_flow\r\n\r\nn = int(sys.stdin.readline())\r\na = sys.stdin.readline().rstrip()\r\nb = list(map(int, sys.stdin.readline().split()))\r\nlatin_alp = [chr(i) for i in range(97, 97 + 26)]\r\ns, t = 0, n // 2 + 27\r\nadj = [[] for _ in range(t + 1)]\r\nmax_beauty = sum(b) * 2\r\nfor i in range(26):\r\n add_edge(adj, s, i + 1, a.count(latin_alp[i]), 0)\r\nfor j in range(n // 2):\r\n add_edge(adj, j + 27, t, 2, 0)\r\n\r\nfor j in range(n // 2):\r\n for i in range(26):\r\n if a[j] == a[-(j+1)] == latin_alp[i]:\r\n add_edge(adj, i + 1, j + 27, 1, min(b[j], b[-(j + 1)]))\r\n elif a[j] == latin_alp[i]:\r\n add_edge(adj, i + 1, j + 27, 1, b[-(j + 1)])\r\n elif a[-(j + 1)] == latin_alp[i]:\r\n add_edge(adj, i + 1, j + 27, 1, b[j])\r\n else:\r\n add_edge(adj, i + 1, j + 27, 1, b[j] + b[-(j + 1)])\r\n\r\ncost, _ = min_cost_max_flow(adj, s, t)\r\nprint(max_beauty - cost)", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef add_edge(u, v, cost, f):\r\n G[u].append([v, cost, f, len(R[v])])\r\n R[v].append([u, -cost, 0, len(G[u]) - 1])\r\n\r\ndef dijkstra(s):\r\n inf = pow(10, 15) + 1\r\n dist = [inf] * l\r\n dist[s] = 0\r\n parent = [-1] * l\r\n p = []\r\n heapq.heappush(p, (0, s))\r\n while p:\r\n d, i = heapq.heappop(p)\r\n if dist[i] < d:\r\n continue\r\n di = dist[i] + h[i]\r\n for j, c, f, _ in G[i]:\r\n if not f:\r\n continue\r\n nd = di + c - h[j]\r\n if dist[j] > nd:\r\n parent[j] = i\r\n dist[j] = nd\r\n heapq.heappush(p, (nd, j))\r\n for j, c, f, _ in R[i]:\r\n if not f:\r\n continue\r\n nd = di + c - h[j]\r\n if dist[j] > nd:\r\n parent[j] = i\r\n dist[j] = nd\r\n heapq.heappush(p, (nd, j))\r\n return dist, parent\r\n\r\ndef min_cost_flow(s, t, f):\r\n ans = 0\r\n while f:\r\n dist, parent = dijkstra(s)\r\n for i in range(l):\r\n h[i] += dist[i]\r\n if not parent[t] ^ -1:\r\n return -1\r\n ma = f\r\n u = t\r\n x, y = [], []\r\n while u ^ s:\r\n v = parent[u]\r\n ok = 0\r\n Gv = G[v]\r\n for i in range(len(Gv)):\r\n if not Gv[i][0] ^ u:\r\n ma = min(ma, Gv[i][2])\r\n ok = 1\r\n x.append((v, i))\r\n break\r\n if not ok:\r\n Rv = R[v]\r\n for i in range(len(Rv)):\r\n if not Rv[i][0] ^ u:\r\n ma = min(ma, Rv[i][2])\r\n ok = 1\r\n y.append((v, i))\r\n break\r\n u = v\r\n f -= ma\r\n for i, j in x:\r\n Gi = G[i]\r\n Gi[j][2] -= ma\r\n R[Gi[j][0]][Gi[j][3]][2] += ma\r\n for i, j in y:\r\n Ri = R[i]\r\n Ri[j][2] -= ma\r\n G[Ri[j][0]][Ri[j][3]][2] += ma\r\n ans += h[t] * ma\r\n return ans\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nb = list(map(int, input().split()))\r\ncnt = [0] * 26\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nl = 26 * (n + 1) + n + 2\r\ns0, t0 = l - 2, l - 1\r\nG = [[] for _ in range(l)]\r\nR = [[] for _ in range(l)]\r\nh = [0] * l\r\nfor i in range(n):\r\n add_edge(s0, i, 0, 1)\r\nfor i in range(n):\r\n u = n + i\r\n bi, si = b[i], s[i] - 97\r\n for j in range(26):\r\n add_edge(i, u, bi * min(1, si ^ j), 1)\r\n u += n\r\nu = n\r\nfor i in range(26):\r\n v = u + n - 1\r\n for _ in range(n // 2):\r\n add_edge(u, v, 0, 1)\r\n u += 1\r\n v -= 1\r\n v = 27 * n + i\r\n for _ in range(n // 2):\r\n add_edge(u, v, 0, 1)\r\n u += 1\r\nu = 27 * n\r\nfor i in range(26):\r\n add_edge(u, t0, 0, cnt[i])\r\n u += 1\r\nans = sum(b) - min_cost_flow(s0, t0, n)\r\nprint(ans)" ]

[ "N = int(input())\ncon = [0]\nvert = [i for i in range(1,N+1)]\na = input().split(\" \")\nfor i in range(N-1):\n con.append(int(a[i])-1)\ncolor=[]\na = input().split(\" \")\nfor i in range(N):\n color.append(int(a[i]))\ncur = [color[0] for i in range(N)]\nsteps=1\nfor i in range(1,N):\n if cur[con[i]]==color[i]:\n cur[i] = color[i]\n else:\n steps+=1\n cur[i] = color[i]\nprint(steps)\n#print(con)\n#print(color)\n#print(vert)\n", "ii=lambda:int(input())\r\nkk=lambda:map(int,input().split())\r\nll=lambda:list(kk())\r\nn=ii()\r\nparents = [-1]*n\r\nedges = {i:[] for i in range(n)}\r\nls = kk()\r\nfor i in range(1, n):\r\n\to = ls.__next__()-1\r\n\tedges[i].append(o)\r\n\tedges[o].append(i)\r\nparents[0]=0\r\nrcol = ll()\r\nlowest = [0]\r\ncnt=1\r\nwhile lowest:\r\n\tl2 = []\r\n\tfor l in lowest:\r\n\t\tif rcol[parents[l]]!=rcol[l]: cnt+=1\r\n\t\tfor child in edges[l]:\r\n\t\t\tif child == parents[l]: continue\r\n\t\t\tparents[child] = l\r\n\t\t\tl2.append(child)\r\n\tlowest=l2\r\n\r\nprint(cnt)", "\"\"\"\nNTC here\n\"\"\"\nimport sys\ninp= sys.stdin.readline\ninput = lambda : inp().strip()\nflush= sys.stdout.flush\n# import threading\n# sys.setrecursionlimit(10**6)\n# threading.stack_size(2**25)\n\ndef iin(): return int(input())\ndef lin(): return list(map(int, input().split()))\n\n# range = xrange\n# input = raw_input\ndef BFS(s, adj, color):\n ans = 1#always for first position\n parent = {s: None}\n cl = {s: color[0]}\n u = [s]\n while u: # runs till u is []\n nextu = []\n for i in u:\n for v in adj[i]:\n if v not in parent:\n if color[v]!=cl[i]:\n cl[v] = color[v]\n ans+=1\n #print(v, 'added')\n else:\n cl[v]=cl[i]\n parent[v] = i\n nextu.append(v)\n u = nextu.copy()\n \n return ans\n\ndef main():\n \n n = iin()\n adj = [[] for i in range(n)]\n a = lin()\n for i in range(1, n):\n adj[i].append(a[i-1]-1)\n adj[a[i-1]-1].append(i)\n color = lin()\n print(BFS(0, adj, color))\n \n \n\n\n\n\n\n\n \n \n\n \nmain()\n# threading.Thread(target=main).start()\n", "n = int(int(input()))\r\nparent = [0,0] + list(map(int, input().split()))\r\ncolor = [0] + list(map(int, input().split()))\r\ncnt = 1\r\nfor i in range(2,n+1,1):\r\n if color[i] != color[parent[i]]:\r\n cnt += 1\r\nprint(cnt)", "\r\ndef main():\r\n\tn = int(input())\r\n\tparents = [int(x)-1 for x in input().strip().split()]\r\n\tcolors = [int(x) for x in input().strip().split()]\r\n\t\r\n\tans = 1\r\n\r\n\tfor i in range(n-1):\r\n\t\tc = i+1\r\n\t\tp = parents[i]\r\n\t\tif (colors[c] != colors[p]):\r\n\t\t\tans += 1\r\n\r\n\tprint(ans)\r\n\t\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\np = input().split(\" \")\nc = input().split(\" \")\n\np = map(int, p)\np = list(p)\nc = map(int, c)\nc = list(c)\n\nc = [0] + c #ajuste de índices\np = [0,0] + p #ajuste de índices\n\ncount = 0\n\nfor i in range(1, n+1):\n if c[i] != c[p[i]]:\n count += 1\nprint(count)\n", "a = [int(i) for i in range(1,int(input())+1)]\r\nedges = [int(i) for i in input().split()]\r\ncolor = [int(i) for i in input().split()]\r\nanswer = 1\r\nfor i,j in zip(color[1:],edges) :\r\n if color[j-1] != i:\r\n answer += 1 \r\nprint(answer)", "\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n p = [int(i) for i in input().split(\" \")]\r\n c = [0] + [int(i) for i in input().split(\" \")]\r\n colunter = 1\r\n tree = [[] for i in range(n + 1)]\r\n for i in range(len(p)):\r\n parent = p[i]\r\n vertice = i + 2\r\n tree[parent].append(vertice)\r\n for i in range(len(tree)):\r\n for j in tree[i]:\r\n if c[i] != c[j]:\r\n colunter += 1\r\n print(colunter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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 queue\n\nn = int(input().strip())\n\ng = [[] for _ in range(n)]\n\np = list(map(int, input().strip().split(' ')))\n\nfor _ in range(len(p)):\n fa = p[_] - 1\n g[fa].append(_ + 1)\n g[_ + 1].append(fa)\n\nc = list(map(int, input().strip().split(' ')))\n\nbfs = queue.Queue()\n\nbfs.put((-1, 0, -1))\n\nans = 0\n\nwhile not bfs.empty():\n cur = bfs.get()\n col = cur[2]\n if col != c[cur[1]]:\n ans += 1\n col = c[cur[1]]\n\n for rt in g[cur[1]]:\n if rt == cur[0]:\n continue\n bfs.put((cur[1], rt, col))\n\nprint(ans)\n", "n, p, c = int(input()), list(map(int, input().split())), list(map(int, input().split()))\r\nprint(1 + sum(c[i + 1] != c[pi - 1] for i, pi in enumerate(p)))", "# número de passos necessários para pintar os nós da árvore do jeito pedido\n# quando pinta a raiz, todos os filhos são pintados também\n\nn = int(input())\npai = input().split()\npai = [None] + [int(x)-1 for x in pai]\ncorFinal = input().split() \n\ncorAtual = []\nfor cor in corFinal:\n corAtual.append(0)\n\ncorAtual[0] = corFinal[0]\npintei = 1\n\ni = 1\nwhile corAtual != corFinal:\n if corAtual[pai[i]] != corFinal[i]:\n pintei += 1\n corAtual[i] = corFinal[i]\n i += 1\n\nprint(pintei) ", "# https://codeforces.com/contest/902\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input())\np = [-1] + list(map(lambda x: int(x) - 1, input().split()))\nc = list(map(int, input().split()))\n\nans = 1\nfor i in range(1, n):\n if c[i] != c[p[i]]:\n ans += 1\nprint(ans)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nstep = 1\r\nfor i in range(1, n):\r\n if c[i] != c[p[i - 1] - 1]:\r\n step += 1\r\nprint(step)", "n = int(input())\r\np = [0] + [int(i) for i in input().split()]\r\nc = [0] + [int(i) for i in input().split()]\r\n\r\nresult = 1\r\nfor i in range(1, n):\r\n v1 = i + 1\r\n v2 = p[i]\r\n if c[v1] != c[v2]:\r\n result += 1\r\nprint(result)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\np = list(mints())\r\nc = list(mints())\r\nr = 0\r\nfor i in range(len(p)):\r\n\tif c[i+1] != c[p[i]-1]:\r\n\t\tr += 1\r\nprint(r+1)", "n=int(input())\r\nl=[0]\r\ns=0\r\nl.extend([int(i)-1 for i in input().split()])\r\nm=[int(i) for i in input().split()]\r\ncv=[0]*n\r\nif m[0]!=0:\r\n cv[0]=m[0]\r\n s+=1\r\nfor i in range(n):\r\n if m[i]!=cv[l[i]]:\r\n cv[i]=m[i]\r\n s+=1\r\n else:\r\n cv[i]=cv[l[i]] \r\nprint(s)", "N = int(input())\r\npeaks = list(map(int, input().split()))\r\ntarget = list(map(int, input().split()))\r\ni = 1\r\nfor p, c in zip(peaks, target[1:]):\r\n if c != target[p-1]:\r\n i += 1\r\nprint(i)", "n = int(input())\r\ngraph = [[] for i in range(n)]\r\nl = list(map(int, input().split(\" \")))\r\nfor i in range(n-1):\r\n graph[i+1] += [l[i]-1]\r\n graph[l[i]-1] += [i+1]\r\ncc = list(map(int, input().split(\" \")))\r\n# for i in range(n):\r\n# print (graph[i])\r\nll = range(n)\r\ncolors = [0 for i in range(n)]\r\ncounter = 0\r\nvisited = [False for i in range(n)]\r\nans = 0\r\ncounter = 0\r\nq = [i]\r\nvisited[i] = True\r\nwhile(len(q) != 0):\r\n u = q[0]\r\n # print (\"u: \", u)\r\n q.pop(0)\r\n for j in graph[u]:\r\n # print (j)\r\n if (visited[j]):\r\n continue\r\n if(cc[j] != cc[u]):\r\n counter+=1\r\n visited[j] = True\r\n q += [j]\r\nprint (counter+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ngraph=[[] for _ in range(n+1)]\r\nfor i in range(2,n+1):\r\n u,v=i,a[i-2]\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n## BFS\r\nqueue=[1]\r\nvisited=[False]*(1+n)\r\nvisited[1]=True\r\nans=1\r\nwhile queue:\r\n s=queue.pop()\r\n for child in graph[s]:\r\n if not visited[child]:\r\n if b[child-1] != b[s - 1]: ans += 1\r\n visited[child]=True\r\n queue.append(child)\r\nprint(ans)", "n = int(input())\r\npohon = [0,0] + list(map(int, input().split())) \r\nwarna = [0] + list(map(int, input().split()))\r\nstep = 1\r\nfor node in range(2, n+1, 1):\r\n if warna[node] != warna[pohon[node]]:\r\n step += 1\r\nprint(step)\r\n", "n = int(input())\narestas = list(map(int, input().split()))\ncores = list(map(int, input().split()))\narestas.insert(0,0)\narestas.insert(0,0)\ncores.insert(0,0)\n\n# print(arestas)\n# print(cores)\n\ncount = 1\nfor i in range(2, n+1):\n\tif cores[i] != cores[arestas[i]]:\n\t\tcount+=1\n\nprint(count)", "import sys\r\nsys.setrecursionlimit(10 ** 6)\r\nN = int(input())\r\nG = [[] for i in range(N)]\r\np = list(map(int, input().split()))\r\nC = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(1, N):\r\n G[p[i - 1] - 1].append(i)\r\n\r\n\r\ndef dfs(u, par, c):\r\n global num\r\n if C[u] != c:\r\n num += 1\r\n\r\n for w in G[u]:\r\n if w == par:\r\n continue\r\n dfs(w, u, C[u])\r\n\r\n\r\ndfs(0, -1, -1)\r\nprint(num)\r\n", "I = lambda :list(map(int,input().split()))\r\nn = int(input())\r\np = I()\r\ncolor = I()\r\nprint(1 + sum(color[i]!=color[x-1] for i, x in enumerate(p,1)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans = 1\r\nfor i in range(n - 1):\r\n if b[i+1] != b[a[i]-1]:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nparent = [0,0] + list(map(int, input().split())) \r\ncolor = [0] + list(map(int, input().split()))\r\ncnt = 1\r\nfor node in range(2, n+1, 1):\r\n if color[node] != color[parent[node]]:\r\n cnt += 1\r\nprint(cnt)", "import sys\r\nI = lambda : map(int,sys.stdin.readline().split())\r\nn = int(input())\r\npar = [0 for i in range (n+1)]\r\ncol = [0 for i in range (n+1)]\r\nli = list(I())\r\nl1 = list(I())\r\nans=1\r\nfor i in range (2,n+1) :\r\n par[i] = li[i-2]\r\nfor i in range (1,n+1) :\r\n col[i] = l1[i-1]\r\nans=1\r\nfor i in range(2,n+1) :\r\n if col[i]!=col[par[i]] :\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nc,p = [0]*(n+1),[0]*(n + 1)\r\np[2:n+1] = list(map(int, input().split()))\r\nc[1:n+1] = list(map(int, input().split()))\r\nret = 1\r\nfor i in range(2, n + 1):\r\n if (c[p[i]] != c[i]):\r\n ret += 1;\r\nprint(ret)", "# def find(a):\r\n# if parent[a]<0:\r\n# return a\r\n# else:\r\n# x=find(parent[a])\r\n# parent[a]=x\r\n# return x\r\n \r\n# def union(u,v):\r\n# parent[min(u,v)]+=parent[max(u,v)]\r\n# parent[max(v,u)]=min(u,v)\r\n\r\nn=int(input())\r\n# parent = [-1]*(n+1)\r\np=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n-1):\r\n if c[i+1]==c[p[i]-1]:\r\n continue\r\n else:\r\n count+=1\r\nprint(count+1)\r\n# s=set()\r\n# for i in range(n):\r\n# if c[i]-1 in s or find(c[i]-1) in s:\r\n# continue\r\n# else:\r\n# s.add(c[i]-1)\r\n# count+=1\r\n# print(s)\r\n# print(count)\r\n\r\n", "n = int(input())\r\n\r\nchildren = [[] for _ in range(n)]\r\nps = [int(v) for v in input().split()]\r\n\r\nfor i, p in enumerate(ps, 1):\r\n children[p - 1].append(i)\r\n\r\ncs = [int(v) for v in input().split()]\r\n\r\nans = 0\r\n\r\n# vertex, color\r\nstack = [(0, 0)]\r\nwhile stack:\r\n v, c = stack.pop()\r\n if c != cs[v]:\r\n ans += 1\r\n c = cs[v]\r\n for child in children[v]:\r\n stack.append((child, c))\r\n\r\nprint(ans)\r\n", "n = int(input())\r\np = list(map(int,input().split()))\r\ncolor = list(map(int,input().split()))\r\na = [i for i in range(1,n+1)]\r\nadj = [[] for i in range(n+1)]\r\nfor i in range(len(p)):\r\n adj[i+2].append(p[i])\r\n adj[p[i]].append(i+2)\r\nvis = [0 for i in range(n+1)]\r\nclr = [0 for i in range(1,n+1)]\r\n\r\ndef dfs(r):\r\n cnt = 0\r\n stk = []\r\n stk.append(r)\r\n vis[r] = 1\r\n clr[1] = color[0]\r\n cnt += 1\r\n \r\n while len(stk) > 0:\r\n u = stk[-1]\r\n stk.pop()\r\n for i in adj[u]:\r\n if vis[i] == 0:\r\n vis[i] = 1\r\n if color[i-1] != color[u-1]:\r\n cnt += 1\r\n stk.append(i)\r\n \r\n return cnt\r\nprint(dfs(1))\r\n", "\r\nfrom collections import defaultdict\r\n#start the code from here\r\n# no of egdes..\r\nt=int(input())\r\n\r\ng=defaultdict(list)\r\nl=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nfor i in range(t-1):\r\n\ta,b=i+2,l[i]\r\n\ta=a-1\r\n\tb=b-1\r\n\tg[b].append(a)\r\ncopyc=[0]*t\r\n# print(g)\r\nans=0\r\nvisited=[0]*t\r\nstack=[0]\r\n# simple DFS EDITED VERSION......\r\nwhile stack:\r\n\t# print(stack)\r\n\tp=stack.pop()\r\n\tif visited[p]==0:\r\n\t\tvisited[p]=1\r\n\t\tif copyc[p]!=c[p]:\r\n\t\t\tans+=1\r\n\t\t\t# print(\"yes\")\r\n\tfor i in range(len(g[p])):\r\n\t\tif visited[g[p][i]]==0:\r\n\t\t\tstack.append(g[p][i])\r\n\t\t\tcopyc[g[p][i]]=c[p]\r\n\t# print(stack)\r\nprint(ans)\r\n", "from collections import defaultdict\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nd=defaultdict(list)\r\nfor i in range(2,n+1):\r\n t=a[i-2]\r\n p=min(i,t)\r\n q=max(i,t)\r\n d[p].append(q)\r\n#print(d) \r\ncount=0\r\nfor i in d:\r\n p=c[i-1]\r\n for j in range(len(d[i])):\r\n q=d[i][j]\r\n if(c[q-1]!=p):\r\n count+=1\r\nprint(count+1) \r\n\r\n \r\n ", "def main():\n n = int(input())\n g = [[] for _ in range(n)]\n for u, v in enumerate(map(int, input().split()), 1):\n g[u].append(v - 1)\n g[v - 1].append(u)\n cc = list(map(int, input().split()))\n avail, st = [True] * n, [0]\n avail[0] = False\n while st:\n u = st.pop()\n c = cc[u]\n for v in g[u]:\n if avail[v]:\n avail[v] = False\n st.append(v)\n if cc[v] == c:\n n -= 1\n print(n)\n\n\nif __name__ == '__main__':\n main()\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\np = [0] * 2 + list(map(int, input().split()))\r\nc = [0] + list(map(int, input().split()))\r\nans = 1\r\nfor i in range(2, n + 1):\r\n ans += min(c[i] ^ c[p[i]], 1)\r\nprint(ans)", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\n\nn = f.readline()\nn = int(n)\n\nch = [[] for _ in range(n)]\np = f.readline().split()\nfor i, x in enumerate(p):\n ch[int(x)-1].append(i+1)\n\nc = f.readline().split()\nc = [int(x) for x in c]\n\ntt = [0 for _ in range(n+2)]\nq = [0]\nbot = 0\nwhile bot<len(q):\n i = q[bot]\n bot += 1\n for child in ch[i]:\n q.append(child)\n\nwhile len(q) > 0:\n i = q.pop(-1)\n cnt_sum = 0\n for child in ch[i]:\n cnt = tt[child]\n cnt_sum += cnt\n if c[child] == c[i]:\n cnt_sum -= 1\n\n tt[i] = cnt_sum+1\n\nprint(tt[0])\n", "n = int(input())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\narray = []\r\nfor x in input().split():\r\n array.append(int(x))\r\n\r\nmass = [array[0]] * n\r\n\r\nk = 1\r\nfor x in range(1, len(mass)):\r\n mass[x] = mass[lst[x - 1] - 1]\r\n \r\n if mass[x] != array[x]:\r\n mass[x] = array[x]\r\n k += 1\r\n #print(mass, k)\r\n\r\nprint(k)\r\n \r\n", "def solve(num,edge,color) :\r\n times = 1\r\n currentColor = [color[0]]*num\r\n index = 1\r\n \r\n while index < num :\r\n vertexAbove = edge[index-1]\r\n currentColor[index] = currentColor[vertexAbove-1]\r\n if currentColor[index] != color[index] :\r\n times += 1\r\n currentColor[index] = color[index]\r\n index += 1\r\n \r\n return times\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nn = int(input())\r\nedge = list(map(int,input().split()))\r\ncolor = list(map(int,input().split()))\r\n\r\nprint (solve(n,edge,color)) \r\n \r\n ", "n = int(input()) #1e4\r\npl = list(map(int,input().split()))\r\ncl = list(map(int,input().split()))\r\n\r\npl = [0] + [p-1 for p in pl]\r\nsl = [None]*n #None=unvisit, False=non-root, True=root\r\nfor i in range(n):\r\n if sl[i] is not None:\r\n continue\r\n j = i\r\n while pl[j]!=j and cl[pl[j]]==cl[j]:\r\n sl[j] = False\r\n j = pl[j]\r\n sl[j] = True\r\n\r\nprint(sum(sl))\r\n\r\n", "import sys\r\nsys.setrecursionlimit(10**9)\r\nfrom collections import defaultdict\r\n\r\n\r\n\r\n\r\ndef dfs(nd):\r\n vis[nd]=1\r\n for i in graph[nd]:\r\n if vis[i]==0:\r\n if col[i-1]==col[nd-1]:\r\n dfs(i)\r\n else:\r\n q.append(i)\r\n \r\n \r\n\r\n \r\n\r\nfor _ in range(1):\r\n n=int(input())\r\n graph=defaultdict(list)\r\n \r\n l=list(map(int,input().split()))\r\n col=list(map(int,input().split()))\r\n for i in range(2,n+1): \r\n graph[i].append(l[i-2])\r\n graph[l[i-2]].append(i)\r\n vis=[0]*(n+1)\r\n q=[1]\r\n tc=0\r\n while(q):\r\n tc+=1\r\n dfs(q.pop(0))\r\n \r\n print(tc)\r\n ", "input()\nlinks = [int(i) for i in input().split(\" \")]\ncolors = [int(i) for i in input().split(\" \")]\n\ni = 1\ncount = 1\nwhile i < len(links) + 1:\n if colors[links[i-1] - 1] != colors[i]:\n count += 1\n i += 1\n\n\nprint(count)\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ncnt=1\r\nfor i in range(1,n):\r\n if(c[i]!=c[p[i-1]-1]):\r\n cnt+=1\r\nprint(cnt)\r\n", "n=int(input())\r\nd={1:[]}\r\nc=1\r\nfor i in input().split():\r\n c+=1\r\n d[c]=[]\r\n d[int(i)]+=[c]\r\nz=list(map(int,input().split()))\r\nc=list(range(1,n+1))\r\npr=list(1 for i in range(n))\r\no=0\r\nwhile c:\r\n for j in d[c[0]]:\r\n if z[j-1]==z[c[0]-1]:\r\n pr[j-1]=0\r\n o+=pr[c[0]-1]\r\n c.pop(0)\r\nprint(o)\r\n", "import sys\nsys.setrecursionlimit(5000)\ndef DFS(pre,node):\n global count \n if visited.get(node,False):\n return \n if pre!=scheme[node-1]:\n count+=1\n \n visited[node]=True\n # if colored[node-1]!=color:\n colored[node-1]=scheme[node-1]\n # print(node)\n pre=colored[node-1]\n if graph.get(node,-1) != -1:\n for i in graph[node]:\n DFS(pre,i)\n \n \nn=int(input())\nl=list(map(int,input().split()))\nscheme=list(map(int,input().split()))\ngraph={}\nfor i in range(n-1):\n if graph.get(l[i],-1)==-1:\n graph[l[i]]=[i+2]\n else:\n graph[l[i]]+=[(i+2)]\n# print(graph)\ncolored=[0]*n\n \n \ncount=0\nvisited={}\npre=0\ncount+=1\nDFS(pre,1)\n# print(colored,scheme,color)\nprint(count-1)\n", "n=int(input())\na=[0,0]\nb=[0]\na.extend(map(int,input().split()))\nb.extend(map(int,input().split()))\nS=1\nfor i in range(2,n+1):\n if b[i]!=b[a[i]]:\n S+=1\nprint(S)\n \t\t \t\t\t \t\t \t \t \t \t \t\t \t \t\t\t", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nk = 1 # покрасили за раз все дерево\r\n\r\nfor i in range(1, n):\r\n if c[i] != c[p[i-1]-1]:\r\n k +=1\r\nprint(k)", "from collections import deque\nn = int(input())\nparents = [-1] + [int(x) for x in input().split()]\ncolors = [int(x) for x in input().split()]\n\nmatrix = [[] for i in range(n)]\n\nfor child, parent in enumerate(parents):\n matrix[parent-1].append(child)\n\nq = deque()\nq.append(0)\n\ncount = 0\nvisited = set()\nwhile q:\n node = q.popleft()\n visited.add(node)\n if parents[node] == -1 or colors[parents[node]-1] != colors[node]:\n count += 1\n for child in matrix[node]:\n if child not in visited:\n q.append(child)\nprint(count)\n \t\t \t \t \t \t \t\t \t \t", "n = int(input())\r\nfa = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nans = 1\r\nfor i in range(n-1):\r\n if c[i+1] != c[fa[i]-1]:\r\n ans += 1\r\nprint(ans)", "class Node():\r\n def __init__(self,value,Color):\r\n self.Parent = self \r\n self.value = value \r\n self.Depth = 0\r\n self.Color = Color \r\nclass DSU(object):\r\n def __init__(self,n,Color):\r\n self.step = 1\r\n self.n = n\r\n self.Nodes = [Node(i,j) for i,j in Color]\r\n def find(self,Node):\r\n if Node != Node.Parent:\r\n Node.Parent = self.find(Node.Parent)\r\n return Node.Parent\r\n def Union(self,Node1,Node2):\r\n X1 = self.find(Node1)\r\n X2 = self.find(Node2)\r\n if X1 == X2:\r\n return True\r\n if X1.Depth == X2.Depth :\r\n X2.Parent = X1\r\n if Node1.Color != Node2.Color:\r\n #print(X1.Color,X2.Color)\r\n self.step += 1\r\n X1.Depth +=1\r\n return False\r\n elif X1.Depth < X2.Depth:\r\n X1.Parent = X2\r\n if Node1.Color != Node2.Color:\r\n #print(X1.Color,X2.Color)\r\n self.step += 1\r\n return False\r\n else:\r\n X2.Parent = X1\r\n if Node1.Color != Node2.Color:\r\n self.step += 1\r\n #print(X1.Color,X2.Color)\r\n return False\r\n\r\n # def print_all_components(self):\r\n # comps = [[] for _ in range(self.n)]\r\n # for node in self.Nodes:\r\n # comps[self.find(node).value].append(node.value)\r\n\r\n # for i in range(n):\r\n #if len(comps[i]):\r\n # print (\"\tnew component: \" + str(comps[i]))\r\ndef read(A,C):\r\n arrows = []\r\n j = 2\r\n for i in A:\r\n arrows.append((i,j))\r\n j +=1\r\n z = zip(range(0,len(A) + 2) , C) \r\n #print(z[0])\r\n return arrows,z\r\nn = int(input()) + 1\r\nC = [0]\r\nA = list(map(int,input().strip().split()))\r\nC += list(map(int,input().strip().split()))\r\nedges,v = read(A,C)\r\n#for i,j in v:\r\n # print(i,j)\r\ndsu = DSU(n,v)\r\nfor u,v in edges:\r\n # print(u,v)\r\n success = dsu.Union(dsu.Nodes[u],dsu.Nodes[v])\r\n # print (\"now components are: \")\r\n # dsu.print_all_components()\r\n #print(\"\")\r\nprint(dsu.step)", "n = int(input())\r\np = list(map(int, input().split()))\r\np.insert(0, 0); p.insert(0, 0)\r\nc = list(map(int, input().split()))\r\nc.insert(0, 0)\r\nans = 1\r\nfor i in range(2, n+1):\r\n if c[i] != c[p[i]]:\r\n ans += 1\r\nprint(ans)\r\n", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\np = get_ints()\r\nc = get_ints()\r\nres = 1\r\ni = 1\r\nfor j in p:\r\n\tif c[j-1]!=c[i]:\r\n\t\tres+=1\r\n\ti+=1\r\nprint(res)", "n=int(input())\r\np=list(map(int,input().split()))\r\ng=[[] for _ in range(n)]\r\nfor i in range(n-1):\r\n g[i+1].append(p[i]-1)\r\n g[p[i]-1].append(i+1)\r\nc=list(map(int,input().split()))\r\n\r\nv=[-1]*n\r\nv[0]=0\r\ns=[0]\r\no=1\r\nwhile s:\r\n x=s.pop()\r\n if c[x]!=c[v[x]]:o+=1\r\n for j in g[x]:\r\n if v[j]==-1:\r\n s.append(j)\r\n v[j]=x\r\nprint(o)", "def painting(dict_children, colors, node, couleur):\r\n stack = [(node, couleur)]\r\n nb_coloriage = 0\r\n\r\n while stack:\r\n current_node, current_color = stack.pop()\r\n if current_color != colors[current_node - 1]:\r\n nb_coloriage += 1\r\n\r\n for children in dict_children[current_node]:\r\n stack.append((children, colors[current_node - 1]))\r\n\r\n return nb_coloriage\r\n\r\nt = int(input())\r\n\r\n# Process each test case\r\nnodes = list(map(int, input().split()))\r\ncolors = list(map(int, input().split()))\r\ndict_children = {}\r\n\r\nfor i in range(len(nodes) + 1):\r\n dict_children[i + 1] = []\r\n\r\nfor i in range(len(nodes)):\r\n dict_children[nodes[i]].append(i + 2)\r\n\r\nnb_coloriage = painting(dict_children, colors, 1, colors[0]) + 1\r\nprint(nb_coloriage)", "n=int(input())\r\nimport sys\r\narr=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\ngraph={}\r\nsys.setrecursionlimit(10**4)\r\nfor i in range(n-1):\r\n graph[arr[i]]=[]\r\nfor i in range(n-1):\r\n graph[arr[i]].append(i+2)\r\ntable={}\r\nfor i in range(1,n+1):\r\n table[i]=arr2[i-1]\r\ncount=0\r\ndef dfs(graph,node,visited,prev_color):\r\n global count\r\n if visited.get(node,False):\r\n return\r\n if prev_color!=table[node]:\r\n count+=1\r\n visited[node]=True\r\n prev_color=table[node]\r\n if graph.get(node,-1)!=-1:\r\n for node in graph[node]:\r\n dfs(graph,node,visited,prev_color)\r\n return count\r\nprint(dfs(graph,1,{},0))", "n = int(input())\n\narr1 = [0] * 12345\narr2 = [0] * 12345\n\narr1_temp = [int(i) for i in input().split()]\narr2_temp = [int(i) for i in input().split()]\n\nfor i in range(1, n):\n arr1[i] = arr1_temp[i - 1]\nfor i in range(1, n + 1):\n arr2[i] = arr2_temp[i - 1]\nans = 1\n\nfor i in range(2, n + 1):\n if arr2[i] != arr2[arr1[i - 1]]: ans += 1\nprint(ans)\n\t\t \t\t \t \t\t \t \t \t \t \t\t\t", "def f():\r\n q=[1]\r\n cnt=0\r\n while q:\r\n x=q.pop(0)\r\n for i in tree[x]:\r\n if color[x]!=color[i]:\r\n cnt+=1\r\n q.append(i)\r\n return cnt\r\n\r\nn=int(input())\r\ntree={i+1:[] for i in range(n)}\r\ncolor={i+1:0 for i in range(n)}\r\np=list(map(int,input().split()))\r\nfor i in range(2,n+1):\r\n tree[p[i-2]].append(i)\r\nc=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n color[i]=c[i-1]\r\nprint(f()+1)", "'''def dfs(startnode, color):\r\n stack = []\r\n stack.append(startnode)\r\n startnode.visited = True\r\n startnode.cv = color\r\n while stack:\r\n actualnode = stack.pop()\r\n for neighbour in actualnode.adjacencyList:\r\n if not neighbour.visited:\r\n neighbour.visited = True\r\n neighbour.cv = color\r\n stack.append(neighbour)'''\r\nclass Node:\r\n def __init__(self,name):\r\n self.name = name\r\n self.cv = 0\r\n self.adjacencyList = []\r\n #self.visited = False\r\nclass Edge:\r\n def __init__(self,startnode,endnode):\r\n self.startnode = startnode\r\n self.endnode = endnode\r\nn = int(input())\r\nnodes = []\r\nfor i in range(1,n+1):\r\n nodes.append(Node(i))\r\nstart = 2\r\nedges = list(map(int,input().split()))\r\nedgelist = []\r\nfor edge in edges:\r\n edgelist.append(Edge(nodes[edge-1],nodes[start-1]))\r\n start += 1\r\ncolors = list(map(int,input().split()))\r\ncounter = 0\r\nfor i,color in enumerate(colors):\r\n nodes[i].cv = color\r\nfor e in edgelist:\r\n if e.startnode.cv != e.endnode.cv:\r\n counter += 1\r\nprint(counter+1)", "n = int(input())\nparent = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ncnt = 1\nfor i in range(1,n):\n if c[i] != c[parent[i-1]-1]:\n cnt+=1\n\nprint(cnt)\n", "from io import BytesIO\nimport os\nfrom collections import defaultdict, deque\n\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\ndef dfs(graph, color):\n count = 1 #subtree with same color\n stack = deque()\n visited = [False]*(len(graph)+1)\n stack.append(1) #root\n while stack:\n top = stack.pop()\n visited[top] = True\n for neighbor in graph[top]:\n if not visited[neighbor]:\n if color[neighbor] != color[top]: count += 1\n stack.append(neighbor)\n\n return count\n\ndef main():\n int(input())\n paths = list(map(int, input().split()))\n colors = [0]\n colors.extend(list(map(int, input().split())))\n graph = defaultdict(list)\n\n for index, edge in enumerate(paths):\n node = index+2\n graph[node].append(edge)\n graph[edge].append(node)\n\n print(dfs(graph, colors))\n \n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\ndef st(): return str(input())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef strip(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\nfrom queue import deque\r\nn=inp()\r\np=li()\r\nc=li()\r\nd={}\r\nfor i in range(n-1):\r\n f=p[i]-1\r\n if f in d: d[f].append(i+1)\r\n else: d[f]=[i+1]\r\nans,res,q=[0]*n,0,deque([])\r\nq.append(0)\r\nwhile q:\r\n a=q.popleft()\r\n if ans[a]!=c[a]:\r\n ans[a]=c[a]\r\n res+=1\r\n try:\r\n for j in d[a]:\r\n ans[j]=c[a]\r\n q.append(j)\r\n except:\r\n pqr=1\r\nprint(res)", "from collections import deque\r\nn = int(input())\r\nparents = list(map(lambda el: int(el)-1, input().split()))\r\ncolors = list(map(int, input().split()))\r\ngraph = {}\r\nfor i in range(n-1):\r\n el = parents[i]\r\n children = graph.get(el, [])\r\n children.append(i+1)\r\n graph[el] = children\r\n\r\nres = 0\r\n\r\nlast_collors = [-1 for i in range(n)]\r\nq = deque()\r\nq.append(0)\r\ncolored_items = 0\r\n\r\nwhile colored_items != n or len(q) > 0:\r\n el = q.pop()\r\n if colors[el] != last_collors[el]:\r\n res += 1\r\n last_collors[el] = colors[el]\r\n colored_items += 1\r\n if el in graph:\r\n for child in graph[el]:\r\n last_collors[child] = colors[el]\r\n q.append(child)\r\n\r\nprint(res)\r\n\r\n\"\"\"\r\n6\r\n1 2 2 1 5\r\n2 1 1 1 1 1\r\n\r\n\"\"\"", "n = int(input())\np = [int(a) for a in input().split()]\nc = [int(a) for a in input().split()]\nN = 1\nfor i in range(n-1):\n if c[i+1] != c[p[i]-1]:\n N += 1\nprint(N)\n", "from queue import Queue\r\n\r\nN = int(input())\r\nchildren = {}\r\nparent = {}\r\nfor i in range(1, N+1):\r\n children[i] = []\r\n parent[i] = 0\r\nls = list(map(int, input().split()))\r\nfor i in range(2, N+1):\r\n parent[i] = ls[i-2]\r\n children[ls[i-2]].append(i)\r\nls = list(map(int, input().split()))\r\ncolor = {}\r\nfor i in range(1, N+1):\r\n color[i] = ls[i-1]\r\n\r\nQ = Queue()\r\nQ.put(1)\r\ncnt = 0\r\nwhile not Q.empty():\r\n element = Q.get()\r\n if element==1: compare = 0\r\n else: compare = color[parent[element]]\r\n if color[element]!=compare:\r\n cnt+=1\r\n for i in children[element]:\r\n Q.put(i)\r\nprint(cnt)\r\n", "n = int(input())\np = list(map(int,input().split()))\nc = input().split()\n\nstep=1\nfor i in range(1,n):\n\tif c[i]!=c[p[i-1]-1]:\n\t\tstep+=1\nprint(step)", "from collections import defaultdict \r\n\r\nn=int(input())\r\ng=defaultdict(set)\r\nlis=list(map(int,input().split()))\r\nlis.insert(0,0)\r\nlis.insert(0,0)\r\nfor i in range(2,n+1):\r\n x=min(i,lis[i])\r\n y=max(i,lis[i])\r\n g[x].add(y)\r\n\r\nclr=list(map(int,input().split()))\r\nclr.insert(0,0)\r\nvis=[0]*(n+1)\r\ncc=[0]*(n+1)\r\nvis[1]=1\r\ncc[1]=clr[1]\r\nc=1\r\nst=[1]\r\nwhile st:\r\n x=st[-1]\r\n for i in g[x]:\r\n if vis[i]==0:\r\n cc[i]=clr[x]\r\n vis[i]=1\r\n if cc[i]!=clr[i]:\r\n c+=1\r\n cc[i]=clr[i]\r\n st.append(i)\r\n break\r\n else:\r\n st.pop()\r\nprint(c)\r\n", "# from math import gcd\r\n# from queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\n# for _ in range(int(input())):\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nans=1\r\nfor i in range(1,n):\r\n if l2[i]!=l2[l1[i-1]-1]:\r\n ans+=1\r\n else:\r\n pass\r\nprint(ans)\r\n\r\n \r\n\r\n\r\n\r\n ", "from collections import deque\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0) \r\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\nif(os.path.exists('input.txt')):\r\n sys.stdin = open('input.txt','r') ; sys.stdout = open('output.txt','w')\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nn = int(input())\r\nverts = list(map(int, input().split()))\r\ncolours = list(map(int, input().split()))\r\nchildren = [set() for i in range(n)]\r\ncurrnum = 2\r\nfor i in verts:\r\n children[currnum-1].add(i-1)\r\n children[i-1].add(currnum-1)\r\n currnum+=1\r\nq = deque()\r\nq.append(0)\r\nwhile q:\r\n v = q.popleft()\r\n for i in children[v]:\r\n if v in children[i]:\r\n children[i].remove(v)\r\n q.append(i)\r\nparent = [None]*n\r\nfor i in range(len(children)):\r\n for j in children[i]:\r\n parent[j] = i\r\ncurrentColours = [0]*n\r\ncurrentColours[0] = colours[0]\r\nans = 1\r\nq = deque()\r\nq.append(0)\r\nwhile q:\r\n v = q.popleft()\r\n if parent[v]==None or colours[v] == currentColours[parent[v]]:\r\n currentColours[v] = colours[v]\r\n else:\r\n currentColours[v] = colours[v]\r\n ans+=1\r\n for i in children[v]:\r\n q.append(i)\r\nprint(ans) \r\n", "\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n p = list(map(int, input().split(' ')))\r\n c = list(map(int, input().split(' ')))\r\n\r\n steps = 1 # root step\r\n for i in range(1, n): # iter p\r\n if c[i] != c[p[i-1]-1]:\r\n steps += 1\r\n\r\n print(steps)", "n = int(input())\r\nmps = list(map(int,input().split()))\r\ncol = list(map(int,input().split()))\r\nst = 2\r\npar = dict()\r\nfor i in range(n-1):\r\n\tpar[st] = par.get(st,[])\r\n\tpar[st].append(mps[i])\r\n\tpar[mps[i]] = par.get(mps[i],[])\r\n\tpar[mps[i]].append(st)\r\n\tst+=1\r\n\r\nqueue = [1]\r\nvis = [0]*(n+1)\r\nans = 1\r\nwhile len(queue):\r\n\ts = queue.pop(0)\r\n\tvis[s] = 1\r\n\tfor i in par[s]:\r\n\t\tif not vis[i]:\r\n\t\t\tqueue.append(i)\r\n\t\t\tvis[i] = 1\r\n\t\t\tif col[i-1]!=col[s-1]:\r\n\t\t\t\tans+=1\r\n\r\nprint(ans)", "from collections import defaultdict\r\n\r\ndef main():\r\n n = int(input())\r\n d = defaultdict(list)\r\n for i, e in enumerate(map(int, input().split()), 2):\r\n d[e].append(i)\r\n\r\n c = {i: int(c) for i, c in enumerate(input().split(), 1)}\r\n\r\n ans = 1\r\n for k, v in d.items():\r\n for e in v:\r\n if c[e] != c[k]:\r\n ans += 1\r\n\r\n print(ans)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\ngraph = [[] for i in range(n)]\nfor index,i in enumerate(input().split()):\n\tgraph[int(i)-1].append(index+1)\ncolors = [int(i) for i in input().split()]\n\nstack = [0]\nans = 0\nwhile (stack):\n\tif graph[stack[-1]]:\n\t\tc = graph[stack[-1]].pop()\n\t\tif colors[stack[-1]]!=colors[c]:\n\t\t\tans += 1\n\t\tstack.append(c)\n\telse:\n\t\tstack.pop()\n\nprint(ans+1)", "from types import GeneratorType\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc\r\n\r\n# Not my code https://codeforces.com/blog/entry/91490?#comment-804801\r\n\r\nan=0\r\n\r\n@bootstrap\r\ndef dfs(node,p):\r\n global an\r\n if p==-1 or co[node]!=co[p]:\r\n an+=1\r\n for i in adj[node]:\r\n if i!=p:\r\n yield dfs(i,node )\r\n yield\r\nn=int(input())\r\np=[int(x) for x in input().split()]\r\nco=[int(x) for x in input().split() ]\r\ndp=[1]*n\r\nadj=[[]for i in range(n)]\r\nfor i in range(1,n):\r\n adj[i].append(p[i-1]-1)\r\n adj[p[i-1]-1].append(i)\r\ndfs(0,-1)\r\nprint(an)", "def bfs(endcolor):\n color=[0]*(n+1)\n endcolor=[0]+endcolor\n count=0\n visited, queue = set(), [1]\n while queue:\n #print(color,queue,count)\n vertex = queue.pop(0)\n if endcolor[vertex] != color[vertex]:\n color[vertex]=endcolor[vertex]\n count+=1\n if vertex not in visited:\n visited.add(vertex)\n queue.extend(g[vertex] - visited)\n for x in g[vertex] - visited:\n color[x]=color[vertex]\n return count\nn=int(input())\ng={x:set() for x in range(1,n+2)}\ni=1\nfor x in map(int,input().split()):\n i+=1\n g[x].add(i)\n #g[i].add(x)\n#print(g)\nprint(bfs(list(map(int,input().split()))))", "n = int(input())\r\np = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nk = 1\r\nfor i in range(n-1):\r\n if c[i+1] != c[p[i]-1]:\r\n k+= 1\r\nprint(k)", "def pst(root, curr):\r\n global times\r\n if cs[root-1] != curr:\r\n times += 1\r\n curr = cs[root-1]\r\n if root not in vss:\r\n return\r\n chn = vss[root]\r\n for ch in chn:\r\n pst(ch, curr)\r\n\r\n\r\nn = int(input())\r\nvs = [int(x) for x in input().split()]\r\n\r\ncs = [int(x) for x in input().split()]\r\n\r\n\r\n\r\n# vss = set()\r\n# for i in range(2, n + 1):\r\n# vss.add((vs[i - 2], i))\r\n#\r\n# vsbp = {v[0]: v for v in vss}\r\nvss = {}\r\nfor c, p in enumerate(vs):\r\n if not p in vss:\r\n vss[p] = [c+2]\r\n else:\r\n vss[p].append(c+2)\r\n\r\ntimes = 0\r\n\r\ndef flattened():\r\n times = 0\r\n root = 1\r\n curr = 0\r\n\r\n firstpart = True\r\n\r\n stack = []\r\n while True:\r\n\r\n\r\n if firstpart:\r\n\r\n if cs[root-1] != curr:\r\n times += 1\r\n curr = cs[root - 1]\r\n if root not in vss:\r\n firstpart = False\r\n if len(stack) == 0:\r\n print(times)\r\n return\r\n chni, curr = stack.pop()\r\n else:\r\n chn = vss[root]\r\n chni = iter(chn)\r\n\r\n try:\r\n ch = next(chni)\r\n firstpart = True\r\n root = ch\r\n stack.append((chni, curr))\r\n except StopIteration:\r\n firstpart = False\r\n if len(stack) == 0:\r\n print(times)\r\n return\r\n chni, curr = stack.pop()\r\n\r\n\r\n\r\n # if root in vss:\r\n # chn = vss[root]\r\n # chni = iter(chn)\r\n # stack.append((curr, chni))\r\n # else:\r\n # if len(stack) == 0:\r\n # print(times)\r\n # return\r\n\r\n\r\n# pst(1, 0)\r\n# print(times)\r\n\r\nflattened()", "from collections import deque\n\nn = int(input())\nadj = [[] for i in range(n + 1)]\nfor i, x in enumerate(input().split()):\n i += 2\n x = int(x)\n adj[i].append(x)\n adj[x].append(i)\n\nparents = [0 for i in range(n + 1)]\nparents[1] = -1\n\n# print(adj)\n\ncolors = [-1] + [int(x) for x in input().split()]\n\nq = deque([1])\nwhile len(q) > 0:\n node = q.popleft()\n for x in adj[node]:\n if parents[x] == 0:\n parents[x] = node\n q.append(x)\n\n# print(parents)\n\nans = 1\n\nfor i in range(2, n + 1):\n if colors[i] != colors[parents[i]]:\n ans += 1\n\nprint(ans)", "import sys\n# # For getting input from input.txt file\n# sys.stdin = open('input.txt', 'r')\n\n# # Printing the Output to output.txt file\n# sys.stdout = open('output.txt', 'w')\n\nn = int(input())\np = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 1\n\nfor i in range(1, n):\n if c[i] != c[p[i - 1] - 1]:\n ans += 1\n\nprint(ans)\n", "n=int(input())\r\npi=list(map(int,input().split()))\r\nci=list(map(int,input().split()))\r\ncom=1\r\nfor i in range(1,n):\r\n if ci[i]!=ci[pi[i-1]-1]:\r\n com+=1\r\nprint(com)", "n=int(input())\r\nedge=list(map(int,input().split(' ')))\r\ncolor=list(map(int,input().split(' ')))\r\nasscolor=[0 for i in range(n)]\r\nvisi=[]\r\ncadj=[];adjli=[]\r\nfor i in range(n):\r\n\tadjli.append([])\r\n\tcadj.append(0);visi.append(0)\r\n\r\nfor i in range(len(edge)):\r\n\tadjli[i+1].append(edge[i]-1);\r\n\tadjli[edge[i]-1].append(i+1)\r\n\r\ndef dfs():\r\n\tglobal adjli,cadj,color,asscolor;\r\n\tans=0\r\n\tstack=[0];asscolor[0]=color[0];ans+=1;\r\n\twhile len(stack)>0:\r\n\t\t#print(asscolor,color,stack)\r\n\t\tcurr=stack[-1];visi[curr]=1\r\n\t\tif asscolor[curr]!=color[curr]:\r\n\t\t\tasscolor[curr]=color[curr]\r\n\t\t\tans+=1\r\n\t\tif cadj[curr]<len(adjli[curr]):\r\n\t\t\tif visi[adjli[curr][cadj[curr]]]==0:\r\n\t\t\t\tstack.append(adjli[curr][cadj[curr]])\r\n\t\t\t\tasscolor[adjli[curr][cadj[curr]]]=asscolor[curr]\r\n\t\t\telif visi[adjli[curr][cadj[curr]]]==1:\r\n\t\t\t\tcadj[curr]+=1\r\n\t\telse:\r\n\t\t\tdel stack[-1]\r\n\t#print(asscolor,color)\r\n\r\n\tprint(ans)\r\ndfs()\r\n\t\t\t\t\r\n\r\n", "import queue\r\n\r\ndef my_solve(n, graph, mask, colors):\r\n\tsteps = 1\r\n\tq = queue.Queue()\r\n\tq.put(1)\r\n\tmask[1] = 1\r\n\twhile not q.empty():\r\n\t\tu = q.get()\r\n\t\tfor v in graph[u]:\r\n\t\t\tif mask[v] == 0:\r\n\t\t\t\tif colors[v-1] != colors[u-1]:\r\n\t\t\t\t\tsteps += 1\r\n\t\t\t\tmask[v] = 1\r\n\t\t\t\tq.put(v)\r\n\t\tmask[u] = 2\r\n\r\n\treturn steps\r\n\r\n\r\ndef test(n, edges, colors):\r\n\tgraph = {}\r\n\tmask = [0]*(n+5)\r\n\tfor i in range(1, n+1):\r\n\t\tgraph[i] = []\r\n\tfor i in range(0, len(edges)):\r\n\t\tgraph[edges[i]].append(i+2)\r\n\treturn my_solve(n, graph, mask, colors)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tline1 = [int(x) for x in input().split()]\r\n\tline2 = [int(x) for x in input().split()]\r\n\tprint(test(n, line1, line2))", "Read = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\np = [0, 0] + Read()\r\nc = [0] + Read()\r\n\r\nans = 0\r\nfor i in range(2, n+1):\r\n if c[i]!=c[p[i]]:\r\n ans+=1\r\n\r\nprint(ans+1)", "import sys\nsys.setrecursionlimit(5000)\n\nn = int(input())\np = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\nans = 1\nfor i,x in enumerate(p):\n if c[i+1] != c[x-1]:\n ans += 1\n\nprint(ans)\n\t\t\t \t \t \t\t\t \t \t\t \t \t \t \t\t \t\t\t\t", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nans = 1\r\nfor a, b in zip(p, c[1:]):\r\n if b != c[a - 1]:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "import sys\r\nsys.setrecursionlimit(10000)\r\nfrom collections import defaultdict\r\ngraph =defaultdict(list)\r\nn = int(input())\r\nedges = list(map(int,input().split()))\r\ncoloring = list(map(int , input().split()))\r\ncnt = 2\r\nfor i in edges:\r\n if graph[i] ==0:\r\n graph[i] = []\r\n graph[i].append(cnt)\r\n cnt+=1\r\nsteps = 0\r\ndef dfs(node,coloring,color,graph):\r\n global steps\r\n if coloring[node-1]!= color:\r\n steps+=1\r\n for i in range(len(graph[node])):\r\n dfs(graph[node][i],coloring,coloring[node-1],graph)\r\ndfs(1,coloring,0,graph)\r\nprint(steps)", "class DSU:\r\n def __init__(self, n):\r\n self.components = n\r\n self.par = [i for i in range(n)]\r\n self.size = [1]*n\r\n\r\n def find(self,x):\r\n if self.par[x] != x:\r\n return self.find(self.par[x])\r\n return self.par[x]\r\n\r\n def union(self, x, y):\r\n p1 = self.find(x)\r\n p2 = self.find(y)\r\n if p1 == p2: return\r\n if self.size[p2] > self.size[p1]:\r\n p1, p2 = p2, p1\r\n self.size[p1] += self.size[p2]\r\n self.par[p2] = p1\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncolor = list(map(int, input().split()))\r\ndsu = DSU(n)\r\nfor i in range(n - 1):\r\n if color[i + 1] == color[a[i] - 1]:\r\n dsu.union(a[i] - 1, i + 1)\r\nprint(len(set(dsu.par)))", "a=int(input())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\np=[0,0]+list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nc=[0]+list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nans=1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(2,a+1):\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 c[i]!=c[p[i]]:ans+=1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(ans)", "from collections import *\nimport sys\nimport math\nfrom functools import reduce\n\ndef factors(n): \n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\n\ndef li():return [int(i) for i in input().rstrip('\\n').split(' ')]\ndef st():return input().rstrip('\\n')\ndef val():return int(input())\ndef stli():return [int(i) for i in input().rstrip('\\n')]\n\n\ndef bfs(c,di):\n tot = 1\n d = deque()\n for i in di[1]:d.append([i,c[0]])\n visited = [0 for i in range(len(c)+1)]\n while d:\n root,itcolor = d.popleft()\n if itcolor != c[root - 1]:\n tot += 1\n itcolor = c[root - 1]\n visited[root] = 1\n for i in di[root]:\n if not visited[i]:\n d.append([i,itcolor])\n return tot\n\n\n\n\nn = val()\nd = defaultdict(list)\nl = li()\n\nfor i in range(n-1):\n d[l[i]].append(i+2)\n\nc = li()\nprint(bfs(c,d))", "n = int(input())\np = [int(n) - 1 for n in input().split()]\nc = [int(n) for n in input().split()]\nans = 1\nfor i in range(1, n):\n if c[p[i - 1]] != c[i]:\n ans += 1\nprint(ans)\n", "from sys import stdin, stdout\r\nimport math,sys,heapq\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport random\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\n\r\ndef dfs(d,n,col):\r\n parentcol=[0]*(n+1)\r\n count=0\r\n parentcol[1]=col[0]\r\n visit=[False]*(n+1)\r\n q=deque([1])\r\n while q:\r\n temp=q.pop()\r\n if col[temp]!=parentcol[temp]:\r\n count+=1\r\n parentcol[temp]=col[temp]\r\n \r\n for x in d[temp]:\r\n if visit[x]==False:\r\n q.append(x)\r\n parentcol[x]=col[temp]\r\n #print(parentcol[x],x,col[temp-1],temp)\r\n visit[temp]=True\r\n #print(parentcol,q)\r\n print(count)\r\n\r\ndef main():\r\n try:\r\n d=defaultdict(list)\r\n n=I()\r\n l=list(In())\r\n for x in range(n-1):\r\n d[x+2].append(l[x])\r\n d[l[x]].append(x+2)\r\n col=[0]\r\n col+=list(In())\r\n #print(d)\r\n dfs(d,n,col)\r\n\r\n\r\n\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n #for _ in range(I()):main()\r\n for _ in range(1):main()", "n=int(input())\r\np=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nstep=1\r\nfor i in range(1,n):\r\n if c[i]!=c[p[i-1]-1]:\r\n step+=1\r\nprint(step)", "I=lambda:map(int,input().split())\r\nn,=I()\r\na,b,s,q=[1]+[*I()],[*I()],0,{}\r\nfor i in range(1,n+1):q[i]=0\r\nfor i in range(n):\r\n if q[a[i]]!=b[i]:s+=1\r\n q[i+1]=b[i]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nss = input()\r\ntree = [[1]]\r\np = list(map(int, s.split()))\r\nq = list(map(int, ss.split()))\r\nfor i in range(0, n-1):\r\n tree.append([i+2])\r\n tree[p[i]-1].append(i+2)\r\ncount = 0\r\nfor each in tree:\r\n if len(each) == 1:\r\n tree.remove(each)\r\n count += 1\r\ntree.sort(key=len)\r\nfor each in tree:\r\n sub = list(map(lambda x:q[x-1], each[1:]))\r\n count += (1-sub.count(q[each[0]-1]))\r\nprint(count)", "#coloring Tree\r\nfrom collections import deque\r\nn=int(input())\r\ngraph={i:[] for i in range(1,n+1)}\r\nAns=0\r\nedge=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n a,b=i+2,edge[i]\r\n graph[a].append(b)\r\n graph[b].append(a)\r\ncolorlist=list(map(int,input().split()))\r\ncolorlist=[0]+colorlist\r\ndef search(N):\r\n global Ans\r\n startnode=N\r\n visitedlist=[0 for i in range(n+1)]\r\n d=deque()\r\n e=deque()\r\n d.append(N)\r\n visitedlist[N]=True\r\n while d:\r\n for point in d:\r\n for node in graph[point]:\r\n if visitedlist[node]==False:\r\n e.append(node)\r\n visitedlist[node]=True\r\n if colorlist[node]!=colorlist[point]:\r\n Ans+=1\r\n elif visitedlist[node]==True:\r\n pass\r\n if e:\r\n d=e\r\n e=deque()\r\n elif not e:\r\n d=deque()\r\nsearch(1)\r\nprint(Ans+1)", "#!/usr/bin/env python3\r\nimport sys\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ls(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef test_ok(ok): print(\"YES\" if ok else \"NO\")\r\n\r\ndef main():\r\n # for _ in range(int(input())):\r\n n = int(input())\r\n p = get_ls()\r\n c = get_ls()\r\n ans = 0\r\n\r\n for i in range(1, n):\r\n if c[i] != c[p[i-1]-1]:\r\n ans += 1\r\n\r\n print(ans+1)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "def compute():\r\n n = int(input())\r\n s = [int(i) for i in input().split(' ')]\r\n desirable = [int(i) for i in input().split(' ')]\r\n color = [0 for i in range(n)]\r\n G = [0 for i in range(n)]\r\n for i in range(len(s)):\r\n G[i + 1] = s[i] - 1\r\n\r\n #print(wrong)\r\n #print(G)\r\n counter = 1\r\n color[0] = desirable[0]\r\n for i in range(1, n):\r\n #print('Przed: ', color[i], desirable[i], G, G[i], ' ', color[G[i]], ' ', counter)\r\n if desirable[i] != color[G[i]]:\r\n color[i] = desirable[i]\r\n counter += 1\r\n else:\r\n color[i] = desirable[i]\r\n #print('Po: ', color[i], desirable[i], G, G[i], ' ', color[G[i]], ' ', counter, '\\n')\r\n print(counter)\r\n\r\ncompute()\r\n", "from collections import deque\r\ndef solve():\r\n\tn = int(input())\r\n\tgraph = dict()\r\n\tfor i in range(1,n+1):\r\n\t\tgraph[i] = list()\r\n\r\n\tp = list(map(int,input().split()))\r\n\tindex = 2\r\n\tfor i in range(n-1):\r\n\t\tgraph[index].append(p[i])\r\n\t\tgraph[p[i]].append(index)\r\n\t\tindex+=1\r\n\r\n\tcolors = [0]\r\n\tfor c in map(int,input().split()):\r\n\t\tcolors.append(c)\r\n\t\r\n\tchecked = [False for _ in range(n+1)]\r\n\r\n\tstep = 1\r\n\tq = deque()\r\n\tq.append(1)\r\n\twhile q:\r\n\t\troot = q.popleft()\r\n\t\ttemp_color = colors[root]\r\n\t\tchecked[root] = True \r\n\t\tfor neighbor in graph[root]:\r\n\t\t\tif (not checked[neighbor]):\r\n\t\t\t\tchecked[neighbor] = True \r\n\t\t\t\tq.append(neighbor)\r\n\t\t\t\tif (temp_color != colors[neighbor]):\r\n\t\t\t\t\tstep += 1 \r\n\r\n\tprint(step)\r\n\r\n\r\n\r\n\r\nsolve()", "def o():return list(map(int,input().split()))\r\n[n],[p,c]=o(),[o()for x in range(2)]\r\nprint(sum([1 if i==0 or c[p[i-1]-1]!=c[i]else 0 for i in range(n)]))", "n = int(input())\nf = [0, 0] + list(map(int, input().split()))\nc = [0] + list(map(int, input().split()))\nans = 0\nfor i in range(2, n + 1):\n if c[i] != c[f[i]]: ans += 1\nans += 1\nprint(ans)", "no_of_nodes = int(input())\nconnection_list = list(map(int, input().split(' ')))\ncolor_list = list(map(int, input().split(' ')))\nanswer = 1\nfor v in range(2, no_of_nodes+1):\n if (color_list[v-1] != color_list[connection_list[v-2]-1]):\n answer += 1\nprint(answer)\n", "n = int(input())\r\n\r\np = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nans = 1;\r\nind = 1\r\n\r\nfor i in p:\r\n if c[i-1]!=c[ind]:\r\n ans+=1;\r\n ind+=1 \r\n \r\nprint(ans)", "from array import array\r\nfrom collections import deque\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n \r\ndef bfs():\r\n ans=1\r\n while len(queue)>0:\r\n node=queue.popleft()\r\n visis[node]=1\r\n colo=color[node-1]\r\n for child in nodes[node]:\r\n if visis[child]==1:\r\n continue\r\n if color[child-1]!=colo:ans+=1\r\n queue.append(child)\r\n return ans\r\n \r\n\r\n\r\n\r\nn=int(input()) ; arr=input().split() ; color=array(\"i\",map(int,input().split())) ; nodes=[] ; visis=[]\r\nfor i in range(n+1):\r\n nodes.append([])\r\n visis.append(0)\r\nfor i in range(n-1):\r\n nodes[i+2].append(int(arr[i]))\r\n nodes[int(arr[i])].append(i+2)\r\nqueue=deque() ; queue.append(1) \r\nprint(bfs())\r\n", "import sys\nimport collections\n\ninput = sys.stdin.readline\n\n\ndef solve(n, p, c):\n G = collections.defaultdict(list)\n ans = 0\n for u, v in enumerate(p):\n v -= 1\n u += 1\n G[v].append([u, 0, c[u]])\n # print(G)\n # for k in G:\n # print(k, G[k])\n # BFS from root node and update the stuff respectively\n alpha = 0\n # q -> node, current_color = 0, target_color -- initially\n q = collections.deque()\n q.append([0, 0, c[alpha]])\n used = [False for i in range(n)]\n used[alpha] = True\n while q:\n val = q.popleft()\n # print(q, val)\n top, cur_color, target_color = val\n if cur_color != target_color:\n ans += 1\n for child, present_color, should_color in G[top]:\n if not used[child]:\n used[child] = True\n q.append([child, target_color, c[child]])\n print(ans)\n\n\nn = int(input())\np = list(map(int, input().split()))\nc = list(map(int, input().split()))\nsolve(n, p, c)\n\n", "n = int(input())\r\n\r\np = [0,0] +list(map(int, input().split()))\r\nc = [0] + list(map(int, input().split()))\r\n\r\ncolors = 1\r\n\r\nfor i in range(2,n+1):\r\n if c[i] != c[p[i]]:\r\n colors += 1\r\n\r\nprint(colors)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncolor = list(map(int, input().split()))\r\n\r\ngraph = {i: [] for i in range(n)}\r\nfor i in range(n - 1):\r\n s = x[i] - 1\r\n graph[s].append(i + 1)\r\n\r\nres = 1\r\nstack = [0]\r\nwhile stack:\r\n curr = stack.pop()\r\n for adjvertex in graph[curr]:\r\n y = 1 if color[curr] != color[adjvertex] else 0\r\n res += y\r\n stack.append(adjvertex)\r\n \r\nprint(res) ", "#!/usr/bin/env python3\n\ndef solve():\n n = get(int)\n children = defaultdict(list)\n P = get([int])\n for i, p in enumerate(P, 2):\n children[i].append(p)\n children[p].append(i)\n\n col = dict(zip(range(1, n+1), get([int])))\n stack = [(1, None, 0)]\n count = 0\n while stack:\n node, parent, pcolor = stack.pop()\n if pcolor != col[node]:\n count += 1\n pcolor = col[node]\n for c in children[node]:\n if c != parent:\n stack.append((c, node, pcolor))\n return count\n\n\n\n\n_testcases = \"\"\"\n6\n1 2 2 1 5\n2 1 1 1 1 1\n\n3\n\n\n\n7\n1 1 2 3 1 4\n3 3 1 1 1 2 3\n\n5\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nfrom bisect import bisect_left, bisect_right\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom heapq import heapify, heappop, heappush\nfrom operator import itemgetter, attrgetter\nimport bisect\nimport collections\nimport functools\nimport heapq\nimport itertools\nimport math\nimport operator\nimport re\nimport string\nimport sys\n\ninf = float('inf')\ncache = lru_cache(None)\nsys.setrecursionlimit(10000)\n\ndef tree():\n return collections.defaultdict(tree)\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n printRecursionTree = timeit = lambda x: x\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "n = int(input())\r\np = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\n\r\nans = 1\r\nfor i,x in enumerate(p):\r\n if c[i+1] != c[x-1]:\r\n ans += 1\r\n\r\nprint(ans)", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\n\n\nn=int(input())\np=list(map(int,input().split()))\nc=list(map(int,input().split()))\n\n\nnbr=1\nfor i in range(1,n):\n if c[i]!=c[p[i-1]-1]:\n nbr+=1\n\nprint(nbr)\n", "import sys \r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split())) \r\nd = defaultdict(list)\r\nfor i in range(n - 1):\r\n d[p[i] - 1].append(i + 1)\r\n\r\n\r\nans = [0] * n \r\nres = 0\r\nq = [0]\r\nwhile(q):\r\n a = q.pop(0) \r\n if(ans[a]!= c[a]):\r\n ans[a] = c[a]\r\n res += 1\r\n for j in d[a]:\r\n ans[j] = c[a]\r\n q.append(j) \r\n # print(ans)\r\n \r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nd = [[i] for i in range(n)]\r\n\r\nw = list(map(int, input().split()))\r\nfor i in range(n-1):\r\n d[i+1].append(w[i]-1)\r\n\r\ns = list(map(int, input().split()))\r\nc = 1\r\nfor i in range(n):\r\n for j in range(len(d[i])-1):\r\n if s[d[i][j]] != s[d[i][j+1]]:\r\n c += 1\r\nprint(c)", "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.rstrip(\"\\r\\n\\t \"))\nn = int(lines[0])\ndata = lines[1].split(' ')\ntree = [0]\nfor x in data:\n tree.append(int(x))\ndata = lines[2].split(' ')\ncolors = [int(data[0])]\noperations = 1\nfor i in range(n):\n if i > 0:\n color = int(data[i])\n parent = tree[i]\n if colors[parent - 1] != color:\n operations += 1\n colors.append(color)\nprint(operations)\n", "edges = []\nneeded = 0\n\ndef parsedges(eraw):\n\tglobal edges\n\tfor i in range(len(eraw)):\n\t\tedges.append((i+1, int(eraw[i])-1))\n\ndef getColors(craw):\n\tglobal needed\n\tfor j in edges:\n\t\tif craw[int(j[0])] != craw[int(j[1])]:\n\t\t\t needed += 1\n\ndef main():\n\tn = int(input())\n\teraw = input().split()\n\tcraw = input().split()\n\t\n\t\n\tparsedges(eraw)\n\tgetColors(craw)\n\treturn needed + 1\n\t\nprint(main())\n\n", "n = int(input())\r\nP = [0]+list(map(lambda c:int(c)-1,input().split()))\r\nC = list(map(int,input().split()))\r\n\r\ncnt = sum(C[i]==C[p] for i,p in enumerate(P))\r\n\r\nprint(n-cnt+1)", "\r\nfrom collections import defaultdict\r\nclass graph():\r\n\tdef __init__(self,v):\r\n\t\tself.v=v\r\n\t\tself.graph=defaultdict(list)\r\n\r\n\tdef add_edge(self,a,b):\r\n\t\tself.graph[a].append(b)\r\n\r\n\tdef solve(self,c):\r\n\t\tpc=[0]*self.v\r\n\t\tvisit=[0]*self.v\r\n\t\ts=[0]\r\n\t\tans=0\r\n\t\twhile s:\r\n\t\t\tu=s.pop()\r\n\t\t\tif visit[u]==0:\r\n\t\t\t\tvisit[u]=1\r\n\t\t\t\tif pc[u]!=c[u]:\r\n\t\t\t\t\tans+=1\r\n\t\t\tfor j in self.graph[u]:\r\n\t\t\t\tif visit[j]==0:\r\n\t\t\t\t\tpc[j]=c[u]\r\n\t\t\t\t\ts.append(j)\r\n\t\tprint(ans)\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ng=graph(n)\r\nfor i in range(n-1):\r\n\tg.add_edge(a[i]-1,i+1)\r\n\r\ng.solve(c)", "n = int(input().strip())\r\np = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nmoves = 1\r\nfor i in range(1,n):\r\n if c[p[i-1]-1]!=c[i]:\r\n moves+=1\r\nprint(moves)", "import sys\nsys.setrecursionlimit(1000000)\nread = sys.stdin.readline\n\nn = int(read())\nparent = [1] + list(map(int, read().split()))\ncolor = list(map(int, read().split()))\nunderVertex = [[] for _ in range(n+1)]\n\nfor i, p in enumerate(parent):\n\tif i+1 != p:\n\t\tunderVertex[p] += [i+1]\n\n\ndef dfs(idx, c):\n\tcount = 0\n\tif c != color[idx-1]:\n\t\tcount = 1\n\tfor nxt in underVertex[idx]:\n\t\tcount += dfs(nxt, color[idx-1])\n\treturn count\n\nprint(dfs(1, 0))", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\ncolormap = [0]*n\r\ncount = 0\r\nfor i in range(n):\r\n if(i>0):\r\n colormap[i]=colormap[p[i-1]-1]\r\n if(c[i]!=colormap[i]):\r\n count += 1\r\n colormap[i]=c[i]\r\nprint(count)\r\n", "n = int(input())\r\n\r\np = [0,0]\r\nc = [0]\r\np.extend(map(int, input().split()))\r\nc.extend(map(int, input().split()))\r\n\r\nanswer = 1\r\nfor i in range(2,n+1):\r\n if c[i]!=c[p[i]]:\r\n answer += 1\r\n\r\nprint(answer)\r\n", "from collections import deque\r\nfrom collections import defaultdict\r\n\r\ndef addEdge(a,b):\r\n graph[a].append(b)\r\n graph[b].append(a)\r\ndef Bfs(src):\r\n q = deque([])\r\n q.append(src)\r\n visited[src] = True\r\n ans = 0\r\n while(q):\r\n node = q.popleft()\r\n if node == 1:\r\n ans += 1\r\n else:\r\n if parent[node] == color[node-1]:\r\n pass\r\n else:\r\n ans += 1\r\n for neighbour in graph[node]:\r\n if(not visited[neighbour]):\r\n q.append(neighbour)\r\n visited[neighbour]= True\r\n parent[neighbour] = color[node-1]\r\n return ans\r\n\r\nn = int(input())\r\ngraph = [[] for i in range(n+1)]\r\narr = list(map(int,input().split()))\r\ncolor = list(map(int,input().split()))\r\nvisited = [False]*(n+1)\r\nparent = [-1]*(n+1)\r\nfor i in range(n-1):\r\n addEdge(i+2,arr[i])\r\nans = Bfs(1)\r\nprint(ans)\r\n\r\n \r\n", "n = int(input())\r\nes = list(map(int, input().split()))\r\ng = [[] for i in range(n)]\r\nfor i, e in enumerate(es):\r\n g[i+1].append(e-1)\r\n g[e-1].append(i+1)\r\ncols = list(map(int, input().split()))\r\nans = 0\r\nq = [[0, 0]]\r\nvis = set([0])\r\nwhile len(q) > 0:\r\n v, c = q[0][0], q[0][1]\r\n del q[0]\r\n nc = cols[v]\r\n if nc != c:\r\n ans += 1\r\n for u in g[v]:\r\n if u not in vis:\r\n vis.add(u)\r\n q.append([u, nc])\r\nprint(ans)", "nodes = int(input())\r\nparents = [None, None]\r\nparents += [int(p) for p in input().split()]\r\nfinal = [int(p) for p in input().split()]\r\ngraph = []\r\nfor i in range(nodes + 1):\r\n\tgraph.append([])\r\nfor i in range(len(parents)):\r\n\tif parents[i] is not None:\r\n\t\tgraph[parents[i]].append(i)\r\ninitial = [0]*(len(final) + 1)\r\nsteps = 0\r\nfor i in range(1, len(initial)):\r\n\tp = parents[i]\r\n\tif p is None:\r\n\t\tinitial[i] = final[i-1]\r\n\t\tsteps += 1\r\n\telif initial[p] != final[i-1]:\r\n\t\tinitial[i] = final[i-1]\r\n\t\tsteps += 1\r\n\telse:\r\n\t\tinitial[i] = final[i-1]\r\n\t\tcontinue\r\nprint(steps)", "read = lambda: list(map(int, input().split()));\r\nn = input();\r\ngraphList = read();\r\ncolorList = read();\r\n\r\ndef minSteps():\r\n steps = 0;\r\n for i in range(0, int(n) - 1):\r\n child = i + 1;\r\n parent = graphList[i] - 1;\r\n if colorList[child] != colorList[parent]:\r\n steps += 1;\r\n return steps;\r\n\r\nprint(minSteps() + 1);\r\n\r\n", "n = int(input())\r\np = [0] + list(map(int, input().split()))\r\nc = [0] + list(map(int, input().split()))\r\nres = 1\r\nmp = {i:[] for i in range(1, n + 1)}\r\nfor i in range(1, len(p)):\r\n\tmp[p[i]].append(i + 1)\r\ncol = {i:0 for i in range(1, n + 1)}\r\nq = [1]\r\nwhile q != []:\r\n\tcur = q.pop(0)\r\n\tfor i in mp[cur]:\r\n\t\tq.append(i)\r\n\tif cur == 1:\r\n\t\tcol[cur] = c[cur]\r\n\telse:\r\n\t\tcol[cur] = col[p[cur - 1]]\r\n\t\tif col[cur] != c[cur]:\r\n\t\t\tcol[cur] = c[cur]\r\n\t\t\tres += 1\r\nprint(res)", "from queue import *\r\n\r\nn=int(input())\r\nparent={}\r\nchild={}\r\nfor i in range(1,n+1):\r\n parent[i]=0\r\n child[i]=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(2,n+1):\r\n parent[i]=l[i-2]\r\n child[l[i-2]].append(i)\r\nl=list(map(int,input().split()))\r\ncolor={}\r\nfor i in range(1,n+1):\r\n color[i]=l[i-1]\r\n \r\nq=Queue()\r\nq.put(1)\r\nans=0\r\nwhile(not(q.empty())):\r\n e=q.get()\r\n c=0\r\n if(e==1):\r\n c=0\r\n else:\r\n c=color[parent[e]]\r\n if(c!=color[e]):\r\n ans+=1\r\n for i in child[e]:\r\n q.put(i)\r\n \r\nprint(ans)\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\np = [1] + list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nans = 1\r\nfor i in range(n):\r\n if(c[i]!=c[p[i]-1]): ans+=1\r\nprint(ans)", "class Node(object):\n def __init__(self, n, color):\n self.n = n\n self.color = color\n\n\ndef main():\n nv = int(input())\n l = input()\n l = l.split(' ')\n l = [int(i) for i in l]\n g = [[] for i in range(0, nv+1)]\n\n c = 2\n for v in l:\n g[v].append(c)\n c += 1\n\n colors = input()\n colors = colors.split(' ')\n colors = [0] + colors\n\n steps = 0\n queue = [Node(1, '0')]\n while len(queue) != 0:\n curr_node = queue.pop(0)\n if curr_node.color != colors[curr_node.n]:\n steps += 1\n for n in g[curr_node.n]:\n queue.append(Node(n, colors[curr_node.n]))\n\n print(steps)\n\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\nm=[]\r\np=list(map(int,input().split()))\r\nc=[0]+list(map(int,input().split()))\r\nm=[1]+[list() for i in range(n)]\r\nfor i in range(n-1):\r\n m[p[i]].append(i+2)\r\nstack=[[1,c[1]]]\r\nk=1\r\nwhile stack:\r\n x,col=stack.pop(0)\r\n for i in m[x]:\r\n if c[i]!=col:\r\n k+=1\r\n stack.append([i,c[i]])\r\nprint(k)", "from collections import defaultdict as di\r\nfrom collections import deque as dq\r\nn=int(input())\r\ncoupl = di(list)\r\nnodess = [int(x)-1 for x in input().split()]\r\nfor i in range(n-1):\r\n node = nodess[i]\r\n coupl[i+1].append(node)\r\n coupl[node].append(i+1)\r\n\r\ncolors = [int(x)-1 for x in input().split()]\r\n\r\nQ=dq()\r\nfound=set()\r\nQ.append((0,0))\r\nparent = [-1]*n\r\norder = []\r\nwhile Q:\r\n node,p = Q.popleft()\r\n if node in found:\r\n continue\r\n found.add(node)\r\n parent[node]=p\r\n order.append(node)\r\n for nei in coupl[node]:\r\n Q.append((nei,node))\r\n\r\ncolor = [-1]*n\r\ncount = 0\r\nfor node in order:\r\n if colors[node]==color[parent[node]]:\r\n pass\r\n else:\r\n count+=1\r\n color[node]=colors[node]\r\n\r\nprint(count)\r\n", "from collections import deque\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\ncol_dict={i+1:k[i] for i in range(n)}\r\nd={i:[] for i in range(1,n+1)}\r\nc=2\r\n\r\nfor i in l:\r\n d[i].append(c)\r\n \r\n c+=1\r\ncol=[0 for i in range(n+1)]\r\nq=deque()\r\nq.append(1)\r\nans=0\r\nwhile q:\r\n a=q.popleft()\r\n if col[a]==col_dict[a]:\r\n for i in d[a]:\r\n q.append(i)\r\n continue\r\n color=col_dict[a]\r\n col[a]=color\r\n stack=[a]\r\n while stack:\r\n z=stack.pop()\r\n for i in d[z]:\r\n col[i]=color\r\n stack.append(i)\r\n for i in d[a]:\r\n q.append(i)\r\n \r\n ans+=1\r\n \r\nprint(ans) \r\n \r\n \r\n", "import sys\r\nsys.setrecursionlimit(20000)\r\nn = int(input())\r\ngraph = {}\r\nlist_ = list(map(int, input().split()))\r\ncolors = list(map(int, input().split()))\r\nfor i in range(0,n):\r\n graph[i+1] = []\r\nfor i in range(0,n-1):\r\n graph[list_[i]].append(i+2)\r\ndef dfs(node, color, visited,colors):\r\n if color == colors[node-1]:\r\n count =0\r\n else:\r\n count = 1\r\n color = colors[node - 1]\r\n for n in graph[node]:\r\n if visited.get(n,False) == False:\r\n visited[node] = True\r\n count += dfs(n, color, visited,colors)\r\n return count\r\n\r\nprint(1 + dfs(1, colors[0], {},colors))\r\n \r\n", "\n\nn = int(input())\n\nT = [int(x) for x in input().split()]\n\nC = [int(x) for x in input().split()]\n\nT_inv = [[] for _ in range(n)]\n\nfor i in range(n - 1):\n T_inv[T[i] - 1] += [i + 1]\n\nresult = 1\n\n#for i in range(n):\n# print(T_inv[i])\n\nfor i in range(n):\n for child in T_inv[i]:\n if C[i] != C[child]:\n result += 1\n\nprint(result)\n", "import sys\nfrom collections import deque\ninput=sys.stdin.readline\nn=int(input())\ndict={}\nfor i in range(n):\n\tdict[i]=[]\nl1=list(map(int,input().split())) \nfor i in range(0,n-1):\n\tdict[i+1].append(l1[i]-1)\n\tdict[l1[i]-1].append(i+1)\n# print(dict)\nl2=list(map(int,input().split())) \ndef bfs(start,n,visited,l2,color):\n\tcount=0\n\n\t# l2=[i+1]\n\tcolor[start]=l2[start]\n\t# print(color)\n\tq=[start]\n\tq=deque(q)\n\tcount+=1\n\tvisited[start]=1\n\twhile (len(q)!=0):\n\t\ty=dict[q[0]]\n\t\tfor j in y:\n\t\t\tif(visited[j]==0):\n\t\t\t\t# print(j,\" \",color,\" \",count)\n\t\t\t\tif(color[q[0]]!=l2[j]):\n\n\t\t\t\t\tcount+=1\n\t\t\t\t\tcolor[j]=l2[j]\n\t\t\t\telse:\n\t\t\t\t\tcolor[j]=l2[j]\n\t\t\t\tvisited[j]=1\n\t\t\t\t# l2.append(j)\n\t\t\t\tq.append(j)\n\t\t\t\t# count+=1\n\t\tq.popleft()\n\tprint(count)\n\nvisited=[0]*n\ncolor=[0]*n\n\n\n\nbfs(0,n,visited,l2,color)\n", "from collections import defaultdict\r\n\r\ndef bfs(src):\r\n q=[]\r\n v[src]=1\r\n q.append(src)\r\n while q:\r\n s=q.pop(0)\r\n for i in d[s]:\r\n if v[i]==0:\r\n v[i]=1\r\n q.append(i)\r\n d1[i]=s\r\n \r\n\r\nn=int(input())\r\nd=defaultdict(list)\r\nl=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nj=2\r\nfor i in range(n-1):\r\n #d[j].append(l[i])\r\n d[l[i]].append(j)\r\n j+=1\r\n#print(d)\r\nst=1\r\nl=[c[0]]*n\r\nv={}\r\nfor i in range(1,n+1):\r\n v[i]=0\r\nd1={}\r\nbfs(1)\r\nst=1\r\nl=[c[0]]*n\r\nfor i in range(1,n):\r\n node=i+1\r\n parent=d1[node]\r\n if c[node-1]!=c[parent-1]:\r\n st+=1\r\nprint(st)\r\n\r\n \r\n \r\n", "# https://codeforces.com/problemset/problem/902/B\nfrom collections import deque\nn = int(input())\nadj = {i:[] for i in range(n)}\nfor ind,val in enumerate(input().split()):\n adj[int(val)-1].append(ind+1)\n# print(adj)\ncolors = [x for x in input().split()]\nq = deque()\nq.append([0,0])\ncnt = 0\nwhile len(q):\n node,color = q.popleft()\n # print(node)\n if colors[node]!=color:\n cnt+=1\n for x in adj[node]:\n q.append([x,colors[node]])\nprint(cnt)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n \r\ncol=1 #root\r\n\r\nfor i in range(2,n+1):\r\n if c[i-1]!=c[p[i-2]-1]:\r\n col+=1\r\n\r\nprint(col)", "N = int(input())\r\nparent = {}\r\nfor i in range(1, N+1): parent[i] = 0\r\nls = list(map(int, input().split()))\r\nfor i in range(2, N+1): parent[i] = ls[i-2]\r\nls = list(map(int, input().split()))\r\ncolor = {}\r\nfor i in range(1, N+1): color[i] = ls[i-1]\r\ncnt = 1\r\nfor i in range(2, N+1):\r\n if color[i]!=color[parent[i]]:\r\n cnt+=1\r\nprint(cnt)\r\n", "import sys\r\nsys.setrecursionlimit(100000)\r\na = int(input())\r\nconnections = list(map(int,input().split()))\r\ncolor_scheme = list(map(int,input().split()))\r\ngraph1 = {}\r\ngraph = {}\r\ncolor_count = [0]*(a+1)\r\ncount = 0\r\nvisited = {}\r\nfor i in range(1,a+1):\r\n graph1[i] = []\r\nfor i in range(len(connections)):\r\n graph1[connections[i]].append(i+2)\r\nfor i in range(1,a+1):\r\n if graph1[i] != []:\r\n graph[i] = graph1[i]\r\ndef dfs(color,node):\r\n global count \r\n if visited.get(node,False):\r\n return \r\n if color!=color_scheme[node-1]:\r\n count+=1\r\n visited[node]=True\r\n color_count[node-1]=color_scheme[node-1]\r\n color=color_count[node-1]\r\n if graph.get(node,-1) != -1:\r\n for i in graph[node]:\r\n dfs(color,i)\r\ndfs(0,1)\r\nprint(count)", "from collections import deque as dq\n\nn = int(input())\n\ngraph = {i: [] for i in range(n)}\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nfor i in range(n-1):\n graph[a[i]-1].append(i+1)\n\nd = dq()\nd.append([b[0], 0])\nans = 1\nwhile len(d) > 0:\n color, pos = d.popleft()\n for k in graph[pos]:\n if b[k] != color:\n ans += 1\n\n d.append([b[k], k])\n\nprint(ans)\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nans = 0\r\np2 = [pow(i, n, mod) for i in range(k + 1)]\r\ndp0 = [1] * (k + 1)\r\ndp = [0] * (k + 1)\r\ncnt = 0\r\nfor i in range(2, k + 1):\r\n dp0i = dp0[i]\r\n dp[i] += dp0i\r\n dp[i] %= mod\r\n c = 2\r\n for j in range(2 * i, k + 1, i):\r\n dp0[j] -= dp0i\r\n dp0[j] %= mod\r\n dp[j] += (p2[c] - p2[c - 1]) % mod * dp0i % mod\r\n dp[j] %= mod\r\n c += 1\r\n cnt += dp[i]\r\n cnt %= mod\r\n ans += ((p2[i] - cnt) % mod) ^ i\r\n ans %= mod\r\nprint(ans)", "mod=10**9+7\r\ndef fpow(x,k):\r\n res=1\r\n while k:\r\n if k&1:\r\n res=res*x%mod\r\n x=x*x%mod\r\n k>>=1\r\n return res\r\n\r\ndef moebius_table(n):\r\n *p, = range(n+1)\r\n sq = int(n**.5)\r\n for x in range(2, sq+1):\r\n if p[x] == x:\r\n for y in range(x*x, n+1, x):\r\n p[y] = x\r\n for y in range(x*x, n+1, x*x):\r\n p[y] = 0\r\n res = [0]*(n+1)\r\n res[0] = 0; res[1] = 1\r\n for x in range(2, n+1):\r\n res[x] = (p[x] and -res[x//p[x]])\r\n return res\r\n\r\nn,k=map(int,input().split())\r\npows=[fpow(i,n) for i in range(k+1)]\r\nmt=moebius_table(k)\r\nd=[0]*(k+1)\r\nfor i in range(1,k+1):\r\n res=0\r\n tmp=1\r\n while tmp*i<=k:\r\n d[tmp*i]+=(pows[tmp]-res)*mt[i]\r\n d[tmp*i]%=mod\r\n res=pows[tmp]\r\n tmp+=1\r\n\r\nans=0\r\ntmp=0\r\nfor i in range(1,k+1):\r\n tmp+=d[i]\r\n tmp%=mod\r\n ans+=tmp^i\r\nprint(ans%mod)", "def degree(a, b, mod):\r\n c = 1\r\n while b:\r\n if b & 1:\r\n c = (c * a) % mod\r\n a = (a * a) % mod\r\n b >>= 1\r\n return c\r\n\r\nn, k = map(int, input().split())\r\nmn = 2000010\r\nN = 2000000\r\nmod = 1000000007\r\ndeg = [0] * mn\r\ndiff = [0] * mn\r\ninp = [0] * mn\r\nmu_fun = [0] * mn\r\nsim = [0] * mn\r\nall = 0\r\ncomp = [False] * mn\r\n\r\nmu_fun[1] = 1\r\nfor i in range(2, N + 1):\r\n if not comp[i]:\r\n all += 1\r\n sim[all] = i\r\n mu_fun[i] = -1\r\n j = 1\r\n while j <= all and i * sim[j] <= N:\r\n comp[i * sim[j]] = True\r\n if i % sim[j] == 0:\r\n mu_fun[i * sim[j]] = 0\r\n break\r\n mu_fun[i * sim[j]] = -mu_fun[i]\r\n j += 1\r\n\r\nfor i in range(1, k + 1):\r\n deg[i] = degree(i, n, mod)\r\n diff[i] = (deg[i] - deg[i - 1]) % mod\r\nres = 0\r\nsum_val = 0\r\nfor i in range(1, k + 1):\r\n for j in range(1, k // i + 1):\r\n inp[i * j] += mu_fun[j] * diff[i]\r\n inp[i * j] %= mod\r\nfor i in range(1, k + 1):\r\n sum_val += inp[i]\r\n sum_val = (sum_val % mod + mod) % mod\r\n res += (sum_val ^ i) % mod\r\n res %= mod\r\nprint(res)# 1692439753.5671709" ]

[ "x,y,a,b=map(int,input().split())\r\nd=list()\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if j<i:\r\n d.append((i,j))\r\nprint(len(d))\r\nfor el in d:\r\n print(*el)", "x,y,a,b=map(int,input().split())\r\ns=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i<=j:\r\n break\r\n s.append((i,j))\r\nprint(len(s))\r\nfor i in s:\r\n print(*i)", "x, y, a, b = list(map(int, input().split()))\nresult = []\nfor i in range(a, x + 1):\n for j in range(b, y + 1):\n if(i > j):\n result.append(f\"{i} {j}\")\n\nprint(len(result))\nfor res in result:\n print(res)", "x,y,a,b = map(int, input().split())\r\n\r\ngames = []\r\n\r\nfor i in range(a,x+1):\r\n if (i <= b): continue\r\n else:\r\n for j in range(b,y+1):\r\n if i > j:\r\n games.append((i,j))\r\n\r\nprint(len(games))\r\nfor i in games:\r\n print(f\"{i[0]} {i[1]}\")", "\r\n\r\nx, y, a, b = map(int, input().split())\r\nl = []\r\nfor i in range(a, x + 1):\r\n\tfor j in range(b, y + 1):\r\n\t\tif i > j:\r\n\t\t\tl.append([i, j])\r\n\r\nl.sort()\r\nprint(len(l))\r\nfor i in l:\r\n\tprint(*i)\r\n\r\n", "x,y,a,b=map(int,input().split())\r\nc=0\r\nxx=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n \r\n if(i>j):\r\n c+=1\r\n xx.append([i,j])\r\nprint(c)\r\nfor i in range(c):\r\n print(xx[i][0],xx[i][1])\r\n\r\n\r\n \r\n", "x, y, a, b = [int(i) for i in input().split()]\n\nleft = x - a\n\nif left + a <= b:\n print(0)\n exit()\n\nans = []\n\nfor i in range(max(a, b+1), x+1):\n for j in range(b, min(i, y+1)):\n ans.append([i, j])\n\nprint(len(ans))\nfor i in ans:\n print(i[0], i[1])\n", "x,y,a,b=map(int,input().split())\nans=[]\nfor i in range(a,x+1):\n for j in range(b,y+1):\n if i>j:\n ans.append((i,j))\nans=sorted(ans)\nprint(len(ans))\nfor i in ans:\n print(str(i[0])+\" \"+str(i[1]))\n \t\t\t \t \t\t \t \t \t\t\t \t", "x,y,a,b=map(int,input().split())\r\ni=a\r\nl=[]\r\nwhile i<=x:\r\n\tj=b\r\n\tif i<=j:\r\n\t\ti+=1\r\n\telse:\r\n\t\twhile j<i and j<=y:\r\n\t\t\tz=[i,j]\r\n\t\t\tl.append(z)\r\n\t\t\tj+=1\r\n\t\ti+=1\r\nprint(len(l))\r\nfor x in l:\r\n\tprint(x[0],x[1])\r\n", "alll = [];\r\nx, y, a, b = [int(x) for x in input().split()]\r\nfor i in range(a, x+1):\r\n for j in range(b, y+1):\r\n if i > j:\r\n alll.append((i, j))\r\nprint(len(alll))\r\nprint(\"\\n\".join([\" \".join([str(x) for x in v]) for v in alll]))", "X = list(map(int, input().split()))\r\nAnswers = []\r\nfor i in range(X[2], X[0] + 1):\r\n for j in range(X[3], min(X[1] + 1, i)):\r\n Answers.append(str(i) + \" \" + str(j))\r\nprint(len(Answers))\r\nprint(*Answers, sep=\"\\n\")\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 647\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(x, y, a, b):\r\n ans = []\r\n for i in range(a, x + 1):\r\n for j in range(b, y + 1):\r\n if i > j:\r\n ans.append((i, j))\r\n return ans\r\n\r\ndef main():\r\n x, y, a, b = map(int, input().split())\r\n ans = solve(x, y, a, b)\r\n print(len(ans))\r\n for i in range(len(ans)):\r\n print('%d %d' % (ans[i][0], ans[i][1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x,y,a,b=list(map(int,input().split()))\r\nn,m=a,b\r\nans,c=[],0\r\nfor i in range(n,x+1):\r\n for j in range(m,y+1):\r\n if i>j:\r\n ans.append([i,j])\r\n c+=1\r\nprint(c)\r\nfor i,j in ans:\r\n print(i,j)", "\r\n\r\nx, y, a, b = map(int, input().split())\r\n\r\nn = 0\r\noutcomes = []\r\nfor i in range(max(a, b + 1), x + 1):\r\n for j in range(b, min(i, y + 1)):\r\n n += 1\r\n outcomes.append((i, j))\r\nprint (n)\r\nfor a, b in outcomes:\r\n print (a, b)", "x, y, a, b = map(int,input().split())\r\nv_possible = list(range(a,x+1))\r\np_possible = list(range(b,y+1))\r\nout = []\r\nout_cnt = 0\r\nfor v in v_possible:\r\n for p in p_possible:\r\n if v>p:\r\n out_cnt +=1\r\n out.append((v,p))\r\nprint(out_cnt)\r\nfor o in out:\r\n print(o[0],o[1])", "x, y, a, b = map(int, input().split())\r\ncounter = 0\r\nans = []\r\nfor i in range(a, x+1):\r\n for j in range(b, min(i-1, y)+1):\r\n counter += 1\r\n ans.append([i, j])\r\nprint(counter)\r\nfor i in range(counter):\r\n print(ans[i][0], ans[i][1])\r\n# FMZJMSOMPMSL\r\n", "def headsOrTails(x,y,a,b):\n\ttemp = [] \n\tcount=0\n\ti=x\n\twhile i>=a:\n\t\tj=y\n\t\twhile j>=b:\n\t\t\tif i>j:\n\t\t\t\ttemp.append([i,j])\n\t\t\tj-=1\n\t\ti-=1\n\tprint(len(temp))\n\ttemp.sort()\n\tfor i in range(len(temp)):\n\t\tprint(temp[i][0],\" \",temp[i][1])\n\nx,y,a,b = input().split()\nheadsOrTails(int(x),int(y),int(a),int(b))\n\n", "x,y,a,b=input().split(' ')\r\nx=int(x)\r\ny=int(y)\r\na=int(a)\r\nb=int(b)\r\nn=0\r\nfor i in range(a,x+1):\r\n for j in range(b,min(i,y+1)):\r\n n+=1\r\nprint(n)\r\nfor i in range(a,x+1):\r\n for j in range(b,min(i,y+1)):\r\n print(i,' ',j)\r\n", "x, y, a, b = [int(i) for i in input().split()]\r\nc = [[i, j] for i in range(a, x + 1) for j in range(b, y + 1) if i > j]\r\nprint(len(c)); [print(*i) for i in c]", "v_max, p_max, v_min, p_min = map(int, input().strip().split())\npossibilities = [(v, p) for v in range(v_min, v_max + 1) for p in range(p_min, p_max + 1) if v > p]\n\nprint(len(possibilities))\nfor game in possibilities:\n print(*game)\n", "l=list(map(int,input().split()))\r\nx=l[0]\r\ny=l[1]\r\na=l[2]\r\nb=l[3]\r\nc=0\r\nk=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j:\r\n c+=1\r\n s=str(i)+\" \"+str(j)\r\n k.append(s)\r\nprint(c)\r\nfor i in range(c):\r\n print(k[i])", "import sys\nf = sys.stdin\n#f = open(\"input.txt\", \"r\")\nx, y, a, b = map(int, f.readline().strip().split())\na1, a2 = [], []\nif a+(x-a) <= b:\n print(0)\nelse:\n for i in range(a, x+1):\n for k in range(b, y+1):\n if i > k:\n a1.append(i)\n a2.append(k)\n print(len(a1))\n for i in range(len(a1)):\n print(a1[i], a2[i])", "import os,sys,io,math\r\nfrom tokenize import Triple\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nx,y,a,b=map(int,input().split())\r\nr=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j:r.append([i,j])\r\nprint(len(r))\r\nfor i in range(len(r)):\r\n print(r[i][0],r[i][1])", "iarr = list(map(int,input().split()))\nx = iarr[0]\ny = iarr[1]\na = iarr[2]\nb = iarr[3]\nans = []\nfor i in range(a,x+1):\n\tfor j in range(b,y+1):\n\t\tif i>j:\n\t\t\tans.append((i,j))\nprint(len(ans))\nfor i in ans:\n\tprint(i[0],i[1])", "x,y,a,b=map(int,input().split())\r\nc=0\r\nl=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if(i>j):\r\n c=c+1\r\n l.append([i,j])\r\nif(c==0):\r\n print(0)\r\nelse:\r\n print(c)\r\n for i in range(c):\r\n print(*l[i])\r\n\r\n", "from sys import stdin, stdout\r\nimport sys\r\nINF=1e11\r\nimport bisect\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\nfrom collections import defaultdict \r\nimport math\r\n#for _ in range(int(stdin.readline())):\r\nx,y,a,b=get_ints()\r\nif a<=b:\r\n a=b+1\r\nans=[]\r\ni=a\r\nwhile i<=x :\r\n j=b\r\n while j<=y:\r\n if i>j:\r\n ans.append([i,j])\r\n j+=1\r\n i+=1\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i][0],ans[i][1])\r\n \r\n\r\n\r\n", "x, y, a, b = list(map(int, input().split()))\ngames = []\n\nfor i in range(a, x + 1):\n for j in range(b, y + 1):\n if j >= i:\n continue\n games.append((i, j))\n\ngames.sort()\nprint(len(games))\nfor c, d in games:\n print(c, d)\n\n", "x, y, a, b = map(int, input().split())\r\nvas, pet = a, b\r\nans = []\r\nwhile vas <= x:\r\n pet = b\r\n while pet < vas and pet <= y:\r\n ans.append([vas, pet])\r\n pet += 1\r\n vas += 1\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(*ans[i])\r\n \r\n ", "max_vasya, max_petya, min_vasya, min_petya = map(int, input().split())\r\nnum_solutions = 0\r\nsolutions = list()\r\nfor vasya in range(min_vasya, max_vasya + 1):\r\n for petya in range(min_petya, max_petya + 1):\r\n if vasya > petya:\r\n num_solutions += 1\r\n solutions.append((vasya, petya))\r\nprint(num_solutions)\r\nfor solution in solutions:\r\n print(f'{solution[0]} {solution[1]}')\r\n", "ar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\ncount = 0\r\nres = []\r\nfor i in range(ar[2], ar[0]+1):\r\n for j in range(ar[3], ar[1]+1):\r\n if i>j:\r\n count = count + 1\r\n res.append(str(i) + ' ' + str(j))\r\nprint(count)\r\nfor i in res:\r\n print(i)\r\n", "x,y,a,b=map(int,input().split())\r\nk=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if (i>j):\r\n k.append([i,j])\r\nprint (len(k))\r\nfor i in k:\r\n for j in i:\r\n print (j,end=' ')\r\n print ()\r\n", "def main():\r\n x, y, a, b = [int(c) for c in input().split()]\r\n\r\n aset = list(range(a, x+1))\r\n bset = list(range(b, y+1))\r\n\r\n res = []\r\n for aa in aset:\r\n for bb in bset:\r\n if aa > bb:\r\n res.append((aa, bb))\r\n\r\n print(len(res))\r\n for e in res:\r\n print(*e)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x,y,a,b = map(int,input().split(' '))\r\n\r\nc = []\r\n\r\nfor p in range(a,x+1):\r\n for q in range(b,y+1):\r\n if(q<p):\r\n c.append((p,q))\r\n\r\nprint(len(c))\r\nif c != []:\r\n for p in c :\r\n print(p[0],p[1])\r\n\r\n", "from collections import *\r\nimport itertools\r\nimport collections\r\n\r\nX, Y, A, B = map(int, input().strip().split())\r\n\r\nans = []\r\nfor i in range(A, X + 1):\r\n for j in range(B, Y + 1):\r\n if i > j:\r\n ans += [[i, j]]\r\n\r\nprint(len(ans))\r\nfor res in ans:\r\n print(*res)", "x, y, a, b = map(int, input().split())\r\nans = []\r\nfor x1 in range(a,x+1):\r\n if x1<=b: continue\r\n for y1 in range(b,y+1):\r\n if x1>y1 and x1>=a and y1>=b: ans.append((x1,y1))\r\nprint(len(ans))\r\nfor x in ans: print(*x)", "def main():\n\tx,y,a,b=[ int(i) for i in input().split()]\n\tl=[]\n\tcount=0\n\tfor i in range(a,x+1):\n\t\tfor j in range(b,y+1):\n\t\t\tif i>j:\n\t\t\t\tcount+=1\n\t\t\t\tl.append([i,j])\n\tprint(len(l))\n\tfor i in l:\n\t\tprint(*i)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "x,y,a,b = map(int,input().split())\nlist = []\nfor i in range(a,x+1):\n for j in range(b,y+1):\n if i>j:\n list.append([i,j])\nprint(len(list))\nfor pair in list:\n print('{} {}'.format(pair[0],pair[1]))\n ", "import sys\r\nfrom collections import defaultdict\r\nfrom random import randrange\r\nfrom copy import copy\r\nfrom math import *\r\nclass dict_(dict):\r\n RANDOM = randrange(2 ** 62)\r\n \r\n def __init__(self, dd):\r\n super().__init__({k ^ self.RANDOM: v for k, v in dd.items()})\r\n \r\n def __missing__(self, key):\r\n return 0\r\n \r\n def __setitem__(self, key, value):\r\n super().__setitem__(key ^ self.RANDOM, value)\r\n \r\n def __getitem__(self, item):\r\n return super().__getitem__(item ^ self.RANDOM)\r\n \r\n def __contains__(self, item):\r\n return super().__contains__(item ^ self.RANDOM)\r\n \r\n def items(self):\r\n for k, v in super().items():\r\n yield (k ^ self.RANDOM, v)\r\n \r\n def keys(self):\r\n for k in super().keys():\r\n yield k ^ self.RANDOM\r\n \r\n def __repr__(self):\r\n return '{0}'.format({k ^ self.RANDOM: v for k, v in super().items()})\r\n \r\ninp = lambda: sys.stdin.readline().strip()\r\nlmp = lambda: list(map(int, inp().split()))\r\nmp = lambda: map(int, inp().split())\r\niinp = lambda: int(inp())\r\nalph = [chr(ord('a') + i) for i in range(26)]\r\ninf = 10 ** 20\r\nmd = 10 ** 9 + 7\r\n\r\n\r\n\r\n#def init():\r\n\r\n\r\ndef main():\r\n \r\n x, y, a, b = mp()\r\n ans = []\r\n for i in range(a, x + 1):\r\n for j in range(b, y + 1):\r\n if i > j:\r\n ans.append([i, j])\r\n print(len(ans))\r\n for i in ans: print(*i)\r\n \r\n \r\n \r\n \r\nTTTT = 0\r\n#init()\r\nif TTTT:\r\n for _ in range(int(input())):\r\n main()\r\n print()\r\nelse:\r\n main()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y, a, b = map(int, input().split())\r\n\r\nd = []\r\nfor i in range(a, x+1):\r\n for j in range(b, min(i, y+1)):\r\n d.append((i, j))\r\n\r\nprint(len(d))\r\nfor i in d:\r\n print(*i)", "x,y,a,b=map(int,input().split())\r\nans=[]\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j: ans.append((i,j))\r\nprint(len(ans))\r\nans.sort()\r\nfor z in ans: print(z[0],z[1])\r\n\r\n \r\n", "x,y,a,b=[ int(i) for i in input().split() ]\r\n\r\nans=[]\r\ns_a=a\r\ns_b=b\r\nif a<=b:\r\n s_a=b+1\r\n s_b=b \r\n\r\nwhile s_a<=x:\r\n for i in range(s_b,min(s_a,y+1)):\r\n ans.append([s_a,i])\r\n s_a+=1\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i[0],i[1])\r\n \r\n \r\n ", "x,y,a,b=map(int,input().split())\r\nl=[]\r\nwhile a<=b and x>a:\r\n a+=1\r\nwhile a<=x:\r\n t=b\r\n while t<a and t<=y: \r\n l.append([a,t])\r\n t+=1\r\n a+=1\r\nprint(len(l))\r\nfor i in l:\r\n print(i[0],end=\" \")\r\n print(i[1])", "x, y, a, b = map(int, input().split())\r\nC = [(i,j) for i in range(max(a,b+1), x+1) for j in range(b, min(i,y+1))]\r\n \r\nprint(len(C))\r\n \r\nfor c in C:\r\n print(*c)", "def main():\n x, y, a, b = map(int, input().split())\n res = [None]\n for i in range(a, x + 1):\n si = str(i)\n for j in range(b, min(y + 1, i)):\n res.append(' '.join((si, str(j))))\n res[0] = str(len(res) - 1)\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()", "x, y, a, b = map(int, input().split())\r\nc = []\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i > j: c.append([i,j])\r\nprint(len(c))\r\nfor i in range(len(c)): print(*c[i])", "x,y,a,b = map(int,input().split())\r\nc = []\r\nfor aa in range(a,x+1):\r\n for bb in range(b, y + 1):\r\n if aa > bb:\r\n c.append([aa,bb])\r\nprint(len(c))\r\nfor x in c:\r\n print(x[0],x[1])", "x,y,a,b = map(int, input().split())\r\n\r\nfinal = []\r\nstart = a if(a > b) else b+1\r\n\r\nfor i in range(start, x+1):\r\n for j in range(b, y+1):\r\n if(i > j):\r\n final.append([i,j])\r\n\r\n else:\r\n break \r\n\r\nprint(len(final))\r\nfor i in range(len(final)):\r\n print(*final[i])\r\n\r\n", "x, y, a, b = map(int, input().split())\r\nans = []\r\nfor i in range(a, x + 1):\r\n for j in range(b, y + 1):\r\n if i > j:\r\n ans.append((i, j))\r\n\r\nprint(len(ans))\r\n[print(x[0], x[1]) for x in ans]\r\n", "x,y,a,b=map(int,input().split())\nResults=[]\nfor i in range(a,x+1):\n for j in range(b,y+1):\n if(j>=i):\n continue\n Results.append((i,j))\nprint(len(Results))\n\nResults.sort()\n\nfor item in Results:\n print(item[0],item[1])\n\n", "x,y,a,b=map(int,input().split())\r\nz=[]\r\nfor i in range(max(b+1,a),x+1):\r\n for j in range(b,min(y+1,i)):\r\n z.append([i,j])\r\nprint(len(z))\r\nfor i in z:\r\n print(i[0],i[1])", "x,y,a,b=map(int,input().split())\r\np=max(a,b+1)\r\nA=[]\r\nfor i in range(p,x+1):\r\n for j in range(b,min(i,y+1)):\r\n A.append([i,j])\r\nprint(len(A))\r\nfor i,j in A:\r\n print(i,j)", "def main():\r\n x, y, a, b = list(map(int, input().split()))\r\n ans = []\r\n for i in range(a, x+1):\r\n for j in range(b, y+1):\r\n if i > j:\r\n ans.append([i, j])\r\n ans.sort()\r\n print(len(ans))\r\n for i in range(len(ans)):\r\n print(*ans[i])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "'''\r\ncars = 100\r\nspace_in_a_car = 4.0\r\ndrivers = 30\r\npassengers = 90\r\ncars_not_driven = cars - drivers\r\ncars_driven = drivers\r\ncarpool_capacity = cars_driven * space_in_a_car\r\naverage_passengers_per_car = passengers / cars_driven\r\n\r\nprint(\"there are\" + \" \" ,cars , \"cars available\")\r\nprint(\"there are only\" + \" \" ,drivers, \"drivers only\")\r\nprint(\"there will be \" + \" \",cars_not_driven,\"empty cars today\")\r\nprint(\"We can transport\",carpool_capacity,\"people today\")\r\nprint(\"We have\" + \" \" ,passengers, \"to carpool today\")\r\nprint(\"We habe to put about\",average_passengers_per_car, \"in each other\")\r\n'''\r\n\r\nx, y, a, b = map(int, input().split())\r\nans = []\r\nfor i in range(a, x + 1, 1):\r\n for j in range(b, y + 1, 1):\r\n if i > j:\r\n ans.append((i, j))\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i][0], ans[i][1])\r\n", "vasya, petya, vh, ph = list(map(int, input().split(' ')))\n\nans = 0\nresult = ''\n\nfor i in range(vh, vasya + 1):\n\tfor j in range(ph, petya + 1):\n\t\tif i > j:\n\t\t\tans += 1\n\t\t\tresult += '%s %s\\n' % (i, j)\n\nprint(ans)\nif ans:\n\tprint(result)\n", "x , y , a , b = map(int,input('').split(' '))\nans = 0\n\nfor i in range(a,x+1):\n for j in range(b,y+1):\n if i > j :\n ans = ans+1\nprint(ans)\n\nfor i in range(a,x+1):\n for j in range(b,y+1):\n if i > j :\n print(f'{i} {j}')", "# coding=utf-8\n\nx, y, a, b = list(map(int, input().split(' ')))\nans = 0\nresult = ''\nfor i in range(a, x + 1):\n for j in range(b, y + 1):\n if i > j:\n ans += 1\n result += '%s %s\\n' % (i, j)\nprint(ans)\nif ans:\n print(result)\n", "a, b, c, d = map(int, input().split(' '))\r\n\r\nct = 0\r\nct2 = 0\r\nbadtoed= [] \r\n\r\nfor i in range(1, a+1):\r\n for j in range(1, b+1):\r\n if i > j and i >= c and j >= d:\r\n badtoed.append(str(i) + ' ' + str(j))\r\n ct += 1\r\n\r\nprint(ct)\r\nfor i in badtoed:\r\n print(i)\r\n", "x,y,a,b=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(a,101):\r\n for j in range(b,101):\r\n if((i+j)<=(x+y)) and i>j and i<=x and j<=y:\r\n arr.append([i,j])\r\nprint(len(arr))\r\nfor i in range(len(arr)):\r\n print(*arr[i])\r\n", "x,y,a,b=map(int,input().split())\r\nr=[]\r\nc=0\r\nfor i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j:\r\n r.append([i,j])\r\nprint(len(r))\r\nfor k in r:\r\n print(k[0],k[1])", "x, y, a, b = map(int, input().split())\r\n\r\nab = []\r\n\r\nfor i in range(a, x + 1):\r\n for j in range(b, min(i, y + 1)):\r\n ab += [[i, j]]\r\n \r\n \r\nprint(len(ab))\r\n\r\nfor x in ab:\r\n print(x[0],end=' ')\r\n print(x[1]) ", "def solve():\n x, y, a,b = map(int, input().split())\n\n newA = a\n\n res = []\n\n while newA <= x:\n newB = b\n\n while newB<=y and newB < newA:\n res.append((newA, newB))\n newB+=1\n \n newA+=1\n \n\n n = len(res)\n\n print(n)\n\n for x, y in res:\n print(x, y)\n \n return\n\n\nsolve()", "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 Heads_or_Tails():\r\n x,y,a,b = invr()\r\n\r\n outputStr= ''\r\n numOutcomes = 0\r\n\r\n for ci in range(a,x+1):\r\n if b <= (ci-1):\r\n for di in range(b,(ci-1)+1):\r\n if di <= y:\r\n numOutcomes += 1\r\n outputStr += str(ci) + ' ' + str(di) + '\\n'\r\n \r\n if numOutcomes == 0:\r\n print(numOutcomes)\r\n else:\r\n print(numOutcomes)\r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return\r\n\r\nHeads_or_Tails()", "\r\nx,y,a,b=(map(int,input().split()))\r\nl=[]\r\nfor i in range(a,x+1):\r\n\tfor j in range(b,y+1):\r\n\t\tif i>j:\r\n\t\t\tl.append((i,j))\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n\tprint(*l[i])\r\n", "x,y,a,b=map(int,input().split())\r\nif (a<b and (x-a)<=(b-a)) or (a==b and x<y):\r\n print(0)\r\nelse:\r\n c=0\r\n for i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j:\r\n c=c+1\r\n print(c)\r\n for i in range(a,x+1):\r\n for j in range(b,y+1):\r\n if i>j:\r\n print(i,j)\r\n \r\n \r\n", "x, y, a, b = map(int, input().split())\r\n\r\n# [a, x]\r\n# [b, y]\r\n# a > b\r\n\r\nans = []\r\nfor i in range(max(a, b + 1), x + 1):\r\n\tfor j in range(b, min(i, y + 1)):\r\n\t\tans.append('{} {}'.format(i, j))\r\nprint(len(ans))\r\nif len(ans) > 0:\r\n\tprint('\\n'.join(ans))", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_nums(nums):\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\nx, y, a, b = read_ints()\r\nres = []\r\nfor A in range(max(a, b+1), x+1):\r\n for B in range(b, min(A-1, y) + 1):\r\n res.append((A, B))\r\nprint(len(res))\r\nfor A, B in res:\r\n print(\"%d %d\" % (A, B))", "x, y, a, b = [int(x) for x in input().split()]\nl = []\nfor i in range(a, x + 1):\n\tfor j in range(b, y + 1):\n\t\tif j < i:\n\t\t\tl.append(str(i) + ' ' + str(j))\nprint(len(l))\nprint('\\n'.join(l))\n" ]

[ "n,k=map(int,input('').split()) \r\nlozung=list(input())\r\nif n-k<k:\r\n for i in range(k,n):\r\n print('RIGHT')\r\n for i in reversed(range(0,n)):\r\n print ('PRINT ',lozung[i])\r\n if i!=0:print('LEFT')\r\nelse:\r\n# print('2')\r\n for i in reversed(range(0,k-1)):\r\n print('LEFT')\r\n for i in range(n):\r\n print ('PRINT ',lozung[i])\r\n if i!=n-1:print('RIGHT')\r\n \r\n\r\n", "n, k = map(int, input().split());\r\nst=input();\r\nif (2*k)<= n:\r\n for i in range(k-1): print('LEFT');\r\n naprav='RIGHT'\r\nelse:\r\n for i in range(n-k): print('RIGHT') ;\r\n naprav='LEFT'\r\n st=st[::-1];\r\nprint('PRINT', st[0])\r\nfor i in range(1, len(st)):\r\n print(naprav);\r\n print('PRINT',st[i])\r\n", "def poster(n,k,s):\n k-=1\n if n%2 == 0:\n if k < n//2:\n while k > 0:\n print(\"LEFT\")\n k -= 1\n while k < n:\n print(\"PRINT\", s[k])\n if k != n-1:\n print(\"RIGHT\")\n k += 1\n else:\n while k < n-1:\n print(\"RIGHT\")\n k += 1\n while k > -1:\n print(\"PRINT\", s[k])\n if k != 0:\n print(\"LEFT\")\n k-=1\n else:\n if k > n//2:\n while k < n-1:\n print(\"RIGHT\")\n k += 1\n while k > -1:\n print(\"PRINT\", s[k])\n if k != 0:\n print(\"LEFT\")\n k-=1\n else:\n while k > 0:\n print(\"LEFT\")\n k -= 1\n while k < n:\n print(\"PRINT\", s[k])\n if k != n-1:\n print(\"RIGHT\")\n k += 1\n\nn,k = map(int, input().split())\ns = input()\n\nposter(n,k,s)", "n, k = map(int, input().split())\r\ns = input()\r\nif k - 1 <= n - k:\r\n for i in range(k-1, 0, -1):\r\n print(\"LEFT\")\r\n for k in range(n):\r\n print(\"PRINT \" + s[k])\r\n if k != n -1:\r\n print(\"RIGHT\")\r\nelse:\r\n for i in range(k - 1,n-1):\r\n print(\"RIGHT\")\r\n for k in range(n-1, -1, -1):\r\n print(\"PRINT \" + s[k])\r\n if k !=0 :\r\n print(\"LEFT\")\r\n\r\n\r\n", "l1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\n\r\n\r\n# 1 2 3 4 5 6 7 8 \r\n# \r\nl2 = list(input())\r\nif k > (n+1)/2:\r\n i=k-1\r\n while i<n-1:\r\n print(\"RIGHT\")\r\n i+=1\r\n l2.reverse()\r\n i=0\r\n while i<n:\r\n print(\"PRINT\",l2[i])\r\n if i!=n-1:print(\"LEFT\")\r\n i+=1\r\nelse:\r\n i = k-1\r\n while i>0:\r\n print(\"LEFT\")\r\n i-=1\r\n i=0\r\n while i<n:\r\n print(\"PRINT\",l2[i])\r\n if i!=n-1:print(\"RIGHT\")\r\n i+=1\r\n\r\n ", "n, k = map(int, input().split())\r\nk, s = k - 1, input()\r\nprint('PRINT', s[k])\r\nif k <= n - k - 1:\r\n for i in range(k - 1, -1, -1):\r\n print('LEFT')\r\n print('PRINT', s[i])\r\n for i in range(k):\r\n print('RIGHT')\r\n for i in range(k + 1, n):\r\n print('RIGHT')\r\n print('PRINT', s[i])\r\nelse:\r\n for i in range(k + 1, n):\r\n print('RIGHT')\r\n print('PRINT', s[i])\r\n for i in range(n - k - 1):\r\n print('LEFT')\r\n for i in range(k - 1, -1, -1):\r\n print('LEFT')\r\n print('PRINT', s[i])", "n,k = map(int,input().split())\r\ns = input()\r\nif n//2 >= k:\r\n for i in range(k-1):\r\n print(\"LEFT\")\r\n for i in range(n-1):\r\n print(\"PRINT\",s[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT\",s[n-1])\r\n\r\nelse:\r\n for i in range(n-k):\r\n print(\"RIGHT\")\r\n for i in range(1,n):\r\n print(\"PRINT\",s[-i])\r\n print(\"LEFT\")\r\n print(\"PRINT\",s[0])\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nif n==1:\r\n print('PRINT',end=' ')\r\n print(s[0])\r\nelif n==2 and k==2:\r\n print('PRINT',end=' ')\r\n print(s[1])\r\n print('LEFT')\r\n print('PRINT',end=' ')\r\n print(s[0])\r\nelif n==2 and k==1:\r\n print('PRINT',end=' ')\r\n print(s[0])\r\n print('RIGHT')\r\n print('PRINT',end=' ')\r\n print(s[1])\r\nelse:\r\n if k>n//2:\r\n for i in range(k,n):\r\n print('RIGHT')\r\n for i in range(n-1,0,-1):\r\n print('PRINT',end=' ')\r\n print(s[i])\r\n print('LEFT')\r\n print('PRINT',end=' ')\r\n print(s[i-1])\r\n else:\r\n for i in range(k,1,-1):\r\n print('LEFT')\r\n for i in range(n-1):\r\n print('PRINT',end=' ')\r\n print(s[i])\r\n print('RIGHT')\r\n print('PRINT',end=' ')\r\n print(s[i+1])", "n, k = map(int, input().split())\r\na, b, c, t = 'LEFT\\n', 'RIGHT\\n', 'PRINT ', input()\r\nif 2 * k > n: k, a, b, t = n - k + 1, b, a, t[:: -1]\r\nprint(a * (k - 1) + c + ('\\n' + b + c).join(t))", "n,k=map(int,input().split())\r\na=input()\r\nx=0\r\nif k>n//2:x=1;k=n-k;a=a[::-1]\r\nelse:k-=1\r\nif k:print(*[['LEFT','RIGHT'][x]]*k,sep='\\n')\r\nprint(f'PRINT {a[0]}')\r\nfor i in range(1,n):\r\n print(['LEFT','RIGHT'][1-x])\r\n print(f'PRINT {a[i]}')\r\n", "a,b=map(int,input().split());i=input()\r\nif b<=a//2:\r\n\tfor x in range(b-1):print(\"LEFT\")\r\n\tfor y in range(a):\r\n\t\tprint(\"PRINT \"+i[y])\r\n\t\tif y<(a-1):print(\"RIGHT\")\r\nelse:\r\n\tfor x in range(a-b):print(\"RIGHT\")\r\n\tfor y in range(1,a+1):\r\n\t\tprint(\"PRINT \"+i[-y])\r\n\t\tif y<a:print(\"LEFT\")", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n \r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef printRun(s, e , st, w, shif):\r\n for i in range(s, e, st):\r\n print(\"PRINT\", w[i])\r\n if i!=e-st:\r\n print(shif)\r\n\r\n\r\n\r\nanswer = 0\r\nn, k =map(int, input().split())\r\nslog = '0'+input()\r\nif n-k<k:\r\n for i in range(n-k):\r\n print(\"RIGHT\")\r\n printRun(n,0,-1, slog, \"LEFT\")\r\nelse:\r\n for i in range(1,k):\r\n print(\"LEFT\")\r\n printRun(1,n+1,1, slog, \"RIGHT\")\r\n\r\n \r\n", "n, k = map(int, input().split())\r\nslogan = input()\r\n\r\nif k > n/2:\r\n for i in range(k, n):\r\n print(\"RIGHT\")\r\n for i in range(n-1, -1, -1):\r\n print(\"PRINT\", slogan[i])\r\n if i != 0:\r\n print(\"LEFT\")\r\nelse:\r\n for i in range(k-1):\r\n print(\"LEFT\")\r\n for i in range(n):\r\n print(\"PRINT\", slogan[i])\r\n if i != n-1:\r\n print(\"RIGHT\")\r\n", "from sys import stdin\ninput = stdin.readline\n\nn, k = (int(x) for x in input().split())\ns = input()[:-1]\nif k - 1 <= n - k:\n\tprint('LEFT\\n' * (k - 1), end='')\n\tprint('PRINT', s[0])\n\tfor c in s[1::]:\n\t\tprint('RIGHT')\n\t\tprint('PRINT', c)\nelse:\n\tprint('RIGHT\\n' * (n - k), end='')\n\tprint('PRINT', s[-1])\n\tfor c in s[-2::-1]:\n\t\tprint('LEFT')\n\t\tprint('PRINT', c)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\na, b = 'LEFT', 'RIGHT'\r\nd = 0\r\nif n-k < k-1:\r\n a,b,k,s = b,a,n-k+1,s[::-1]\r\n\r\nfor i in range(k-1):\r\n print(a)\r\nfor i in range(n):\r\n print(f'PRINT {s[i]}')\r\n if i == n-1:\r\n break\r\n print(b)", "n,k=map(int,input().split())\r\ns=list(input())\r\nif(k>(n//2)):\r\n\ty=n-k\r\n\tfor i in range(y):\r\n\t\tprint('RIGHT')\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tif(i==0):\r\n\t\t\tprint('PRINT {}'.format(s[i]))\r\n\t\telse:\r\n\t\t\tprint('PRINT {}'.format(s[i]))\r\n\t\t\tprint('LEFT')\r\nelse:\r\n\ty=k-1\r\n\tfor i in range(y):\r\n\t\tprint('LEFT')\r\n\tfor i in range(len(s)):\r\n\t\tif(i==n-1):\r\n\t\t\tprint('PRINT {}'.format(s[i]))\r\n\t\telse:\r\n\t\t\tprint('PRINT {}'.format(s[i]))\r\n\t\t\tprint('RIGHT')", "n, k = (int(i) for i in input().split())\ns = input()\nm = min(k - 1, n - k)\nright = m < k - 1\nfor _ in range(m):\n print(\"RIGHT\" if right else \"LEFT\")\nif right:\n s = reversed(s)\nright = not right\nfor c in s:\n print(f\"PRINT {c}\")\n if n > 1:\n print(\"RIGHT\" if right else \"LEFT\")\n n -= 1\n", "n ,k = map(int, input().split())\r\ns = input()\r\nif k - 1 >= n - k:\r\n for i in range(n - k):\r\n print('RIGHT')\r\n for j in range(n - 1):\r\n print( 'PRINT ' + s[n - j - 1])\r\n print('LEFT')\r\n print('PRINT ' + s[0])\r\nelse:\r\n for i in range(k - 1):\r\n print('LEFT')\r\n for j in range(n - 1):\r\n print( 'PRINT ' + s[j])\r\n print('RIGHT')\r\n print('PRINT ' + s[n - 1])", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n#\r\n# без имени.py\r\n# \r\n# Copyright 2014 user <user@user-Aspire-E1-531G>\r\n# \r\n# This program is free software; you can redistribute it and/or modify\r\n# it under the terms of the GNU General Public License as published by\r\n# the Free Software Foundation; either version 2 of the License, or\r\n# (at your option) any later version.\r\n# \r\n# This program is distributed in the hope that it will be useful,\r\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n# GNU General Public License for more details.\r\n# \r\n# You should have received a copy of the GNU General Public License\r\n# along with this program; if not, write to the Free Software\r\n# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\r\n# MA 02110-1301, USA.\r\n# \r\n#\r\n\r\nimport sys\r\nimport math\r\n\r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nst = sys.stdin.readline()\r\n\r\nv = 0\r\nres = []\r\n\r\nif(k > int(n / 2)):\r\n\tres.extend( [\"RIGHT\"] * (n - k))\r\n\tres.append(\"PRINT \" + str(st[n - 1]))\r\n\tfor i in range(n - 2, -1, -1):\r\n\t\tres.append(\"LEFT\")\r\n\t\tres.append(\"PRINT \" + str(st[i]))\r\nelse:\r\n\tres.extend([\"LEFT\"]*(k - 1))\r\n\tres.append(\"PRINT \" + str(st[0]))\r\n\tfor i in range(1, n):\r\n\t\tres.append(\"RIGHT\")\r\n\t\tres.append(\"PRINT \" + str(st[i]))\r\n\r\nfor i in res:\t\t\r\n\tprint(i)\r\n", "n, x = list(map(int, input().split()))\r\n\r\ns = input()\r\nif x <= n // 2:\r\n while x > 1:\r\n print(\"LEFT\")\r\n x -= 1\r\n while x <= n:\r\n print(\"PRINT\", s[x - 1])\r\n if x == n:\r\n exit()\r\n print(\"RIGHT\")\r\n x += 1\r\nelse:\r\n while x < n:\r\n print(\"RIGHT\")\r\n x += 1\r\n while x >= 1:\r\n print(\"PRINT\", s[x - 1])\r\n if x == 1:\r\n exit()\r\n print(\"LEFT\")\r\n x -= 1\r\n \r\n", "from math import fabs\r\nlen_of_poster, stairs_position = (int(x) for x in input().split())\r\nposter = input()\r\nif fabs(stairs_position - 1) <= fabs(stairs_position - len_of_poster):\r\n\ti = stairs_position - 1\r\n\twhile i > 0:\r\n\t\tprint('LEFT')\r\n\t\ti -= 1\r\nelse:\r\n\ti = stairs_position - 1\r\n\twhile i < len_of_poster - 1:\r\n\t\tprint('RIGHT')\r\n\t\ti += 1\r\nstairs_position = i\r\nif stairs_position == 0:\r\n\twhile stairs_position < len_of_poster:\r\n\t\tif stairs_position < len_of_poster - 1:\r\n\t\t\tprint(f'PRINT {poster[stairs_position]}')\r\n\t\t\tprint('RIGHT')\r\n\t\telse:\r\n\t\t\tprint(f'PRINT {poster[stairs_position]}')\r\n\t\tstairs_position += 1\r\nelse:\r\n\twhile stairs_position >= 0:\r\n\t\tif stairs_position > 0:\r\n\t\t\tprint(f'PRINT {poster[stairs_position]}')\r\n\t\t\tprint('LEFT')\r\n\t\telse:\r\n\t\t\tprint(f'PRINT {poster[stairs_position]}')\r\n\t\tstairs_position -= 1", "n,k=map(int,input().split())\r\ns=input()\r\nw='-'*n\r\nprint(\"PRINT\",s[k-1])\r\ns=s[:k-1]+'-'+s[k:]\r\nd=False\r\nif(k>int(n/2)): d=True\r\nwhile(s!=w):\r\n if(d):\r\n if(k==n):\r\n d=1-d\r\n k-=1\r\n else: k+=1\r\n else:\r\n if(k==1):\r\n d=1-d\r\n k+=1\r\n else: k-=1\r\n print(\"RIGHT\" if d else \"LEFT\")\r\n if(s[k-1]!='-'):print(\"PRINT\",s[k-1])\r\n s=s[:k-1]+'-'+s[k:]\r\n", "a,b = map(int,input().split())\r\nNS = input()\r\nif b > a//2:\r\n for i in range(a-b):print('RIGHT')\r\n NS = NS[::-1]\r\n move = 'LEFT'\r\nelse:\r\n for i in range(b-1):print('LEFT')\r\n move = 'RIGHT'\r\nfor i in NS[:-1]:\r\n print('PRINT ' + i)\r\n print(move)\r\nprint('PRINT ' + NS[-1])\r\n ", "def solve(n, k , s):\r\n if k > n//2 and n != k:\r\n for i in range(k, n):\r\n print(\"RIGHT\")\r\n k = n\r\n elif k<=n//2 and k!=1:\r\n for j in range(1,k):\r\n print(\"LEFT\")\r\n k = 1\r\n if k == n:\r\n for l in range(n-1, -1, -1):\r\n print(\"PRINT\",s[l])\r\n if l != 0:\r\n print(\"LEFT\")\r\n else:\r\n for l in range(0, n):\r\n print(\"PRINT\",s[l])\r\n if l != n-1:\r\n print(\"RIGHT\")\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n\r\nsolve(n, k, s)", "X = list(map(int, input().split()))\r\nSentence, Status = input(), False # for status true in right and false is left\r\nStatus, X[1] = (True if abs(X[1] - X[0]) < X[1] - 1 else False), X[1] - 1\r\nTop, Bottom, Stop, Msg1, Msg2, it = X[0] - 1, -1, 0, \"RIGHT\", \"LEFT\", -1\r\nif not Status:\r\n Top, Bottom, Stop, Msg1, Msg2, it = 0, X[0], X[0] - 1, \"LEFT\", \"RIGHT\", 1\r\nwhile X[1] != Top:\r\n print(Msg1)\r\n X[1] += -1 * it\r\nwhile X[1] != Bottom:\r\n print(\"PRINT \" + Sentence[X[1]])\r\n if X[1] != Stop:\r\n print(Msg2)\r\n X[1] += it\r\n# UB_CodeForces\r\n# Advice: Keep an eye on your goals\r\n# Location: At home next to a cup of thyme tea\r\n# Caption: Not so happy because of this code \r\n", "n,k=map(int,input().split())\n\nx=input()\nt=min(n-k,k-1)\n\nans=\"\"\nif (n==1):\n ans=\"PRINT \"+x\n\nelse:\n\n if (t==n-k):\n if (t==0):\n j=n-1\n while (j>0):\n ans+=\"PRINT \"+x[j]+\"\\n\"+\"LEFT\\n\"\n j-=1\n\n ans+=\"PRINT \"+x[0]+\"\\n\"\n else:\n ans=t*\"RIGHT\\n\"\n j=n-1\n while(j>0):\n ans+=\"PRINT \"+x[j]+\"\\n\"+\"LEFT\\n\"\n j-=1\n\n ans+=\"PRINT \"+x[0]+\"\\n\"\n\n else:\n if (t==0):\n j=0\n while (j<n-1):\n ans+=\"PRINT \"+x[j]+\"\\n\"+\"RIGHT\\n\"\n j+=1\n ans+=\"PRINT \"+x[n-1]+\"\\n\"\n else:\n ans=t*\"LEFT\\n\"\n j=0\n while (j<n-1):\n ans+=\"PRINT \"+x[j]+\"\\n\"+\"RIGHT\\n\"\n j+=1\n\n ans+=\"PRINT \"+x[n-1]+\"\\n\"\n\nprint (ans)\n \n \n \n\n \n \n \n \n", "n,k=map(int,input().split())\r\ns=input()\r\nmid=n//2\r\nif k<=mid:\r\n\tfor i in range(k-1):print(\"LEFT\")\r\n\tfor i in range(len(s)):\r\n\t\tprint(\"PRINT \"+s[i])\r\n\t\tif i==len(s)-1:exit()\r\n\t\tprint(\"RIGHT\")\r\n\r\nelse:\r\n\tfor i in range(n-k,0,-1):print(\"RIGHT\")\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tprint(\"PRINT \"+s[i])\r\n\t\tif i==0:exit()\r\n\t\tprint(\"LEFT\")", "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\nClimb Stairs\r\n'''\r\n\r\ndef solve():\r\n n, k = MII()\r\n s = I().strip()\r\n\r\n left_to_right = k <= (n//2)\r\n while k > 1 and k < n:\r\n k += -1 if left_to_right else 1\r\n print('LEFT' if left_to_right else 'RIGHT')\r\n \r\n while k > 0 and k <= n:\r\n print('PRINT ' + s[k-1])\r\n k += 1 if left_to_right else -1\r\n\r\n if k > 0 and k <= n:\r\n print('RIGHT' if left_to_right else 'LEFT')\r\n\r\nsolve()", "def ladder (n,k,a):\n a = list(a)\n if k == 0 :\n print (\"PRINT\",a[0])\n for x in range(1,len(a)):\n print (\"RIGHT\")\n print (\"PRINT\", a[x])\n elif k == n:\n print (\"PRINT\",a[-1])\n for x in range(len(a)-2,-1,-1):\n print (\"LEFT\")\n print (\"PRINT\",a[x])\n else:\n if k > n//2 :\n for y in range(n-k):\n print (\"RIGHT\")\n print (\"PRINT\",a[-1])\n for x in range(len(a)-2,-1,-1):\n print (\"LEFT\")\n print (\"PRINT\",a[x])\n else:\n for y in range(k-1):\n print (\"LEFT\")\n print (\"PRINT\",a[0])\n for x in range(1,len(a)):\n print (\"RIGHT\")\n print (\"PRINT\", a[x])\n \n \n \nn,k = list(map(int,input().split()))\na = input()\nladder(n,k,a)\n", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-24 10:09:45\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\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn, k = (int(x) for x in input().split())\r\ns = input()[:-1]\r\nif k - 1 <= n - k:\r\n print('LEFT\\n' * (k - 1), end='')\r\n print('PRINT', s[0])\r\n for c in s[1::]:\r\n print('RIGHT')\r\n print('PRINT', c)\r\nelse:\r\n print('RIGHT\\n' * (n - k), end='')\r\n print('PRINT', s[-1])\r\n for c in s[-2::-1]:\r\n print('LEFT')\r\n print('PRINT', c)", "\r\na,b=map(int,input().split())\r\nc=input()\r\nd=len(c)\r\nif(d-b>=b):\r\n for i in range(b-1):\r\n print(\"LEFT\")\r\n for i in range(d-1):\r\n print(\"PRINT\",c[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT\",c[a-1])\r\nelse:\r\n for i in range(d-b):\r\n print(\"RIGHT\")\r\n for i in range(d - 1):\r\n print(\"PRINT\",c[a-1-i])\r\n print(\"LEFT\")\r\n print(\"PRINT\",c[0])\r\n", "[n, k] = [int(i) for i in input().split()]\r\ns = input()\r\n\r\nif (n-k > k-1):\r\n\ti = 0\r\n\td = 1\r\n\tfor j in range(k-1):\r\n\t\tprint('LEFT')\r\nelse:\r\n\ti = n-1\r\n\td = -1\r\n\tfor j in range(n-k):\r\n\t\tprint('RIGHT')\r\n\r\nfor j in range(n-1):\r\n\tprint('PRINT', s[i])\r\n\tprint('LEFT' if d<0 else 'RIGHT')\r\n\ti += d\r\n\r\nprint('PRINT', s[i])\r\n", "n, m = map(int, input(). split())\r\ns = input()\r\nd = 0\r\nmm = m\r\nwhile 1 > 0:\r\n if n - m <= m - 1:\r\n if mm != n and d == 0:\r\n print('RIGHT')\r\n mm += 1\r\n if mm == n and d == 0:\r\n d = 1\r\n if d == 1:\r\n if mm == 1:\r\n print('PRINT', s[mm - 1])\r\n break\r\n else:\r\n print('PRINT', s[mm - 1])\r\n print('LEFT')\r\n mm -= 1\r\n else:\r\n if mm != 1 and d == 0:\r\n print('LEFT')\r\n mm -= 1\r\n if mm == 1 and d == 0:\r\n d = 1\r\n if d == 1:\r\n if mm == n:\r\n print('PRINT', s[mm - 1])\r\n break\r\n else:\r\n print('PRINT', s[mm - 1])\r\n print('RIGHT')\r\n mm += 1\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nif n//2 < k:\r\n for _ in range(n-k):\r\n print('RIGHT')\r\n for i in range(1, n):\r\n print('PRINT', s[-i])\r\n print('LEFT')\r\n print('PRINT', s[0])\r\nelse:\r\n for _ in range(k-1):\r\n print('LEFT')\r\n for i in range(n-1):\r\n print('PRINT', s[i])\r\n print('RIGHT')\r\n print('PRINT', s[-1])", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nleft = k - 1\r\nright = n - k\r\nif left < right:\r\n print('LEFT\\n' * left, end = '')\r\n for i in range(len(s) - 1):\r\n c = s[i]\r\n print('PRINT', c)\r\n print('RIGHT')\r\n print('PRINT', s[-1])\r\nelse:\r\n print('RIGHT\\n' * right, end = '')\r\n for i in range(len(s) - 1):\r\n c = s[-i - 1]\r\n print('PRINT', c)\r\n print('LEFT')\r\n print('PRINT', s[0]) ", "a=input().split()\r\nlozung=input()\r\nn=int(a[0])\r\nk=int(a[1])\r\ntol=k-1\r\ntor=n-k\r\nif tol>tor:\r\n for i in range(tor):\r\n print('RIGHT')\r\n for i in range(1,n):\r\n print('PRINT '+lozung[n-i])\r\n print('LEFT')\r\n print('PRINT '+lozung[0])\r\nelse:\r\n for i in range(tol):\r\n print('LEFT')\r\n for i in range(n-1):\r\n print('PRINT '+lozung[i])\r\n print('RIGHT')\r\n print('PRINT '+lozung[n-1])\r\n", "n_square, k_th = map(int, input().split())\nslogan = input()\n\nif k_th - 1 < (n_square - 1) - (k_th - 1):\n while k_th - 1 > 0:\n k_th -= 1\n print(\"LEFT\")\n for i in range(n_square):\n print(f\"PRINT {slogan[i]}\")\n if i != n_square - 1:\n print(\"RIGHT\")\nelse:\n n_right = n_square - k_th\n while n_right:\n n_right -= 1\n print(\"RIGHT\")\n for i in range(n_square - 1, -1, -1):\n print(f\"PRINT {slogan[i]}\")\n if i != 0:\n print(\"LEFT\")\n", "n,k = map(int,input().split(' '))\r\ns = str(input())\r\ndiff1 = k - 1\r\ndiff2 = n - k\r\nif diff1 > diff2:\r\n while k != n:\r\n print(\"RIGHT\")\r\n k += 1\r\n while k != 1:\r\n print(\"PRINT\",s[k-1])\r\n print(\"LEFT\")\r\n k -= 1\r\n if k == 1:\r\n print(\"PRINT\",s[0])\r\nelse:\r\n while k != 1:\r\n print(\"LEFT\")\r\n k -= 1\r\n while k != n:\r\n print(\"PRINT\",s[k-1])\r\n print(\"RIGHT\")\r\n k += 1\r\n if k == n:\r\n print(\"PRINT\",s[n-1])", "n,k=map(int,input().split())\r\ns=input()\r\ni=k-1\r\nwhile i!=0 and i!=n-1:\r\n\tif n-i-1<i:\r\n\t\ti+=1\r\n\t\tprint(\"RIGHT\")\r\n\telse:\r\n\t\ti-=1\r\n\t\tprint(\"LEFT\")\r\nif i==0:\r\n\tfor x in range(n):\r\n\t\tprint(\"PRINT\",s[x])\r\n\t\tif x!=n-1:\r\n\t\t\tprint(\"RIGHT\")\r\nelse:\r\n\tfor x in range(n-1,-1,-1):\r\n\t\tprint(\"PRINT\",s[x])\r\n\t\tif x!=0:\r\n\t\t\tprint(\"LEFT\")", "n, k = [int (x) for x in input().split()]\r\n\r\ns = input()\r\n\r\nif k >= len(s)//2 + 1:\r\n for x in range(k, len(s)):\r\n print('RIGHT')\r\n for x in range(len(s), 0, -1):\r\n print('PRINT',s[x-1])\r\n if(x-1 != 0):\r\n print('LEFT')\r\nelse:\r\n for x in range(k, 1, -1):\r\n print('LEFT')\r\n for x in range(len(s)):\r\n print('PRINT',s[x])\r\n if x+1 != len(s):\r\n print('RIGHT')\r\n", "n,k=[int(x) for x in input().split()]\r\nx=input()\r\nif k>(n//2):\r\n for i in range(n-k):\r\n print(\"RIGHT\")\r\n x=x[::-1]\r\n for i in range(n-1):\r\n print(\"PRINT {}\".format(x[i]))\r\n print(\"LEFT\")\r\n print(\"PRINT {}\".format(x[n-1])) \r\nelse:\r\n for i in range(k-1):\r\n print(\"LEFT\")\r\n for i in range(n-1):\r\n print(\"PRINT {}\".format(x[i]))\r\n print(\"RIGHT\")\r\n print(\"PRINT {}\".format(x[n-1])) ", "n, k = [int(x) for x in input().split(' ')]\r\ns = input()\r\nif n - k < k:\r\n #go right\r\n print('PRINT ' + s[k-1])\r\n for i in range(k, n):\r\n print('RIGHT')\r\n print('PRINT ' + s[i])\r\n\r\n\r\n for i in range(k, n):\r\n print('LEFT')\r\n for i in range(k-2, -1, -1):\r\n print('LEFT')\r\n print('PRINT ' + s[i])\r\n\r\nelse:\r\n #go right\r\n print('PRINT ' + s[k-1])\r\n for i in range(k-2, -1, -1):\r\n print('LEFT')\r\n print('PRINT ' + s[i])\r\n\r\n for i in range(k-2, -1, -1):\r\n print('RIGHT')\r\n for i in range(k, n):\r\n print('RIGHT')\r\n print('PRINT ' + s[i])\r\n", "n, k = map(int, input().split())\nk -= 1\ns = input()\n\nif k < n//2:\n for _ in range(k):\n print(\"LEFT\")\n for i in range(n):\n print(\"PRINT\", s[i])\n if i != n-1:\n print(\"RIGHT\")\nelse:\n for _ in range(n-k-1):\n print(\"RIGHT\")\n for i in range(n-1, -1, -1):\n print(\"PRINT\", s[i])\n if i != 0:\n print(\"LEFT\")\n", "def print_char(c):\r\n print(f'PRINT {c}')\r\n \r\ndef move(n_steps, direction):\r\n for _ in range(n_steps):\r\n print(direction)\r\n\r\ndef print_forward(text):\r\n for i in range(len(text)-1):\r\n print_char(text[i])\r\n print('RIGHT')\r\n print_char(text[-1])\r\n \r\ndef print_backward(text):\r\n for i in range(len(text)-1, 0, -1):\r\n print_char(text[i])\r\n print('LEFT')\r\n print_char(text[0])\r\n\r\nn_symbols, position = map(int, input().split())\r\ntext = input()\r\nif position == n_symbols:\r\n print_backward(text)\r\nelif position == 1:\r\n print_forward(text)\r\nelse:\r\n to_right = n_symbols-position\r\n to_left = position-1\r\n if to_right < to_left:\r\n move(to_right, 'RIGHT')\r\n print_backward(text)\r\n else:\r\n move(to_left, 'LEFT')\r\n print_forward(text)", "#!/usr/bin/env python\r\n\r\ndef main():\r\n n, k = [int(c) for c in input().split()]\r\n slogan = input()\r\n\r\n if k > n // 2:\r\n for i in range(k - 1, n):\r\n print('PRINT {}'.format(slogan[i]))\r\n if i != n - 1:\r\n print('RIGHT')\r\n\r\n for i in range(k - 1, n-1):\r\n print('LEFT')\r\n\r\n for i in range(k - 2, -1, -1):\r\n print('LEFT')\r\n print('PRINT {}'.format(slogan[i]))\r\n else:\r\n for i in range(k-1, -1, -1):\r\n print('PRINT {}'.format(slogan[i]))\r\n if i != 0:\r\n print('LEFT')\r\n\r\n for i in range(k-1, 0, -1):\r\n print('RIGHT')\r\n\r\n for i in range(k, n):\r\n print('RIGHT')\r\n print('PRINT {}'.format(slogan[i]))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#enter the 2 inputs\nfirst_input = input()\nslogan_str = input()\n\nfirst_input_as_list = first_input.split(' ')\nnber_signs = int(first_input_as_list[0])\ninitial_pos = int(first_input_as_list[1])\n\n#turn slogan_str into a list\nslogan = []\nfor i in range(len(slogan_str)):\n slogan.append(slogan_str[i])\n\nif nber_signs == 1:\n print('PRINT {}'.format(slogan[0]))\nelse:\n if initial_pos <= nber_signs / 2:\n pos = initial_pos\n while pos > 1:\n print('LEFT')\n pos -= 1\n while pos < nber_signs:\n print('PRINT {}'.format(slogan[pos-1]))\n print('RIGHT')\n pos += 1\n print('PRINT {}'.format(slogan[-1]))\n else:\n pos = initial_pos # 1\n while pos < nber_signs:\n print('RIGHT')\n pos += 1\n while pos > 1:\n print('PRINT {}'.format(slogan[pos - 1]))\n print('LEFT')\n pos -= 1\n print('PRINT {}'.format(slogan[-0]))", "m,n=map(int,input().split())\r\ns=input()\r\nif n>(m//2):\r\n while n!=m:\r\n print(\"RIGHT\")\r\n n+=1\r\n while n!=1:\r\n print(\"PRINT\",s[n-1])\r\n print(\"LEFT\")\r\n n-=1\r\n print(\"PRINT\",s[n-1])\r\nelif n<=(m//2):\r\n while n!=1:\r\n print(\"LEFT\")\r\n n-=1\r\n while n!=m:\r\n print(\"PRINT\",s[n-1])\r\n print(\"RIGHT\")\r\n n+=1\r\n print(\"PRINT\",s[n-1])", "n,k=map(int,input().split())\r\na=input()\r\nk-=1\r\n\r\n\r\nif k!=0 or k!=n-1:\r\n if k>n-k-1:\r\n for i in range(n-1-k):\r\n print(\"RIGHT\")\r\n k=n-1\r\n else:\r\n for i in range(k):\r\n print(\"LEFT\")\r\n k=0\r\n\r\nif k==0:\r\n for i in range(n):\r\n print(\"PRINT\",a[i])\r\n if i<n-1:\r\n print(\"RIGHT\")\r\n\r\nelif k==n-1:\r\n for i in range(n):\r\n print(\"PRINT\",a[n-i-1])\r\n if i<n-1:\r\n print(\"LEFT\")\r\n", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\ns = input()\r\nif k <= (n+1) // 2:\r\n for i in range(k-1):\r\n print('LEFT')\r\n for i in range(n):\r\n print('PRINT', s[i])\r\n if i != n-1:\r\n print('RIGHT')\r\nelse:\r\n for i in range(n-k):\r\n print('RIGHT')\r\n for i in range(n):\r\n print('PRINT', s[n-1-i])\r\n if i != n-1:\r\n print('LEFT')\r\n\r\n\r\n\r\n", "n,k=map(int, input().split())\r\ns=input()\r\nif n-k<k-1:\r\n for i in range(n-k):\r\n print('RIGHT')\r\n for i in range(n-1,-1,-1):\r\n print('PRINT',s[i])\r\n if i>0:\r\n print('LEFT')\r\nelse:\r\n for i in range(k-1):\r\n print('LEFT')\r\n for i in range(n):\r\n print('PRINT',s[i])\r\n if i<n-1:\r\n print('RIGHT')", "n, k = map(int, input().split())\nv = input()\nd = [\"LEFT\", \"RIGHT\"]\nf = k - 1 < n - k\nm = min(k - 1, n - k)\na = []\nfor i in range(0, m):\n a.append(d[not f])\nfor i in v[:: -1 + 2 * f]:\n a.append(\"PRINT \" + i)\n a.append(d[f])\n\nprint(*a[:-1], sep=\"\\n\")\n", "n,k=map(int,input().split())\r\ns=input()\r\nf=k-1\r\nl=n-k\r\nif f<l:\r\n\tfor i in range(f):\r\n\t\tprint('LEFT')\r\n\ta=[]\r\n\tfor i in range(n):\r\n\t\ta.append('PRINT '+str(s[i]))\r\n\t\ta.append('RIGHT')\r\n\ta=a[:-1]\r\n\tfor i in a:\r\n\t\tprint(i)\r\nelse:\r\n\tfor i in range(l):\r\n\t\tprint('RIGHT')\r\n\ta=[]\r\n\tfor i in range(n-1,-1,-1):\r\n\t\ta.append('PRINT '+str(s[i]))\r\n\t\ta.append('LEFT')\r\n\ta=a[:-1]\r\n\tfor i in a:\r\n\t\tprint(i)", "import sys\r\nn,k=map(int,input().split())\r\n\r\ns=input()\r\n\r\nk-=1\r\n\r\nAns=\"\"\r\n\r\nif((k+1)>n//2):\r\n for j in range(k,n-1):\r\n Ans+=\"PRINT \"+s[j]+\"\\n\"\r\n Ans+=\"RIGHT\\n\"\r\n Ans+=\"PRINT \"+s[n-1]+\"\\n\"\r\n ind=n-1\r\n if(k>0):\r\n while(ind>=k):\r\n Ans+=\"LEFT\\n\"\r\n ind-=1\r\n for i in range(ind,0,-1):\r\n Ans+=\"PRINT \"+s[i]+\"\\n\"\r\n Ans+=\"LEFT\\n\"\r\n Ans+=\"PRINT \"+s[0]+\"\\n\"\r\n\r\nelse:\r\n for j in range(k,0,-1):\r\n Ans+=\"PRINT \"+s[j]+\"\\n\"\r\n Ans+=\"LEFT\\n\"\r\n Ans+=\"PRINT \"+s[0]+\"\\n\"\r\n ind=0\r\n if(k<n-1):\r\n while(ind<=k):\r\n Ans+=\"RIGHT\\n\"\r\n ind+=1\r\n for i in range(ind,n-1):\r\n Ans+=\"PRINT \"+s[i]+\"\\n\"\r\n Ans+=\"RIGHT\\n\"\r\n Ans+=\"PRINT \"+s[n-1]+\"\\n\"\r\nsys.stdout.write(Ans)\r\n", "n,k=map(int,input().split())\r\ns=input().strip()\r\nif n-k<k-1:\r\n for i in range(n-k):\r\n print('RIGHT')\r\n for i in reversed(range(1,n)):\r\n print('PRINT',s[i])\r\n print('LEFT')\r\n print('PRINT',s[0])\r\nelse:\r\n for i in range(k-1):\r\n print('LEFT')\r\n for i in range(n-1):\r\n print('PRINT',s[i])\r\n print('RIGHT')\r\n print('PRINT',s[n-1])\r\n", "n,k = map(int,input().split())\nbanner = input()\nif k<=(n+1)//2:\n while k>1:\n print(\"LEFT\")\n k-=1\n while k<n:\n print(\"PRINT\",banner[k-1])\n print(\"RIGHT\")\n k+=1\n print(\"PRINT\",banner[k-1])\nelse:\n while k<n:\n print(\"RIGHT\")\n k+=1\n while k>1:\n print(\"PRINT\",banner[k-1])\n print(\"LEFT\")\n k-=1\n print(\"PRINT\",banner[k-1])\n", "if __name__ == '__main__':\r\n n, t = [int(x) for x in input().split()]\r\n fila = list(input())\r\n p1 = n-t\r\n p2 = t-1\r\n if t != 1 and t != n:\r\n if p1<p2:\r\n for i in range (p1):\r\n print(\"RIGHT\")\r\n else:\r\n for i in range (p2):\r\n print(\"LEFT\")\r\n if p1<p2:\r\n for i in list(range(n-1, 0,-1)):\r\n print(\"PRINT {}\".format(fila[i]))\r\n print(\"LEFT\")\r\n print(\"PRINT {}\".format(fila[0]))\r\n else:\r\n for i in range(n-1):\r\n print(\"PRINT {}\".format(fila[i]))\r\n print(\"RIGHT\")\r\n print(\"PRINT {}\".format(fila[n-1]))\r\n ", "no_sq , pos = map(int,input().split())\r\nslogan = input()\r\nleft = pos - 1\r\nright = no_sq - pos\r\nif left > right:\r\n print('RIGHT\\n'*(right))\r\n flag = 0\r\n for i in slogan[::-1]:\r\n print('PRINT',i)\r\n if flag == no_sq-1:\r\n break\r\n print('LEFT')\r\n flag += 1\r\nelse:\r\n print('LEFT\\n'*(left))\r\n flag = 0\r\n for i in slogan:\r\n print('PRINT', i)\r\n if flag == no_sq - 1:\r\n break\r\n print('RIGHT')\r\n flag += 1", "n, k = map(int, input().split())\r\ns = input()\r\nm = n // 2\r\nif k <= m:\r\n for i in range(k - 1):\r\n print('LEFT')\r\n for i in range(len(s) - 1):\r\n print('PRINT', s[i], '\\nRIGHT')\r\n print('PRINT', s[-1])\r\nelse:\r\n for i in range(len(s) - k):\r\n print('RIGHT')\r\n for i in range(len(s) - 1, 0, -1):\r\n print('PRINT', s[i], '\\nLEFT')\r\n print('PRINT', s[0])\r\n", "\ndef main():\n n, init = [int(i) for i in input().split()]\n\n letters = list(input())\n\n toLeft = False\n toRight = False\n if(init == 1):\n toLeft = True\n elif(init == n):\n toRight = True\n elif(init > int(n/2)):\n toRight = True\n else:\n toLeft = True\n\n if(toLeft):\n for i in range(init, 1, -1):\n print('LEFT')\n \n for i in range(len(letters)):\n letter = letters[i]\n print('PRINT', letter)\n if(i != len(letters) - 1):\n print('RIGHT')\n\n if(toRight):\n for i in range(init, len(letters)):\n print('RIGHT')\n \n letters = letters[::-1]\n for i in range(len(letters)):\n letter = letters[i]\n print('PRINT', letter)\n\n if(i != len(letters) - 1):\n print('LEFT')\nmain()\n\n\t\t \t \t\t\t \t\t \t \t\t \t \t\t \t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\n\r\nd = 0\r\nif k > n//2:\r\n d = 1\r\n for i in range(n-k):\r\n print(\"RIGHT\")\r\n s = s[::-1]\r\n for i in range(n):\r\n print(f'PRINT {s[i]}')\r\n if i == n-1:\r\n break\r\n print(\"LEFT\")\r\nelse:\r\n for i in range(k-1):\r\n print(\"LEFT\")\r\n for i in range(n):\r\n print(f'PRINT {s[i]}')\r\n if i == n-1:\r\n break\r\n print(\"RIGHT\")", "def poster():\n n, k = list(map(int,input().split()))\n phrase = input()\n movements = 0\n pos = 1\n if(k-1<n/2):\n pos = 0\n if(pos==0):\n movements = k-1 + n\n for i in range(k-1):\n print('LEFT')\n for c in phrase[:-1]:\n print(f'PRINT {c}')\n print('RIGHT')\n print(f'PRINT {phrase[-1]}')\n else:\n movements = n-k + n\n for i in range(n-k):\n print('RIGHT')\n for c in phrase[-1:0:-1]:\n print(f'PRINT {c}')\n print('LEFT')\n print(f'PRINT {phrase[0]}')\n\nposter()\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\ns = input()\r\na, b = \"LEFT\", \"RIGHT\"\r\nif k + k > n:\r\n a, b, k, s = b, a, n - k, s[::-1]\r\nelse:\r\n k -= 1\r\nprint(\"\\n\".join([a] * k))\r\nprint(\"PRINT\", s[0])\r\nprint(\"\\n\".join((b + \"\\nPRINT \" + s[i]) for i in range(1, n)))", "n,k=map(int,input().split())\r\ns=input()\r\nl=k-1\r\nr=n-k\r\nif l>r:\r\n for _ in range(r):\r\n print(\"RIGHT\")\r\n k=n-1\r\nelse:\r\n for _ in range(l):\r\n print(\"LEFT\")\r\n k=0\r\n\r\n\r\nif k==n-1:\r\n for i in range(k,0,-1):\r\n print(f'PRINT {s[i]}')\r\n print(\"LEFT\")\r\n print(f\"PRINT {s[0]}\")\r\nelse:\r\n for i in range(n-1):\r\n print(f\"PRINT {s[i]}\")\r\n print(\"RIGHT\")\r\n print(f\"PRINT {s[n-1]}\")", "a, b = map(int, input().split())\nslogan = list(input())\nif b - 1 <= a - b:\n print(\"LEFT\\n\"*(b - 1), end='')\n for i in range(a - 1):\n print(f'PRINT {slogan[i]}\\nRIGHT')\n print(f'PRINT {slogan[-1]}')\nelse:\n print(\"RIGHT\\n\" * (a - b), end='')\n for i in range(a - 1):\n print(f'PRINT {slogan[-(i + 1)]}\\nLEFT')\n print(f'PRINT {slogan[0]}')\n\n \t\t\t\t \t\t\t \t\t \t\t \t \t", "user_input = input()\r\ncharacters = int(user_input.split(\" \")[0])\r\nposition = int(user_input.split(\" \")[1])-1\r\nstring = input()\r\n\r\nif position < len(string)//2:\r\n while position > 0:\r\n print(\"LEFT\")\r\n position -= 1\r\n while position < len(string)-1:\r\n print(f\"PRINT {string[position]}\")\r\n print(\"RIGHT\")\r\n position += 1\r\n print(f\"PRINT {string[position]}\")\r\nelif position >= len(string)//2:\r\n while position < len(string)-1:\r\n print(\"RIGHT\")\r\n position += 1\r\n while position > 0:\r\n # print(position)\r\n print(f\"PRINT {string[position]}\")\r\n print(\"LEFT\")\r\n position -= 1\r\n print(f\"PRINT {string[position]}\")", "n,k=map(int,input().split())\r\na=' '+input()\r\nif abs(k-1)<=abs(n-k):\r\n for i in range(k-1):\r\n print('LEFT')\r\n k=1\r\nelse:\r\n for i in range(n-k):\r\n print('RIGHT')\r\n k=n\r\nif k==1:\r\n for k in range(1,n+1):\r\n print('PRINT %c'%(a[k]))\r\n if k!=n:\r\n print('RIGHT')\r\nelse:\r\n for k in range(n,0,-1):\r\n print('PRINT %c'%(a[k]))\r\n if k!=1:\r\n print('LEFT')", "n, k = map(int, input().split())\nJ = list(input().strip())\nr = 'RIGHT'\nl = 'LEFT'\np = 'PRINT'\ns = -1\r\nf = 0\nwhile n // k != 1 and k != 1:\n print(l)\n k -= 1\nwhile n // k == 1 and k != n:\n print(r)\n k += 1\r\nif k == 1:\r\n m = r\r\n s = 1\r\nelse:\r\n m = l\r\nk = k - 1\nprint(p, J[k])\nwhile f < n - 1:\r\n print(m)\r\n k = k + s\r\n print(p, J[k])\r\n f += 1", "n,k=map(int,input().split())\r\nl=list(input())\r\nk=k-1\r\nd1=(n-1)-k\r\nd2=k\r\nif d1<d2:\r\n k+=1\r\n for i in range(n-k):\r\n print(\"RIGHT\")\r\n for i in range(len(l)-1,-1,-1):\r\n if i==0:\r\n print(\"PRINT \" + str(l[i]))\r\n else:\r\n print(\"PRINT \"+ str(l[i]))\r\n print(\"LEFT\")\r\nelif d2<=d1:\r\n for i in range(k):\r\n print(\"LEFT\")\r\n for i in range(len(l)):\r\n if i==len(l)-1:\r\n print(\"PRINT \"+ str(l[i]))\r\n else:\r\n print(\"PRINT \" + str(l[i]))\r\n print(\"RIGHT\")\r\n\r\n\r\n\r\n\r\n", "n, k = list(map(int, input().split()))\ns = input()\nif k > n // 2:\n shift = 'RIGHT'\n oshift = 'LEFT'\n dist = n - k\n s = s[::-1]\nelse:\n shift = 'LEFT'\n oshift = 'RIGHT'\n dist = k - 1\nfor _ in range(dist):\n print(shift)\nfor i, l in enumerate(s):\n print('PRINT', l)\n if i != n - 1:\n print(oshift)", "way_dir = ['LEFT', 'RIGHT']\r\n\r\nn, k = map(int, input().split())\r\ndaf = list(input())\r\n\r\nif k > (n + 1) / 2:\r\n way = 1\r\nelse:\r\n way = 0\r\n\r\nif way == 1:\r\n start_move = n - k\r\n daf = daf[::-1]\r\nelse:\r\n start_move = k - 1\r\n\r\nfor i in range(start_move):\r\n print(way_dir[way])\r\n\r\nprint(\"PRINT\", daf[0])\r\n\r\nfor i in range(n - 1):\r\n print(way_dir[not way])\r\n print(\"PRINT\", daf[i+1])\r\n", "num ,pos = input().split()\r\nslogan = input()\r\npos = int(pos)\r\n\r\ndef go():\r\n\tfor x in range(int(num)):\r\n\t\tprint(\"PRINT {}\".format(slogan[x]))\r\n\t\tif x != int(num) - 1:\r\n\t\t\tprint(\"RIGHT\")\r\ndef go2():\r\n\tfor x in range(int(num)):\r\n\t\tprint(\"PRINT {}\".format(slogan[int(num) - 1 - x]))\r\n\t\tif x != int(num) - 1:\r\n\t\t\tprint(\"LEFT\")\r\n\r\nif pos > 1 and pos < len(slogan):\r\n\tdefere = ([len(slogan) - pos , pos - 1])\r\n\tdeferance = defere.index(min(defere))\r\n\tif deferance == 0:\r\n\t\tfor x in range(len(slogan) - pos):\r\n\t\t\tprint(\"RIGHT\")\r\n\t\tgo2()\r\n\telse:\r\n\t\tfor x in range(pos - 1):\r\n\t\t\tprint(\"LEFT\")\r\n\t\tgo()\r\nelif pos == 1:go()\r\nelif pos == len(slogan):go2()\r\n\r\n", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n answer = ''\r\n\r\n if k <= n-k:\r\n answer += 'LEFT\\n'*(k-1)\r\n for i in range(n-1):\r\n answer += 'PRINT {}\\n'.format(s[i])\r\n answer += 'RIGHT\\n'\r\n answer += 'PRINT {}\\n'.format(s[n-1])\r\n else:\r\n answer += 'RIGHT\\n'*(n-k)\r\n for i in range(n-1, 0, -1):\r\n answer += 'PRINT {}\\n'.format(s[i])\r\n answer += 'LEFT\\n'\r\n answer += 'PRINT {}\\n'.format(s[0])\r\n\r\n print(answer[:-1])\r\n\r\nmain()", "e = input()\r\nL = e.split()\r\nn = int(L[0])\r\nx = int(L[1])\r\ns = input()\r\nz = len(s) - 1\r\nFlag = False\r\nif x - 1 <= n - x :\r\n for i in range(x - 1):\r\n print(\"LEFT\")\r\n Flag = True\r\nelse:\r\n for i in range(n - x):\r\n print(\"RIGHT\")\r\nif Flag == True :\r\n for i in range(len(s)):\r\n print(\"PRINT \"+s[i])\r\n if i != len(s) - 1:\r\n print(\"RIGHT\")\r\nelse:\r\n while z >= 0 :\r\n print(\"PRINT \"+s[z])\r\n if z != 0 :\r\n print(\"LEFT\")\r\n z -= 1", "n, k = map(int, input().split())\r\ns = input().strip()\r\nif k - 1 > n - k:\r\n for i in range(k, n):\r\n print(\"RIGHT\")\r\n print(\"PRINT\", s[n - 1])\r\n for i in range(n - 1, 0, -1):\r\n print(\"LEFT\")\r\n print(\"PRINT\", s[i - 1])\r\nelse:\r\n for i in range(k - 1):\r\n print(\"LEFT\")\r\n print(\"PRINT\", s[0])\r\n for i in range(1, n):\r\n print(\"RIGHT\")\r\n print(\"PRINT\", s[i])\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nif k <= n / 2:\r\n for i in range(k, 1, -1):\r\n print(\"PRINT\", s[i - 1])\r\n print(\"LEFT\")\r\n print(\"PRINT\", s[0])\r\n for i in range(k - 1):\r\n print(\"RIGHT\")\r\n for i in range(k, n):\r\n print(\"RIGHT\")\r\n print(\"PRINT\", s[i])\r\nelse:\r\n for i in range(k, n):\r\n print(\"PRINT\", s[i - 1])\r\n print(\"RIGHT\")\r\n print(\"PRINT\", s[-1])\r\n for i in range(n - k):\r\n print(\"LEFT\")\r\n for i in range(k - 1, 0, -1):\r\n print(\"LEFT\")\r\n print(\"PRINT\", s[i - 1])\r\n", "n, k = map(int, input().split())\r\nline = input()\r\nj = k - 1\r\nif n - k > k - 1:\r\n for i in range(k - 1):\r\n print(\"LEFT\")\r\n j -= 1\r\n add = \"RIGHT\"\r\nelse:\r\n for i in range(n - k):\r\n print(\"RIGHT\")\r\n j += 1\r\n add = \"LEFT\"\r\nif j == 0:\r\n for i in range(n - 1):\r\n print(\"PRINT\", line[i])\r\n print(add)\r\n print(\"PRINT\", line[-1])\r\nelse:\r\n for i in range(j, 0, -1):\r\n print(\"PRINT\", line[i])\r\n print(add)\r\n print(\"PRINT\", line[0])\r\n", "a, b = input().split()\r\na, b = int(a), int(b)\r\nq = input()\r\nif b == 1:\r\n print(\"PRINT \" + q[0])\r\n for i in range(a - 1):\r\n print(\"RIGHT\")\r\n print(\"PRINT \" + q[i + 1])\r\nelif b == a:\r\n print(\"PRINT \" + q[-1])\r\n for i in range(a - 2, -1, -1):\r\n print(\"LEFT\")\r\n print(\"PRINT \" + q[i])\r\nelif b > a // 2:\r\n for i in range(a - b):\r\n print(\"RIGHT\")\r\n print(\"PRINT \" + q[-1])\r\n for i in range(a - 2, -1, -1):\r\n print(\"LEFT\")\r\n print(\"PRINT \" + q[i])\r\nelse:\r\n for i in range(b - 1):\r\n print(\"LEFT\")\r\n print(\"PRINT \" + q[0])\r\n for i in range(a - 1):\r\n print(\"RIGHT\")\r\n print(\"PRINT \" + q[i + 1])\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nleft = False\r\nif n - k < k - 1:\r\n left = True\r\n for i in range(k, n):\r\n print(\"RIGHT\")\r\nelse:\r\n for i in range(k - 1):\r\n print(\"LEFT\")\r\n\r\nif left:\r\n for i in range(n - 1, -1, -1):\r\n print(\"PRINT \" + s[i])\r\n if i > 0:\r\n print(\"LEFT\")\r\nelse:\r\n for i in range(n):\r\n print(\"PRINT \" + s[i])\r\n if i < n - 1:\r\n print(\"RIGHT\")\r\n", "n, k = map(int, input().split())\r\ns = input().strip()\r\nif n - k >= k - 1:\r\n for i in range(k - 1):\r\n print(\"LEFT\")\r\n for i in range(n - 1):\r\n print(\"PRINT\", s[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT\", s[n - 1])\r\nelse:\r\n for i in range(n - k):\r\n print(\"RIGHT\")\r\n for i in range(n - 1, 0, -1):\r\n print(\"PRINT\", s[i])\r\n print(\"LEFT\")\r\n print(\"PRINT\", s[0])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = input().rstrip()\r\n\r\nif k - 1 < n - k:\r\n for _ in range(k - 1):\r\n print(\"LEFT\")\r\n print(\"PRINT \" + data[0])\r\n for i in range(1, n):\r\n print(\"RIGHT\")\r\n print(\"PRINT \" + data[i])\r\n\r\nelse:\r\n for _ in range(n - k):\r\n print(\"RIGHT\")\r\n print(\"PRINT \" + data[n - 1])\r\n for i in range(n - 2, -1, -1):\r\n print(\"LEFT\")\r\n print(\"PRINT \" + data[i])\r\n\r\n", "t = input()\r\nt = t.split(\" \")\r\ninpList = []\r\nfor i in range(len(t)):\r\n inpList.insert(i, int(t[i]))\r\n\r\ns = input()\r\nif inpList[1] <= int(inpList[0] / 2):\r\n while inpList[1] != 1:\r\n print(\"LEFT\")\r\n inpList[1] += -1\r\n for i in range(len(s)):\r\n print(\"PRINT {}\".format(s[i]))\r\n if i != (len(s) - 1):\r\n print(\"RIGHT\")\r\nelse:\r\n while inpList[1] != inpList[0]:\r\n print(\"RIGHT\")\r\n inpList[1] += 1\r\n i = len(s) - 1\r\n while i > -1:\r\n print(\"PRINT {}\".format(s[i]))\r\n if i != 0:\r\n print(\"LEFT\")\r\n i += -1\r\n", "n,m = map(int,input().split())\r\n\r\n\r\n\r\nt = list(input())\r\n\r\ng = t[::-1]\r\n\r\n\r\nif m==1:\r\n for j in range(n):\r\n if 0<=j<n-1:\r\n print('PRINT ',t[j])\r\n print('RIGHT')\r\n else:\r\n print('PRINT ',t[j])\r\nelif m==n:\r\n for k in range(n):\r\n if 0<=k<n-1:\r\n print('PRINT ', g[k])\r\n print('LEFT')\r\n else:\r\n print('PRINT ', g[k])\r\nelse:\r\n\r\n if m-1 < n-m:\r\n for x in range(m-1):\r\n print('LEFT')\r\n for j in range(n):\r\n if 0<=j<n-1:\r\n print('PRINT ',t[j])\r\n print('RIGHT')\r\n else:\r\n print('PRINT ',t[j])\r\n else:\r\n for aw in range(n-m):\r\n print('RIGHT')\r\n for k in range(n):\r\n if 0<=k<n-1:\r\n print('PRINT ', g[k])\r\n print('LEFT')\r\n else:\r\n print('PRINT ', g[k])\r\n \r\n \r\n \r\n", "#!/usr/bin/env pypy\r\n#for t in range(int(input())):\r\nn,pos=[int(x) for x in input().split()]\r\ns=input()\r\ncnt=0\r\nif pos > n // 2:\r\n for i in range(n - pos):\r\n print(\"RIGHT\")\r\n pos = n\r\n while(cnt<n):\r\n print(\"PRINT {}\".format(s[pos-1]))\r\n cnt+=1\r\n if n==cnt:\r\n break\r\n print(\"LEFT\")\r\n pos-=1\r\nelse:\r\n for i in range(pos - 1):\r\n print(\"LEFT\")\r\n pos = 1\r\n while(cnt<n):\r\n print(\"PRINT {}\".format(s[pos-1]))\r\n cnt+=1\r\n if n==cnt:\r\n break\r\n print(\"RIGHT\")\r\n pos+=1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int,input().split())\r\ns = input()\r\nm = n - k\r\nif m >= n//2: # --+++++\r\n i = k - 2\r\n while i >= 0:\r\n print('LEFT')\r\n i -= 1\r\n print('PRINT', s[0])\r\n i = 1\r\n while i < n:\r\n print('RIGHT')\r\n print('PRINT', s[i])\r\n i += 1\r\n \r\nelse:\r\n i = k\r\n while i < n:\r\n print('RIGHT')\r\n i += 1\r\n i = n-1\r\n print('PRINT', s[i])\r\n i = n-2\r\n while i >= 0:\r\n print('LEFT')\r\n print('PRINT', s[i])\r\n i -= 1\r\n \r\n", "n,k = map(int,input().split())\r\nt = input()\r\nif n-k >= k:\r\n\tfor i in range(k-1):\r\n\t\tprint(\"LEFT\")\r\n\tfor i in range(n):\r\n\t\tprint(\"PRINT\",t[i])\r\n\t\tif i < n-1:\r\n\t\t\tprint(\"RIGHT\")\r\nelse:\r\n\tt = t[::-1]\r\n\tfor i in range(n-k):\r\n\t\tprint(\"RIGHT\")\r\n\tfor i in range(n):\r\n\t\tprint(\"PRINT\",t[i])\r\n\t\tif i < n-1:\r\n\t\t\tprint(\"LEFT\")\r\n\r\n", "n,k =[int(i) for i in input().split()]\r\nk-=1\r\ns=input()\r\nif(k>=len(s)-1-k):\r\n while(k<len(s)-1):\r\n print('RIGHT')\r\n k+=1\r\n while(k>=0):\r\n print('PRINT '+s[k])\r\n if(k==0):\r\n break\r\n print('LEFT')\r\n k-=1\r\nelse:\r\n while(k>0):\r\n print('LEFT')\r\n k-=1\r\n while(k<len(s)):\r\n print('PRINT '+s[k])\r\n if(k==len(s)-1):\r\n break\r\n print('RIGHT')\r\n k+=1\r\n", "def solve(n: int, k: int, s: list) -> str:\r\n if n-k<k-1:\r\n for i in range(n-k):\r\n print('RIGHT')\r\n for i in range(n-1,-1,-1):\r\n print('PRINT',s[i])\r\n if i>0:\r\n print('LEFT')\r\n else:\r\n for i in range(k-1):\r\n print('LEFT')\r\n for i in range(n):\r\n print('PRINT',s[i])\r\n if i<n-1:\r\n print('RIGHT')\r\n \r\nn,k=map(int, input().split())\r\ns=input()\r\nsolve(n, k, s)\r\n ", "#include <CodeforcesSolutions.h>\r\n#include <ONLINE_JUDGE <Solution.txt(contestID = \"412\",problemID = \"B\")>.h>\r\n\"\"\"\r\n Author : thekushalghosh\r\n Team : CodeDiggers\r\n\r\n I prefer Python language over the C++ language :p :D\r\n \r\n Visit my website : thekushalghosh.github.io\r\n\"\"\"\r\nimport sys,math,cmath,time\r\nstart_time = time.time()\r\ntt = 0\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 return(input().strip())\r\ndef invr():\r\n return(map(int,input().split()))\r\n##########################################################################\r\n################# ---- THE ACTUAL CODE STARTS BELOW ---- #################\r\n\r\ndef solve():\r\n n,k = invr()\r\n s = insr()\r\n a = list(s)\r\n if k > len(a) - k + 1:\r\n q = \"LEFT\"\r\n w = [\"RIGHT\"] * (n - k)\r\n a.reverse()\r\n else:\r\n q = \"RIGHT\"\r\n w = [\"LEFT\"] * (k - 1)\r\n for i in range(len(a)):\r\n w.append(\"PRINT \" + a[i])\r\n w.append(q)\r\n w.pop()\r\n for i in range(len(w)):\r\n print(w[i])\r\n \r\n################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################\r\n##########################################################################\r\ndef main():\r\n if not ONLINE_JUDGE:\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n t = 1\r\n for tt in range(t):\r\n solve()\r\n if not ONLINE_JUDGE:\r\n print(\"Time Elapsed :\",time.time() - start_time,\"seconds\")\r\n sys.stdout.close()\r\n############## ---- USER DEFINED PROGRAMMING FUNCTIONS ---- ##############\r\ndef counter(a):\r\n q = [0] * max(a)\r\n for i in range(len(a)):\r\n q[a[i] - 1] = q[a[i] - 1] + 1\r\n return(q)\r\n\r\ndef string_counter(a):\r\n q = [0] * 26\r\n for i in range(len(a)):\r\n q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1\r\n return(q)\r\nONLINE_JUDGE = __debug__\r\nif ONLINE_JUDGE:\r\n input = sys.stdin.readline\r\n \r\nmain()\r\n", "n, k = input().split()\nn, k = int(n), int(k)\nslogan = input()\nslogan = list(slogan)\nif k > n / 2:\n while k != n:\n print(\"RIGHT\")\n k += 1\n while k >= 1:\n print(\"PRINT \" + slogan[k - 1])\n if k > 1:\n print(\"LEFT\")\n k -= 1\nelse:\n while k != 1:\n print(\"LEFT\")\n k -= 1\n while k <= n:\n print(\"PRINT \" + slogan[k - 1])\n if k < n:\n print(\"RIGHT\")\n k += 1\n\n \t \t\t\t \t\t\t \t\t\t \t \t\t\t\t\t \t\t \t", "[n, k], slogan = map(int, input().split()), input().strip()\r\nif 2 * k < n + 1:\r\n for x in range(k - 2, -1, -1):\r\n print('LEFT')\r\n print('PRINT', slogan[x])\r\n for x in range(k - 1):\r\n print('RIGHT')\r\n print('PRINT', slogan[k - 1])\r\n for x in range(k, n):\r\n print('RIGHT')\r\n print('PRINT', slogan[x])\r\nelse:\r\n for x in range(k, n):\r\n print('RIGHT')\r\n print('PRINT', slogan[x])\r\n for x in range(n - k):\r\n print('LEFT')\r\n print('PRINT', slogan[k - 1])\r\n for x in range(k - 2, -1, -1):\r\n print('LEFT')\r\n print('PRINT', slogan[x])\r\n", "l, k = list(map(int, input().split()))\nphrase = input()\n\ndef print_sw(word: str) -> str:\n\tarr = [\"PRINT \" + i for i in word]\n\treturn \"\\nRIGHT\\n\".join(arr)\n\ndef print_bw(word: str) -> str:\n\tarr = [\"PRINT \" + i for i in word[::-1]]\n\treturn \"\\nLEFT\\n\".join(arr)\n\nif k > l / 2:\n\twhile k != l:\n\t\tprint(\"RIGHT\")\n\t\tk += 1\n\tprint(print_bw(phrase))\nelse:\n\twhile k != 1:\n\t\tprint(\"LEFT\")\n\t\tk -= 1\n\tprint(print_sw(phrase))\n", "n, k=map(int,input().split())\r\nl=list(input())\r\n\r\nx=n//2\r\nif k>x:\r\n a=n-k\r\n for i in range(a):\r\n print(\"RIGHT\")\r\n \r\n for i in range(n):\r\n print(\"PRINT\",end=\" \")\r\n print(l[n-1-i])\r\n if i!=n-1:\r\n print(\"LEFT\")\r\n \r\nelse:\r\n a=k\r\n for i in range(1,k):\r\n print(\"LEFT\")\r\n \r\n for i in range(n):\r\n print('PRINT',end=\" \")\r\n print(l[i])\r\n if i!=n-1:\r\n print(\"RIGHT\")\r\n\r\n \r\n", "\r\nx=map(int,input().split())\r\ny=input()\r\nn,k=x\r\na=n-k\r\nb=k-1\r\nif k==1 or n==k:\r\n if k==1:\r\n print(\"PRINT \"+y[0])\r\n for i in range(1,n):\r\n print(\"RIGHT\")\r\n print(\"PRINT \"+y[i])\r\n else:\r\n print(\"PRINT \"+y[-1])\r\n for i in range(n-2,-1,-1):\r\n print(\"LEFT\")\r\n print(\"PRINT \"+y[i])\r\nelse:\r\n if b<=a:\r\n for j in range(b):\r\n print(\"LEFT\")\r\n for i in range(n-1):\r\n print(\"PRINT \"+y[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT \"+y[-1])\r\n else:\r\n for j in range(a):\r\n print(\"RIGHT\")\r\n for i in range(n-1,0,-1):\r\n print(\"PRINT \"+y[i])\r\n print(\"LEFT\")\r\n print(\"PRINT \"+y[0])\r\n\r\n", "def dir_print(word, dir): \r\n for i in range(len(word)): \r\n print(\"PRINT\", word[i])\r\n if i < len(word)-1 and dir != \"\": \r\n print(dir)\r\n\r\nn, k = map(int, input().split())\r\nword = input().strip()\r\nif n == 1: \r\n dir_print(word, \"\")\r\nelif k == n: \r\n dir_print(word[::-1], \"LEFT\")\r\nelif k == 1: \r\n dir_print(word, \"RIGHT\")\r\nelse: \r\n r = n-k\r\n l = k - 1\r\n if l < r: \r\n for i in range(l): \r\n print(\"LEFT\")\r\n dir_print(word, \"RIGHT\")\r\n else: \r\n for i in range(r): \r\n print(\"RIGHT\")\r\n dir_print(word[::-1], \"LEFT\")", "n = input()\r\ns = input()\r\nx = n.split()\r\nif int(x[1])-1 >= int(x[0]) // 2:\r\n for i in range(int(x[1]) - 1, int(x[0]) - 1):\r\n print(\"RIGHT\")\r\n for j in range(0, int(x[0])):\r\n if int(x[0]) - j-1 == 0:\r\n print(\"PRINT \" + s[int(x[0]) - j-1])\r\n else:\r\n print(\"PRINT \" + s[int(x[0]) - j-1] + \"\\nLEFT\")\r\nelse:\r\n for i in range(0, int(x[1]) - 1):\r\n print(\"LEFT\")\r\n for j in range(0, int(x[0])):\r\n if int(x[0])-j-1 == 0:\r\n print(\"PRINT \" + s[j])\r\n else:\r\n print(\"PRINT \" + s[j] + \"\\nRIGHT\")", "n, k = map(int, input().split())\r\ns = input()\r\nstart, ans = 0, []\r\nif 1 < k < n:\r\n diff = min(k - 1, n - k)\r\n if diff == k - 1:\r\n for i in range(diff):\r\n ans.append('LEFT')\r\n start = 1\r\n else:\r\n for i in range(diff):\r\n ans.append('RIGHT')\r\n start = n\r\nelse:\r\n if k == n:\r\n start = n\r\n if k == 1:\r\n start = 1\r\n\r\nif start == 1:\r\n for i in range(len(s)):\r\n if i < len(s) - 1:\r\n ans.append('PRINT ' + s[i])\r\n ans.append('RIGHT')\r\n else:\r\n ans.append('PRINT ' + s[i])\r\nif start == n:\r\n e = len(s) - 1\r\n while e > 0:\r\n ans.append('PRINT ' + s[e])\r\n ans.append('LEFT')\r\n e -= 1\r\n if e == 0:\r\n ans.append('PRINT ' + s[e])\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n\r\n\r\n", "(n, k) = [int(r) for r in input().split()]\r\ns = input()\r\n\r\nif k <= n // 2:\r\n while k > 1:\r\n print(\"LEFT\")\r\n k -= 1\r\n print(\"\\nRIGHT\\n\".join((\"PRINT \" + c) for c in s))\r\nelse:\r\n while k < n:\r\n print(\"RIGHT\")\r\n k += 1\r\n print(\"\\nLEFT\\n\".join((\"PRINT \" + c) for c in reversed(s)))\r\n", "n, k = list(map(int, input().split()))\nslogan = list(input())\n\nif k == 1:\n for i in range(n):\n print('PRINT ' + slogan[i])\n if i < n-1:\n print('RIGHT')\nelif k == n:\n for i in range(n-1, -1, -1):\n print('PRINT ' + slogan[i])\n if i > 0:\n print('LEFT')\nelse:\n if n%2 == 0 and k <= (n/2):\n for _ in range(k-1):\n print('LEFT')\n k = 1\n elif n%2 == 0 and k > (n/2):\n for _ in range(n-k):\n print('RIGHT')\n k = n\n elif k <= n/2:\n for _ in range(k-1):\n print('LEFT')\n k = 1\n else:\n for _ in range(n-k):\n print('RIGHT')\n k = n\n\n if k == 1:\n for i in range(n):\n print('PRINT ' + slogan[i])\n if i < n-1:\n print('RIGHT')\n else:\n for i in range(n-1, -1, -1):\n print('PRINT ' + slogan[i])\n if i > 0:\n print('LEFT')\n\t \t \t\t \t\t \t \t\t \t\t\t\t \t \t", "n, k = map(int, input().split())\r\na = input()\r\nli = []\r\nif n == k or k > n//2:\r\n\tfor i in range(n-k): li.append(\"RIGHT\")\r\n\ta = list(a)\r\n\ta.reverse()\r\n\tfor i in range(n):\r\n\t\tif i != 0:\r\n\t\t\t li.append(\"LEFT\")\r\n\t\tli.append(\"PRINT\"+ \" \" + a[i])\r\nelse:\r\n\tfor i in range(k-1): li.append(\"LEFT\")\r\n\ta = list(a)\r\n\tfor i in range(n): \r\n\t\tif i != 0:\r\n\t\t\t li.append(\"RIGHT\")\r\n\t\tli.append(\"PRINT\"+ \" \" +a[i])\r\nprint(*li, sep = \"\\n\")\r\n\t\r\n", "line = input()\nchar_length, init_pos = line.split()\nchar_length, init_pos = int(char_length), int(init_pos)\n\nline = input()\nif init_pos > char_length / 2:\n\tfor i in range(init_pos, char_length):\n\t\tprint('RIGHT')\n\tfor index, i in enumerate(reversed(line)):\n\t\tif index != 0:\n\t\t\tprint('LEFT')\n\t\tprint('PRINT', i)\nelse:\n\tfor i in range(1, init_pos):\n\t\tprint('LEFT')\n\tfor index, i in enumerate(line):\n\t\tif index != 0:\n\t\t\tprint('RIGHT')\n\t\tprint('PRINT', i)\n\t\t\n", "n,k = map(int,input().split())\r\ns = input()\r\nif k==1:\r\n\tprint(\"PRINT {}\".format(s[0]))\r\n\tfor i in range(1,n):\r\n\t\tprint(\"RIGHT\")\r\n\t\tprint(\"PRINT {}\".format(s[i]))\r\nelif k==n:\r\n\tprint(\"PRINT {}\".format(s[n-1]))\r\n\tfor i in range(n-2,-1,-1):\r\n\t\tprint(\"LEFT\")\r\n\t\tprint(\"PRINT {}\".format(s[i]))\r\nelse:\r\n\tif k<=(n//2):\r\n\t\tfor i in range(k-1):\r\n\t\t\tprint(\"LEFT\")\r\n\t\tprint(\"PRINT {}\".format(s[0]))\r\n\t\tfor i in range(1,n):\r\n\t\t\tprint(\"RIGHT\")\r\n\t\t\tprint(\"PRINT {}\".format(s[i]))\r\n\telse:\r\n\t\tfor i in range(n-k):\r\n\t\t\tprint(\"RIGHT\")\r\n\t\tprint(\"PRINT {}\".format(s[n-1]))\r\n\t\tfor i in range(n-2,-1,-1):\r\n\t\t\tprint(\"LEFT\")\r\n\t\t\tprint(\"PRINT {}\".format(s[i]))", "n, k = map(int, input().split())\r\nL = list(input())\r\nif k > n // 2:\r\n for i in range(k, n):\r\n print('RIGHT')\r\n k = n - 1\r\n while k != 0:\r\n print('PRINT', L[k])\r\n print('LEFT')\r\n k -= 1\r\n print('PRINT', L[0])\r\nelse:\r\n for i in range(k - 1):\r\n print('LEFT')\r\n k = 0\r\n while k != n - 1:\r\n print('PRINT', L[k])\r\n print('RIGHT')\r\n k += 1\r\n print('PRINT', L[n - 1])", "n, k = map(int, input().split())\r\ns = input()\r\nif n-k>=n//2:\r\n\tfor i in range(k-1):\r\n\t\tprint(\"LEFT\")\r\n\tfor i in range(n):\r\n\t\tprint(\"PRINT \"+s[i])\r\n\t\tif i!=n-1:\r\n\t\t\tprint(\"RIGHT\")\r\nelse:\r\n\tfor i in range(n-k):\r\n\t\tprint(\"RIGHT\")\r\n\tfor i in range(n):\r\n\t\tprint(\"PRINT \"+s[::-1][i])\r\n\t\tif i!=n-1:\r\n\t\t\tprint(\"LEFT\")", "n,k=map(int,input().split())\r\ns=input()\r\n# print(s[2:3])\r\nif k>n//2:\r\n\ts=s[::-1]\r\n\tfor i in range(n-k):\r\n\t\tprint(\"RIGHT\")\r\n\tprint(\"PRINT\",s[0:1])\r\n\tfor i in range(1,n):\r\n\t\tprint(\"LEFT\")\r\n\t\tprint(\"PRINT\",s[i:i+1])\r\nelif k==1:\r\n\tprint(\"PRINT\",s[0:1])\r\n\tfor i in range(1,n):\r\n\t\tprint(\"RIGHT\")\r\n\t\tprint(\"PRINT\",s[i:i+1])\r\nelse:\r\n\tfor i in range(k-1):\r\n\t\tprint(\"LEFT\")\r\n\tprint(\"PRINT\",s[0:1])\r\n\tfor i in range(1,n):\r\n\t\tprint(\"RIGHT\")\r\n\t\tprint(\"PRINT\",s[i:i+1])\t", "a = list(map(int,input().split()))\nb = input()\nif a[1] -1 < a[0] - a[1]:\n\tfor x in range(0,a[1]-1):\n\t\tprint(\"LEFT\")\n\tfor x in range(0,a[0]):\n\t\tprint(\"PRINT \" + b[x])\n\t\tif x != a[0] - 1:\n\t\t\tprint(\"RIGHT\")\nelse:\n\tfor x in range(0,a[0] - a[1]):\n\t\tprint(\"RIGHT\")\n\tfor x in range(1,a[0] + 1):\n\t\tprint(\"PRINT \" + b[-x])\n\t\tif x != a[0]:\n\t\t\tprint(\"LEFT\")", "n,k = map(int,input().split())\r\ns = list(input())\r\n\r\nif n-k < k-1:\r\n for i in range(k-1,n-1):\r\n print(\"RIGHT\")\r\n\r\n i = n-1\r\n while i > 0:\r\n print(\"{} {}\".format(\"PRINT\",s[i]))\r\n print(\"{}\".format(\"LEFT\"))\r\n i-=1\r\n print(\"{} {}\".format(\"PRINT\",s[i]))\r\nelse:\r\n i = k-1\r\n while i > 0 :\r\n print(\"LEFT\")\r\n i-=1\r\n\r\n for i in range(0,n-1):\r\n print(\"{} {}\".format(\"PRINT\", s[i]))\r\n print(\"{}\".format(\"RIGHT\"))\r\n\r\n print(\"{} {}\".format(\"PRINT\", s[n-1]))", "n,k = map(int,input().split())\r\ns = input()\r\nl = k-1\r\nr = n-k\r\nif l > r:\r\n print('RIGHT\\n'*(r),end='')\r\n cnt = 0\r\n for i in s[::-1]:\r\n print('PRINT',i)\r\n if cnt == n-1:\r\n break\r\n print('LEFT')\r\n cnt += 1\r\nelse:\r\n print('LEFT\\n'*(l),end='')\r\n cnt = 0\r\n for i in s:\r\n print('PRINT', i)\r\n if cnt == n-1:\r\n break\r\n print('RIGHT')\r\n cnt += 1", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, k = map(int, input().split())\r\nstring = list(input())\r\nif n // 2 >= k:\r\n if k == 1 or k == n:\r\n # move left\r\n for i in range(0, n-1):\r\n print(\"PRINT\", string[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT\", string[n-1])\r\n else:\r\n for k in range(abs(1 - k)):\r\n print(\"LEFT\")\r\n for i in range(0, n-1):\r\n print(\"PRINT\", string[i])\r\n print(\"RIGHT\")\r\n print(\"PRINT\", string[n-1])\r\nelse:\r\n # move right\r\n if k == 1 or k == n:\r\n i = n-1\r\n while i >= 1:\r\n print(\"PRINT\", string[i])\r\n print(\"LEFT\")\r\n i -= 1\r\n print(\"PRINT\", string[0])\r\n else:\r\n for k in range(abs(n - k)):\r\n print(\"RIGHT\")\r\n i = n - 1\r\n while i >= 1:\r\n print(\"PRINT\", string[i])\r\n print(\"LEFT\")\r\n i -= 1\r\n print(\"PRINT\", string[0])\r\n", "k, n = list(map(int, input().split()))\nslogan = input()\nres = ''\n\nif n == 1:\n for i in range(len(slogan)-1):\n print(\"PRINT %s\" % (slogan[i]))\n print(\"RIGHT\")\n print(\"PRINT %s\" % (slogan[len(slogan)-1]))\nelif n == len(slogan):\n slogan = slogan[::-1]\n for i in range(len(slogan)-1):\n print(\"PRINT %s\" % (slogan[i]))\n print(\"LEFT\")\n print(\"PRINT %s\" % (slogan[len(slogan)-1]))\n\nelif (len(slogan)/2) < n:\n for i in range(n, len(slogan)):\n print(\"RIGHT\")\n slogan = slogan[::-1]\n for i in range(len(slogan)-1):\n print(\"PRINT %s\" % (slogan[i]))\n print(\"LEFT\")\n print(\"PRINT %s\" % (slogan[len(slogan)-1]))\nelse:\n for i in range(0, n-1):\n print(\"LEFT\")\n for i in range(len(slogan)-1):\n print(\"PRINT %s\" % (slogan[i]))\n print(\"RIGHT\")\n print(\"PRINT %s\" % (slogan[len(slogan)-1]))\n \t \t\t \t \t\t \t \t\t \t \t \t \t \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 integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,k = get_int_list()\r\ns = get_string()\r\nif k == n:\r\n for i in range(n-1):\r\n pt(\"PRINT \"+s[~i])\r\n pt(\"LEFT\")\r\n pt(\"PRINT \"+s[0])\r\nelif k == 1:\r\n for i in range(n-1):\r\n pt(\"PRINT \"+s[i])\r\n pt(\"RIGHT\")\r\n pt(\"PRINT \"+s[-1])\r\nelse:\r\n if k-1 < n-k: #left is near\r\n for i in range(k-1):\r\n pt(\"LEFT\")\r\n for i in range(n-1):\r\n pt(\"PRINT \"+s[i])\r\n pt(\"RIGHT\")\r\n pt(\"PRINT \"+s[-1])\r\n\r\n else: #right is near\r\n for i in range(n-k):\r\n pt(\"RIGHT\")\r\n for i in range(n-1):\r\n pt(\"PRINT \"+s[~i])\r\n pt(\"LEFT\")\r\n pt(\"PRINT \"+s[0])" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, w, b, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ncost = list(map(int, input().split()))\r\ndp0 = [w]\r\ns = 0\r\ninf = pow(10, 15) + 1\r\nfor i, u in zip(c, cost):\r\n s += i\r\n dp = [-1] * (s + 1)\r\n v = b - u\r\n q, k = [], 0\r\n for j in range(s + 1):\r\n if j < len(dp0):\r\n dp0[j] = min(dp0[j] + x, w + j * b)\r\n y = dp0[j]\r\n while len(q) ^ k and dp0[q[-1]] - u * (j - q[-1]) <= y:\r\n q.pop()\r\n q.append(j)\r\n while len(q) ^ k and q[k] + i < j:\r\n k += 1\r\n if len(q) ^ k:\r\n dp[j] = min(dp0[q[k]] - u * (j - q[k]), w + j * b)\r\n if dp[j] < 0:\r\n dp[j] = -inf\r\n dp0 = dp\r\n while dp0[-1] < 0:\r\n dp0.pop()\r\n s -= 1\r\nans = len(dp) - 1\r\nprint(ans)" ]

[ "def my_cmp(x):\r\n if x[0] == 0:\r\n return float('inf')\r\n return x[1]/x[0]\r\n\r\ndef dis(a, b):\r\n return a*a + b*b\r\n\r\nn = int(input())\r\nv = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n v.append((x, y, i))\r\nv.sort(key = my_cmp)\r\nx, y = 0, 0\r\nans = [0]*n\r\nfor i in range(n):\r\n if dis(x+v[i][0], y+v[i][1]) < dis(x-v[i][0], y-v[i][1]):\r\n ans[v[i][2]] = 1\r\n else:\r\n ans[v[i][2]] = -1\r\n x += v[i][0]*ans[v[i][2]]\r\n y += v[i][1]*ans[v[i][2]]\r\nfor x in ans:\r\n print(x, end = ' ')", "# LUOGU_RID: 135953269\nimport sys\nfrom math import sqrt\nimport random\n\ndef dist(x, y):\n \"\"\"\n Calculate the Euclidean distance from the origin to the point (x, y).\n\n Parameters:\n - x: The x-coordinate of the point.\n - y: The y-coordinate of the point.\n\n Returns:\n - The Euclidean distance from the origin to the point (x, y).\n \"\"\"\n return sqrt(x*x + y*y)\n\ndef calculate_moves(n, v):\n \"\"\"\n Calculate the sequence of moves that Allen should make.\n\n Parameters:\n - n: The number of moves.\n - v: The list of vectors.\n\n Returns:\n - res: The sequence of moves that Allen should make.\n \"\"\"\n x, y = 0, 0\n res = [0] * n\n for i in range(n-1, -1, -1):\n if dist(x+v[i][0], y+v[i][1]) < dist(x-v[i][0], y-v[i][1]):\n x += v[i][0]\n y += v[i][1]\n res[v[i][2]] = 1\n else:\n x -= v[i][0]\n y -= v[i][1]\n res[v[i][2]] = -1\n return dist(x, y), res\n\ndef calculate_best_moves(n, v):\n best_dis, best_moves = 1e9, None\n while True:\n v = random.sample(v, len(v))\n dis, moves = calculate_moves(n, v)\n if dis < best_dis:\n best_dis, best_moves = dis, moves\n if best_dis < 1.5 * 1e6:\n break\n #print(best_dis)\n return best_moves\n\nif __name__ == \"__main__\":\n # Read input values from standard input\n n = int(sys.stdin.readline())\n v = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]\n v = [[x[0], x[1], id] for (id, x) in enumerate(v)]\n # Calculate the sequence of moves that Allen should make\n #res = calculate_best_moves(n, v)\n res = calculate_moves(n, v)[1]\n # Print the sequence of moves\n print(' '.join(map(str, res)))", "n = int(input())\r\nf = [0] * 100001\r\nx = [0] * 100001\r\ny = [0] * 100001\r\nX, Y = 0, 0\r\ndef calc(x, y):\r\n return x*x + y*y\r\nfor i in range(1, n + 1):\r\n x[i], y[i] = map(float, input().split())\r\nfor i in range(n, 0, -1):\r\n if calc(X - x[i], Y - y[i]) < calc(X + x[i], Y + y[i]):\r\n X -= x[i]\r\n Y -= y[i]\r\n f[i] = -1\r\n else:\r\n X += x[i]\r\n Y += y[i]\r\n f[i] = 1\r\nfor i in range(1, n + 1):\r\n print(f\"{f[i]}\", end=' ' if i < n else '\\n')\r\n#bobfut.near moondance" ]

[ "a = int(input())\r\nprint(a // 3 * 2 + (a % 3 > 0))", "def solve(n):\n if n == 1:\n return 1\n return n-round(n/3)\n \ndef main():\n n =int(input())\n print(solve(n))\n\nmain()", "n=int(input())\r\nprint((((n*2)+1))//3) ", "n=int(input())\r\nt=(n//3)*2\r\nprint(1+t if n%3 else t)", "n = int(input())\r\nprint(n//3*2+(n%3>0))", "print(int((int(input())*2+1)/3))", "a=int(input())\r\n[print((a//3)*2) if a%3==0 else print((a//3)*2+1)]", "n = int(input())\nk = round(n/3)\nprint(n - k)\n", "n = int(input())\r\n\r\nif(n%3 == 0):\r\n ans = (n//3)*2\r\nelse:\r\n ans = (n//3)*2 + 1\r\n\r\nprint(ans)", "n = int(input())\r\nk = 0\r\nif n in range(3,n+1,3):\r\n\ta = 2+2*((n-3)/3)\r\nelse:\r\n\ta = 3+2*(((n-n%3)-3)/3)\r\nprint(int(a))", "n = int(input())\r\nans = (n - 1) // 3 * 2 + int(n % 3 == 0) + 1\r\nprint(ans)\r\n", "n = int(input())\r\ns = (n - (n % 3))//3\r\nif n < 0:\r\n print (1)\r\nelif n % 3 == 0:\r\n print (2 * s)\r\nelif n % 3 == 1 or n % 3 == 2:\r\n print (2 * s + 1)", "n = int(input())\r\nx = n//3\r\nx *= 2\r\nif n % 3 > 0:\r\n x += 1\r\nprint(x)", "a=int(input())\r\nz=a//3*2\r\nl=a%3\r\nif l==0:z+=0\r\nif l==1:z+=1\r\nif l==2:z+=1\r\nprint(z)\r\n", "a = int(input())\ntoAdd = 0\nif a%3 !=0:\n\ttoAdd = 1\nprint(((a//3)*2)+toAdd)", "n = int(input())\r\ncounter = n//3 * 2\r\nn = n%3\r\nif n != 0:\r\n counter += 1\r\nprint(counter)", "print((lambda x: (x//3)*2+(x%3+2)//3)(int(input())))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness\r\n", "n = int(input())\r\nprint(int(n / 3) * 2 + (1 if n % 3 else 0))", "a= int(input())\r\nb= int((a*2+1)/3)\r\nprint(b)", "n = int(input())\n\nnum = n // 3\n\nif n % 3 == 1:\n print(2 * num + 1)\nelif n % 3 == 2:\n print(2 * num + 1)\nelse:\n print(2 * num)", "n = int(input())\r\nd = (n%3) != 0\r\nprint(2*(n//3) + d)", "n = int(input())\r\nif n%3 == 0:\r\n n = n // 3 * 2\r\nelse:\r\n n = n//3 * 2 + 1\r\nprint(n)", "\r\ndef main():\r\n d = int(input())\r\n c = d//3*2\r\n v = d%3\r\n if v!=0:\r\n c+=1\r\n\r\n print(c)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input()\r\nn=int(n)\r\nif(n%3==0):\r\n ans=int(n/3)*2\r\nelse :\r\n ans=int(n/3)*2+1\r\nprint(ans)\r\n", "n = int(input())\r\nans = (n//3)*2\r\nif n%3!=0:ans = ans + 1\r\nprint(ans)", "n = int(input())\r\nk = round(n/3)\r\nprint(abs(n-k))\r\n", "n = int(input())\nres = 2 * (n // 3) + (n % 3 > 0)\nprint(res)\n", "n=int(input())\r\nS=n//3\r\nif n%3==0:\r\n print(S*2+n%3)\r\nelse:\r\n print(S*2+1)\r\n", "import math\r\nn = int(input())\r\nc = math.floor(n // 3)\r\nprint(c * 2 + 1) if n % 3 != 0 else print(c * 2)\r\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\nprint(n//3*2+int(n%3!=0))", "n=int(input())\r\nprint(n//3*2+bool(n%3))", "n= int(input())\nres= (n//3)*2\nif n%3>0:\n res+=1\nprint(res)\n", "n = int(input())\r\n\r\nif(n%3==0):\r\n print(2*n//3)\r\nelif(n<3):\r\n print(1)\r\nelse:\r\n print(2*(n-n%3)//3+1)", "#Codeforces Contest 669 A (Little Artem and Presents)\r\n\r\n#--Too slow--\r\n##n = int(input(\"\"))\r\n##\r\n##count = 0\r\n##prevn = 2\r\n##while (n>2):\r\n## count += 1\r\n## if (prevn != 1):\r\n## n = n - 1\r\n## prevn = 1\r\n## else:\r\n## n = n - 2\r\n## prevn = 2\r\n## \r\n##count += 1\r\n##print (count)\r\n \r\n\r\nn = int(input(\"\"))\r\n\r\ncount = (n//3)*2\r\n\r\nif (n%3 >= 1):\r\n count += 1\r\n\r\n\r\nprint(count)\r\n\r\n \r\n \r\n", "import math\r\nn = int(input())\r\nif math.remainder(n,3) > 0:\r\n print(math.floor(n/3*2+1))\r\nelse:\r\n print(math.floor(n/3*2))", "n = int(input())\r\nif n == 1 or n == 2 :\r\n print(1)\r\nelif n == 4 or n == 5:\r\n print(3)\r\nelif n % 3 != 0:\r\n print((n//3)*2+1)\r\nelse:\r\n print((n//3)*2)", "n=int(input())\nif n%3==1 or n%3==2:\n x = 1\nelse:\n x=0\nprint((n//3)*2+x)", "n=int(input())\r\nif n<=2:\r\n print(1)\r\nelse:\r\n k=n//3\r\n p=n%3\r\n if p==0:\r\n print(k*2)\r\n else:\r\n print(1+k*2)", "n=int(input())\r\ncount=0\r\nif n==\"1\" or n=='2':\r\n print(\"1\")\r\n exit(0)\r\nelse:\r\n while n>0:\r\n n=n-1\r\n count+=1\r\n if n>=2:\r\n n=n-2\r\n count+=1\r\n else:\r\n print(count)\r\n exit(0)\r\n print(count)\r\n", "n = int(input())\r\nif n % 3 == 0:\r\n ans = (2 * n) // 3\r\nelse:\r\n ans = 2 * (n - n % 3) // 3 + 1\r\nprint(ans)", "n = int(input())\r\nx=2*(n//3)\r\nif n%3 != 0:\r\n x += 1\r\nprint(x)\r\n\r\n", "n = int(input())\r\n\r\nif n%3 == 0:\r\n print(((n//3) *2))\r\nelse:\r\n print(((n//3)*2)+1)", "n = int(input())\r\nk = round(n/3)\r\nprint(n-k)", "a=int(input())\r\nans=a//3*2\r\nif a%3!=0: ans+=1\r\nprint(ans)", "n=int(input())\r\ni=n//3*2\r\nk=n%3\r\nif k==1 or k==2:\r\n i+=1\r\nprint(i)\r\n \r\n \r\n \r\n", "n = int(input())\r\nprint((2 * n + 1)// 3)", "n = int(input())\r\nprint(2 * (n // 3) + (n % 3 + 2) // 3)", "import sys\n\n\ndef s(n):\n\n if n <3:\n return 1\n if n==3:\n return 2\n ct = (n//3) * 2 \n if n%3 ==0:\n return ct\n ct+=1\n return ct\n\nfor name in map(str.rstrip, sys.stdin):\n n = int(name)\n break\n \nres = s(n)\nprint(res)\n\t\t \t\t\t\t \t \t \t\t\t \t\t\t \t \t \t", "n = int(input())\r\nprint(n // 3 * 2 + min(1, n % 3))\r\n", "a=int(input())\r\nk=s=t=int(0)\r\nif a%3==0:\r\n\tk=(a//3)*2\r\nelse:\r\n\tk=(a//3)*2+1\r\nprint(k)", "parse_int = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\nres = (n//3)*2\r\nif n%3 > 0:\r\n res += 1\r\nprint(res)", "a = int(input())\nprint( (a//3)*2 + (1 if a%3 > 0 else 0))\n", "n = int(input())\nif n % 3 == 0:\n print(int(n / 3) * 2 )\nelif n % 3 == 1:\n print(int((n - 1) / 3) * 2 + 1)\nelif n % 3 == 2:\n print(int(((n - 1)) / 3) * 2 + 1)\n \t\t\t \t\t \t \t \t \t\t \t\t\t\t\t \t \t", "n = int(input())\nprint((n // 3) * 2 + (0 if n%3==0 else 1))\n \t\t \t \t\t\t \t\t\t \t\t \t \t \t", "n = int(input())\nif n % 3 == 2:\n n -= 1\nprint(2 * n // 3 if n % 3 == 0 else 2 * n // 3 + 1)\n", "n=int(input())\r\nflag=0\r\nif(n==1 or n==2):\r\n\tprint(1)\r\n\tflag=1\r\nif(n%3==0):\r\n\tprint((n//3)*2)\r\n\tflag=1\r\nelse:\r\n\tif(flag==0):\r\n\t\tn=n-1\r\n\t\tif(n%3==0):\r\n\t\t\tprint((n//3)*2+1)\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tn=n-1\r\n\t\t\tif(n%3==0):\r\n\t\t\t\tprint((n//3)*2+1)\r\n\t", "n=int(input())\r\na=n//3;\r\nb=n%3;\r\nif b==0:\r\n print(2*a);\r\nelse:\r\n print(2*a+1);", "n = int(input())\nans = n // 3 * 2\nif n % 3 > 0:\n ans += 1\nprint(ans)", "a=int(input())\r\nprint(2*(a//3) if not a%3 else 2*(a//3)+1)", "n = int(input())\r\nif n%3 == 0:\r\n print(n//3 * 2)\r\nelse:\r\n n = (n+1)-(n%3)\r\n print(((n-1)//3)*2 + 1)", "def qI(): \n def solve(n):\n print(n - round(n / 3))\n \n n = int(input())\n solve(n)\nqI()\n\t \t \t \t\t\t \t\t\t\t", "\r\nx=int(input())\r\nj=x//3\r\nif x%3!=0:\r\n p=1\r\nelse:\r\n p=0\r\nprint(2*j+p)", "import sys\r\n\r\nn = int(input())\r\n\r\nif n % 3 == 0:\r\n print(n//3 * 2)\r\nelse:\r\n print(n//3 * 2 + 1)\r\n\r\nsys.stdout.flush()\r\n", "n=int(input())\r\nk=(n//3)*2\r\nif n % 3>0: k+=1\r\nprint(k)\r\n", "def solve():\n N = int(input())\n\n d3 = N // 3\n\n m3 = N % 3\n\n ans = d3 * 2\n\n if m3 == 1:\n ans += 1\n elif m3 == 2:\n ans += 1\n\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn=read_int()\r\n\tprint((n//3)*2 + min(n%3, 1))\r\n\r\nsolve()\r\n", "n = int(input())\r\nans = n // 3 * 2\r\nn %= 3\r\nif n > 0:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nif n % 3 == 0 or n % 3 == 1:\r\n print(n - n // 3)\r\nelse:\r\n print(n - n // 3 - 1)", "print((2*int(input()) + 1)//3) ", "t = int(input())\r\nif t>=3: print(round(t/3*2))\r\nelse: print(1)", "n = int(input())\nq = n // 3\nr = n % 3\nif r > 0:\n print((q*2)+1)\nelse:\n print(q*2)", "import math\r\nstons = int(input())\r\ngift = 0\r\ngift = 2 * math.floor(stons / 3)\r\nif stons % 3 > 0:\r\n gift += 1\r\nprint(gift)\r\n", "n = int(input())\r\nprint((n // 3) * 2 + min(1, n % 3))", "n = int(input())\r\nans = int((n//3)*2)\r\nprint(ans+1 if n%3 else ans)", "n=int(input())\r\nif(n==1 or n==2):\r\n print('1')\r\nelif(n%3==0):\r\n print((n//3)*2)\r\nelse:\r\n print((n//3)*2+1)\r\n", "a = int(input())\r\n\r\nif a % 3 == 0:\r\n print(round((a/3)*2))\r\nelse:\r\n print(round(((a/3)*2)))", "n=int(input())\r\nx= (2*n+1 ) // 3\r\nprint(x)\r\n", "inp = int(input())\n\nif inp % 3 == 0:\n print((inp//3)*2)\n\nelse:\n print((inp//3)*2+1)\n", "a=int(input())\r\nb=int(not not a%3)\r\nc=int(a/3)*2\r\nprint(b+c)", "n = int(input())\r\n\r\ncount = (2 * n) / 3\r\n\r\nprint(round(count))", "n = int(input())\r\nif n%3==0:print((n//3)*2)\r\nelse:print(((n//3)*2)+1)", "n = int(input())\r\nprint(2*(n//3) + (1 if n%3 else 0))", "print((2 * int(input()) + 1) // 3)", "n=int(input())\r\nr=int((2*n)/3)\r\nif n%3==0:\r\n print(int((2*n)/3))\r\nelse:\r\n print(int(2*(n-n%3)/3 + 1))", "a = int(input())\r\nif (a//3)==a/3:\r\n print(a//3*2)\r\nelse:\r\n print(a//3*2+1)", "n=int(input())\r\nif(n%3):\r\n print(int((n-n%3)/3)*2+1)\r\nelse:\r\n print(int(n/3)*2)", "n = int(input())\r\nk = (n - 1) // 3 * 2 + 1\r\nif n % 3 == 0:\r\n k += 1\r\nprint(k)", "#python3\r\n#utf-8\r\nrocks_nr = int(input())\r\n\r\nans = (rocks_nr // 3) * 2\r\nans += 1 if rocks_nr % 3 != 0 else 0\r\nprint(ans)\r\n", "n=input()\r\nn=int(n)\r\ni=(n//3)*2\r\nif n%3!=0:\r\n i+=1\r\nprint(i)", "#C:\\Users\\User\\vscode\\PyTests\n#prob.py\nn = int(input()) \nprint((n//3)*2+(n%3!=0))\n \t\t \t \t \t\t \t\t \t\t \t\t \t\t\t \t", "x=int(input())\r\nprint(2*int(x/3) if x/3 == int(x/3) else 2*int(x/3)+1)", "'''\r\n##======================================================================================================================================##\r\n ## _____ _ _ _ _____ _ _ _ _ _____ _____ ____ ___ ____ ___ ##\r\n ## | / \\ | \\ / | | | | |\\ | | | | | | | | \\ | | | ##\r\n ## |_____ / \\ | \\/ | |_____ | | | \\ | | __ --- |_____ |____| | | | |___ |___| ##\r\n ## | / \\ | | | | | | \\ | | | | | | | | | | \\ ##\r\n ## _____| / \\ | | _____| \\ __ / | \\| |_____| _____| | | |___/ |____ | \\ ##\r\n##======================================================================================================================================##\r\n------------------------------Samsung_Spider------------------------------\r\n'''\r\nnumber = int(input()); m = 1; day = 0\r\nwhile number > 0:\r\n if number - m < 0:\r\n break\r\n number -= m\r\n if m == 1: m = 2\r\n else: m = 1\r\n day += 1\r\nprint(day)", "n = int(input())\r\n\r\nif n % 3 == 0:\r\n\tprint(int(n / 3) * 2)\r\nelse:\r\n\tprint((int(n / 3) * 2) + 1)", "n=int(input())\r\nprint((n//3)*2) if n%3==0 else print(((n//3)*2)+1)", "a = int(input())\r\nif a//3==a/3:\r\n print(a//3*2)\r\nelse:\r\n print(a//3*2+1)", "n=int(input())\r\nc=n//3*2\r\nif n%3:\r\n c+=1\r\nprint(c)\r\n\r\n", "n = int(input())\r\na = (int(n/3)*2)\r\nprint(a if (int(n%3)) == 0 else a+1)", "x = int(input())\r\nn3 = x // 3\r\nost = x % 3\r\nprint(n3*2 + int(ost != 0))\r\n", "n = int(input())\r\nanswer = (n // 3) * 2\r\nn -= answer / 2 * 3\r\nwhile True:\r\n if n < 1:\r\n break\r\n else:\r\n answer +=1\r\n n -= 1\r\n if n < 2:\r\n break\r\n else:\r\n answer +=1\r\n n -= 2\r\n\r\nprint(answer)", "n = int(input())\r\nprint(2*(n//3) + (n%3 != 0))", "import math as m\r\nn = int(input())\r\nif n<3:\r\n print(1)\r\nelif n%3==0:\r\n print(m.floor((n/3))*2)\r\nelse:\r\n print(m.floor((n/3))*2+1)", "n = int(input())\r\na = 0\r\nif n%3!=0:\r\n\ta = 1\r\nprint(2*(n//3)+a)", "n=int(input())\r\nif n%3==0:\r\n\tprint(n//3*2)\r\nelse:\r\n\tprint((n//3*2)+1)", "#20: 1 11 1 11 1 11 1 11 1 11 1 11 1 1\n#20: 1 2 1 2 1 2 1 2 1 2 1 2 1\nn=int(input())\na=n%3\nif a==2:\n a=1\nprint((a)+(n//3)*2) #number of two\n\n", "# cook your dish here\r\nn = int(input())\r\n\r\n\r\nif n%3 !=0:\r\n a = 1 \r\nelse:\r\n a = 0\r\n\r\nprint(2*(n//3) + a)", "n=int(input())\r\nk=n//3*2\r\nif n%3>0:\r\n k+=1\r\nprint(k)", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n return n//3*2 + int(bool(n%3))\r\n \r\nprint(main())\r\n", "n = int(input())\r\nif(n%3==0):\r\n print(n//3*2)\r\nelif((n+1)%3==0):\r\n print ((n+1)//3+(n+1)//3-1)\r\nelse:\r\n print ((n+2)//3+(n+2)//3-1)\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nprint((int(input())*2+1)//3)", "\r\ndef solve():\r\n n = int(input())\r\n if n==1 or n==2:\r\n print(1)\r\n else:\r\n kk = n//3\r\n ans = 2*kk\r\n if n%3==0:\r\n print(ans)\r\n else:\r\n print(ans+1)\r\n \r\n\r\n\r\nif __name__=='__main__':\r\n solve()", "a = int(input())\r\nmany = 2 * (a // 3)\r\nif a % 3 == 0:\r\n print(many)\r\nelif a % 3 == 1:\r\n print(many + 1)\r\nelse:\r\n print(many + 1)", "n = int(input())\r\nq, r = divmod(n, 3)\r\nq <<= 1\r\nq += r != 0\r\nprint(q)", "n = int(input().strip())\r\nif n % 3 != 0:\r\n ans = (n//3)*2 + 1\r\nelse:\r\n ans = (n//3)*2\r\nprint(ans)", "N=int(input())\nif N==1 or N==2:\n\tprint(1)\nelif N%3==0:\n\tprint(int(N/3)*2)\nelif N%3!=3 and (N!=1 or N!=2):\n\tprint(int(N/3)*2+1)\n\n\n", "x=int(input());print(x//3*2+(x%3>0))", "#整数を変数に格納する場合、変数名=int(input())で格納する。\r\n#文字列を1つの変数に格納する場合、変数名=input()で格納する。\r\n#文字列を複数の変数に格納する場合、変数名A,変数名B,変数名C,変数名D=input()で格納する。\r\n#print(a,b,c,d)⇛a b c d of output\r\n#整数を複数の変数に格納する場合、変数名A,変数名B=map(int,input().split())で格納する。\r\n#文字列を複数の変数に格納する場合、変数名A,変数名B=input().split()で格納する。\r\n#()内にどこで区切るかの情報が入ってる.\",\"とするとカンマ区切りとなる\r\n#List=list(map(int,input().split()))#配列格納\r\n#リスト名=[int(変数名) for 変数名 in input().split()]配列格納\r\n#リストに文字列を格納する場合、リスト名=list(input().split())で格納する。\r\n#a=len(list(set(s)))==2;str sの要素数\r\n#空白区切りの入力で\r\n\r\nm1=\"abcdefghijklmnopqrstuvwxyz\"\r\nm2=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ncond=['No','Yes']\r\nCond=['NO','YES']\r\n#h,w,s=map(int,input().split(\"/\"))#223/333/22\r\n#print(input().count(\"2\"))1121⇛1\r\n#s=s.replace('1','a')1129⇛aa29\r\n\r\nn=int(input());\r\nans=int(n/3);\r\nans*=2;\r\nans+=(1 if (n%3)>0 else 0)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "a=int(input())\r\nx=round(2*a/3)\r\nprint(int(max(1, x)))", "n = int(input())\r\nprint(2 * (n // 3) if n % 3 == 0 else 2 * (n // 3) + 1)\r\n", "num = int(input())\r\ny = (num // 3) * 2\r\nif num % 3 == 0:\r\n print(y)\r\nelse:\r\n print(y+1) ", "n = int(input())\n\nt = (n // 3) * 2\n\nif n % 3 != 0:\n\tt += 1\nprint(t)", "a = int(input())\r\nk = 0\r\nwhile(1):\r\n if(a>=1):\r\n a = a - 1\r\n k += 1\r\n else:\r\n break\r\n if(a>=2):\r\n a = a - 2\r\n k += 1\r\n else:\r\n break\r\nprint(k)\r\n", "# LUOGU_RID: 118269699\nprint((2*int(input())+1)//3)", "n=int(input())\r\nx=2*int(n/3)\r\nprint(x if n%3==0 else x+1)", "n=int(input())\r\np=(n//3)*2\r\nif(n%3):\r\n p=p+1\r\nprint(p) ", "n = int(input())\n\nsol = (n//3) * 2\n\nif n % 3:\n sol += 1\n\nprint(sol)\n", "a=int(input())\r\nif(a%3==0):\r\n\tprint((a//3)*2)\r\nelse:\r\n\tprint((a//3)*2 +1)", "#!/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 q,r = divmod(n,3)\r\n print(q*2+(1 if r != 0 else 0))", "x=int(input())\r\nprint(x//3*2+int(x%3!=0))", "total = int(input())\r\n\r\nif total == 0:\r\n print(0)\r\nif total % 3 == 0:\r\n print(int(total / 3) * 2)\r\nelse:\r\n print(int(total / 3) * 2 + 1)\r\n", "n = int(input())\r\n\r\nt = 0\r\n\r\nif n >= 3 :\r\n t += 2*(n//3)\r\n n%=3\r\n\r\nif n > 0 :\r\n t += 1\r\n\r\nprint(t)", "import math\r\nn = int(input())\r\nans = math.floor(n / 3) * 2\r\na = n % 3\r\nif a == 1:\r\n ans += 1\r\nif a == 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nif n < 3 :\r\n print(\"1\")\r\nelse:\r\n cnt = 0\r\n i = 1\r\n while n > 0 :\r\n if i%2 == 1:\r\n n-=1\r\n cnt+=1\r\n else:\r\n if n!=1 :\r\n n-=2\r\n cnt+=1\r\n else:\r\n n-=1\r\n i+=1\r\n # print(cnt)\r\n print(cnt)", "n = int(input())\r\n\r\nprint(2*(n//3) + (1 if n % 3 != 0 else 0))", "n = int(input())\nprint(int(n / 3)*2 + (0 if n % 3 == 0 else 1))\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN=int(input())\r\nprint((N//3)*2+bool(N%3))", "x = int(input())\ncore = (x//3)*2\nl= x-(x//3)*3\nif l == 0:\n\tprint (core)\nelse:\n\tprint (core+1)", "n = int(input())\r\nsoLan = int(n / 3)\r\nconLai = n - soLan * 3\r\nif conLai % 3 == 0:\r\n print(soLan * 2)\r\nelse: print(soLan * 2 + 1)\r\n", "n = int(input())\r\n\r\nif n < 3:\r\n print(1)\r\nelse:\r\n if n % 3 == 0:\r\n print(2*(n//3))\r\n else:\r\n print(2*(n//3)+1) ", "n=int(input())\r\nres=(n//3)*2\r\nif n%3!=0:\r\n res+=1\r\nprint(res)\r\n", "n = int( input() )\r\n\r\nif n % 3 != 0:\r\n x = 1\r\nelse:\r\n x = 0\r\nx += n//3 * 2\r\n\r\nprint(x)\r\n", "n = int(input())\r\nif n%3!=0:\r\n a = (n//3)*2 + 1\r\n print(a)\r\nelse:\r\n c = (n//3)*2\r\n print(c)\r\n ", "n = int(input())\r\nprint(int(n/3)*2 + (0 if n%3==0 else 1))", "n=int(input())\r\nprint(int(n/3)*2 if n%3==0 else int(n/3)*2+1)", "n = int(input())\r\nprint (round((n/3*2)))", "n = int(input())\r\nprint(n//3*2 +(1 if n%3 else 0) )\r\n", "x = int(input())\r\nr = int(x/3)\r\nif x%3 != 0:\r\n\tprint(2*r+1)\r\nelse:\r\n\tprint(2*r)", "x=int(input())\r\nif x%3==0:\r\n print(int(int(x/3)*2))\r\nelse: \r\n print(int(int(x/3)*2+1)) ", "t=int(input())\r\nd=t//3\r\nif t%3==0 or t%3==1:\r\n print(t-d)\r\nelse:\r\n print(t-d-1)\r\n", "#listInput = list(map(int,input().split()))\r\nnum = int(input())\r\nnumleft = num%3\r\nout = 2*(num//3)\r\nif numleft == 0:\r\n print(out)\r\nelse:\r\n print(out + 1)", "n = int(input())\nn = (n * 2 + 1) // 3\nprint(n)", "n = int(input())\r\nif n % 3 == 0:\r\n print(2 * (n // 3))\r\nelse:\r\n print(2 * (n // 3) + 1)\r\n", "a = int(input())\nb = a // 3\nb *= 2\nif a % 3 > 0:\n b += 1\nprint(b)\n \t \t \t \t\t \t\t\t\t \t\t\t\t \t \t\t \t", "print(((int(input())*2)+1)//3)\r\n", "print((1+int(input())*2)//3)", "n = int(input())\r\nif n%3 == 0:\r\n print(int((n/3)*2))\r\nelse:\r\n print(int((((n-(n%3))/3)*2)+1))", "x = int(input())\nif x % 3 == 0:\n r = 0\nelse:\n r = 1\nx = (x // 3) * 2\nprint(x + r)\n", "j = int(input())\r\nprint(int((j*2 + 1) / 3))", "n=int(input())\r\nif n%3==0:print(2*(n//3))\r\nelse:print(2*(n//3)+1)", "n = int(input())\r\nans = 2*(n//3)\r\nif(n%3!=0):\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nr = n%3\r\nif(r==0):\r\n\tprint((n//3)*2)\r\nelse:\r\n\tprint(((n//3)*2)+1)", "n = int(input())\r\nq = int(n/3)\r\nk = n%3\r\nif(k==0):\r\n print(str(q*2))\r\nelif(k==1):\r\n print(str(q*2+1))\r\nelif(k==2):\r\n print(str(q*2+1))", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\ng=0\r\ng=t//3\r\ng=g*2\r\nif(t%3>0):\r\n g+=1\r\nprint(g)\r\n", "n = int(input())\nif (2*n%3) == 0:\n print(n//3*2)\nelse:\n t = (n//3*2)\n print(t+1)", "n=int(input())\r\nif n==1 or n==2:\r\n print(1)\r\nelse:\r\n num=n//3\r\n if n%3:\r\n print(2*num+1)\r\n else:\r\n print(2*num)\r\n\r\n", "n = int(input())\r\na = n // 3 * 2\r\nif n % 3 != 0:\r\n a += 1\r\nprint(a)", "n = int(input())\n\nans = (n // 3) * 2\n\nif n % 3:\n ans += 1\n\nprint(ans)", "x=int(input())\r\ny=x//3*2\r\nif x%3!=0:\r\n y+=1\r\nif x==0:\r\n print(\"0\");\r\nelse:\r\n print(y);\r\n", "x=int(input())\r\nif x%3==0:\r\n\tprint((x//3)*2)\r\nelse:\r\n\tprint((x//3)*2+1)", "stones = int(input())\na = 2 * (stones // 3)\nif stones % 3 != 0:\n a += 1\nprint(a)\n\t\t \t\t \t \t\t\t \t\t \t\t \t\t\t", "n=int(input())\r\nx=(n//3)*2\r\nif n%3!=0:\r\n x+=1\r\nprint(x)", "# coding:utf8\r\nx = int(input())\r\ny = x % 3\r\nz = x // 3\r\nif y:\r\n print(z * 2 + 1)\r\nelse:\r\n print(z * 2)\r\n", "n = int(input())\nif n%3 == 0:\n print ((n//3)*2)\nelse: #If n == 3k + 1 or n == 3k + 2\n print ((n//3)*2 + 1)", "n = int(input())\r\ngift=0\r\ngift=2*(n//3)\r\nif(n%3>0):\r\n\tgift += 1\r\nprint(gift)", "n = int(input())\r\nif n < 3: print(1)\r\nelif n%3 == 0: print(int(n/3) * 2)\r\nelse: print(int(n/3)*2 + 1)", "n=int(input())\r\nif n % 3 == 0:\r\n\tprint(2*n//3)\r\nelse:\r\n\tprint(2*(n//3)+1)", "n = int(input())\r\nn1 = (2 * n) // 3\r\nn2 = (2 * n + 1) // 3\r\nprint(max(n1, n2))\r\n", "n=int(input())\r\nif n%2==0:\r\n\ta=n\r\n\tif a%3==0:\r\n\t\tprint((a//3)*2)\r\n\telse:\r\n\t\tprint((a//3)*2+1)\r\nelse:\r\n\tn=n-1\r\n\ta=n\r\n\tif a%3==0:\r\n\t\tprint(2*(a//3)+1)\r\n\telif a%3==1:\r\n\t\tprint(2*(a//3)+1)\r\n\telif a%3==2:\r\n\t\tprint(2*(a//3)+2)", "n = int(input())\r\nprint((2 * n) // 3 + (1 if n % 3 == 1 else 0))", "\r\nn = int(input())\r\nn3 = n // 3\r\nnp = n3 * 2\r\nif n % 3 != 0:\r\n\tnp += 1\r\nprint(np)", "n=int(input())\r\nprint(n//3*2+(1 if n%3 else 0))", "n = int(input())\n\nif n % 3 >= 1:\n x = 1\nelse:\n x = 0\n\nprint(2*(n//3) + x)", "def ras(n):\r\n if(n%3==0):\r\n x=n/3*2\r\n return(int(x))\r\n else:\r\n x=((n-n%3)/3*2)+1\r\n return(int(x))\r\nn=int(input())\r\nr=ras(n)\r\nprint(r)\r\n", "# Description of the rpoblem can be found at http://codeforces.com/problemset/problem/669/A\r\n\r\nn = int(input())\r\n\r\nprint((n // 3) * 2 + (1 if n % 3 > 0 else 0))", "import math\r\nn = int(input())\r\nif(n% 3 == 0):\r\n print(n - n//3)\r\nelse:\r\n n = n - n%3\r\n print(n - n//3 + 1)\r\n", "def reversed_list(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n if n < 3:\r\n return 1\r\n elif not n % 3:\r\n return 2 * (n // 3)\r\n return 2 * (n // 3) + 1\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\nif n % 3 == 0: print(n // 3 * 2)\r\nelse: print(n // 3 * 2 + 1)", "n = int(input())\nans = n // 3 * 2\nn %= 3\nif n:\n ans += 1\nprint (ans)\n \t \t \t\t\t\t\t \t \t\t \t \t\t \t", "def first():\n inp = int(input())\n res = ((int)((inp/3)*2))\n if(inp%3 == 1):\n res += 1\n print(res)\n\n\nfirst()", "n = int(input())\nprint(max(((n) // 3) * 2 + (n % 3 >= 1), 1))", "a = int(input())\nprint((a//3)*2+bool(a%3))\n", "n = int(input())\r\n\r\nprint((n+2)//3 + n//3)", "from math import floor\r\nn = int(input())\r\nfinal = 2*(n//3)\r\n#print(final)\r\nif n%3 != 0 and n - final:\r\n print(final + 1)\r\nelse:\r\n print(final)\r\n", "x = int(input())\ny=0\ny = x//3\ny = y*2\nif(x%3>0):\n y = y+1\nprint(y)\n\n \n\n", "# -*- coding: utf-8 -*-\r\n\r\nn=input()\r\nn=int(n)\r\nif n%3==0:\r\n\tprint((n//3)*2)\r\nelse:\r\n\tprint((n//3)*2+1)\r\n\r\n\r\n", "def solve(n):\n x = n // 3\n c = 2 * x\n n -= 3 * x\n if n:\n c += 1\n return c\n\nn = int(input())\n\nprint(solve(n))\n", "n=int(input())\r\n# (2 * n) / 3 + (n % 3 != 0)\r\nif n%3!=0 and (2*n-((2*n)//3)*3)==2:\r\n\tprint((2*n)//3+1)\r\nelif n%3!=0 and (2*n-((2*n)//3)*3)==1:\r\n\tprint((2*n)//3)\r\nelse:\r\n\tprint((2*n)//3)", "a = int(input())\nb=int(a/3)*2\nc=a%3\nif c==0:\n print(b)\nelse:\n print(b+1)\n", "n=int(input())\r\nif n%3>0:\r\n print(2*(n//3)+1)\r\nelse:\r\n print(2*(n//3))", "def solve(c):\r\n if c%3==0:\r\n ans=c//3*2\r\n else:\r\n ans=c//3*2+1\r\n return ans\r\n\r\nc=int(input())\r\nprint(solve(c))\r\n", "n=int(input())\r\nprint((n*2+1)//3)", "n=int(input())\r\nprint(((n+2)//3) +(n//3))", "def solve(n):\r\n x = n // 3 * 2\r\n if n % 3 == 0:\r\n return x\r\n return x + 1\r\n\r\nn = int(input())\r\nprint(solve(n))", "n = int(input())\r\na = (n // 3) * 2\r\nif n%3 > 0:\r\n a = a+1\r\nprint(a)", "num=int(input())\r\nif num%3==0:\r\n k=num//3\r\n print(2*k)\r\nelse:\r\n k=num//3\r\n print((2*k)+1)", "from math import *\r\n\r\nn =int(input())\r\nif (n%3!=0):\r\n print((n//3) * 2 + 1)\r\nelse:\r\n print((n//3)*2)", "n = int(input())\nr = 2 * (n // 3)\nif n % 3 != 0: r += 1\nprint(r)\n", "n=int(input())\r\nt=(n//3)*2\r\np=n%3\r\nif p>0:\r\n t+=1\r\nprint(t)\r\n \r\n", "stones = int(input())\n\nmasha = (stones//3)*2\n\nif (stones % 3 != 0): masha += 1\n\nprint(masha)\n", "n = int(input())\n\na = 2 * (n//3)\n\nif n % 3 > 0:\n a += 1\nprint(a)\n", "n = int(input())\r\nm = 0\r\nk = 1\r\nm = n // 3\r\nm = m * 2\r\nif n % 3 > 0:\r\n m = m + 1\r\nprint(m)", "\n\ndef calc(val):\n \"\"\"For given number of the stone, find maximum possible\n that can be gifted\"\"\"\n count = (val//3) * 2\n if (val%3) > 0:\n count = count + 1\n print(count)\n\ndef main():\n arg = int(input())\n calc(arg)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nt = 0\r\nif n%3 != 0:\r\n\tt = 1\r\nprint(2 * (n//3) + t)", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n arr = [int(i) for i in input().split(' ')]\n\n arr_sum = sum(arr)\n zeros = len([i for i in arr if i == 0])\n\n if -1*arr_sum == zeros:\n print(zeros+1)\n return\n print(max(0, zeros))\n\ndef possible(arr):\n halfsum = sum(arr)//2\n if halfsum in arr:\n return True\n for i in range(0, 4):\n for j in range(i+1, 4):\n if arr[i] + arr[j] == halfsum:\n return True\n return False\n\ndef is_palin(string):\n if not string or len(string) == 1:\n return True\n n = len(string)\n for i in range(0, n//2):\n pass\n # if string[i] != string[]\n\nn = int(input())\n\nprint((n//3)*2 + (n%3 != 0))\n", "a=int(input())\nprint((a*2+1)//3)\n", "n=int(input())\r\nx=n%3\r\nif(x>0):\r\n x=1\r\nprint(int(n/3)*2+x)", "n = int(input())\r\nif n%3!=0:\r\n a = (n//3)*2 + 1\r\nelse:\r\n a = (n//3)*2\r\nprint(a)\r\n \r\n", "import math\r\nstones = int(input())\r\nextra = 0\r\nif stones%3 == 2 or stones%3 == 1: extra = 1\r\nif stones >= 3: print(math.floor(stones/3)*2 + extra)\r\nelse: print(\"1\")", "n = int(input())\r\n\r\nprint(n//3*2 + (n%3>0))", "stones = int(input())\r\nmaximum_num = (stones * 2 + 1) // 3\r\nprint(maximum_num)", "from math import ceil\r\nn = int(input())\r\nans = 2*(n//3) + ceil((n%3)/2)\r\nprint(ans)", "n = int(input())\r\na= 0\r\nwhile True:\r\n n = n-1\r\n if n < 0:\r\n break\r\n a += 1\r\n n = n - 2\r\n \r\n if n < 0:\r\n break\r\n a += 1\r\nprint(a)", "n=int(input())\r\na=2*(n//3)\r\nif (n%3)!=0:\r\n a=a+1\r\nprint(a)", "n=int(input())\r\nprint(2*(n//3)+min(n%3,1))", "# Little Artem and his presents\nn = int(input())\nif n%3 == 0:\n print(n//3*2)\nelse:\n print(n//3*2+1)\n", "def max_presents(n):\r\n if n % 3 == 0:\r\n return (n // 3)*2\r\n else:\r\n return (n // 3)*2 + 1\r\n\r\n\r\ndef main():\r\n n = int(input().strip())\r\n ans = max_presents(n)\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "a = int(input())\nnum=a//3\nhow=a%3\nprint(2*num+(a%3!=0))\n\t \t\t\t \t \t \t\t \t\t\t\t\t\t \t\t \t", "n=int(input())\r\nr=n%3\r\ns=0\r\n\r\nif not r:\r\n\tprint(2*(n//3))\r\nelse:\r\n\tprint(1+(2*(n//3)))", "n = int(input())\r\nanswer = (n//3)*2\r\nn = n%3\r\nif n != 0:\r\n print(answer+1)\r\nelse:\r\n print(answer)", "n = int(input())\r\nif n%3==0:\r\n\tprint(2*(n//3))\r\nelif n%3!=0:\r\n\tprint(2*(n//3)+1)\t", "n = int(input())\r\nm = 2 * (n // 3)\r\nif n % 3 != 0: \r\n m += 1\r\nprint(m)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-22 23:03:45\nLastEditTime: 2021-12-03 22:07:43\nDescription: Little Artem and Presents\nFilePath: CF669A.py\n'''\n\n\ndef func():\n n = int(input())\n if n % 3 == 0:\n print(n // 3 * 2)\n else:\n print(n // 3 * 2 + 1)\n\n\nif __name__ == '__main__':\n func()\n", "def solution(n):\r\n if n==2:\r\n return 1\r\n return int(n/3)*2+(n%3!=0)\r\ndef answer():\r\n n = int(input())\r\n print(solution(n))\r\nanswer()", "n = int(input())\r\nprint((n//3)*2+(n%3>0))\r\n", "n = int(input())\r\noutput = (n // 3) * 2\r\nprint(output + 1 if n % 3 > 0 else output)", "n = int(input())\r\na = (n + 1) // 3\r\nprint(n - a)", "n=int(input())\r\nc=2*(n//3)\r\nif n%3>0:\r\n\tc+=1\r\nprint(c)\r\n", "a = int(input())\r\nnum=a//3\r\nhow=a%3\r\nprint(2*num+(a%3!=0))", "n=int(input())\r\n\r\ns=(n//3)*2\r\nif n%3!=0 :\r\n s+=1\r\nprint(s)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = n // 3 * 2 + min(n % 3, 1)\r\nprint(ans)", "n = int(input())\r\nif n%3==0:\r\n print((n//3)*2)\r\nelse:\r\n print(((n//3)*2)+1)", "a=int(input())\nb=0\nc=0\nif a%3==0:\n\tprint(a//3*2)\nelse:\n\tprint(a//3*2+1)\n", "n = int(input())\r\nprint(round((n/3) *2))", "a = int(input())\r\nprint((a*2+1)//3)", "n = int(input())\r\n\r\nmod = n % 3\r\n\r\nif mod == 0:\r\n\tprint(int(n/3)*2)\r\nelif mod == 1:\r\n\tprint(int((n-1)/3*2 + 1))\r\nelif mod == 2:\r\n\tprint(int((n-2)/3*2 + 1))\r\n", "a=int(input())\r\nsum=(a//3)*2\r\nif a%3==1 or a%3==2:\r\n sum+=1\r\nprint(sum)\r\n ", "n = int(input())\nx = (n//3) * 2 + int(0.9 +(n%3)/2)\nprint(x)\n\t\t \t\t \t\t\t\t \t\t\t \t\t \t \t\t \t", "a = int(input())\r\nif a % 3 == 0:\r\n\tprint(a // 3 * 2)\r\nelse:\r\n\tprint(a // 3 * 2 + 1)", "n=int(input())\r\nif n//3!=n/3:\r\n print(2*(n//3)+1)\r\nelif n%3==0:\r\n print(2*(n//3))", "n = int(input())\r\nans = (n//3)*2\r\nif n%3>0: ans+=1\r\nprint(ans)", "n = int(input())\r\ngifts = 2 * (n // 3) + int(n % 3 != 0)\r\nprint(gifts)", "n = int(input())\r\nif(n%3 == 0):\r\n t = 2 * int(n/3)\r\nelse:\r\n t = 2 * int(n/3) + 1\r\nprint(t)", "n=int(input())\r\nif n%3==0:print((n//3)*2)\r\nelse:print((n//3)*2+1)", "n = int(input())\r\n\r\nk = n//3\r\nans= k * 2\r\nn %= 3\r\nif n > 0:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nif n % 3 == 2:\r\n n -= 1\r\nprint(((n // 3) * 2) + (n % 3))", "n = int(input())\r\nmax_presents = (n //3 ) * 2\r\nif n % 3 > 0:\r\n max_presents += 1\r\nprint(max_presents)", "n = int(input())\nans = 2 * (n // 3) + ((n % 3 != 0) + 0)\nprint(ans)\n", "def main():\r\n n = int(input())\r\n m = n // 3\r\n r = n % 3\r\n if r == 0:\r\n print(2*m)\r\n else:\r\n print(2*m + 1)\r\n\r\nmain()", "n = int(input())\nif n == 1 or n == 2:\n print(1)\nelif n%3 == 0:\n print(int(n/3)*2)\nelif n%3 == 1 or n%3 == 2:\n print((int(n//3)*2)+1)\n", "n = int ( input(\"\") )\na= n%3\nb=int(n/3)\n\nif a>=1:\n\tm=1\nelse :\n\tm=0\nsol = b*2+m\n\nprint (str(sol))\n\n", "n = int(input())\r\nprint(2*(n//3)+(1 if n%3 > 0 else 0))", "x = int ( input() )\r\nif x < 3:\r\n print (1)\r\n\r\nelif x%3 == 0 :\r\n z=int (x/3)\r\n print(z*2)\r\n\r\nelif x%3 > 0:\r\n y=int (x/3)\r\n print(y*2+1)\r\n", "n = int(input()); print(((n*2)//3 , ((n-(n%3))*2)//3 +1)[not(n%3==0)] )\r\n", "n=int(input())\r\nif n%3==0 or n%3==2:\r\n print((2*n)//3)\r\nif n%3==1:\r\n print((2*n)//3+1)\r\n", "n = int(input()); print(1 + (n-1)//3 + n//3)\r\n", "n = int(input())\r\nprint(n//3*2 if n % 3 == 0 else n//3*2+1)", "# Little Artem and Presents\n\nn = int(input())\nprint((2*n+1)//3)", "n = int(input())\r\nprint(n-(n+1)//3)", "# from dust i have come, dust i will be\r\n\r\nn=int(input())\r\nans=(n//3)*2\r\nn=n%3\r\n\r\nif n>0:\r\n ans+=1\r\n\r\nprint(ans)", "n = int(input())\nn3 = n//3\nr3 = n%3\nif r3:\n print(2*n3+1)\nelse:\n print(2*n3)\n", "n = int(input())\r\nres = 1\r\nl = 1\r\nn -= 1\r\nwhile n:\r\n if l == 1:\r\n if n >= 2:\r\n n -= 2\r\n l = 2\r\n res += 1\r\n else:\r\n break\r\n else:\r\n if n >= 1:\r\n n -= 1\r\n l = 1\r\n res += 1\r\n else:\r\n break\r\nprint(res)\r\n", "def solve(n):\r\n if n < 3:\r\n return 1\r\n ans = (n//3) * 2\r\n if n%3 == 0:\r\n return ans\r\n else:\r\n return ans + 1\r\n \r\n# n,c = map(int,input().split())\r\na = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\nprint(solve(a))\r\n# solve()\r\n\r\n\r\n\r\n", "h=int(input())\r\nprint((h//3)*2+(h%3!=0))", "import math\r\n\r\n\r\nn=int(input())\r\nif n%3==0:\r\n print(int(n/3)*2)\r\nelse :\r\n x=math.floor(n/3)\r\n print((2*x)+1)", "p=int(input())\r\n\r\nif p>=3:\r\n\r\n result = p // 3\r\n x= result*2\r\n y= p-(result*3)\r\n\r\n if y!=0:\r\n x+=1\r\nelse:\r\n x=1\r\n\r\nprint(x)\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef masha(n):\n q, r = divmod(n, 3)\n q *= 2\n if r:\n q += 1\n return q\n\n\ndef main():\n n = readint()\n print(masha(n))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nn=(2*n+1)//3\r\nprint (n)", "n = int(input())\r\nans = n // 3 * 2 + (n % 3 != 0)\r\nprint(ans)", "n=int(input())\r\ns=((2/3)*n)\r\ne=((2/3)*n)//1\r\nif s+0.4<e+1 and n>2:\r\n print (int(e))\r\nif s+0.4>e+1 and n>2:\r\n print (int(e+1))\r\nif n==1 or n==2:\r\n print (1)", "last = 0;\n\ns = int(input());\ng = 0\n\nl = int(s / 3) *2;\ng = s % 3\nif g >= 1:\n l += 1;\n\nprint(l);\n\t\t \t\t\t\t \t\t \t\t\t \t\t \t\t\t\t \t", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue\n\ndef solve():\n n = int(input())\n r = (n//3)*2\n if n%3 != 0:\n r += 1\n return r\n\nif __name__ == '__main__':\n print(solve())\n\n", "#for _ in range(int(input())):\r\n#a,b,c,d=map(int,input().split())\r\nn=int(input())\r\nif(n<=2):\r\n print(1)\r\nelif(n%3==0):\r\n print((n//3)*2)\r\nelse:\r\n print((n//3)*2+1)\r\n ", "n=int(input())\r\nk=n//3\r\nif n%3==0:\r\n\tprint(2*k)\r\nelse:\r\n\tprint(2*k+1)", "\"\"\"\r\nProblem: https://codeforces.com/problemset/problem/669/A\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\n\r\ndef presents(num):\r\n number_of_presents = int(num / 3) * 2\r\n if (n % 3 != 0):\r\n number_of_presents += 1\r\n return number_of_presents\r\n\r\n\r\nprint(presents(n))\r\n", "\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n if n==0:\r\n print(0)\r\n elif n==1:\r\n print(1)\r\n elif n==2:\r\n print(1)\r\n else:\r\n if n%3==0:\r\n k = n//3\r\n print(2*k)\r\n else:\r\n k = n//3\r\n print((2*k)+1)\r\n", "n=int(input())\r\nprint(1 if n==1 or n==2 else 2*(n//3) if n%3==0 else 2*(n//3)+1)", "stones = int(input())\np = 0\nif stones>=3:\n t=stones//3\n stones%=3\n p+=t*2\nif stones != 0:\n p+=1\nprint(p)", "import math\nn = int(input())\nif n % 3 == 0:\n print(2 * (n // 3))\nelse:\n print(n // 3 + math.ceil(n / 3))\n", "n=int(input())\r\nkam=n//3\r\ns=kam*2\r\ntam=n%3\r\nif tam==0:\r\n print(s)\r\nelse:\r\n print(s+1)", "n = int(input())\nprint(n // 3 * 2 + 1*(n % 3 != 0))\n", "n=int(input())\r\nprint(2*(n//3)+int(n%3>0))", "n = int(input())\r\nprint(((n//3)*2 + 1) if n%3!=0 else (n//3)*2)", "n=int(input())\r\nif(n%3==0):\r\n c=(n//3)*2\r\nelse:\r\n c=(n//3)*2+1\r\n\r\nprint(c)\r\n \r\n", "n=int(input())\r\nans=int(n/3)*2\r\nif n%3:\r\n ans+=1\r\nprint(ans)", "t = int(input())\r\nif t%3==0:\r\n print((t//3)*2)\r\nelse:\r\n print((t//3)*2+1)", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\nfrom queue import PriorityQueue\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\nx = n%3\r\nres = n//3 * 2\r\nif x:\r\n p(res + 1)\r\nelse:\r\n p(res)", "n=int(input())\r\nans=(2*(n//3)+(n%3!=0))\r\nprint(ans)\r\n", "n=int(input())\r\nans=2*(n//3)\r\nif n<=2:\r\n ans=1\r\nelif n%3==0:\r\n ans=2*(n//3)\r\nelse:\r\n ans=2*(n//3)+1\r\nprint (ans)\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn=int(input())\r\nprint((2*n +1)//3)", "n = int(input())\r\nprint((n//3)*2 if n%3==0 else (n//3)*2+1)\r\n", "stones = int(input())\na = (stones + 1) // 3\nprint(stones - a)\n \t\t\t \t\t\t \t \t\t", "n=int(input())\r\nc=0\r\nif n==1:\r\n print(1)\r\nelse:\r\n while n>=3:\r\n n=n-3\r\n c=c+2\r\n if n==1:\r\n c=c+1\r\n elif n==2:\r\n c=c+1\r\n print(c)", "x=int(input())\r\nprint(x//3*2+(1 if x%3 else 0))", "if __name__ == '__main__':\r\n n = int(input())\r\n print(n // 3 * 2 + min(n % 3, 1))\r\n", "n = int(input())\r\n\r\ntriples = n // 3\r\nprint(2 * triples if 3 * triples == n else 2 * triples + 1)", "n = int(input())\ni = 1 \nwhile n > 0:\n if i%2 == 1: \n n -= 1\n else: \n n-=2\n if n < 0: \n print(i-1)\n exit()\n elif n == 0: \n print(i)\n exit() \n i+=1\n", "n = int(input())\r\nx = n // 3 * 2\r\nif n % 3 != 0:\r\n x += 1\r\nprint(x)\r\n", "n = int(input())\r\nk = round(n/3)\r\nprint(n - k)", "n = int(input())\r\nprint(2*(n//3) if n % 3 == 0 else 2*(n//3) + 1)\r\n", "def present(number):\r\n flag = 0\r\n if number % 3 == 0:\r\n flag = 0\r\n else:\r\n flag = 1\r\n return 2 * (number // 3) + flag\r\n\r\n\r\nprint(present(int(input())))\r\n", "n = int(input())\r\nn = (n * 2 + 1) // 3\r\nprint(n)", "n=int(input())\r\nprint(2*(n//3)+(n%3!=0))\r\n", "n = int(input())\r\ny = (n // 3)*2\r\nif n % 3 == 0:\r\n print(y)\r\nelse:\r\n print(y+1) ", "a = int(input())\nprint(a // 3 * 2 + (a % 3 + 2) // 3)", "n=int(input())\r\nif n%3==0:print((n//3)*2)\r\nelse:print(2*(n//3)+1)", "# cf 669 A 800\nn = int(input())\nc = 2 * (n // 3)\nif n % 3 != 0:\n c += 1\nprint(c)\n", "n = int(input())\r\nresult = int(((n * 2) + 1 ) // 3)\r\nprint(result)", "n=int(input())\r\nans=(int(n/3)*2)\r\nif n%3 !=0:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nans =2*(n//3);\r\nif n%3>0:\r\n ans += 1\r\nprint(ans)", "a = int(input())\r\nprint(a//3*2+[0,1][a%3!=0])", "x=int(input())\r\ny=int(x/3)\r\nif x%3==0:\r\n print(y*2)\r\nelse:\r\n print(y*2+1)", "\nn = int(input())\n\nprint((n // 3) * 2 + (1 if n % 3 else 0))\n", "n=int(input())\r\nif (n-1)%3==0:\r\n k=(n-1)//3\r\n print(2*k+1)\r\nif (n-2)%3==0:\r\n k=(n-2)//3\r\n print(2*k+1)\r\nif n%3==0:\r\n print(2*(n//3))\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nprint(2*(n//3)+(n%3+2)//3)", "stones = int(input())\r\nprint(((stones*2)+1)//3)\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# نشکن دلمو\r\n", "n = int(input())\r\nchislo_par = n // 3\r\npodarkov = chislo_par * 2\r\nn = n - chislo_par * 3\r\nif n == 1 or n == 2:\r\n podarkov = podarkov + 1\r\nprint(podarkov)", "n=int(input())\r\nn=2*n\r\nn=n+1\r\nprint(n//3)", "from math import *\r\nStones = int(input())\r\n\r\nprint(Stones - floor((Stones + 1)/3))\r\n", "n = int(input())\n\nif n == 1:\n print(1)\nelse:\n block = (n - 2) // 3\n item = (n - 2) % 3\n print(block * 2 + 1 + item)\n\t\t \t\t \t \t \t\t\t \t\t \t\t \t \t\t\t", "x = input()\nx = int(x)\nans = (int)(x/3)*2\nif x%3>0:\n ans+=1\nprint(ans)\n \t \t\t\t\t\t \t\t \t\t\t \t\t \t \t", "n = int(input())\na = n//3\nprint(2*a+int(n-3*a>0))\n", "n = int(input())\r\nif n%3==0:\r\n\r\n print(((n+2)//3)*2)\r\nelse:\r\n print(((n//3)*2)+1)\r\n\r\n", "n = int(input())\r\n\r\nans = 0\r\n\r\nif n % 3 == 0:\r\n ans = 2 * int(n /3)\r\nelse:\r\n ans = 2 * int(n / 3) + 1\r\n\r\nprint(ans)", "#Made by FazeCT\r\n\r\nn = int(input())\r\nflip = 1\r\nres = 0\r\nwhile n>=flip:\r\n res += 1\r\n n -= flip\r\n flip = 3 - flip\r\nprint(res)", "n=int(input())\r\na=n%3\r\nif a==1 or a==2:\r\n print(n//3*2+1)\r\nelse:\r\n print(n//3*2)\r\n", "n=int(input())\r\nans=(n//3)*2\r\nif n%3 !=0:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nif n % 3 ==0:\r\n ans = 2 * int((n // 3))\r\nelse:\r\n ans = 2 * int((n // 3)) + 1\r\nprint(ans)", "\r\nn = int(input())\r\nresult = 2 * (n // 3)\r\n\r\nif n % 3 != 0:\r\n result += 1\r\nprint(result)", "# https://codeforces.com/problemset/problem/669/A\r\n\r\nn_present = int(input())\r\nn = (n_present//3) * 2\r\nif n_present % 3 != 0:\r\n n = n+1\r\nprint(n)", "n=int(input())\r\nx=2*(n//3)\r\nif n%3!=0:\r\n x+=1\r\nprint(x)", "n = int(input())\r\n\r\nprint( 2*(n//3) + (1 if n%3 > 0 else 0))", "n = int(input())\r\ncount = 0\r\ncount += (n//3)*2\r\nn = n%3\r\nif n%3 != 0:\r\n count += 1 \r\nprint(count)", "n=int(input())\r\nprint(n//3*2+(n%3>0))", "n = int(input())\r\nprint(n // 3 * 2 + int(n % 3 != 0))", "n = int(input())\nres = 2*(n // 3) + (n%3 > 0)\nprint(res)\n", "n = int(input())\nd, r = divmod(n, 3)\nprint(d * 2 + (1 if r > 0 else 0))", "if __name__ == \"__main__\":\r\n #n, m = list(map(int, input().split()))\r\n #s = list(input().split())\r\n n = int(input())\r\n if n % 3 == 0:\r\n print(2 * (n // 3))\r\n else:\r\n print(2 * (n // 3) + 1)\r\n \r\n ", "n = int(input())\r\nx = (n/3)*2\r\n\r\n\r\nif n%3 == 0:\r\n print(int(x))\r\nelse:\r\n print(round((n/3)*2))", "n=int(input())\nif n%3==0:\n print(int((n/3)*2))\nelif n%3==1 or n%3==2:\n print((n//3)*2+1)\n\n \n\n\n ", "\r\na=int(input())\r\nif a%3==0:\r\n\tprint((a//3)*2)\r\nelif a%3==1:\r\n\tprint(((a//3)*2)+1)\r\nelse:\r\n\tprint(((a//3)*2)+1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint((n // 3) * 2 + (1 if n % 3 != 0 else 0))", "n= int(input())\r\n\r\nif(n%3==0):\r\n answer = 2*n/3;\r\nelse :\r\n answer = 2*(n-n%3)/3 + 1;\r\n\r\nprint(int(answer))", "x=int(input())\r\nif x%3==0:\r\n print(int(x/3)*2)\r\nelse:\r\n print(int(x/3)*2+1)", "n = int(input())\n\nd = n % 3\n\np = n//3\nleft = n - p*3\np *= 2\n\nif left == 2:\n p += 1\nelif left == 1:\n p += 1\n\nprint(p)\n", "stones = int(input())\n# if stones % 3 == 0:\n# print(2 * (stones // 3))\n# else:\n# print(2 * (stones // 3) + 1)\n\nextra = 1 if stones % 3 != 0 else 0\nprint(2 * (stones // 3) + extra)", "from math import ceil\r\nn=int(input())\r\nif n%3==0:\r\n print(n-int(n/3))\r\nelse:\r\n print(int(n/3)+ceil(n/3))", "a = int(input())\r\n\r\nc=0\r\nwhile a>0:\r\n a=a-1\r\n c=c+1\r\n a=a-2\r\n c=c+1\r\nif a<0:\r\n print(c-1)\r\nelse:\r\n print(c)", "print((int(input())*2+1)//3)\r\n", "n = int(input())\r\ns = n // 3 * 2\r\nif n % 3 != 0:\r\n\ts += 1\r\nprint(s)", "n = int(input())\r\nm = n \r\nt = 1\r\nans = 0\r\nfor i in range(n):\r\n if(m-1<0):\r\n break\r\n if(t==1):\r\n m-=1\r\n t=0\r\n ans += 1\r\n if(m-2<0):\r\n break\r\n if(t==0):\r\n m-=2\r\n t=1\r\n ans += 1\r\nprint(ans)\r\n \r\n \r\n ", "n=int(input())\r\nif n<=2:\r\n print(1)\r\nelse:\r\n r=n//3\r\n rem=n%3\r\n if rem==0:\r\n print(r*2)\r\n else:\r\n print(1+r*2)", "n=int(input())\r\nif((n+1)%3==0 or 2*n%3==0):\r\n print(int(2*n/3))\r\nelse:\r\n print(int(2*n/3)+1)", "n=int(input())\r\ns=0\r\nc=0\r\nf=1\r\nflag=0\r\nwhile True:\r\n if s+f<=n:\r\n s=s+f\r\n c=c+1\r\n else:\r\n break\r\n if flag%2==0:\r\n f=2\r\n flag+=1\r\n else:\r\n f=1\r\n flag+=1\r\nprint(c)\r\n \r\n \r\n\r\n", "q=int(input(''))\r\na=((q//3)*2)\r\nif q%3!=0:\r\n a+=1\r\nprint(a)", "print((2*int(input())+1)//3)\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\n\r\nn = int(input())\r\nprint((n // 3) * 2 + min(n % 3, 1))\r\n\r\n\"\"\"\r\n1\r\n1\r\n\r\n2\r\n1\r\n\r\n3\r\n1 2\r\n\r\n4\r\n1 2 1\r\n\r\n5\r\n1 2 1\r\n\r\n6\r\n1 2 1 2\r\n\r\n7\r\n1 2 1 2 1\r\n\r\n8\r\n2 1 2 1 2\r\n\r\n(1 + n) * n // 2\r\nподобрать бин поиском n\r\n\"\"\"" ]

[ "p,q,l,r =map(int,input().split())\r\nll,kk=set(),[]\r\nfor _ in range(p):\r\n x,y=map(int,input().split())\r\n for i in range(x,y+1):\r\n ll.add(i)\r\nfor _ in range(q):\r\n x,y=map(int,input().split())\r\n kk.append([x,y])\r\nres=0\r\nfor i in range(l,r+1):\r\n flag=False\r\n for m in kk:\r\n x,y=m\r\n x+=i\r\n y+=i\r\n for c in range(x,y+1):\r\n if c in ll:\r\n flag=True\r\n break\r\n if flag:\r\n res+=1\r\n break\r\nprint(res)\r\n", "p, q, l, r = map(int, input().split())\r\nintervals = [False] * 1001\r\n\r\nfor k in range(p):\r\n i, j = map(int, input().split())\r\n for index in range(i, j+1):\r\n intervals[index] = True\r\n\r\narr = []\r\nfor k in range(q):\r\n i, j = map(int, input().split())\r\n arr.append((i, j))\r\n\r\nres = 0\r\nfor i in range(l, r+1):\r\n for x, y in arr:\r\n x1 = x + i\r\n y1 = y + i\r\n find = False\r\n for index in range(x1, y1+1):\r\n if index > 1000:\r\n break\r\n if intervals[index] == True:\r\n res += 1\r\n find = True\r\n break\r\n if find:\r\n break\r\nprint(res)", "p,q,l,r=map(int,input().split());\r\nap=set();aq=set();count=0\r\nfor i in range(p):\r\n a,b=map(int,input().split())\r\n for i in range(a,b+1):\r\n ap.add(i)\r\nfor i in range(q):\r\n c,d=map(int,input().split())\r\n for i in range(c,d+1):\r\n aq.add(i)\r\nfor h in range(l,r+1):\r\n for i in aq:\r\n if (h+i) in ap:\r\n count+=1\r\n break\r\nprint(count)", "p, q, l, r = map(int, input().split())\r\n\r\nz_intervals, x_intervals = [], []\r\n\r\nfor i in range(p):\r\n x, y = map(int, input().split())\r\n z_intervals.append((x, y))\r\nfor i in range(q):\r\n x, y = map(int, input().split())\r\n x_intervals.append((x, y))\r\n\r\nchat = set()\r\nfor x_interval in x_intervals:\r\n for z_interval in z_intervals:\r\n interval_start = max(l, z_interval[0] - x_interval[1])\r\n interval_end = min(r, z_interval[1] - x_interval[0])\r\n \r\n for i in range(interval_start, interval_end + 1):\r\n chat.add(i)\r\n \r\n\r\nprint(len(chat))\r\n", "p,q,l,r = map(int,input().split())\r\nlzs = list()\r\nlxs = list()\r\nfor i in range(p):\r\n lzs.append(tuple(map(int,input().split())))\r\nfor i in range(q):\r\n lxs.append(tuple(map(int,input().split())))\r\ns = set()\r\n# count=0\r\nfor lz in lzs:\r\n for lx in lxs:\r\n x = lz[0]-lx[1]\r\n y = lz[1]-lx[0]\r\n for i in range(max(x,l),min(y,r)+1):\r\n s.add(i)\r\n\r\nprint(len(s))", "def can_chat(p, q, l, r, schedule_z, schedule_x):\r\n count = 0 # Initialize the counter to zero\r\n \r\n for wake_up_time in range(l, r + 1):\r\n can_chat_now = False\r\n \r\n for i in range(q):\r\n for j in range(p):\r\n x_start = schedule_x[i][0] + wake_up_time\r\n x_end = schedule_x[i][1] + wake_up_time\r\n z_start = schedule_z[j][0]\r\n z_end = schedule_z[j][1]\r\n \r\n # Check for overlap\r\n if max(x_start, z_start) <= min(x_end, z_end):\r\n can_chat_now = True\r\n break\r\n \r\n if can_chat_now:\r\n break\r\n \r\n if can_chat_now:\r\n count += 1 # Increment the counter if they can chat at this waking time\r\n \r\n return count\r\n\r\n# Read input values\r\np, q, l, r = map(int, input().split())\r\nschedule_z = [list(map(int, input().split())) for _ in range(p)]\r\nschedule_x = [list(map(int, input().split())) for _ in range(q)]\r\n\r\n# Calculate and print the result\r\nresult = can_chat(p, q, l, r, schedule_z, schedule_x)\r\nprint(result)\r\n", "import array\r\nimport collections\r\nimport math\r\nsums = lambda n: int(n * (n + 1) / 2) # sum from 1 to n\r\nsumsqur = lambda n: int( (n) * (n + 1) * (2*n +1)/6) # sum square from 1 to n\r\n\r\n\r\ndef im(): return map(int, input().split())\r\ndef il(): return list(map(int, input().split()))\r\ndef ii(): return int(input())\r\n\r\n# \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ndef isPalindrom(a):\r\n return True if a[::-1] == a else False\r\nxx=lambda n:int(n * (n - 1) / 2) # 2->1,3->3,4->6,5->10,6->15\r\n\r\ndef solve():\r\n p,q,l,r=im()\r\n a=[]\r\n c=[]\r\n for i in range(p):\r\n x,y=im()\r\n a.append((x,y))\r\n for i in range(q):\r\n c.append(tuple(im()))\r\n count=0\r\n for t in range(l,r+1):\r\n for i in range(q):\r\n x=0\r\n for j in range(p):\r\n if not(c[i][0]+t>a[j][1] or c[i][1]+t<a[j][0]):\r\n x=1\r\n break\r\n if x==1:\r\n count+=1\r\n break\r\n return count\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n #for i in range(ii()):\r\n print(solve())\r\n", "p,q,l,r=map(int,input().split())\r\nz=[]\r\nx=[]\r\nfor i in range(p):\r\n z.append(list(map(int,input().split())))\r\nfor j in range(q):\r\n x.append(list(map(int,input().split()))) \r\n\r\nlst=[]\r\nfor i in range(len(x)):\r\n for j in range(len(z)):\r\n lower=z[j][0]-(x[i][1])\r\n upper=z[j][1]-x[i][0]\r\n if(lower>=l and upper<=r):\r\n for k in range(lower,upper+1):\r\n if(k not in lst):\r\n lst.append(k)\r\n if(lower<=l and upper<=r):\r\n for k in range(l,upper+1):\r\n if(k not in lst):\r\n lst.append(k)\r\n if(lower<=l and upper>=r):\r\n for k in range(l,r+1):\r\n if(k not in lst):\r\n lst.append(k)\r\n if(lower>=l and upper>=r):\r\n for k in range(lower,r+1):\r\n if(k not in lst):\r\n lst.append(k)\r\n\r\nprint(len(lst)) \r\n\r\n" ]

[ "n=int(input())\r\nstringVector=[]\r\nfor i in range(n):\r\n stringVector.append(input())\r\nstringVector=list(sorted(stringVector, key=lambda x: (-len(x),x)))[::-1]\r\nok=\"YES\"\r\nfor i in range(n-1):\r\n if stringVector[i] not in stringVector[i+1]:\r\n ok=\"NO\"\r\n break\r\nprint(ok)\r\nif ok==\"YES\":\r\n for s in stringVector:\r\n print(s)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n s=input()[:-1]\r\n l.append([s,len(s)])\r\nl.sort(key=lambda x: x[1])\r\nf=1\r\nfor i in range(1,n):\r\n if l[i][0].find(l[i-1][0])==-1:\r\n f=0\r\n break\r\nif f==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(l[i][0])", "s = sorted((input() for i in range(int(input()))),key = len)\r\n\r\nif all(x in y for x,y in zip(s,s[1:])):\r\n print(\"YES\")\r\n print(*s,sep = ' ')\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n t = input()\r\n s.append(t)\r\ns.sort(key=lambda x: len(x))\r\nans = True\r\nfor i in range(1, n):\r\n if s[i-1] not in s[i]:\r\n ans = False\r\nif ans:\r\n print(\"YES\")\r\n for k in s:\r\n print(k)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\narra=[]\r\nflag=False\r\nfor i in range(n):\r\n arra.append(input())\r\nfor i in range(n):\r\n for j in range(n-1):\r\n if len(arra[j])>len(arra[j+1]):\r\n a=arra[j]\r\n arra[j]=arra[j+1]\r\n arra[j+1]=a\r\nfor i in range(n-1):\r\n if arra[i+1].find(arra[i])==-1:\r\n print(\"NO\")\r\n flag=True\r\n break\r\nif flag==False:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(arra[i])\r\n", "import sys\r\nimport os.path\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\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\ns= [input().strip() for i in range(n)]\r\n\r\ns.sort(key=lambda x: len(x))\r\nf=True\r\nfor i in range(1,n):\r\n if s[i-1] not in s[i]:\r\n f=False\r\n break\r\nif f: print(\"YES\\n\"+\"\\n\".join(s))\r\nelse: print(\"NO\")", "def check(a,b):\r\n m=len(a)\r\n n=len(b)\r\n ans=False\r\n for i in range(n-m+1):\r\n if b[i:i+m]==a:\r\n ans=True\r\n break\r\n return ans\r\n \r\n\r\nt=int(input())\r\nlist=[]\r\nfor i in range(t):\r\n str=input()\r\n list.append((len(str),str))\r\nlist.sort()\r\nfinal=[]\r\nfor p in range(len(list)):\r\n final.append(list[p][1])\r\nfound=False\r\nfor j in range(len(final)-1):\r\n if not check(final[j],final[j+1]):\r\n found=True\r\n break\r\nif found:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for k in range(len(final)):\r\n print(final[k])\r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append([len(s), s])\r\na.sort(key=lambda x: x[0])\r\nb=[]\r\nflag=0\r\nfor i in range(n-1):\r\n if a[i][1] in a[i+1][1]:\r\n b.append(a[i][1])\r\n else:\r\n flag=1\r\n break\r\n\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n b.append(a[-1][1])\r\n print('YES')\r\n for i in range(n):\r\n print(b[i])", "# from collections import defaultdict, Counter\r\n# from bisect import bisect, bisect_left\r\n# from math import sqrt, gcd\r\n# def read(): return list(map(int, input().strip().split()))\r\n\r\n# ans_ = []\r\n\r\n# def f(s):\r\n# last = -1\r\n# dp = [0]*len(s)\r\n# count = 0\r\n# for i in range(len(s)):\r\n# x = [0, 1][s[i] == \"*\"]\r\n# dp[i] += dp[last]\r\n# dp[i] += count*(i-last-x)\r\n# count += x\r\n# last = [last, i][x]\r\n# return(dp)\r\n\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input()); s = input().strip()\r\n# a = f(s)\r\n# b = f(s[::-1])[::-1]\r\n# ca = s.count(\"*\")\r\n# ans = float(\"inf\")\r\n# c = 0\r\n# for i in range(n):\r\n# if s[i] == \"*\":\r\n# c += 1\r\n# ans = min(ans, (a[i]+b[i]))\r\n# else:\r\n# ans = min(ans, (a[i]+b[i]-max(c, ca-c)))\r\n\r\n# # print(a, \"\\n\", b)\r\n# if c != 0:\r\n# ans_.append(ans)\r\n# else:\r\n# ans_.append(0)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n# # print(ans_)\r\n# for i in ans_:\r\n# print(i)\r\n\r\n\r\n# \"\"\"\r\n\r\n# 1\r\n\r\n# 1\r\n\r\n\r\n# 2 1 2 3 4\r\n\r\n# 3 1 2 3 4 5 6 7 8 9\r\n\r\n# 1 3 5\r\n# 4 6 \r\n\r\n\r\n# \"\"\"\r\n\r\nfrom collections import defaultdict, Counter\r\nfrom bisect import bisect, bisect_left\r\nfrom math import sqrt, gcd\r\n \r\ndef read(): return list(map(int, input().strip().split()))\r\n \r\nans_ = []\r\n \r\ndef f(lis, n):\r\n for i in range(1, n):\r\n if not lis[i-1] in lis[i]:return(False)\r\n return(True)\r\n\r\n \r\n# for _ in range(int(input())):\r\nn = int(input()); arr = [input().strip() for i in range(n)]\r\narr.sort(key = len)\r\n# print(arr)\r\nif f(arr, n):\r\n ans_.append(\"YES\")\r\n ans_.append((\"\\n\").join(arr))\r\nelse:\r\n ans_.append(\"NO\")\r\n\r\n\r\n \r\n \r\n# print(ans_)\r\nfor i in ans_:\r\n print(i)\r\n \r\n \r\n\"\"\"\r\n9 + 9 + \r\n\"\"\"", "def is_contain(words):\n for i in range(n-1):\n if words[i] not in words[i+1]:\n return False\n return True\nif __name__ == '__main__':\n n = int(input())\n words = []\n for i in range(n):\n words.append(input())\n words.sort(key=lambda x: len(x))\n if is_contain(words):\n print(\"YES\")\n for word in words:\n print(word)\n else:\n print(\"NO\")\n \n\n \t \t \t \t\t \t\t\t\t \t\t\t\t \t\t", "c=[]\r\nl=[]\r\nfor _ in range(int(input())):\r\n\ts=input()\r\n\tc.append(s)\r\n\tl.append(len(s))\r\nn=len(l)\r\nfor i in range(n-1):\r\n\tfor j in range(n-i-1):\r\n\t\tif l[j]>l[j+1]:\r\n\t\t\tl[j],l[j+1]=l[j+1],l[j]\r\n\t\t\tc[j],c[j+1]=c[j+1],c[j]\r\nfor i in range(1,n):\r\n\tif c[i-1] not in c[i]:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor k in c:\r\n\t\tprint(k)\r\n\r\n", "from collections import defaultdict\r\nn=int(input())\r\nd=defaultdict(list)\r\nb=[]\r\nfor _ in range(n):\r\n s=input()\r\n l=len(s)\r\n d[l].append(s)\r\n if l not in b:\r\n b.append(l)\r\nb.sort()\r\na=[]\r\ncase=True\r\nfor i in b:\r\n for j in d[i]:\r\n a.append(j)\r\nfor i in range(n-1):\r\n s=a[i]\r\n p=a[i+1]\r\n # print(s,p)\r\n if s not in p:\r\n print(\"NO\")\r\n case=False\r\n break\r\nif case:\r\n print(\"YES\")\r\n for i in a:\r\n print(i)", "lit=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n lit.append(s)\r\nfor i in range(0,n):\r\n for j in range(i+1,n):\r\n if len(lit[i])>len(lit[j]):\r\n s=lit[i]\r\n lit[i]=lit[j]\r\n lit[j]=s\r\nc=0\r\nfor i in range(1,n):\r\n x=lit[i-1] in lit[i]\r\n if x==False:\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in lit:\r\n print(i)", "n = int(input())\ncount = 0\n\nstring_list = []\n\nfor i in range(n):\n string_list.append(input())\n\nstring_list = sorted(string_list, key=len)\nfor i in range(len(string_list)-1):\n if string_list[i] in string_list[i+1]:\n count +=1\nif count+1 == n:\n print('YES')\n for i in range(len(string_list)):\n print(string_list[i])\nelse:\n print('NO')\n", "lst = []\r\nans= \"YES\"\r\nfor _ in range(int(input())):\r\n lst += [input().strip()]\r\nlst = sorted(lst, key = len)\r\nfor i in range(len(lst) - 1):\r\n if lst[i] not in lst[i+1]:\r\n ans = \"NO\"\r\n break\r\nif ans == \"NO\":\r\n print(ans)\r\nelse:\r\n print(ans)\r\n for i in lst:\r\n print(i)", "n=int(input())\r\ninput_strings=[]\r\nfor i in range(n):\r\n input_strings.append(input())\r\nsorted_strings=sorted(input_strings,key=len)\r\ncount=0\r\nfor i in range(len(sorted_strings)-1):\r\n if sorted_strings[i] in sorted_strings[i+1]:\r\n count+=1\r\nif count==len(sorted_strings)-1:\r\n print(\"YES\")\r\n for i in sorted_strings:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "def sort(s, n):\r\n for i in range(1, n):\r\n temp = s[i]\r\n j = i - 1\r\n while j >= 0 and len(temp) < len(s[j]):\r\n s[j + 1] = s[j]\r\n j -= 1\r\n\r\n s[j + 1] = temp\r\n\r\n\r\nn = int(input())\r\nstrings = []\r\nfor _ in range(n):\r\n s = input()\r\n strings.append(s)\r\n\r\ncheck = True\r\nsort(strings, n)\r\n# print(strings)\r\nfor i in range(0, n-1):\r\n if (strings[i] not in strings[i+1]):\r\n # print(strings[i], strings[i+1])\r\n check = False\r\n break\r\n\r\nif (not check):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in strings:\r\n print(i)\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n S = []\r\n groups = defaultdict(set)\r\n\r\n for _ in range(n):\r\n s = input().strip()\r\n S.append(s)\r\n groups[len(s)].add(s)\r\n\r\n if len(groups[len(s)]) > 1:\r\n print(\"NO\")\r\n return\r\n\r\n S.sort(key=len)\r\n is_chain_substrs = all(S[i] in S[i + 1] for i in range(n - 1))\r\n if is_chain_substrs:\r\n print(\"YES\")\r\n print(\"\\n\".join(S))\r\n else:\r\n print(\"NO\")\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ndef cmp(s): return len(s)\r\nn=int(input())\r\nq=[input() for i in range(n)]\r\nq.sort(key=cmp)\r\nans=[q[0]]\r\nfor i in range(1, n):\r\n for s in ans:\r\n if s not in q[i]:\r\n print('NO')\r\n sys.exit()\r\n ans.append(q[i])\r\nprint('YES')\r\nfor i in ans: print(i)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\nnorm = lambda s: s.replace('\\n', '')\r\nn = int(input())\r\nmas = [norm(input()) for i in range(n)]\r\nmas.sort(key=len)\r\nf = True\r\nfor i in range(len(mas) - 1):\r\n if mas[i] in mas[i + 1]:\r\n f = True\r\n else:\r\n f = False\r\n print('NO')\r\n exit()\r\nif f:\r\n print('YES')\r\n print(*mas, sep='\\n')\r\n", "import sys\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n): lst.append(input())\r\na=sorted(lst,key=len)\r\nfor i in range(1, n):\r\n if a[i-1] not in a[i]:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')\r\nfor i in a:\r\n print(i)", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nans=[]\r\nfor i in range(n):\r\n temp=0\r\n for j in range(n):\r\n if i!=j and arr[j] in arr[i]:\r\n temp+=1\r\n ans.append((temp,arr[i])) \r\nans.sort()\r\nres=[]\r\nfor v in range(n-1,-1,-1):\r\n if ans[-1][0]>=v:\r\n res.append(ans.pop()[1])\r\n else :\r\n break\r\nif len(ans):\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n while res:\r\n print(res.pop())", "import heapq\r\nimport math, itertools\r\nimport sys, collections\r\nimport bisect, queue\r\nimport copy\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nlist1 = []\r\nfor _ in range(int(input())):\r\n list1.append(input())\r\nlist1.sort( key=lambda x:len(x))\r\n\r\nf = 1\r\nfor i in range(1,len(list1)):\r\n if list1[i-1] not in list1[i]:\r\n f = 0\r\n break\r\nif f:\r\n print(\"YES\")\r\n for i in list1:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n", "a = sorted([input() for i in range(int(input()))], key=lambda x: len(x))\r\nprint(*(('NO',),('YES', *a))[all(i in j for i, j in zip(a, a[1:]))], sep='\\n')\r\n", "# https://codeforces.com/contest/988/problem/B\n\n\ndef print_yes(ans):\n print(\"YES\")\n print(\"\\n\".join(i for i in ans))\n\ndef find_substrings(strings):\n strings.sort(key = len)\n answer = [strings[0]]\n n = len(strings)\n for i in range(1, n):\n if strings[i-1] not in strings[i]:\n print(\"NO\")\n return\n answer.append(strings[i])\n return print_yes(answer)\n\n\ndef main():\n n = int(input())\n s = [input() for _ in range(n)]\n find_substrings(s)\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n p=input()\r\n a.append(p)\r\na.sort(key=len)\r\nflag=1\r\nfor i in range(len(a)-1):\r\n if a[i] in a[i+1]:\r\n continue\r\n else:\r\n flag=0\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(len(a)):\r\n print(a[i])\r\n \r\n \r\n \r\n \r\n", "l=[]\r\nfor n in range(int(input())):\r\n l.append(input())\r\nl.sort(key=len)\r\nflag=1\r\nfor i in range(len(l)-1):\r\n if l[i] not in l[i+1]:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "l=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n s=input()\r\n l.append(s)\r\nl.sort(key=len)\r\nres=1\r\nfor i in range(n):\r\n if i!=n-1 and l[i] not in l[i+1]:\r\n res=-1\r\n break\r\n \r\nif res==1:\r\n print('YES')\r\n for each in l:\r\n print(each)\r\nelse:\r\n print('NO')", "n=int(input())\nl=[]\nfor i in range(n):\n s=input()\n l.append((len(s),s))\nl.sort()\ncntr=1\nfor i in range(1,n):\n if l[i-1][1] not in l[i][1]:\n cntr=0\n break\nif cntr==0:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in l:\n print(i[1])", "import sys\r\n\r\nn = int(input())\r\nlst = []\r\nfor _ in range(n):\r\n lst.append(input())\r\n\r\na = sorted(lst, key=len)\r\nfor i in range(1, n):\r\n if a[i - 1] not in a[i]:\r\n print('NO')\r\n sys.exit()\r\n\r\nprint('YES')\r\nfor i in a:\r\n print(i)", "# from bisect import bisect, bisect_left, bisect_right\r\nimport math\r\n# import random\r\n# import sys\r\n# sys.stdin.readlines() \r\nfrom sys import stdin\r\n# stdin.readlines()\r\n# __import__(\"sys\").stdin.readlines()\r\n\r\ndef __gcd(a, b): return a if b == 0 else __gcd(b, a % b)\r\n\r\ndef __lcm(a, b): return a * b // __gcd(a, b)\r\n\r\n\r\ndef __dist(x1, y1, x2, y2): return (x1 - x2) ** 2 + (y1 - y2) ** 2\r\n# :):\r\ndef __getprimes(n):\r\n isprime = [True for i in range(n + 1)]; primes = []\r\n for j in range(4, n + 1, 2): isprime[j] = False\r\n for i in range(3, n + 1, 2):\r\n if isprime[i]:\r\n for j in range(i * i, n + 1, i): \r\n \tisprime[j] = False\r\n if 1 < n: primes.append(2)\r\n for i in range(3, n + 1, 2):\r\n if isprime[i]: primes.append(i)\r\n return primes\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n\ts = input()\r\n\ta.append([len(s), s])\r\na.sort()\r\nfor i in range(1, n):\r\n\tif a[i - 1][1] in a[i][1]: continue\r\n\telse: \r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\nprint(\"YES\")\r\nfor x in a: print(x[1])", "n = int(input())\r\nar = sorted((input() for _ in range(n)), key = lambda x:len(x))\r\nx = all(ar[i] in ar[i+1] for i in range(n-1))\r\nprint('YES\\n'+\"\\n\".join(ar) if x else 'NO')", "n=int(input())\r\nls=[]\r\n\r\nfor _ in range(n):\r\n s=input();ls.append(s)\r\n\r\nls.sort(key=lambda x:len(x))\r\n\r\nfor i in range(len(ls)-1):\r\n if ls[i] not in ls[i+1]:\r\n print('NO')\r\n exit()\r\nelse:\r\n print('YES');print('\\n'.join(ls))\r\n", "n = int(input())\r\n\r\nst = []\r\n\r\nfor i in range(n):\r\n st.append(input())\r\n\r\nfor i in range(len(st)):\r\n for j in range(len(st) - 1 - i):\r\n if len(st[j]) > len(st[j + 1]):\r\n st[j], st[j + 1] = st[j + 1], st[j]\r\nflag = 1\r\n\r\nfor i in range(1, len(st)):\r\n if st[i - 1] not in st[i]:\r\n flag = 0\r\n\r\nif flag:\r\n print(\"YES\")\r\n for i in range(len(st)):\r\n print(st[i])\r\nelse:\r\n print(\"NO\")", "x = []\nl = []\nd = {}\nn = int(input())\nfor _ in range(n):\n\ts = input()\n\tx.append(s)\n\tif len(s) in d:\n\t\td[len(s)].append(s)\n\telse:\n\t\tl.append(len(s))\n\t\td[len(s)] = [s]\nl.sort()\nans = []\nfor i in l:\n\tz = d[i]\n\tz.sort()\n\tans+=z\nflag = 0\nfor i in range(len(ans)-1):\n\tif ans[i] not in ans[i+1]:\n\t\tflag = 1\n\t\tbreak\nif flag == 1:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tfor i in ans:\n\t\tprint(i)\n \t \t \t\t\t\t \t \t\t \t\t \t\t \t \t", "def solve(n):\r\n l = list(); ans = list()\r\n for _ in range(n):\r\n s = input(); l.append((len(s), s))\r\n l.sort()\r\n for i in range(n-1):\r\n if l[i][1] not in l[i+1][1]:\r\n print(\"NO\"); return\r\n ans.append(l[i][1])\r\n ans += [l[-1][1]]\r\n print(\"YES\\n\" + \"\\n\".join(ans))\r\n\r\ndef main():\r\n solve(int(input()))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nx=[]\r\nprev=''\r\nfor i in range(n):\r\n x.append(input())\r\ny=sorted(x,key=len)\r\nfor i in y:\r\n if prev not in i:\r\n print('NO')\r\n exit()\r\n prev=i\r\nprint('YES')\r\nfor i in y:\r\n print(i)", "l=[]\r\nfor i in range(int(input())):l.append(input())\r\nl.sort(key=lambda x:len(x))\r\nfor i in range(1,len(l)):\r\n if l[i-1]not in l[i]:print('NO');exit()\r\nelse:print('YES');print('\\n'.join(l))\r\n", "a=sorted([input()for _ in[0]*int(input())],key=lambda x:len(x))\r\nr=any(x not in y for x,y in zip(a,a[1:]))\r\nprint('YNEOS'[r::2])\r\nif r<1:print(*a,sep='\\n')\r\n", "n = int(input(''))\r\n\r\ndat = []\r\n\r\nfor i in range(n):\r\n dat.append(input())\r\n\r\nfor i in range(len(dat)):\r\n for j in range(len(dat)-1-i):\r\n if len(dat[j]) > len(dat[j+1]):\r\n dat[j] , dat[j+1] = dat[j+1] , dat[j]\r\nf = 0\r\nfor i in range(1,len(dat)):\r\n if dat[i-1] not in dat[i]:\r\n f = 1\r\nif f:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(len(dat)):\r\n print(dat[i])\r\n", "n = int(input())\r\na = [input() for _ in range(n)]\r\na.sort(key=lambda x: len(x))\r\nfor i in range(n - 1):\r\n if a[i] not in a[i + 1]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nprint(\"\\n\".join(a))", "lst = [w.rstrip() for w in open(0).readlines()][1:]\r\nlst.sort(key=lambda x: len(x))\r\nres = all(x in y for x, y in zip(lst, lst[1:]))\r\nif res:\r\n print(\"YES\")\r\n print(\"\\n\".join(lst))\r\nelse:\r\n print(\"NO\")", "def method(s1, s2):\r\n return s1 in s2\r\n\r\n\r\nn = int(input())\r\nniz = []\r\nfor i in range(n):\r\n c = input()\r\n niz.append(c)\r\nniz.sort(key = len)\r\nfor i in range(n - 1):\r\n if method(niz[i], niz[i + 1]) == 0:\r\n print(\"NO\")\r\n break\r\nelse: \r\n print(\"YES\")\r\n for i in niz:\r\n print(i)", "n = int(input())\r\n\r\nss = []\r\n\r\nfor i in range(n):\r\n\tss.append(input())\r\n\r\nss.sort(key=len)\r\n\r\nif all(ss[i] in ss[i+1] for i in range(len(ss)-1)):\r\n\tprint('YES')\r\n\tprint(*ss, sep='\\n')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nstrings = sorted([input() for _ in range(n)], key=len)\r\nanswer = True\r\nfor i in range(n-1):\r\n if strings[i] not in strings[i+1]:\r\n answer = False\r\n break\r\n\r\nif answer:\r\n print(\"YES\")\r\n for s in strings:\r\n print(s)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nl.sort(key = len)\r\nfor i in range(1, n):\r\n if l[i-1] not in l[i]:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\nprint('\\n'.join(l))\r\nexit()\r\n", "n = int(input())\na = [None] * n\nfor i in range(n):\n a[i] = input()\na.sort(key=lambda x: len(x))\nflag = True\nfor i in range(1, n):\n if a[i - 1] in a[i]:\n pass\n else:\n flag = False\n break\nif flag:\n print(\"YES\")\n print(*a, sep=\"\\n\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\nls = sorted([input() for _ in range(n)], key=len)\r\nlz = zip(ls, ls[1:])\r\nif all(map(lambda x: x[0] in x[1], lz)):\r\n print(\"YES\")\r\n print(\"\\n\".join(ls))\r\nelse:\r\n print(\"NO\")", "strings = []\nn = int(input())\nfor i in range(n):\n strings.append(input())\nstrings = sorted(strings, key=len)\nfor i in range(n-1):\n if not strings[i] in strings[i+1]:\n print('NO')\n exit(0)\nelse:\n print('YES')\nfor s in strings:\n print(s)", "def can_rearrange_strings(strings):\r\n strings.sort(key=len) \r\n for i in range(1, len(strings)):\r\n if strings[i].find(strings[i - 1]) == -1:\r\n return False\r\n return True\r\nn = int(input())\r\nstrings = []\r\nfor _ in range(n):\r\n strings.append(input())\r\nif can_rearrange_strings(strings):\r\n print(\"YES\")\r\n for s in strings:\r\n print(s)\r\nelse:\r\n print(\"NO\")\r\n", "a = []\r\nn = int(input())\r\nfor i in range(n):\r\n a.append(input())\r\na.sort(key=lambda x: len(x))\r\nflag = True\r\nfor i in range(1, n):\r\n if a[i - 1] not in a[i]:\r\n flag = False\r\nif flag:\r\n print(\"YES\")\r\n print(*a, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n) :\r\n ch=input()\r\n l.append(ch)\r\nl.sort(key=lambda item:len(item))\r\ni=0\r\ntest=True\r\nwhile i<n-1 :\r\n if l[i+1].find(l[i])== -1 :\r\n print('NO')\r\n test=False\r\n break\r\n else :\r\n i+=1\r\nif test==True :\r\n print('YES')\r\n for i in range(n) :\r\n print(l[i])", "def compare(item):\n return len(item), item\n\n\nline = input()\nn = int(line)\n\nstrings = [input() for i in range(n)]\n\nstrings.sort(key=compare)\n\nans = True\nfor i in range(len(strings) - 1):\n if strings[i] in strings[i + 1]:\n continue\n else:\n ans = False\n\nif ans:\n print(\"YES\")\n for i in strings:\n print(i)\nelse:\n print(\"NO\")\n\n \t\t \t \t\t \t\t \t\t \t \t \t \t", "def key(e):\r\n return len(e)\r\n\r\nn = int(input())\r\narr = sorted([input() for i in range(n)] , key = key)\r\n\r\nl = arr[0]\r\no = \"\"\r\nr = True\r\nfor e in arr:\r\n if l not in e:\r\n r = False\r\n break\r\n else:\r\n o += e + \"\\n\"\r\n l = e\r\nif r:\r\n print(\"YES\")\r\n print(o)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = [input() for i in range(n)]\r\na.sort(key = len)\r\nf = 0\r\nfor i in range(n-1):\r\n\tif a[i] not in a[i+1]:\r\n\t\tf = 1\r\n\t\tbreak\r\nif f:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(*a, sep = \"\\n\")\r\n\r\n", "n = int(input())\r\nli = []\r\n\r\nfor _ in range(n):\r\n li.append(input())\r\n\r\nli.sort(key=lambda x: (len(x),x))\r\n\r\nflag = True\r\nfor i in range(n-1):\r\n if li[i] not in li[i+1]:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(li[i])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nar = list()\r\nfor i in range(n):\r\n ar.append(input())\r\ndef custom_key(str):\r\n return len(str)\r\nar = sorted(ar, key = custom_key)\r\nflag = True\r\nfor i in range(1, n):\r\n if(ar[i-1] not in ar[i]):\r\n flag = False\r\n print('NO')\r\n break\r\nif flag:\r\n print('YES')\r\n for i in ar:\r\n print(i)", "n=int(input())\r\nar=[]\r\nfor x in range(n):\r\n ch=input()\r\n ar.append(ch)\r\nfor x in range(n-1):\r\n for y in range(n-x-1):\r\n if len(ar[y])>len(ar[y+1]):\r\n ar[y],ar[y+1]=ar[y+1],ar[y]\r\nm=True\r\nfor x in range(1,n):\r\n if ar[x-1] not in ar[x]:\r\n m=False\r\n break\r\nif m:\r\n print(\"YES\")\r\n for x in ar:\r\n print(x)\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\n-*- coding: utf-8 -*-\r\n\r\nCreated on Sun Jan 16 17:35:49 2022\r\n\r\n@author: Tausif Khan Arnob\r\n\"\"\"\r\n\r\nn = int(input())\r\na = sorted((input() for _ in range(n)), key = lambda x:len(x))\r\nprint(['NO', '\\n'.join(['YES'] + a)][all(x in y for x, y in zip(a, a[1:]))])", "n = int(input())\nl = []\n\nwhile n:\n l.append(input())\n n -= 1\n\nl.sort(key=len)\n\nfor i, _ in enumerate(l):\n try:\n if l[i + 1].find(l[i]) == -1:\n print('NO')\n exit()\n except IndexError:\n print('YES')\n for i in l:\n print(i)\n", "n = int(input())\na = [input() for _ in range(n)]\na.sort(reverse=True, key=lambda x: len(x))\nprev = a[0]\nfor i in a[1:]:\n if i not in prev:\n print(\"NO\")\n exit(0)\n prev = i\nprint(\"YES\", *a[::-1], sep=\"\\n\")", "import sys\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\nn = int(input())\r\ns = []\r\nml = 0; ms = ''\r\nfor _ in range(n):\r\n t = input()\r\n s.append((len(t), t))\r\n \r\ns = sorted(s)\r\n\r\ni = 0\r\nwhile i<len(s) - 1:\r\n if s[i][1] not in s[i+1][1]: print(\"NO\"); sys.exit()\r\n i+=1\r\n\r\nprint(\"YES\")\r\nfor i in s:\r\n print(i[1])", "x=[]\na=0\nfor _ in \" \"*int(input()):\n\tx.append(input())\n\ta+=1\nx.sort(key=len)\nm=x[-1]\nfor i in range(a-1):\n\tif x[i] not in x[i+1]:\n\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"YES\")\n\tprint(\"\\n\".join(x))\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\nc=1\r\nfor i in range(n):\r\n l.append(input())\r\np=sorted(l,key=len)\r\nfor i in range(n-1):\r\n if p[i] in p[i+1]:\r\n c+=1\r\n else:\r\n break\r\nif c==n:\r\n print('YES')\r\n for i in p:\r\n print(i)\r\nelse:\r\n print('NO')", "num=int(input())\nwords=[input() for i in range (num)]\nwords.sort(key=len)\nl=[\"YES\"]\nl.extend(words)\nfor i in range(len(words)-1):\n if words[i] not in words[i+1]:\n l.clear()\n l.append(\"NO\")\n break\nfor i in l:\n print(i) \n\n\t \t\t\t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\n\r\nmy_list = []\r\n\r\nfor i in range(n):\r\n item = input()\r\n my_list.append(item)\r\n \r\nmy_list.sort(key= len)\r\n\r\nfor i in range(len(my_list) - 1):\r\n if my_list[i] not in my_list[i + 1]:\r\n print(\"NO\")\r\n break\r\n \r\nelse:\r\n print(\"YES\")\r\n for i in my_list:\r\n print(i)\r\n ", "inf=10**18\r\ndxy=[(0,1), (1,0), (-1, 0), (0, -1)]\r\nmod=10**9+7\r\nMOD=998244353\r\n\r\n\r\ndef is_substring(sub, full):\r\n s,f = len(sub), len(full)\r\n for i in range(f-s+1):\r\n if sub==full[i:i+s]: return True\r\n return False\r\n\r\n\r\nN = int(input())\r\nstrings = []\r\nfor _ in range(N):\r\n s = input()\r\n strings.append([len(s), s])\r\nstrings.sort()\r\n\r\nfor i in range(N-1):\r\n if not is_substring(strings[i][1], strings[i+1][1]):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor _, i in strings: print(i)\r\n", "n=int(input())\nl1=[]\nc=0\nfor _ in range(n):\n\ts=input()\n\tl1.append(s)\nl = list(sorted(l1, key = len))\nfor i in range(n-1):\n\tif(l[i] not in l[i+1]):\n\t\tprint(\"NO\")\n\t\tc=1\n\t\tbreak\nif(c==0):\n\tprint(\"YES\")\n\tfor i in l:\n\t\tprint(i)\n \t\t\t\t\t \t\t \t\t \t\t \t", "s = []\r\nq = True\r\nfor i in range(int(input())):\r\n s.append(input())\r\ns.sort(key=len)\r\nfor i in range(len(s) - 1):\r\n if s[i] not in s[i + 1]:\r\n q = False\r\nif q:\r\n print('YES')\r\n print(*s, sep='\\n')\r\nelse:\r\n print('NO')", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(input().strip())\r\n\r\narr.sort(key=lambda x: -len(x))\r\n\r\nf = True\r\n\r\nfor i in range(0, n-1):\r\n s1 = arr[i]\r\n s2 = arr[i+1]\r\n\r\n if len(s1) == len(s2):\r\n if s1 != s2:\r\n f = False\r\n break\r\n else:\r\n if not s2 in s1:\r\n f = False\r\n break\r\n\r\nif f:\r\n print(\"YES\")\r\n print(\"\\n\".join(arr[::-1]))\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def Sorting(lst):\r\n lst.sort(key=len)\r\n return lst\r\n\r\nn = int(input())\r\nv = list()\r\nfor i in range(n):\r\n a = input()\r\n v.append(a)\r\nv = Sorting(v)\r\n# print(v)\r\nb = bool(1)\r\nfor i in range(len(v)-1):\r\n if v[i] not in v[i+1]:\r\n print(\"NO\")\r\n b = bool(0)\r\n break\r\nif b: \r\n print(\"YES\")\r\n for i in v:\r\n print(i)", "t = int(input())\nl = []\nfor i in range(t):\n s = input()\n l.append(s)\nl1 = sorted(l, key = len)\nq = 0\nfor i in range(t-1):\n if l1[i] in l1[i+1]:\n q += 1\nif q == t-1:\n print('YES')\n for i in l1:\n print(i)\nelse:\n print('NO')", "n=int(input())\nlst=[]\nfor i in range(n):\n s=input()\n lst.append(s)\nlst.sort(key=len)\nc=1\nfor i in range(len(lst)):\n c=1\n for j in range(i+1,len(lst)):\n if lst[j].count(lst[i])==0:\n c=0\n break\n if c==0:\n break\nif c==0:\n print('NO')\nelse:\n print('YES')\n for i in range(len(lst)):\n print(lst[i])", "import sys\r\n\r\n\r\nLI = lambda: list(map(int, sys.stdin.readline().split()))\r\nMI = lambda: map(int, sys.stdin.readline().split())\r\nSI = lambda: sys.stdin.readline().strip('\\n')\r\nII = lambda: int(sys.stdin.readline())\r\n\r\n# sys.stdin = open(\"Round 3 - 486/input.txt\", \"r\")\r\n\r\nn = II()\r\nstrings = []\r\nfor i in range(n):\r\n s = SI()\r\n strings.append(s)\r\n\r\n\r\nfor i in range(len(strings)):\r\n for j in range(i, len(strings)):\r\n if strings[i] not in strings[j]:\r\n temp = strings[j]\r\n strings[j] = strings[i]\r\n strings[i] = temp\r\n\r\ncount = 0\r\nfor s in range(len(strings)-1):\r\n if strings[s] in strings[s+1]:\r\n count += 1\r\n\r\nif count == len(strings)-1:\r\n print(\"YES\")\r\n for i in strings:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\nlst = []\nfor i in range(n):\n\ts = str(input())\n\tlst.append(s)\nlst = sorted(lst, key = len)\np = lst[0]\nans = [p]\nk = 'YES'\nfor i in range(1, n):\n\tif p in lst[i]:\n\t\tans.append(lst[i])\n\t\tp = lst[i]\n\telse :\n\t\tk = 'NO'\n\t\tbreak\nprint(k)\nif k == 'YES':\n\tfor i in range(n):\n\t\tprint(ans[i])\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\na.sort(key=len)\r\n\r\nf = 1\r\nfor i in range(n - 1):\r\n if a[i] in a[i+1]:\r\n continue\r\n f = 0 \r\nif f == 0:\r\n print(\"NO\")\r\nif f:\r\n print(\"YES\")\r\n for el in a:\r\n print(el)", "def check(s1,s2):\r\n n=len(s1)\r\n m=len(s2)\r\n for i in range(m-n+1):\r\n if s1==s2[i:i+n]:\r\n return True\r\n return False\r\nn=int(input())\r\nst=[]\r\nfor _ in range(n):\r\n st.append(str(input()))\r\nst.sort(key=lambda x: len(x))\r\nfor i in range(n-1):\r\n if not check(st[i],st[i+1]):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for a in st:\r\n print(a)", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n ls.append(input())\r\nls.sort(key=len)\r\nok = True\r\nfor i in range(n-1):\r\n if not (ls[i] in ls[i+1]):\r\n ok = False\r\n break\r\nif ok == True:\r\n print(\"YES\")\r\n for x in ls: \r\n print(x)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = sorted((input() for _ in range(n)), key=lambda x: len(x))\r\nv = all(s[i] in s[i+1] for i in range(n-1))\r\nif (v == True):\r\n print('YES\\n'+\"\\n\".join(s))\r\nelse:\r\n print(\"NO\")\r\n", "t = int(input())\r\na = sorted((input() for _ in range(t)), key=lambda res: len(res))\r\nans = all(a[i] in a[i+1] for i in range(t-1))\r\nprint('YES\\n'+\"\\n\".join(a) if ans else 'NO')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\n\r\n\r\nlst=sorted(l,key=len)\r\ni=0\r\nwhile i <n-1:\r\n if lst[i] in lst[i+1]:\r\n i+=1\r\n else:\r\n break\r\n\r\nif i==n-1:\r\n print (\"YES\")\r\n for x in lst:\r\n print (x)\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "a=[]\r\nfor _ in range(int(input())):\r\n a.append(input())\r\nfor j in range(len(a)):\r\n changes=0\r\n for i in range(len(a)-1):\r\n if len(a[i])>len(a[i+1]):\r\n a[i],a[i+1]=a[i+1],a[i]\r\n changes+=1\r\n if changes==0:\r\n break\r\nstatus=True\r\nfor i in range(len(a)-1):\r\n if len(a[i+1].split(a[i]))<2:\r\n status=False\r\nif status==True:\r\n print(\"YES\")\r\n print(\"\\n\".join(a))\r\nelse:print(\"NO\")", "n = int(input())\nl = []\nans = \"YES\"\nfor i in range(n):\n l.append(input())\nl = sorted(l, key = len)\nfor i in range(n - 1):\n if l[i] not in l[i + 1]:\n ans = \"NO\"\n break\nprint(ans)\nif ans == \"YES\":\n for j in l:\n print(j)\n \t\t\t\t \t \t \t \t \t \t\t \t\t\t \t \t", "lst=[]\r\nfor q in range(int(input())):\r\n s=input()\r\n lst.append(s)\r\nlst.sort(key=len)\r\na=1\r\nfor i in range(len(lst)-1):\r\n if lst[i] in lst[i+1]:\r\n continue\r\n else:\r\n a=0\r\n break\r\nif a==1:\r\n print(\"YES\")\r\n print(*lst,sep = \"\\n\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin,stdout,setrecursionlimit\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\ndef match(x,y):\r\n\tif x in y:\r\n\t\treturn 1\r\n\treturn 0\r\n\r\n\r\n\r\nn = it()\r\nv=[]\r\nfor _ in range(n):\r\n\ts = input()\r\n\tv.append([s,len(s)])\r\nv.sort(key = lambda x:(x[1],x[0]))\r\n# print(v)\r\nfor i in range(1,n):\r\n\tif not match(v[i-1][0],v[i][0]):\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')\r\nfor i in v:\r\n\tprint(i[0])\r\n\r\n\r\n", "x=[]\r\na=0\r\nfor _ in \" \"*int(input()):\r\n\tx.append(input())\r\n\ta+=1\r\nx.sort(key=len)\r\nm=x[-1]\r\nfor i in range(a-1):\r\n\tif x[i] not in x[i+1]:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(\"\\n\".join(x))", "n = int(input())\r\n\r\narr = [input() for _ in range(n)]\r\narr.sort(key = len)\r\nf = True\r\n\r\nfor i in range(1 , n):\r\n if arr[i-1] not in arr[i]:\r\n f = False\r\n break\r\n\r\nif not f:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"YES\")\r\n print(*arr , sep = '\\n')", "import math\r\n\r\ndef is_substring_of(a, b):\r\n if len(a) == len(b):\r\n if a == b:\r\n return True\r\n return False\r\n else:\r\n for i in range(len(b) - len(a) + 1):\r\n for j in range(i, i + len(a)):\r\n k = j - i\r\n if b[j] != a[k]:\r\n break\r\n elif k == len(a) - 1:\r\n return True\r\n return False\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n data = [input() for i in range(n)]\r\n data = sorted(data, key=lambda x:len(x))\r\n is_answer_given = False\r\n for i in range(len(data) - 1):\r\n if not is_substring_of(data[i], data[i + 1]):\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 for i in data:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "a = []\r\nn = int(input())\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\n\r\ndef cmp(x):\r\n return len(x)\r\na.sort(key=cmp)\r\ntemp = True\r\nfor i in range(len(a)-1):\r\n if not a[i] in a[i+1]:\r\n temp = False\r\n break\r\nif temp:\r\n print(\"YES\")\r\n for i in range(len(a)):\r\n print(a[i])\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nss = []\r\nfor _ in range(n):\r\n ss.append(input())\r\nss.sort(key=len)\r\nfor i in range(n-1):\r\n if ss[i] in ss[i+1]:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n print(*ss, sep=\"\\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\n'''\r\ndef solve():\r\n ans = []\r\n for _ in range(II()):\r\n s = I().strip()\r\n ans.append(s)\r\n ans.sort(key=lambda x: len(x))\r\n\r\n ok = True\r\n for i in range(len(ans)):\r\n for j in range(i):\r\n ok &= (ans[j] in ans[i]) \r\n if ok:\r\n print('YES')\r\n WRITE(ans)\r\n else:\r\n print('NO')\r\n \r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\na.sort(key=len)\r\nflag=1\r\nfor i in range(n-1):\r\n if a[i] not in a[i+1]:\r\n flag=0\r\nif flag:\r\n print(\"YES\")\r\n for i in a:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n s=str(input())\r\n arr.append(s)\r\narr.sort(key=len)#sorting the array according to length of strings \r\nfor i in range(n-1):\r\n if(arr[i] not in arr[i+1]):\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\nfor item in arr:\r\n print(item)\r\n\r\n\r\n\r\n\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 13 10:45:02 2021\r\n\r\n@author: PC1\r\n\"\"\"\r\ndef selec(speicher,length):\r\n for i in range(len(length)-1):\r\n mini=i\r\n for j in range(i+1,len(length)):\r\n if length[j]<length[mini]:\r\n mini=j\r\n length[i],length[mini]=length[mini],length[i]\r\n speicher[i],speicher[mini]=speicher[mini],speicher[i]\r\n return speicher\r\n\r\nmenge=input()\r\nspeicher=[]\r\nfor i in range(int(menge)):\r\n speicher.append(input())\r\nlength=[]\r\nfor i in range(len(speicher)):\r\n length.append(len(speicher[i]))\r\nspeicher=selec(speicher,length)\r\nPrüfer=True\r\nfor i in range(len(speicher)-1):\r\n if not speicher[i] in speicher[i+1]:\r\n Prüfer=False\r\nif Prüfer :\r\n print(\"YES\")\r\n for i in range(len(speicher)):\r\n print(speicher[i])\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n\r\n\r\n ", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n s=input().rstrip()\r\n l.append(s)\r\na=sorted(l,key=lambda x:(len(x)))\r\nf=0\r\nfor i in range(n-1):\r\n if a[i] not in a[i+1]:\r\n f=1\r\n break\r\nif f==0:\r\n print(\"YES\")\r\n for x in a:\r\n print(x)\r\nelse:print(\"NO\")", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(input())\r\narr = sorted(arr,key = len)\r\nflag = False\r\nfor i in range(len(arr)):\r\n if i > 0 and arr[i - 1] in arr[i]:\r\n continue\r\n elif i != 0:\r\n flag = True\r\n print(\"NO\")\r\n break\r\nif not flag:\r\n print(\"YES\")\r\n for i in arr:\r\n print(i)\r\n", "n = int(input())\r\n\r\ns = [input() for i in range(n)]\r\ns.sort(key=len)\r\n\r\nflag = True\r\nfor i in range(1, n):\r\n if (s[i - 1] not in s[i]):\r\n flag = False;\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(*s, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n\r\nl = sorted(l, key=lambda x : len(x))\r\n\r\nflag = True\r\nfor i in range(1, n):\r\n if l[i].find(l[i-1]) == -1:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\n for s in l:\r\n print(s)\r\nelse:\r\n print(\"NO\")\r\n", "strings = []\r\nfor _ in range(int(input())):\r\n strings.append(input())\r\nstrings.sort(key=len)\r\nfor i in range(len(strings)-1):\r\n if not all(map(lambda x: strings[i] in x, strings[i+1:])):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n print(*strings,sep='\\n')", "import functools\r\narr1 = []\r\nn = int(input())\r\ndef compare(x,y):\r\n return len(x)-len(y)\r\nfor x in range(n):\r\n s = input()\r\n arr1.append(s)\r\narr1 = sorted(arr1,key = functools.cmp_to_key(compare))\r\nfor i in range(len(arr1)-1):\r\n if arr1[i] in arr1[i+1]:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for y in arr1:\r\n print(y)", "arr=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n arr.append(s)\r\narr.sort(key=len)\r\nfor i in range(1,len(arr)):\r\n if arr[i-1] not in arr[i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for i in arr:\r\n print(i)\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [input() for i in range(n)]\r\nfor i in range(len(a)):\r\n b = []\r\n for j in a[i]:\r\n b.append(j)\r\n b = [len(a[i])] + b\r\n a[i] = b.copy()\r\na.sort()\r\nfor i in range(len(a)):\r\n a[i] = a[i][1:]\r\nfor i in range(len(a) - 1):\r\n t = False\r\n for j in range(len(a[i+1]) - len(a[i])+1):\r\n if a[i+1][j:j+len(a[i])] == a[i]:\r\n t = True\r\n break\r\n if t:\r\n continue\r\n else:\r\n print('NO')\r\n quit()\r\nprint('YES')\r\nfor i in a:\r\n b = ''\r\n for j in i:\r\n b += j\r\n print(b)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nl.sort(key=len)\r\nc=0\r\nfor i in range(n-1):\r\n if l[i] not in l[i+1]:\r\n c+=1\r\n break\r\nif c!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = []\r\ns.sort(key=lambda x: -len(x))\r\nfor i in range(n):\r\n st = s[i]\r\n for j in range(i, n):\r\n if s[j] not in st:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\nfor i in range(n):\r\n print(s[-(i + 1)])", "import sys\nt = int(input())\ns = sorted([x for x in sys.stdin.read().split()], key = len)\nfor i in range(t-1):\n if s[i] not in s[i+1]:\n print(\"NO\")\n sys.exit()\nprint(\"YES\")\nprint(*s,sep=\"\\n\")\n \t \t\t \t\t \t \t \t \t \t\t \t\t\t \t", "n=int(input())\r\nl=[];ls=[]\r\nfor _ in range(101):l.append([])\r\nfor _ in range(n):\r\n s=input();ls.append(s)\r\n l[len(s)].append(s)\r\n\r\nli=[]\r\nfor x in l:\r\n if x!=[]:\r\n if len(set(x))!=1:\r\n print('NO')\r\n exit()\r\n else:\r\n li.append(x[0])\r\n\r\nfor i in range(len(li)-1):\r\n if li[i] not in li[i+1]:\r\n print('NO');exit()\r\n\r\nprint('YES')\r\nfor x in li:\r\n for i in range(ls.count(x)):\r\n print(x)\r\n\r\n", "# collaborated with no one\n\ntestCases = int(input())\n\nposs = \"YES\"\n\nwords = []\n\nfor x in range(testCases):\n userInput = input()\n words.append(userInput)\n\nwords.sort(key=len)\n\nfor y in range(testCases - 1):\n if words[y] not in words[y + 1]:\n poss = \"NO\"\n break\n\n\nif poss == \"YES\":\n print(poss)\n for x in words:\n print(x)\n\nelse:\n print(poss)\n\t \t \t\t \t \t \t\t\t\t \t\t\t \t\t", "x = []\r\nl = []\r\nd = {}\r\nn = int(input())\r\nfor _ in range(n):\r\n\ts = input()\r\n\tx.append(s)\r\n\tif len(s) in d:\r\n\t\td[len(s)].append(s)\r\n\telse:\r\n\t\tl.append(len(s))\r\n\t\td[len(s)] = [s]\r\nl.sort()\r\nans = []\r\nfor i in l:\r\n\tz = d[i]\r\n\tz.sort()\r\n\tans+=z\r\nflag = 0\r\nfor i in range(len(ans)-1):\r\n\tif ans[i] not in ans[i+1]:\r\n\t\tflag = 1\r\n\t\tbreak\r\nif flag == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in ans:\r\n\t\tprint(i)", "n=int(input())\ns=[]\nfor x in range(n):\n s.append(input())\nfor y in range(len(s)-1):\n for z in range(len(s)-1-y):\n if s[z+1] in s[z]:\n tem=s[z]\n s[z]=s[z+1]\n s[z+1]=tem\nfor i in range(len(s)-1):\n if s[i] not in s[i+1]:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n for j in s:\n print(j)\n\t \t\t \t \t \t\t \t\t \t \t\t \t\t \t", "n = int(input())\r\n\r\nsss = []\r\n\r\nfor i in range(n):\r\n sss.append(input())\r\n\r\nsss.sort(key=lambda x: len(x))\r\nfor i in range(len(sss) - 1):\r\n if sss[i] not in sss[i + 1]:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES', *sss, sep='\\n')\r\n", "n = int(input())\r\ns = [input() for _ in range(n)]\r\ns.sort(key=lambda x: (len(x), x))\r\n\r\nfor i in range(1, n):\r\n if s[i - 1] not in s[i]:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\nprint(*s, sep='\\n')", "arr = []\r\nfor _ in range(int(input())) : \r\n arr.append(input())\r\narr.sort(key = len)\r\nfor i in range(len(arr) -1 ) : \r\n if arr[i] not in arr[i+1] : \r\n print('NO') ; exit()\r\nprint('YES')\r\nprint(*arr , sep= '\\n')", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\narr=sorted(arr,key=len)\r\ncount=1\r\nfor i in range(1,n):\r\n if(arr[i].__contains__(arr[i-1])):\r\n continue\r\n else :\r\n count=0\r\n break\r\nif count==0 :\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")\r\n for i in range(n):\r\n print(arr[i])", "t=int(input())\r\na=[]\r\nk=0\r\nfor i in range(t):\r\n n=input()\r\n a.append([len(n),n])\r\na.sort()\r\nfor i in range(t):\r\n for j in range(i,t):\r\n if a[i][1] not in a[j][1]:\r\n print(\"NO\")\r\n k=1\r\n break\r\n if k==1:\r\n break\r\nif k==0:\r\n print(\"YES\")\r\n for i in a:\r\n print(i[1])\r\n\r\n", "def substring(a,b):\r\n m=len(a)\r\n n=len(b)\r\n s=0\r\n for i in range(n-m+1):\r\n if a==b[i:m+i]:\r\n s+=1\r\n if s==0:\r\n return 0\r\n else:\r\n return 1\r\nn=int(input())\r\nstrlist=[]\r\nstrlength=[]\r\nfor i in range(n):\r\n strlist.append(input())\r\n strlength.append(10**9*len(strlist[len(strlist)-1])+i)\r\nstrlength.sort()\r\nordered=[]\r\nfor i in range(n):\r\n ordered.append(strlist[strlength[i]%(10**9)])\r\ns=0\r\nfor i in range(len(ordered)-1):\r\n s+=substring(ordered[i],ordered[i+1])\r\nif s==len(ordered)-1:\r\n print(\"YES\")\r\n for i in ordered:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\r\n\r\nn = int(input())\r\ns = []\r\n\r\nfor _ in range(n):\r\n s.append(input())\r\n\r\ns.sort(key=len)\r\n\r\nfor i in range(n - 1):\r\n if s[i + 1].find(s[i]) == -1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\nfor it in s:\r\n print(it)", "t=int(input())\r\ndata=[input() for t1 in range(t)]\r\ndataLen = [len(x) for x in data]\r\ndataLen, data = zip(*sorted(zip(dataLen, data)))\r\n\r\nflag=True\r\n\r\nfor z in range(t-1):\r\n if (data[z+1].find(data[z]) == -1):\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\n for z in data:\r\n print(z)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=sorted((input()for _ in[0]*n),key=len)\r\nprint(('NO','\\n'.join(['YES']+a))[all(x in y for x,y in zip(a,a[1:]))])", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n \r\n \r\nfor t in range(1):\r\n n = int(input().strip())\r\n strings = [input().strip() for i in range(n)]\r\n \r\n strings.sort(key = lambda x: len(x))\r\n \r\n ans = True\r\n for i in range(1,n):\r\n if strings[i].find(strings[i-1]) < 0:\r\n ans = False\r\n break\r\n \r\n # print(strings)\r\n if ans:\r\n print(\"YES\")\r\n for i in strings:\r\n print(i)\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n # print(\"\")\r\n ", "n = int(input())\r\nlst = []\r\n\r\nfor _ in range(n):\r\n lst.append(input())\r\nls = sorted(lst, key=len)\r\na = 1\r\nfor i in range(1, n):\r\n if ls[i-1] not in ls[i]:\r\n print(\"NO\")\r\n a = 0\r\n break\r\nif a == 1:\r\n print(\"YES\")\r\n for i in ls:\r\n print(i)", "n=int(input())\r\nstrings=[]\r\nfor i in range(n):\r\n string=input()\r\n strings.append((len(string),string))\r\nstrings.sort()\r\npasa=True\r\nfor i in range(n-1):\r\n if(strings[i][1] in strings[i+1][1]):\r\n continue\r\n pasa=False\r\nif(pasa):\r\n print(\"YES\")\r\n for i in range(n):\r\n print(strings[i][1])\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return \"\".join(list(s[:len(s) - 1]))\r\n\r\n\r\ndef srt(n, arr):\r\n i = 0\r\n while i < n-1:\r\n a = arr[i]\r\n j = i+1\r\n while j < n:\r\n b = arr[j]\r\n if len(a) > len(b):\r\n arr[j] = a\r\n arr[i] = b\r\n i -= 1\r\n break\r\n j += 1\r\n i += 1\r\n return arr\r\n\r\n\r\nn = inp()\r\n\r\ns = []\r\n\r\nfor i in range(n):\r\n s.append(insr())\r\n\r\nsrt(n, s)\r\n\r\ni = 1\r\ngood = True\r\n\r\nwhile i < n:\r\n a = s[i-1]\r\n b = s[i]\r\n if a not in b:\r\n good = False\r\n break\r\n i += 1\r\n\r\nif good:\r\n print(\"YES\")\r\n for x in s:\r\n print(x)\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndata = [input() for _ in range(n)]\r\n\r\nresult = sorted([(len(x), x) for x in data])\r\nsort = [y[1] for y in result]\r\noutput = \"YES\"\r\n\r\nfor idx, value in enumerate(sort):\r\n if idx != len(sort)-1:\r\n if value not in sort[idx+1]:\r\n output = \"NO\"\r\n break\r\n\r\nif output == \"YES\":\r\n print(output)\r\n for val in sort:\r\n print(val)\r\nelse:\r\n print(output)\r\n", "n=int(input())\r\nli=[input() for i in range(n)]\r\nli=sorted(li,key=lambda x:len(x))\r\nfor i in range(n-1):\r\n if li[i] not in li[i+1]:\r\n print('NO');break\r\n\r\nelse:\r\n print('YES')\r\n for i in li:\r\n print(i)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=str(input())\r\n l.append(s)\r\nl=sorted(l,key=len)\r\ncnt=0\r\nfor j in range(n-1):\r\n temp=l[j]\r\n for k in range(j+1,n,1):\r\n if (temp in l[k]):\r\n cnt+=1\r\n \r\nif (cnt==((n*(n-1))/2)):\r\n print(\"YES\")\r\n for t in l:\r\n print(t,\"\\n\")\r\nelse :\r\n print(\"NO\")", "n = int(input())\r\n\r\na = list()\r\n\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\n\r\ndef f(x):\r\n return(len(x))\r\n\r\na.sort(key = f)\r\n\r\n\r\nh = 'YES'\r\n\r\nfor i in range(len(a) - 1):\r\n if a[i] not in a[i + 1]:\r\n h = 'NO'\r\n break\r\n\r\nif h == 'YES':\r\n print(h)\r\n for i in range(len(a)):\r\n print(a[i])\r\nelse:\r\n print('NO')\r\n", "l=[]\r\nfor _ in range(int(input())):\r\n l.append(input())\r\nl.sort(key=lambda x: (len(x),x))\r\nif all(l[i] in l[i+1] for i in range(len(l)-1)):\r\n print('YES')\r\n print(*l,sep='\\n')\r\nelse:\r\n print('NO')", "n = int(input())\r\ntotal = []\r\nfor i in range(n):\r\n a = input()\r\n total.append(a)\r\ntotal = sorted(total, key=len)\r\nfor j in range(1, n):\r\n if total[j - 1] not in total[j]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\", *total, sep=\"\\n\")\r\n", "def solve():\r\n n = int(input())\r\n x = []; \r\n for i in range(n): t = input(); x.append(t)\r\n x.sort(key=len)\r\n for i in range(1, n):\r\n if not x[i-1] in x[i]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for i in x:\r\n print(i)\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()", "n=int(input())\r\nM=[]\r\nfor i in range(n):\r\n M.append(input())\r\nM.sort(key = len)\r\ni=0\r\ntest=True\r\nwhile (i<=n-2) and (test==True):\r\n test=M[i] in M[i+1]\r\n i+=1\r\nif test ==False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for k in M:\r\n print(k)\r\n", "n = int(input())\r\ndat = []\r\nt = n\r\nwhile t:\r\n t -= 1\r\n\r\n s = input()\r\n dat.append(s)\r\n\r\ndat.sort(key=len)\r\nk = 1\r\nfor i in range(1, n):\r\n for j in range(i - 1, -1, -1):\r\n if dat[j] not in dat[i]:\r\n k = 0\r\nif k == 1:\r\n print(\"YES\")\r\n for y in range(n):\r\n print(dat[y])\r\nelif k == 0:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=[]\r\nfor i in range(1,n+1):\r\n s=input()\r\n a.append(s)\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if len(a[i])<len(a[j]):\r\n a[i],a[j]=a[j],a[i]\r\nflag=True\r\nfor i in range(0,n-1):\r\n if a[i] not in a[i+1]:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\n for i in range(0,n):\r\n print(a[i])\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n b.append(input())\r\nb = sorted(b, key=len)\r\nfor i in range(a - 1):\r\n if b[i] not in b[i + 1]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in b:\r\n print(i)", "n = int(input())\r\na = sorted((input() for _ in range(n)), key=lambda x: len(x))\r\nv = all(a[i] in a[i+1] for i in range(n-1))\r\nprint('YES\\n'+\"\\n\".join(a) if v else 'NO')", "n = int(input())\r\nstrings = []\r\n\r\ndef main():\r\n for _ in range(n):\r\n temp = input()\r\n strings.append(temp)\r\n\r\n strings.sort(key = lambda x: len(x))\r\n\r\n for i in range(1, len(strings)):\r\n if strings[i-1] not in strings[i]:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n for string in strings:\r\n print(string)\r\n\r\nmain()", "def question2():\r\n N = int(input())\r\n arr = []\r\n for i in range(N):\r\n a1 = input()\r\n arr.append([a1,len(a1)])\r\n arr.sort(key = lambda x:x[1])\r\n ans = [arr[0][0]]\r\n found = True\r\n for i in range(1,len(arr)):\r\n if arr[i-1][0] in arr[i][0]:\r\n ans.append(arr[i][0])\r\n else:\r\n found = False\r\n break\r\n if found:\r\n print(\"YES\")\r\n for i in ans:\r\n print(i)\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n# remained_test_case = int(input())\r\nremained_test_case = 1\r\nwhile remained_test_case > 0:\r\n (question2())\r\n remained_test_case -= 1 ", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nk.sort(key=len)\r\ncnt=0\r\nfor i in range(len(k)-1):\r\n if k[i] in k[i+1]:\r\n cnt=cnt+1\r\nif cnt==len(k)-1:\r\n print(\"YES\")\r\n print(*k,sep=\"\\n\")\r\nelse: print(\"NO\")", "x=int(input())\r\nli=[]\r\nfor i in range(x):\r\n li.append(input())\r\nli.sort(key = len)\r\nfor i in range(x-1):\r\n if(li[i] not in li[i+1]):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for j in li:\r\n print(j)", "def compare(item):\r\n return len(item), item\r\n\r\n\r\nline = input()\r\nn = int(line)\r\n\r\nstrings = [input() for i in range(n)]\r\n\r\nstrings.sort(key=compare)\r\n\r\nans = True\r\nfor i in range(len(strings) - 1):\r\n if strings[i] in strings[i + 1]:\r\n continue\r\n else:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\n for i in strings:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n l.append(x)\r\n\r\nl.sort(key=len)\r\n\r\nc = True\r\n\r\nfor i in range(n-1):\r\n if l[i] not in l[i+1]:\r\n c = False\r\n\r\nif c:\r\n print(\"YES\")\r\n [print(x) for x in l]\r\nelse:\r\n print(\"NO\")", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\n\r\ndef is_in(s1,s2):\r\n\r\n if(s1 in s2):\r\n return 1\r\n return 0\r\n\r\nmy_list= list()\r\nsize_list = list()\r\n\r\nfor i in range(0, int(input())):\r\n\r\n s = input()\r\n if len(size_list) == 0:\r\n size_list.append(len(s))\r\n my_list.append(s)\r\n else:\r\n flag1 = 0\r\n for j in size_list:\r\n if len(s)<j:\r\n index = size_list.index(j)\r\n size_list.insert(index, len(s))\r\n my_list.insert(index, s)\r\n flag1=1\r\n break\r\n if flag1==0:\r\n size_list.append(len(s))\r\n my_list.append(s)\r\n\r\n\r\nflag = 0\r\nfor i in range(1, len(my_list)):\r\n if not is_in(my_list[i-1],my_list[i]):\r\n flag = 1\r\n\r\nif flag ==0:\r\n print(\"YES\")\r\n for i in my_list:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nll = []\r\ncheck = True\r\nfor i in range(n):\r\n ll.append(input())\r\n \r\nll = sorted(ll , key= lambda x : len(x))\r\n\r\nfor i in range(len(ll)-1):\r\n if(ll[i] not in ll[i+1]):\r\n check = False\r\n break\r\n \r\nif(check):\r\n print(\"YES\")\r\n for i in ll :\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n string=input()\r\n l.append(string)\r\nsl=sorted(l, key=len)\r\n\"\"\"\r\ns=l[0]\r\nliste=[s]\r\nfor i in range(1,n):\r\n if s in sl[i]:\r\n liste.append(sl[i])\r\n s=sl[i]\r\n else:\r\n break\r\nprint(liste)\r\nif len(liste)==n:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(liste[i])\r\nelse:\r\n print(\"NO\")\"\"\"\r\na=1\r\nfor i in range(1,len(sl)):\r\n if sl[i-1] not in sl[i]:\r\n print('NO')\r\n a=0\r\n break\r\nif a==1:\r\n print('YES')\r\n for i in sl:\r\n print(i)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = sorted([input()[:-1] for _ in range(n)], key=len)\r\n\r\nfor i in range(n-1):\r\n if g[i] not in g[i+1]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for i in g:\r\n print(i)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n = int(input())\r\n S = [input().strip() for _ in range(n)]\r\n S.sort(key = lambda x:len(x))\r\n for i in range(1, n):\r\n if S[i - 1] not in S[i]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for s in S:\r\n print(s)\r\n \r\nfor _ in range(1):\r\n main()", "from queue import PriorityQueue\nfrom sys import stdin, stdout, exit\n\n\ndef isSubstring(s1, s2):\n \n if s1 in s2 or s2 in s1:\n return True\n return False\n\n\n\n\nstrings = PriorityQueue()\n\nn = int(stdin.readline())\n\nfor i in range(n):\n line = stdin.readline().rstrip()\n strings.put((len(line), line))\n\ncurrent_line = strings.get()[1]\nresult = []\n\nanswer = True\nwhile not strings.empty():\n line = strings.get()[1]\n if not isSubstring(current_line, line):\n answer = False\n break\n result.append(current_line)\n current_line = line\n\n\nif (answer):\n result.append(current_line)\n print(\"YES\")\n stdout.write('\\n'.join(result))\nelse:\n print(\"NO\")\n\t \t\t \t \t\t\t\t\t \t \t \t\t\t \t\t", "import collections\r\nimport math\r\n\r\nt = 1\r\nfor _ in range(t):\r\n # n, k = map(int, input().split())\r\n n = int(input())\r\n # a = list(map(int, input().split()))\r\n strs = sorted([input() for _ in range(n)], key=lambda x: len(x))\r\n if all(strs[i - 1] in strs[i] for i in range(1, n)):\r\n print(\"YES\")\r\n for s in strs:\r\n print(s)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "l = []\r\nfor _ in range(int(input())):\r\n l.append(input())\r\nl = sorted(l, key=len)\r\nc = l[0]\r\nfor x in l:\r\n if c not in x:\r\n print('NO')\r\n exit()\r\n c= x\r\nprint('YES')\r\nfor elem in l:\r\n print(elem)", "\n\ntestCases = int(input())\ninputs = []\nfor tests in range(testCases):\n\n s = str(input())\n inputs.append(s)\n\nchange = True\n\nreorder = True\nwhile (change):\n change = False\n for i in range(len(inputs)-1):\n\n if len(inputs[i]) > len(inputs[i+1]):\n temp = inputs[i + 1]\n inputs[i + 1] = inputs[i]\n inputs[i] = temp\n change = True\n\nfor i in range(len(inputs) - 1):\n if inputs[i] not in inputs[i+1]:\n reorder = False\n\n\nif reorder:\n print(\"YES\")\n for x in inputs:\n print(x)\nelse:\n print(\"NO\")\n", "a = int(input())\r\ns = []\r\nfor i in range(a):\r\n s.append(input())\r\ns.sort(key=lambda x : len(x))\r\n\r\nfor i in range(len(s)-1):\r\n if s[i] not in s[i+1]:\r\n print('NO')\r\n exit(0)\r\nprint(\"YES\")\r\nprint('\\n'.join(s))\r\n", "n=int(input())\r\ns=[]\r\nfor fi in range(n):\r\n s.append(input())\r\ns.sort(key = lambda x: len(x))\r\nfor i in range(n-1):\r\n if s[i+1].find(s[i])==-1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\\n\" +\"\\n\".join(s))", "def ca(n, s):\r\n s.sort(key = lambda x: len(x))\r\n for i in range(1, n):\r\n if s[i - 1] not in s[i]:\r\n print(\"NO\")\r\n return \r\n print(\"YES\")\r\n for i, v in enumerate(s):\r\n print(v)\r\nn = int(input())\r\ns = [input() for _ in range(n)]\r\nca(n, s)", "\"\"\"\r\n@author Muzaffardjan\r\n@link https://karaev.uz\r\n\"\"\"\r\n\r\n\r\ndef cmp(val):\r\n return len(val)\r\n\r\n\r\ndef run_code():\r\n n = int(input())\r\n arr = []\r\n\r\n for i in range(n):\r\n arr.append(input())\r\n\r\n arr.sort(key=cmp)\r\n flag = True\r\n\r\n for i in range(1, len(arr)):\r\n if arr[i - 1] not in arr[i]:\r\n flag = False\r\n break\r\n\r\n if flag:\r\n print('YES')\r\n\r\n for i in range(len(arr)):\r\n print(arr[i])\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n run_code()\r\n", "n = int(input())\r\nstrings = [input() for r in range(n)]\r\n\r\nstrings.sort(key=len)\r\n\r\nif all(strings[i] in strings[i+1] for i in range(n-1)):\r\n print(\"YES\")\r\n for s in strings:\r\n print(s)\r\nelse:\r\n print(\"NO\")", "def main():\r\n n = int(input())\r\n\r\n strings = []\r\n for i in range (0,n):\r\n string = input()\r\n strings.append(string)\r\n\r\n strings = sorted(strings,key=len)\r\n length = len(strings)-1\r\n\r\n for i in range (0,length):\r\n if strings[i+1].find(strings[i])==-1:\r\n print(\"NO\")\r\n return 0\r\n print(\"YES\")\r\n for j in strings:\r\n print(j)\r\n\r\n\r\nif __name__ == '__main__':\r\n # print(\"abcd\".find(\"abcd\"))\r\n main()", "n = int(input())\r\ns = [input() for i in range(n)]\r\ns.sort(key=lambda x : len(x))\r\nfor i in range(n - 1):\r\n if s[i] not in s[i + 1]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nprint('\\n'.join(s))", "from heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as c,permutations as p\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nmp = lambda : map(int,input().split())\r\nit = lambda: int(input())\r\nls = lambda : list(input().strip().split())\r\nmt = lambda r : [ ls() for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b)\r\ndef fibo_n(n):\r\n\treturn (((1+sqrt(5))/2)**n)/sqrt(5)\r\nl =[]\r\nn = it()\r\nfor i in range(n):\r\n\tl.append(input().strip())\r\nl.sort(key = lambda i : len(i))\r\ncnt =0\r\nfor j in range(1,n):\r\n\tif l[j-1] in l[j]:\r\n\t\tcnt+=1\r\nif cnt!=n-1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor k in l:\r\n\t\tprint(k)", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input())\r\nl.sort(key=len)\r\nfor i in range(1,n):\r\n if(l[i].find(l[i-1])==-1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(n):\r\n print(l[i])\r\n ", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(str(input()))\r\nl.sort(key=len)\r\nflag=0\r\nfor i in range(n-1):\r\n if(l[i] not in l[i+1]):\r\n flag=1\r\nif(flag==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for x in l:\r\n print(x)", "n = int(input())\r\nelements = {}\r\nr = True\r\nfor i in range(n):\r\n input_ = input()\r\n f = False\r\n for e in elements: \r\n if len(input_) == len(e):\r\n f = True\r\n if e != input_:\r\n r = False\r\n break\r\n else:\r\n elements[e] += 1\r\n if not f:\r\n elements[input_] = 1\r\n\r\nif r:\r\n o = \"\"\r\n def key(e):\r\n return len(e[0])\r\n\r\n narr = sorted(elements.items() , key=key)\r\n c = narr[0][0]\r\n\r\n for e in narr:\r\n if c in e[0]:\r\n for k in range(e[1]):\r\n o += (e[0]) + \"\\n\"\r\n c = e[0]\r\n else:\r\n r = False\r\n break\r\n if r:\r\n print(\"YES\")\r\n print(o)\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "# Wadea #\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):word = input();arr.append(word)\r\narr = sorted(arr,key=len)\r\nc = 0\r\nfor j in range(len(arr)-1):\r\n if arr[j] in arr[j+1]:\r\n c += 1\r\nif n == 1:\r\n print(\"YES\")\r\n print(\"\\n\".join(arr))\r\nelif c == len(arr)-1:\r\n print(\"YES\")\r\n print(\"\\n\".join(arr))\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append([s, len(s)])\r\nl.sort(key = lambda x : x[1])\r\nfor i in range(n - 1, 0, -1):\r\n if(l[i - 1][0] not in l[i][0]):\r\n print(\"NO\")\r\n break \r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(l[i][0])", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n s = input()\r\n lst.append(s)\r\nlst.sort(key=len)\r\nposs=True\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (lst[i] not in lst[j]):\r\n poss= False\r\n\r\nif (poss):\r\n print(\"YES\")\r\n for i in lst:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "def sort(s, n):\r\n for i in range(1, n):\r\n temp = s[i]\r\n \r\n # Insert s[j] at its correct position\r\n j = i - 1\r\n while j >= 0 and len(temp) < len(s[j]):\r\n s[j + 1] = s[j]\r\n j -= 1\r\n \r\n s[j + 1] = temp \r\nt=int(input())\r\ns=[]\r\nfor i in range(t):\r\n s.append(input())\r\nn=len(s)\r\nsort(s,n)\r\nflag=1 \r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n if s[i] not in s[j]:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\n for i in range(len(s)):\r\n print(s[i])\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "\r\nn = int(input())\r\nlist = []\r\n\r\nfor i in range(n):\r\n a = input()\r\n list.append(a)\r\n\r\nlist = sorted(list , key=len)\r\n\r\nl = True\r\nfor i in range(0 , len(list)-1):\r\n if list[i] not in list[i + 1]:\r\n l = False\r\n break \r\n\r\nif l :\r\n print(\"YES\")\r\n for i in list:\r\n print(i)\r\nelse:\r\n print(\"NO\") ", "stdin = lambda type_ = \"int\", sep = \" \": list(map(eval(type_), input().split(sep)))\r\n\"\"\"\r\n>>> stdin()\r\n1 2 3 4\r\n>>>[1, 2, 3, 4]\r\n\"\"\"\r\n\r\njoint = lambda sep = \" \", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)\r\n\"\"\"\r\n>>> joint(\" \", [1, 2])\r\n'1 2'\r\n>>> joint(\" \", [1, 2], [2, 3])\r\n'1 2 2 3'\r\n\"\"\"\r\n\r\ndef iters(): return map(int(input()))\r\n\r\n\r\nn = int(input())\r\na = sorted((input() for _ in range(n)), key=lambda x: len(x))\r\nv = all(a[i] in a[i+1] for i in range(n-1))\r\nprint('YES\\n'+\"\\n\".join(a) if v else 'NO')\r\n\r\n\r\n\r\n", "n = int(input())\r\nli = []\r\nfor _ in range(n):\r\n\ts = str(input())\r\n\tli.append([s, len(s)])\r\nli.sort(key = lambda x: x[1])\r\nli = [el[0] for el in li]\r\n\r\ncnt = 0\r\nfor i in range(n - 1):\r\n\tif len(li[i]) < len(li[i + 1]):\r\n\t\tif li[i] in li[i + 1]:\r\n\t\t\tcnt += 1\r\n\telif len(li[i]) == len(li[i + 1]):\r\n\t\tif li[i] == li[i + 1]:\r\n\t\t\tcnt += 1\r\n\r\nif cnt == n - 1:\r\n\tprint('YES')\r\n\tfor el in li:\r\n\t\tprint(el)\r\nelse:\r\n\tprint('NO')", "from collections import defaultdict\r\n\r\n\r\ndef solve(frq, possible):\r\n \r\n if not possible:\r\n print('NO')\r\n return \r\n else:\r\n \r\n ans = []\r\n \r\n keys = sorted(frq.keys())\r\n \r\n for index in range(len(keys)):\r\n \r\n if index == 0:\r\n ans += frq[keys[0]]\r\n else:\r\n if ans[-1] in frq[keys[index]][0]:\r\n ans += frq[keys[index]]\r\n else:\r\n # print(ans[-1], frq[keys[index]][0])\r\n print('NO')\r\n return \r\n \r\n print('YES')\r\n for s in ans:\r\n print(s)\r\n\r\n\r\nfrq = defaultdict(list)\r\npossible = 1\r\nn = int(input())\r\nfor _ in range(n):\r\n \r\n string = input()\r\n length = len(string)\r\n if frq[length] and frq[length][-1] != string:\r\n possible = 0\r\n # break\r\n \r\n frq[len(string)].append(string)\r\n \r\n# print(possible)\r\nsolve(frq, possible)\r\n \r\n \r\n \r\n\r\n", "# n = int(input())\r\n# nq=list(map(int,input().split()))\r\n# arr=list(map(int,input().split()))\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n word = input()\r\n arr.append(word)\r\narr.sort(key = lambda x : len(x))\r\nl = 0\r\nfor r in range(1 , n):\r\n if arr[l] not in arr[r]:\r\n print(\"NO\")\r\n break\r\n l += 1\r\nelse:\r\n print('YES')\r\n for word in arr:\r\n print(word)\r\n\r\n" ]

[ "w=eval(input())\r\nh=w\r\nMatrix = [[0 for x in range(w)] for y in range(h)] \r\ni=0\r\nwhile (i<w):\r\n Matrix[i]=list(map(int,input().split()))\r\n i+=1\r\ni=0\r\nwhile(i<w):\r\n a=set(Matrix[i])\r\n if (len(a)<len(Matrix[i])):\r\n i+=1\r\n else:\r\n s=Matrix[i]\r\n k=0\r\n while (s[k]!=0):\r\n k+=1\r\n break\r\n \r\ns[k]=max(s)+1\r\nprint (\" \".join(map(str,s)))\r\n \r\n \r\n ", "import sys\r\nf=sys.stdin\r\nn=int(f.readline())\r\narr=[max(map(int, f.readline().split())) for i in range(n)]\r\narr[arr.index(n-1)]=n\r\nprint(\" \".join(map(str, arr)))", "n=int(input())\r\na=[list(map(int, input().split())) for i in range(n)]\r\nchosen=set()\r\np=[0]*n\r\nfor i in range(1, n+1):\r\n b=-1\r\n for j in range(n):\r\n if not j in chosen and all(a[j][k]<=i for k in range(n)) and all(a[k][j]<=i for k in range(n)):\r\n b=j\r\n p[b]=i\r\n chosen.add(b)\r\nprint(*p)", "n = int(input())\r\nnumbers = [0] * n\r\nused = set()\r\nfor i in range(n):\r\n for j in range(max(list(map(int, input().split()))), n + 1):\r\n if j not in used:\r\n used.add(j)\r\n numbers[i] = j\r\n break\r\nprint(' '.join(map(str, numbers)))", "n = int(input())\n\n\ndef count_diff(array):\n array = sorted(array)\n last_num = -1\n diff = 0\n for num in array:\n if num != last_num:\n diff += 1\n last_num = num\n return diff\n\n\ndiff_array = [0] * n\n\n\nfor i in range(n):\n array = input().split()\n array = [int(x) for x in array]\n diff_array[i] = count_diff(array)\n\nidx_list = list(range(n))\n\ndiff_array = list(zip(diff_array, idx_list))\n\ndiff_array = list(reversed(sorted(diff_array)))\n\nanswer = [-1] * n\ncontroller = n\nfor diff, idx in diff_array:\n answer[idx] = str(controller)\n controller -= 1\n\nanswer = ' '.join(answer)\nprint(answer)\n \t\t\t \t\t \t \t\t\t\t\t \t\t\t\t \t \t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n\nn = int(input())\na = []\n\nfor i in range(n):\n a.append(max([int(i) for i in input().split()]))\n\nstart = time.time()\n\nfor i in range(n):\n if a[i] == n-1:\n a[i] += 1\n break\n\nfor i in a:\n print(i, end=' ')\nprint()\n\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\narr = [0 for _ in range(n)]\nfor i in range(n):\n row = list(map(int, input().split(' ')))\n counter = [0 for _ in range(n)]\n for x in row:\n counter[x] += 1\n idx = 0\n max_seen = 1\n for j in range(n):\n if counter[j]>max_seen:\n max_seen = counter[j]\n idx = j\n arr[i] = idx\ntotal = n\nfor i, x in enumerate(arr):\n if x == 0:\n arr[i] = total\n total -= 1\nprint(' '.join([str(x) for x in arr]))\n ", "n = int(input())\r\narr = []\r\nunk = []\r\ndig = [a+1 for a in range(n)]\r\nused_t = []\r\nans =[0]*n\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n used_t.clear()\r\n for a in range(n):\r\n if temp[a] in used_t:\r\n ans[i] = temp[a]\r\n break\r\n else:\r\n used_t.append(temp[a])\r\n else:\r\n unk.append(i)\r\n arr.append(temp)\r\nunused = list(set(dig)-set(ans))\r\nz=0\r\nfor a in unk:\r\n ans[a]=unused[z]\r\n z+=1\r\nprint(\" \".join(map(str, ans)))", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n c.append(a)\r\nd = {}\r\nfor i in range(n):\r\n d[i] = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n d[i].append(c[i][j])\r\n d[j].append(c[i][j])\r\n\r\nz = [0 for i in range(n)]\r\nfor key in d:\r\n r = {}\r\n for i in range(len(d[key])):\r\n r[(d[key])[i]] = 0\r\n for i in range(len(d[key])):\r\n r[(d[key])[i]]+=1\r\n p = 0\r\n for l in r:\r\n if r[l]>p:\r\n p = r[l]\r\n o = 0\r\n for l in r:\r\n if r[l] == p:\r\n z[key] = l\r\n o+=1\r\n if o>1:\r\n z[key] = 0\r\nu = []\r\nfor i in range(1,n+1):\r\n if i not in z:\r\n u.append(i)\r\nt = {}\r\nfor i in range(0,n+1):\r\n t[i] = 0\r\nfor i in range(len(z)):\r\n if t[z[i]] == 0:\r\n t[z[i]] = 1\r\n else:\r\n z[i] = 0\r\no = 0\r\nfor i in range(len(z)):\r\n if z[i] == 0:\r\n z[i] = u[o]\r\n o+=1\r\nprint(*z)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import *\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = [rr() for _ in range(n)]\r\n\r\nans = [0] * n\r\n\r\nfor i in range(1, n):\r\n pos = -1\r\n for x, j in enumerate(arr):\r\n if i in j and (j.count(i) + j.count(0) == n):\r\n # ans[x] = i\r\n pos = x\r\n\r\n ans[pos] = i\r\n\r\n for j in range(n):\r\n arr[pos][j] = 0\r\n arr[j][pos] = 0\r\n\r\n # print(*arr, sep = '\\n')\r\n\r\nfor i in range(n):\r\n if ans[i] == 0:\r\n ans[i] = n\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\nA = [list(map(int, input().split())) for i in range(n)]\r\n\r\nans = [max(row) for row in A]\r\nans[ans.index(n-1)] = n\r\nprint(*ans)\r\n", "import sys\r\n\r\ndef takeInput(stdin):\r\n lines = stdin.readlines()\r\n n = int(lines[0])\r\n matrix = []\r\n for i in range(1, n+1):\r\n matrix.append([int(number) for number in lines[i].rstrip().split(\" \")])\r\n return matrix\r\n \r\n\r\ndef solve(matrix):\r\n largestPerRow = []\r\n for j in range(len(matrix)):\r\n row = matrix[j]\r\n largestPerRow.append(max(row))\r\n largestPerRow[largestPerRow.index(max(largestPerRow))] = max(largestPerRow) + 1\r\n return largestPerRow\r\noutList = solve(takeInput(sys.stdin))\r\nprint(\" \".join(map(lambda x: str(x), outList)))", "num = int(input())\narra = []\nfor i in range(num):\n arr_gen =list(map(int, input().split()))\n if max(arr_gen) in arra:\n arra.append(max(arr_gen) + 1)\n else:\n arra.append(max(arr_gen))\nfor i in arra:\n print(i, end=' ')", "n = int(input())\n\na = []\n\nfor i in range(n):\n a.append(input().split(\" \"))\n a[i] = map(int, a[i])\n a[i] = list(a[i])\n\nf = [0]*n\nfor i in range(n):\n f[i] = len(set(a[i]))\n if f[i] == n:\n imax = i\n break\nresp = [0]*n\nresp[imax] = n\n\nfor i in range(n):\n if i != imax:\n resp[i] = a[imax][i]\n\n\nfor i in range(n):\n print(resp[i], end=' ')\nprint()\n", "n = int(input())\nmaxes = []\nfor i in range(n):\n\tmaxes.append(max([int(x) for x in input().split()]))\nfor i in range(len(maxes)):\n\tif(maxes[i] == n-1):\n\t\tmaxes[i] = n\n\t\tbreak\nprint(*maxes)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(max(list(map(int, input().split()))))\r\n for i in range(n):\r\n if A[i] == n - 1:\r\n A[i] = n\r\n break\r\n print(' '.join(list(str(a) for a in A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nset_highest = False\nnumbers = []\nfor _ in range(n):\n number = max(int(x) for x in input().split())\n if number == n - 1 and not set_highest:\n number = n\n set_highest = True\n \n numbers.append(number)\n\nprint(\" \".join(str(x) for x in numbers))\n \t\t\t\t \t\t \t \t\t \t \t\t\t\t\t", "n = int(input())\nR = lambda : map(int, input().split())\nv = []\nfor i in range(n):\n v.append((max(R()),i))\nr = [0]*n\nv = sorted(v)\nfor i in range(n):\n r[v[i][1]]=i+1\nprint(*r)", "n = int(input())\nperm = [0 for i in range(n)]\na = [[0 for i in range(n)] for i in range(n)]\nb = [0 for i in range(n)]\nfor i in range(n):\n a[i] = list(map(int, input().split()))\n b[i] = max(a[i])\n\ns = set()\n\nfor i in range(1, n + 1):\n for j in range(n):\n if b[j] <= i and j not in s:\n perm[j] = i\n s.add(j)\n break\nprint(*perm)\n ", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nans = [0 for i in range(n)]\nfor cur in range(1, n + 1):\n k = -1\n for i, row in enumerate(a):\n if all((x <= cur for x in row)):\n k = i\n break\n #assert(k != -1)\n for i in range(len(row)):\n row[i] = 999\n ans[k] = cur\nprint(' '.join(map(str, ans)))\n", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n data = sorted([[j + 1, sum([int(i) for i in input().split(\" \")])] for j in range(n)], key=lambda x:x[1])\r\n original_list = [0 for i in range(n)]\r\n current = 1\r\n for i in data:\r\n original_list[i[0] - 1] = str(current)\r\n current += 1\r\n print(\" \".join(original_list))\r\n\r\n\r\n\r\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())\nans = []\nfor i in range(n):\n x = list(map(int, input().split()))\n if len(set(x)) == len(x):\n x[x.index(0)] = n\n ans = x\nprint(*ans)\n", "v = [max(map(int, input().split())) for i in range(int(input()))]\r\nv[v.index(max(v))] += 1\r\nprint(' '.join(map(str, v)))", "n=int(input())\r\narr=[max(map(int,input().split())) for i in range(n)]\r\narr[arr.index(n-1)]=n\r\nfor i in arr:\r\n print(i,end=\" \")", "n = int(input())\ngrid = [[] for x in range(n)]\nfor i in range(n):\n grid[i] = [int(x) for x in input().split()]\n\nMa = [0] * n\nfor i in range(n):\n for j in range(n):\n if (i != j):\n Ma[i] = max(Ma[i], grid[i][j])\n\nfor i in range(n):\n if (Ma[i] == n-1):\n Ma[i] += 1\n break\n\nprint(' '.join(str(x) for x in Ma))\n", "#!/usr/bin/python3\n\nn = int(input())\na = [0]*n\nm = [0]*n\nfor i in range(n):\n a[i] = tuple(map(int, input().split()))\nfor i in range(n):\n m[i] = max(a[i])\n\n#print(a)\nres = [0]*n\n\nfor i in range(n):\n for j in range(n):\n if m[j] <= i+1 and res[j] == 0:\n res[j] = i+1\n break\n\nfor i in res:\n\tprint(str(i), end=\" \")\n", "#!/bin/python3\nimport sys\nn = int(input())\nmatrix = []\nfor i in range(n):\n tlist = [int(a) for a in input().split(' ')]\n matrix.append(tlist)\n\nfor i in range(n):\n if set(range(n)) == set(matrix[i]):\n big = i\n break\n\nfor i in range(n):\n if i == big:\n sys.stdout.write(\"{} \".format(n))\n else:\n sys.stdout.write(\"{} \".format(matrix[big][i]))\n\n", "n = int(input())\n#nums = list(range(1,n+1))\nnums = [0 for i in range(1,n+1)]\ni = 0\nwhile i < n:\n permutation = list(map(int,input().split()))\n j = 0\n for p in permutation:\n nums[j] = max(nums[j],p)\n j += 1\n i += 1\nmaximumNums = max(nums)\nfor num in nums:\n if maximumNums == num:\n idx = nums.index(num)\n nums[idx] = n\n break\nprint(*nums)\n \t\t\t\t \t\t \t \t\t\t\t \t \t\t\t \t\t\t \t \t", "n = int(input())\n\na = [0]*n\nfor i in range(n):\n\ta[i] = list(map(int, input().split()))\nunused = set(range(1,n+1))\nused = {0}\nbind = [-1]*(n)\nfor cur in range(1, n+1):\n\tfor i in range(n):\n\t\tif (bind[i]==-1) and (max(a[i])<=cur):\n\t\t\tbind[i] = cur\n\t\t\tbreak\nprint(' '.join(map(str, bind)))\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\nans = [] \r\nfor i in range(n):\r\n l = list(map(int, input().split())) \r\n ans.append(len(set(l)) - 1) \r\nans[ans.index(n - 1)] = n \r\nprint(*ans)", "n = int(input())\nvf = [0 for i in range(n)]\nflag = True\nfor i in range(n):\n num = [0 for i in range(n+1)]\n li = [int(i) for i in input().split()]\n for j in li:\n num[j]+=1\n # print(num)\n id = -1\n maior = 1\n for k in range(n+1):\n if num[k] > maior:\n maior = num[k]\n id = k\n if id == -1 and flag:\n id = n-1\n flag = False\n elif id == -1:\n id = n\n vf[i] = id\nprint(*vf)\n", "#!/usr/bin/env python3\n\ndef perm_to_matrix(p):\n m = []\n s = len(p)\n for i in range(s):\n r = []\n for j in range(s):\n if i == j:\n r.append(0)\n else:\n r.append(min(p[i], p[j]))\n m.append(r)\n return m\n\ndef pp(p):\n for row in perm_to_matrix(p):\n print(row)\n\nif __name__ == '__main__':\n n = int(input())\n mat = [list(map(int, input().split())) for _ in range(n)]\n\n result = [None] * n\n found = {0}\n for _ in range(n):\n for i, row in enumerate(mat):\n valid = set(row) - found\n if len(valid) == 1:\n elem = valid.pop()\n result[i] = elem\n found.add(elem)\n result[result.index(None)] = n\n print(*result)\n\n", "n = int(input())\n\nm = [[int(i) for i in input().split()] for j in range(n)]\n\nres = [0 for i in range(n)]\n\nfor i in range(n):\n for j in range(n):\n res[i] = max(res[i], m[i][j])\n res[j] = max(res[j], m[i][j])\n\nres[res.index(n-1)] = n\nprint(*res)\n", "n=int(input())\r\nA=[];\r\nfor i in range(n):\r\n L=list(map(int,input().split(\" \")))\r\n A.append(max(L))\r\n\r\nA[A.index(n-1)]=n;\r\n\r\nfor i in A:\r\n print(i,end=\" \")\r\n", "import sys\r\narr=[]\r\nn=int(input())\r\nfor x in range(n):\r\n arr.append(max(list(map(int, input().split()))))\r\narr[arr.index(n-1)]=n\r\nprint(*arr)", "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n a = [list(map(int, input().split())) for i in range(n)]\r\n used = [False] * n\r\n result = [0] * n\r\n\r\n def is_good(i):\r\n if used[i]:\r\n return False\r\n prev = None\r\n for j, x in enumerate(a[i]):\r\n if not used[j] and i != j:\r\n if prev is None:\r\n prev = x\r\n elif prev != x:\r\n return False\r\n return True\r\n\r\n for step in range(n):\r\n first_good = next(filter(is_good, range(n)))\r\n used[first_good] = True\r\n for j, x in enumerate(a[first_good]):\r\n if not used[j]:\r\n result[first_good] = x\r\n break\r\n else:\r\n result[first_good] = n\r\n\r\n print(' '.join(map(str, result)))\r\n\r\nexcept EOFError:\r\n pass\r\n", "#Problem 618B Codeforce Wunder Fund Round 2016 (Div. 1 + Div. 2 combined)\r\nn = int(input())\r\na = [0] * n\r\nres = ['0'] * n\r\nfor j in range(0,n):\r\n a[j] = [int(num) for num in input().split()]\r\n maxx = 0\r\n for i in range(0,n):\r\n if a[j][i] > maxx:\r\n maxx = a[j][i]\r\n res[j] = str(maxx)\r\nfor j in range(0,len(res)):\r\n if res[j] == str(n - 1):\r\n res[j] = str(n)\r\n break\r\nfor j in res:\r\n print(j,\" \",end = '')\r\n \r\n", "n = int(input())\r\nal = set([i for i in range(1, n + 1)])\r\ndata = [[] for i in range(n)]\r\nfor i in range(n):\r\n cr = list(map(int, input().split()))\r\n for j in range(n):\r\n data[j].append(cr[j])\r\nfor i in data:\r\n k = max(i)\r\n if k in al:\r\n print(k, end = ' ')\r\n al.remove(k)\r\n else:\r\n print(k + 1, end = ' ')\r\n al.remove(k + 1)", "n=int(input())\r\nfor u in range(n):\r\n l=list(map(int,input().split()))\r\n if(len(set(l))==n):\r\n x=l.index(0)\r\n l[x]=n\r\n print(*l)\r\n exit()\r\n", "N = int(input())\nmat = [[int(x) for x in input().split()] for _ in range(N)]\na = list(range(N))\nfor row in mat:\n if sorted(row) == a:\n row[row.index(0)] = N\n print(*row)\n break\nelse:\n assert(0)\n", "n=int(input())\r\nz=set(range(1,n+1))\r\nfor q in range(n):\r\n x=max(int(s)for s in input().split());p=min(i for i in z if i>=x);z-={p};print(p,end=\" \")\r\n\r\n\r\n#take max of each row\r\n#permutuation shud contain distinct integers from 1 to n \r\n#so if somewhere a number is repeteated then replace it with the next greatest number than that repeateed number", "n = int(input())\n\nlines = []\nfor i in range(n):\n line = [int(x) for x in input().split(\" \")]\n lines.append(line)\n \nresult = []\nmax_n = False\n\nfor line in lines:\n d = {x:0 for x in range(0,n)}\n for l in line:\n d[l] += 1\n max_int = 0\n for key in d:\n if d[key] > max_int:\n max_int = d[key]\n max_key = key\n \n if max_int == 1 and max_n == False:\n result.append(n)\n max_n = True\n elif max_int == 1 and max_n == True:\n result.append(n-1)\n else:\n result.append(max_key)\n \nprint((\" \").join(map(str,result)))", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd, c = [], 0\r\nfor _ in range(n):\r\n w = Counter(map(int, input().split()))\r\n if max(w.values()) > 1:\r\n d.append(max(w))\r\n else:\r\n d.append(n-c)\r\n c += 1\r\nprint(' '.join(map(str, d)))", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nres = list()\r\nused = set()\r\n\r\nfor i in range(n):\r\n count = dict()\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if a[i][j] not in count:\r\n count[a[i][j]] = 0\r\n count[a[i][j]] += 1\r\n for c in count:\r\n if n - count[c] == c:\r\n if c in used:\r\n res.append(c+1)\r\n else:\r\n res.append(c)\r\n used.add(c)\r\n\r\nprint(\" \".join(map(str, res)))\r\n", "n = int(input())\r\npermutation = []\r\nfor _ in range(n):\r\n S = set(input().split())\r\n permutation.append(len(S) - 1)\r\nfor i in range(n):\r\n if permutation[i] == n - 1:\r\n permutation[i] += 1\r\n break\r\nprint(*permutation)\r\n", "n = int(input())\r\na = []\r\np = [0] * n\r\nfor i in range(n):\r\n a += [list(map(int,input().split()))]\r\n if max(a[i]) == n-1:\r\n for j in range(n):\r\n if a[i][j] == 0:\r\n a[i][j] = n\r\n print(*a[i])\r\n break\r\n\"\"\"\r\nn = 5\r\nl = [2,4,5,1,3]\r\nfor i in l:\r\n for j in l:\r\n print(min(i,j) if i!=j else 0,end=' ')\r\n print('')\r\n\"\"\"\r\n", "def s():\r\n\tn = int(input())\r\n\ta = []\r\n\tfor _ in range(n):\r\n\t\ta.append(max(map(int,input().split(' '))))\r\n\ta[a.index(n-1)] = n\r\n\tprint(*a)\r\ns()", "n=int(input())\r\nm=0\r\narr=[]\r\nfor i in range(n):\r\n a=list(map(int, input().split()))\r\n m=0\r\n for b in a:\r\n m=max(m, a.count(b))\r\n\r\n if m > 1:\r\n arr.append(n-m)\r\n elif n not in arr:\r\n arr.append(n)\r\n else:\r\n arr.append(n-1)\r\n \r\nprint(*arr)", "n = int(input())\r\ndata = [[0] * n for i in range(n)]\r\nresult_table = [0] * n\r\nfor i in range(n):\r\n data[i] = input().split()\r\n j = i + 1\r\n result_table[i] = (n - j) * j + i * (i + 1) // 2\r\ncalc = 0\r\nanswer = [0] * n\r\ncounter = 0\r\nfor i in data:\r\n for j in i:\r\n calc += int(j)\r\n answer[counter] = 1 + result_table.index(calc)\r\n result_table[result_table.index(calc)] = -1\r\n calc = 0\r\n counter += 1\r\nstr_answer = \"\"\r\nfor i in answer:\r\n str_answer += str(i) + \" \"\r\nprint(str_answer)", "n = int(input())\r\nd = [list(map(int, input().split())) for i in range(0, n)]\r\nc = 0\r\nfor i in range(0, n):\r\n has = False\r\n for num in range(1, n + 1):\r\n if d[i].count(num) >= 2:\r\n has = True\r\n print(num, end=' ')\r\n if not has:\r\n print(n - c, end=' ')\r\n c +=1\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split(' ')])\r\nb=[-1 for i in range(n)]\r\nfor i in range(n):\r\n cnum=set([])\r\n for j in range(n):\r\n cnum.add(a[i][j])\r\n if len(cnum)==n:\r\n ch=[]\r\n for j in range(n):\r\n if a[i][j]==0 or a[i][j]==n-1:\r\n ch.append(a[i][j])\r\n if ch[0]==0:\r\n b[i]=n\r\n else:\r\n b[i]=n-1\r\n else:\r\n b[i]=len(cnum)-1\r\nfor i in range(n):\r\n print(b[i],end=' ')\r\n\r\n", "a=[]\r\nfor _ in range(int(input())):\r\n x=max(map(int,input().split()))\r\n while True:\r\n if x not in a:\r\n break\r\n x+=1\r\n a.append(x)\r\nprint(*a)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = [0] * n\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n ans[i] = max(a)\r\nans[ans.index(n - 1)] = n\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\n\r\nans = []\r\nfor _ in range(n):\r\n arr = list(map(int, input().split()))\r\n if (max(arr) == n - 1):\r\n for num in arr:\r\n if num == 0:\r\n ans.append(n)\r\n else:\r\n ans.append(num)\r\n break\r\n\r\nprint(' '.join(map(str, ans)))", "n = int(input())\r\nA = []\r\n\r\nfor i in range(n):\r\n L = list(map(int, input().split(\" \")))\r\n A.append(max(L))\r\n\r\nA[A.index(n - 1)] = n;\r\n\r\nprint(*A)", "n = int(input())\r\npole = []\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n pole.append(s)\r\n\r\nans = [0] * n\r\nfor number in range(1, n + 1):\r\n for i in range(n):\r\n s = set()\r\n for j in range(n):\r\n if pole[i][j] > number - 1:\r\n s.add(pole[i][j])\r\n if len(s) == 1:\r\n for k in s:\r\n ans[i] = k\r\nfor i in range(n):\r\n if ans[i] == n - 1:\r\n ans[i] = n\r\n break\r\nprint(*ans)\r\n ", "l1 = int(input())\nl2 = []\nx = []\nx.append(0)\n\nfor i in range(l1):\n x.append(0)\n l2.append(list(map(int, input().split())))\n\nfor i in range(1, l1+1):\n for j in range(1, l1+1):\n cnt=0\n for k in range(1, l1+1):\n if(l2[j-1][k-1]==i):\n cnt+=1;\n if(cnt==l1-i and (not x[j])):\n x[j]=i;\n break;\n\nfor i in range (1, x.__len__()):\n print(str(x[i]) + \" \", end='')\n\n \t \t \t\t\t \t\t\t \t\t \t \t \t", "n = int(input())\narr = [list(map(int, input().split())) for i in range(n)]\nans = []\nfor i in arr:\n\tanf = max(i)\n\twhile (anf in ans):\n\t\tanf+=1\n\tans.append(anf)\nprint(*ans)", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nanswer = [0 for i in range(n)]\r\nfor num in range(1, n + 1):\r\n row = 0\r\n counter = [a[i].count(num) for i in range(n)]\r\n if answer[counter.index(n - num)] == 0:\r\n answer[counter.index(n - num)] = num\r\nanswer[answer.index(0)] = n\r\nprint(' '.join(map(str, answer)))", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\tx = sum(list(map(int,input().split())))\r\n\ta.append([x,i])\r\na.sort()\r\nans = [n for i in range(n)]\r\nfor i in range(n):\r\n\tans[a[i][1]] = i+1\r\nfor i in ans:\r\n\tprint(i,end = \" \")\r\nprint() ", "n = int(input())\nres = []\n\nfor i in range(n):\n res.append(0)\n\nfor i in range(n):\n inp = input().split()\n inp = [int(x) for x in inp]\n for j in range(n):\n if inp[j]>res[j]:\n res[j] = inp[j]\n\nres[res.index(n-1)] = n\n\nfor num in res:\n print(num,end = \" \")\nprint() \n", "from collections import Counter\r\nf=False\r\nn=int(input())\r\nans=[0]*n\r\nfor i in range(n):\r\n c=Counter(map(int,input().split()))\r\n if len(c.keys())!=n:\r\n ans[i]=len(c.keys())-1\r\n elif not f:\r\n ans[i]=n\r\n f=True\r\n else:\r\n ans[i] = n-1\r\nprint(\" \".join(map(str,ans)))\r\n\r\n", "\r\nfrom itertools import chain\r\nn = int(input())\r\n\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\nfor i in range(n):\r\n a[i][i] = i\r\n\r\nans = []\r\n\r\nwhile n > 0:\r\n done = False\r\n for i in chain(range(1, n-1), [0, n-1]):\r\n if done:\r\n break\r\n b = True\r\n for dx in -1, 0, 1:\r\n for dy in -1, 0, 1:\r\n if dx != 0 and dy != 0:\r\n continue\r\n if dx == 0 and dy == 0:\r\n continue\r\n nx, ny = i+dx, i+dy\r\n if nx < 0 or nx >= n:\r\n continue\r\n if ny < 0 or ny >= n:\r\n continue\r\n b = b and a[nx][ny] == 1\r\n if b:\r\n ans.append(a[i][i])\r\n# print(ans)\r\n if i < n - 1:\r\n a = a[:i] + a[i+1:]\r\n else:\r\n a = a[:i]\r\n for j in range(len(a)):\r\n if i < n - 1:\r\n a[j] = a[j][:i] + a[j][i+1:]\r\n else:\r\n a[j] = a[j][:i]\r\n for x in range(len(a)):\r\n for y in range(len(a)):\r\n if x == y:\r\n continue\r\n a[x][y] -= 1\r\n n -= 1\r\n done = True\r\n if not done:\r\n exit(1)\r\n# for x in a:\r\n# for y in x:\r\n# print(y, end = ' ')\r\n# print()\r\n\r\n\r\nret = [0] * len(ans)\r\nfor i in range(len(ans)):\r\n ret[ans[i]] = i + 1\r\n\r\nfor i in ret:\r\n print(i, end = ' ')\r\n", "n=int(input())\r\nfrom collections import Counter \r\nans=[0]*n \r\n\r\nfor ind in range(n):\r\n a=[int(i) for i in input().split()]\r\n c=Counter(a)\r\n maxi=0 \r\n for i in c:\r\n if c[i]>maxi:\r\n maxi=c[i]\r\n curr=i \r\n #@ print(maxi,curr)\r\n if maxi>1:\r\n ans[ind]=curr\r\n#@print(ans)\r\nz=n \r\nfor i in range(n):\r\n if ans[i]==0:\r\n ans[i]=z \r\n z-=1 \r\nprint(*ans)\r\n ", "n = int(input())\nr = [n]*n\nf = 0\nfor _ in range(n):\n s = len(set(list(map(int,input().split())))-{0})\n if s==n-1:\n if f==0:\n r[_]=str(s)\n f=1\n else:\n r[_]=str(s+1)\n else:\n r[_]=str(s)\nprint(' '.join(r))", "n = int(input())\r\nrows = [[] for i in range(n)]\r\nd = {}\r\nfor i in range(n):\r\n curr_d = {}\r\n arr = map(int, input().split(' '))\r\n mx = 0\r\n for j in arr:\r\n rows[i].append(j)\r\n if j not in curr_d:\r\n curr_d[j] = 1\r\n else:\r\n curr_d[j] += 1\r\n mx = max(mx, curr_d[j])\r\n d[mx] = i\r\n\r\nsorted_keys = sorted(d, reverse=True)\r\nseen_set = set([0])\r\npos = {}\r\nfor k in sorted_keys:\r\n row_val = d[k]\r\n for j in rows[row_val]:\r\n if j not in seen_set:\r\n pos[row_val] = j\r\n break\r\n seen_set.add(j)\r\n\r\n\r\nfor i in range(n):\r\n if i not in pos:\r\n pos[i] = n\r\n print(pos[i], end=' ')\r\nprint()\r\n", "a = int(input())\r\nm = []\r\nfor i in range(a):\r\n m.append([int(x) for x in input().split()])\r\nminn = set()\r\nminn.add(0)\r\nans = [0 for i in range(a)]\r\nfor k in range(1, a + 1):\r\n for i in range(a):\r\n cont = True\r\n for j in range(a):\r\n if m[i][j] > k or ans[i] != 0:\r\n cont = False\r\n if cont:\r\n ans[i] = k\r\n break\r\nprint(*ans)", "n = int(input())\r\na=[]\r\nfor _ in range(n):\r\n arr = list(map(int, input().split()))\r\n if (max(arr) == n - 1):\r\n for i in arr:\r\n if i==0:\r\n a.append(n)\r\n else:\r\n a.append(i)\r\n break\r\n\r\nfor i in a:\r\n print(i,end=' ')", "res = []\r\nfor _ in [0]*int(input()):\r\n\ttmp = [int(z) for z in input().split()]\r\n\ttmp.sort()\r\n\ttmp = tmp[::-1]\r\n\tif(tmp[0]==tmp[1]):\r\n\t\tres.append(tmp[0])\r\n\telif(res.count(tmp[0])):\r\n\t\tres.append(tmp[0]+1)\r\n\telse:\r\n\t\tres.append(tmp[0])\r\nfor r in res:\r\n\tprint(r,end = ' ')\r\n", "def main():\r\n n = int(input())\r\n a = [[int(i) for i in input().split()] for j in range(n)]\r\n \r\n result = [-1] * n\r\n for i in range(n - 1):\r\n for j in range(n):\r\n d = set(a[j][k] for k in range(n) if result[k] == -1 and j != k)\r\n if len(d) == 1:\r\n result[j] = d.pop()\r\n result[result.index(-1)] = n\r\n \r\n print(' '.join(str(i) for i in result))\r\n \r\nmain()", "n = int(input())\r\nans = []\r\nb = True\r\nfor _ in range(n):\r\n x = max(list(map(int, input().split())))\r\n if x == n-1 and b:\r\n ans.append(n)\r\n b = False\r\n else:\r\n ans.append(x)\r\nprint(*ans)", "n = int(input())\na = [list(map(int, input().split())) for x in range(n)]\nresult = [0] * n\nfor x in range(1, n):\n result[max(range(n), key = lambda i: a[i].count(x))] = x\nprint(*[(x if x else n) for x in result])\n", "n=int(input())\na=[list(map(int, input().split())) for _ in range(n)]\nb=[0]*n\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[j].count(i+1)==n-1:\n\t\t\tb[j]=i+1\n\t\t\ta[j]=[0]*n\n\t\t\tbreak\n\tfor j in range(n):\n\t\tfor k in range(n):\n\t\t\tif a[k][j]==i+1:\n\t\t\t\ta[k][j]+=1\n\t\nprint(*b)\n", "n = int(input())\nsaida = []\n\nfor _ in range(n):\n\tl = [int(x) for x in input().split()]\n\n\tsaida.append(max(l))\n\ni = saida.index(max(saida))\n\nsaida[i] = n\nprint(' '.join(map(str, saida)))\n# print(min(matriz))", "from sys import stdin as fin\n# fin = open(\"wfr2016b.in\", \"r\")\n\nn = int(fin.readline())\n\nans = [None] * n\nmaxv = 1\nfor i in range(n):\n line = tuple(map(int, fin.readline().split()))\n cnt = [False] * (n + 1)\n for j in range(n):\n if not cnt[line[j]]:\n cnt[line[j]] = True\n else:\n ans[i] = line[j]\n maxv = max(maxv, line[j] + 1)\n break\n\nfor num in ans:\n if num is None:\n print(maxv, end=' ')\n maxv += 1\n else:\n print(num, end=' ')", "'''\nID: essi\nLANG: PYTHON3\nTASK: self-contest.py\n'''\n# solve with max biween every pair\nn = int(input())\na = []\nres = [-1] * n\nfor i in range(n):\n a.append(list(map(int,input().split())))\nfor i in range(n - 1):\n for j in range(i + 1, n):\n res[i] = max(res[i], a[i][j])\n res[j] = max(res[j], a[i][j])\nseen = [0] * (n + 1)\nfor i in res:\n seen[i] = 1\nr = []\nfor i in range(1, n + 1):\n if seen[i] == 0:\n r.append(i)\nind = 0\nseen = [0] * (n + 1)\nfor i in range(n):\n if seen[res[i]] == 0:\n seen[res[i]] = 1\n else:\n res[i] = r[ind]\n ind+=1\nprint(*res)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(M):\r\n n = len(M)\r\n i1 = None\r\n for i in range(n):\r\n works = False\r\n for j in range(n):\r\n if M[i][j]==n-1:\r\n works = True \r\n break\r\n if works and i1 is None:\r\n i1 = i\r\n answer = [M[i][i1] for i in range(n)]\r\n answer[i1] = n\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\nM = []\r\nfor i in range(n):\r\n row = [int(x) for x in input().split()]\r\n M.append(row)\r\nprocess(M)", "n = int(input())\r\ns = [0] * n\r\ndp = [[0] for i in range(n)]\r\nfor i in range(n):\r\n dp[i] = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n s[i] = max(s[i], dp[i][j])\r\n s[j] = max(s[j], dp[i][j])\r\nused = [False] * n\r\nfor i in range(n):\r\n if used[s[i] - 1]:\r\n s[i] *= -1\r\n else:\r\n used[s[i] - 1] = True\r\nfor i in range(n):\r\n if s[i] < 0:\r\n for j in range(1, n + 1):\r\n if abs(s[i]) < j and not used[j - 1]:\r\n s[i] = j\r\n break\r\nprint(*s)", "n = int(input())\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n if len(set(x)) == n:\r\n x[x.index(0)]=n\r\n print(*x)\r\n break", "def f(l):\r\n c=[0]*(len(l))\r\n for i in range(len(l)):\r\n c[l[i]-1]=c[l[i]-1]+1\r\n \r\n \r\n for i in range(len(c)):\r\n if c[i]>1:\r\n return i+1\r\n return 0\r\n \r\n\r\nn=int(input())\r\nt=[]\r\ng=[]\r\nfor i in range(n):\r\n l=input()\r\n l=l.split(\" \")\r\n for j in range(len(l)):\r\n l[j]=int(l[j])\r\n c=f(l)\r\n \r\n if c>0:\r\n t.append(c)\r\n \r\n \r\n else:\r\n g.append(i)\r\n t.append(0)\r\n \r\nt[g[0]]=n-1\r\nt[g[1]]=n\r\n\r\nfor i in range(n):\r\n print(t[i],\"\", end=\"\")", "n = int(input())\nfor i in range(n):\n k = list(map(int, input().split()))\n if len(set(k)) == n:\n k[k.index(0)] = n\n print(*k)\n break", "n = int(input())\nmatrix = []\n\nfor r in range(0,n):\n matrix.append(list(map(int,list(input().split()))))\n\nans = []\nfor line in matrix:\n k = max(line)\n while k in ans:\n k += 1\n ans.append(k)\n\nf = ''\nfor w in ans:\n f += str(w)\n f += ' '\nprint(f[:-1])\n\n\n \t \t\t\t \t\t \t\t\t \t \t", "t=int(input())\r\nfor i in range(t):\r\n l=[]\r\n l=list(map(int,input().split()))\r\n s=set(l)\r\n if(len(s)==len(l)):\r\n break\r\nfor i in l:\r\n if(i==0):\r\n print(t,end=\" \")\r\n else:\r\n print(i,end=\" \")", "def solve(n:int , List:list )-> int :\r\n inf = int(1e9)\r\n p = [0]*n\r\n used= [False]*(n+1)\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n # if(List[i][j]> p[i] and List[i][j]> p[j]):\r\n # p[i] = p[i][j]\r\n # p[j] = p[i][j]\r\n # if(List[i][j]> p[i] and List[i][j]< p[j]):\r\n # p[i] = List[i][j]\r\n if ( p[i] < List[i][j]):\r\n p[i] = List[i][j]\r\n if (p[j] < List[i][j]):\r\n p[j] = List[i][j]\r\n for i in range(n):\r\n for j in range(p[i],n+1):\r\n if not used[j]:\r\n # print(j)\r\n used[j] = True\r\n p[i] = j\r\n break\r\n\r\n return p\r\nn = int(input())\r\nList = []\r\nfor i in range(n):\r\n line = input().split()\r\n List.append([])\r\n for j in range(n):\r\n List[i].append(int (line[j]) )\r\n#print(n)\r\n#print(List)\r\nto_print = solve(n,List)\r\nfor i in range (n):\r\n print(to_print[i], end=\" \")\r\n\r\n", "\r\nn=int(input())\r\nl1=[]\r\n\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n l1.append(l)\r\n\r\nt=[]\r\n\r\nfor i in range(n):\r\n t.append(max(l1[i]))\r\n\r\nt[t.index(n-1)]=n\r\n\r\nfor i in range(n):\r\n print(t[i],end=\" \")\r\n", "#!/usr/bin/env python3\nN = int(input())\n\nmin_arr = [0 for _ in range(N)]\n\nfor i in range(N):\n arr_i = [n-1 for n in map(int, input().split())]\n for j in range(N):\n if i == j:\n continue\n min_arr[i] = max(arr_i[j], min_arr[i])\n min_arr[j] = max(arr_i[j], min_arr[j])\n\nassign = [0 for _ in range(N)]\nblah = [(min_arr[i], i) for i in range(N)]\nblah.sort()\nfor i in range(N):\n assign[blah[i][1]] = i+1\n\nprint(' '.join(map(str, assign)))\n", "n=int(input())\r\nop=[]\r\nfor i in range(n):\r\n ip=list(map(int,input().split()))\r\n ip.remove(0)\r\n if max(ip) not in op:\r\n op.append(max(ip))\r\n else:\r\n op.append(max(ip)+1)\r\nfor j in op:\r\n print(j,end=' ')\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(max(list(map(int,input().split(' ')))))\r\nl[l.index(n-1)]=n\r\nfor i in l:\r\n print(i,end=\" \")\r\n", "n = int(input())\r\nfor i in range(n):\r\n a = input()\r\n a = a.split()\r\n a = [int(x) for x in a]\r\n a_s = set(a)\r\n if len(a_s) == n:\r\n b = a.copy()\r\n b[a.index(0)] = n\r\n break\r\n\r\nfor i in b:\r\n print(i, end=' ')", "n = int(input())\n\ntarget = [x for x in range(n)]\nfor i in range(n):\n v = list(map(int, input().split()))\n\n if sorted(v) == target:\n print(' '.join([str(x) if x != 0 else str(n) for x in v]))\n exit(0)\n\n\n", "n=int(input())\r\nz=set(range(1,n+1))\r\nfor q in range(n):\r\n x=max(int(s)for s in input().split());p=min(i for i in z if i>=x);z-={p};print(p,end=\" \")\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nk=a[0][1]\r\ns=[0]*n\r\nfor i in range(n):\r\n f=0\r\n for j in range(n):\r\n f=max(a[i][j],f)\r\n if f in s:\r\n s[i]=n\r\n else:\r\n s[i]=f\r\ns=list(map(str,s))\r\nprint(\" \".join(s))", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n = int(inp())\r\n ans = None\r\n for i in range(n):\r\n l = list(map(int,inp().split()))\r\n if len(set(l)) == n:\r\n ans = l\r\n break\r\n for i in range(len(ans)):\r\n if ans[i] == 0: ans[i] = n\r\n print(' '.join(map(str,ans)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nt = []\r\nfor i in range(n):\r\n t.append(map(int, input().split()))\r\n\r\nresult = []\r\nn_set = False\r\nfor row in t:\r\n m = max(row)\r\n if m == n - 1:\r\n if not n_set:\r\n result.append(n-1)\r\n n_set = True\r\n else:\r\n result.append(n)\r\n else:\r\n result.append(m)\r\n\r\n\r\nfor i in result:\r\n print(i, end=\" \")\r\n", "# from pprint import pprint\n\nn = int(input())\na = []\nfor i in range(n):\n row = [int(k) for k in input().split()]\n a.append(row)\n\nresult = [0] * n\nfor k in range(1, n):\n # print('k=', k)\n for i in range(n):\n countK = 0\n countNonK = 0\n for j in range(n):\n if a[i][j] == k:\n countK += 1\n elif a[i][j] != 0:\n countNonK += 1\n # print('@', countK, countNonK)\n if countK > 0 and countNonK == 0:\n # print('j', j)\n result[i] = k\n for j in range(n):\n a[i][j] = 0\n a[j][i] = 0\n continue\n\n countK = 0\n countNonK = 0\n for j in range(n):\n if a[j][i] == k:\n countK += 1\n elif a[j][i] != 0:\n countNonK += 1\n if countK > 0 and countNonK == 0:\n # print('j#', j)\n result[i] = k\n for j in range(n):\n a[j][i] = 0\n a[i][j] = 0\n # pprint(a)\nresult[result.index(0)] = n\n\nprint(' '.join(str(i) for i in result))\n\n", "v = [len(set(map(int, input().split())))\r\n - 1 for _ in range(int(input()))]\r\nv[v.index(max(v))] += 1\r\nprint(' '.join(map(str, v)))", "n = int(input())\na = [list(map(int, input().split(' '))) for i in range(n)]\nans = [0]*n\nfor i in range(1, n+1):\n for j in range(n):\n if ans[j] == 0 and a[j].count(i) == n-i:\n ans[j] = str(i)\n break\nprint(' '.join(ans))\n", "n = int(input())\r\na = [max(map(int, input().split())) for i in range(n)]\r\na[a.index(n - 1)] = n\r\nprint(*a)", "n = int(input())\n\ns = []\n\nfor _ in range(n):\n l = [int(b) for b in input().split()]\n s.append(max(l))\n\ni = s.index(max(s))\ns[i] = n\n\nfor c in s:\n print(f'{c}', end=' ')\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nloops = int(input().strip())\r\n\r\nc = [[0 for __ in range(0)] for _ in range(loops)]\r\nfor i in range(loops):\r\n c[i] = input().split()\r\na = [0 for _ in range(loops)]\r\nfor i in range(loops):\r\n max1 = 0\r\n for j in range(loops):\r\n if int(c[j][i]) > max1:\r\n max1 = int(c[j][i])\r\n a[i] = max1\r\na[a.index(loops - 1)] = loops\r\nfor i in range(0,len(a)):\r\n a[i] = str(a[i])\r\nprint(\" \".join(a))\r\n\r\n\r\n", "n = int(input())\nM = [[int(x) for x in input().split()] for i in range(n)]\nlast = False\nperm = [0 for i in range(n)]\nfor i in range(n):\n S = set()\n for x in M[i]:\n if x in S:\n perm[i] = x\n break\n else:\n S.add(x)\n else:\n if last:\n perm[i] = n-1\n else:\n perm[i] = n\n last = True\nfor x in perm:\n print(x, end = ' ')\n", "n=int(input());v=[];tmp=0;t=False\r\nfor i in range(n):\r\n v.append([0 for i in range(n+1)])\r\np=[0 for i in range(n)];\r\nfor i in range(n):\r\n inp=list(map(int,input().split(\" \")))\r\n for k in inp:\r\n v[i][k]+=1\r\nfor i in range(1,n+1):\r\n for j in range(n):\r\n if ((p[j]==0) and (v[j][i]==n-i)):\r\n p[j]=i\r\nfor i in p:\r\n if (t==0) and (i==n-1):\r\n print(n,end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n if (i==n-1):\r\n t=1\r\n \r\n \r\n", "n = int(input())\r\nT = []\r\nfor i in range(n):\r\n T.append(list(map(int, input().split())))\r\n\r\nans = [-1] * n\r\nfor i in range(n):\r\n if ans[i] != -1:\r\n continue\r\n for j in range(len(T[i])):\r\n for k in range(j + 1, len(T[i])):\r\n if T[i][j] == T[i][k]:\r\n ans[i] = T[i][j]\r\n break\r\n if ans[i] != -1:\r\n for k in range(n):\r\n if T[i][k] != ans[i] and ans[k] == -1:\r\n ans[k] = T[i][k] \r\n break\r\n#print(ans) \r\nfor i in range(n):\r\n if ans[i] == -1:\r\n for j in range(i + 1, n):\r\n if ans[j] == -1:\r\n ans[i] = T[i][j]\r\n for k in range(n):\r\n if T[i][k] != ans[i] and ans[k] == -1:\r\n ans[k] = T[i][k]\r\n#print(ans)\r\ntemp = ((n + 1) * n) // 2\r\nfor i in range(n):\r\n if ans[i] != -1:\r\n temp = temp - ans[i]\r\nfor i in range(n):\r\n if ans[i] == -1:\r\n ans[i] = temp\r\nprint(' '.join((str(num) for num in ans)))", "#!/usr/bin/python3\n\ndef remove(A, i, n):\n for j in range(n):\n A[i][j] = 0\n A[j][i] = 0\n\n\nn = int(input())\nA = [list(map(int, input().split())) for i in range(n)]\n\nans = [0 for i in range(n)]\nfor i in range(n - 1):\n t = -1\n for j in range(n):\n f = True\n g = False\n for k in range(n):\n if not (A[j][k] in (0, i + 1) and A[k][j] in (0, i + 1)):\n f = False\n if A[j][k] != 0:\n g = True\n if f and g:\n t = j\n\n\n ans[t] = i + 1\n remove(A, t, n)\n\n\nfor i in range(n):\n if ans[i] == 0:\n ans[i] = n\n\nprint(\" \".join(map(str, ans)))\n \n", "from collections import Counter\r\n\r\nn = int(input())\r\np = [0] * n\r\nhash_map = {}\r\nfound = set()\r\nfor i in range(1, n + 1):\r\n hash_map[i] = n - i\r\n\r\nfor i in range(n):\r\n array = list(map(int, input().split()))\r\n count = Counter(array)\r\n for k, v in count.items():\r\n for k1, v2 in hash_map.items():\r\n if 1 < v2 == v and v > 1:\r\n p[i] = k\r\nwhile 0 in p:\r\n idx = p.index(0)\r\n if n not in p:\r\n p[idx] = n\r\n else:\r\n p[idx] = n - 1\r\nprint(*p)\r\n", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nans = []\r\nfor i in range(n):\r\n ans.append(max(a[i]))\r\nfor i in range(n):\r\n if (ans[i] == n - 1):\r\n ans[i] = n\r\n break\r\nprint(*ans)", "import sys\nf = sys.stdin\nn = int(f.readline())\narr = [max(map(int, f.readline().split())) for i in range(n)]\narr[arr.index(n-1)] = n\nprint (\" \".join(map(str,arr)))\n \t\t\t\t \t\t \t\t\t\t\t \t \t\t\t\t\t \t", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n\r\nfor i in range(n):\r\n is_dif = True\r\n for j in range(n):\r\n c = a[i].count(a[i][j])\r\n if c > 1:\r\n is_dif = False\r\n break\r\n if is_dif:\r\n for k in range(n):\r\n if a[i][k] == 0:\r\n a[i][k] = n\r\n print(a[i][k],end=' ')\r\n break", "n = int(input())\r\nP = [0]*n\r\n\r\nfor i in range(n):\r\n A = list(map(int, input().split()))\r\n x = max(A, key=A.count)\r\n if A.count(x) > 1:\r\n P[i] = x\r\n\r\nA = set(range(n+1)) - set(P)\r\n\r\nfor i in range(n):\r\n if not P[i]:\r\n P[i] = A.pop()\r\n\r\nprint(*P)", "n = int(input())\nfl = 0\nA = [list(map(int, input().split())) for i in range(n)]\nfor i in range(n):\n kok = []\n for u in A:\n kok.append(u[i])\n if len(set(kok)) == len(kok):\n print(n - fl, end=' ')\n fl = 1\n else:\n ans = 0\n pri = 122\n for U in set(kok):\n if kok.count(U) > ans:\n ans = kok.count(U)\n pri = U\n print(pri, end=' ')", "n = int(input())\r\n\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\np = [0] * n\r\n\r\ngot = [0, 1]\r\n\r\nif n == 2:\r\n print(2, 1)\r\n exit()\r\n\r\nfor i in range(n):\r\n if set(a[i]) == {0, 1}:\r\n p[i] = 1\r\n break\r\nfor need in range(1, n):\r\n for i in range(n):\r\n if set(a[i]) == set(got+[need]):\r\n p[i] = need\r\n got.append(need)\r\n break\r\n\r\nfor i in range(n):\r\n if p[i] == 0:\r\n p[i] = n\r\n\r\nprint(*p)", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n p.append(list(map(int, input().split())))\r\n p[i].sort()\r\n p[i].append(i)\r\np.sort()\r\npos = [0] * n\r\nfor i in range(n):\r\n pos[p[i][-1]] = i + 1\r\nprint(*pos)\r\n\r\n \r\n \r\n \r\n", "from collections import defaultdict\r\n\r\ndef get_max_key( number_counts ):\r\n res = 0\r\n max_count = 1\r\n for k,v in number_counts.items():\r\n if v > max_count:\r\n res = k\r\n max_count = v\r\n return res\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = int( input() )\r\n res = [0]*n\r\n\r\n thenum = n-1\r\n\r\n for i in range(n):\r\n ap = [int(x) for x in input().split()]\r\n number_counts = defaultdict(int)\r\n for j in range(n):\r\n if ap[j]:\r\n number_counts[ap[j]] += 1\r\n #print(number_counts)\r\n maxkey = get_max_key(number_counts)\r\n if maxkey == 0:\r\n res[i] = thenum\r\n thenum += 1\r\n else:\r\n res[i] = maxkey\r\n\r\n print(\" \".join([str(x) for x in res]))\r\n\r\n", "n=int(input())\nR=range(n)\na=[list(map(int, input().split())) for _ in R]\nb=[0]*n\nfor i in R:\n\tfor j in R:\n\t\tif a[j].count(i+1)==n-1:\n\t\t\tb[j]=i+1\n\t\t\ta[j]=[0]*n\n\t\t\tbreak\n\tfor j in R:\n\t\tfor k in R:\n\t\t\tif a[k][j]==i+1:\n\t\t\t\ta[k][j]+=1\nprint(*b)\n", "n = int(input())\r\ndata = [list(map(int, input().split())) for i in range(n)]\r\nanswer = []\r\nfor i in range(n):\r\n max1 = data[i][0]\r\n for j in range(n):\r\n max1 = max(max1, data[j][i])\r\n answer.append(max1)\r\nmax2 = max(answer)\r\nfor i in range(len(answer)):\r\n answer[i] = [answer[i], i]\r\nanswer.sort()\r\nindex = -1\r\nfor i in range(len(answer)):\r\n if answer[i][0] == max2:\r\n index = i\r\n break\r\nfor i in range(index + 1, len(answer)):\r\n answer[i][0] = answer[i - 1][0] + 1\r\n\r\nfor i in range(len(answer)):\r\n answer[i][0], answer[i][1] = answer[i][1], answer[i][0]\r\nanswer.sort()\r\nfor i in range(len(answer)):\r\n print(answer[i][1], end=\" \")", "from statistics import mode\r\nn = int(input())\r\nlis = []\r\nen = 0 \r\nfor i in range(n):\r\n arr = [int(x)for x in input().split()]\r\n if n-1 in arr :\r\n if en:\r\n lis.append(n-1)\r\n else:\r\n lis.append(n) \r\n en = 1 \r\n continue\r\n lis.append(mode(arr))\r\nprint(*lis) \r\n \r\n", "def main():\n n = int(input())\n aa = list(tuple(map(int, input().split())) for _ in range(n))\n cnt = []\n for row in aa:\n l = [0] * n\n for x in row:\n l[x] += 1\n cnt.append(l)\n res = [0] * n\n for x in range(1, n):\n i = max(range(n), key=lambda i: cnt[i][x])\n res[i] = x\n for i, x in enumerate(res):\n if not x:\n res[i] = n - 1\n elif x == n - 1:\n res[i] = n\n print(*res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nl = [list(map(int, input().split())) for i in range(n)]\np = [-1 for i in range(n)]\nfor i in range(n):\n for j in range(1, n+1):\n if l[i].count(j) == n-j:\n p[i] = j\n break\nif p.count(n-1) == 2:\n p[p.index(n-1)] = n\nprint(\" \".join(map(str, p)))\n", "lines = int(input())\nvalues = [False] * lines\nmatrix = []\nmaxValue = 0\nanswer = []\n\nfor i in range(lines):\n matrix.append([int(x) for x in input().split()])\n for j in range(lines):\n if maxValue < matrix[i][j]:\n maxValue = matrix[i][j]\n if values[maxValue - 1] == True:\n values[lines - 1] = True\n answer.append(lines)\n else:\n values[maxValue - 1] = True\n answer.append(maxValue)\n maxValue = 0\n\nprint(*answer)\n\n\n \t \t \t \t\t\t \t \t \t \t\t\t", "n=int(input())\r\na=[]\r\nfor _ in range(n):\r\n l=list(map(int,input().strip().split()))\r\n a.append(l)\r\nans=[-1]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=0:\r\n if ans[j]==-1:\r\n if ans[i]==-1:\r\n ans[i]=a[i][j]\r\n else:\r\n ans[j]=a[i][j]\r\n else:\r\n if ans[j]<a[i][j]:\r\n ans[j]=a[i][j]\r\nb=[]\r\nfor x in ans:\r\n if x<0:\r\n b.append(n)\r\n elif x not in b:\r\n b.append(x)\r\n else:\r\n b.append(n)\r\nprint(*b)", "n = int(input())\nx = list()\nfor i in range(n):\n y = input().split(' ')\n y = [int(k) for k in y]\n y = int(max(y))\n x.append(y)\n\ns = set()\nfor i in range(n):\n s.add(i+1)\n\n# procura duplicata, as outras,\nfor i in range(len(x)):\n if x[i] not in s:\n t = 1\n while (x[i] + t) not in s:\n t += 1\n x[i] += t\n s.remove(x[i])\n\nprint(str(x).replace('[','').replace(']','').replace(',', ''))\n\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n t=max(x[:i]+x[i+1:])\r\n while t in a:\r\n t+=1\r\n a.append(t)\r\nfor i in range(len(a)):\r\n print(a[i],end=' ')\r\nprint()", "n = int(input())\nresp = []\nflag = False\nfor i in range(n):\n tc = 0\n p = 0\n aux = [0 for x in range(n)]\n arr = [int(x) for x in input().split()]\n for j in range(n):\n aux[arr[j]] += 1\n for c in range(n):\n if aux[c] == 1 and c == n-1:\n if not flag:\n p = c\n flag = True\n else:\n p = c+1\n break\n elif aux[c] > tc:\n tc = aux[c]\n p = c\n resp.append(p)\nf = ' '.join(map(str, resp))\nprint (f)\n \t\t\t \t \t \t\t\t\t\t \t \t\t" ]

[ "a=str(input())\ns=0\nfor i in range(len(a)):\n if a[i]=='A':\n s+=1\n elif a[i]=='1':\n s+=10\n else:\n s+=int(a[i])\nprint(s)", "s = list(input())\ndex = 0\nfor i in s:\n if i == \"A\":\n dex += 1\n elif i == \"1\":\n dex += 10\n else:\n dex += int(i)\nprint(dex)", "s = input()\r\nq = 0\r\nw = 0\r\nfor i in range(1, len(s)):\r\n if (s[i] == '0'):\r\n q *= 10\r\n w += q\r\n q = int(s[i])\r\nw += q\r\nprint(w + 1)", "s=list(input())\r\ndex=0\r\nfor i in s:\r\n if i==\"A\":\r\n dex += 1\r\n elif i==\"1\":\r\n dex+=10\r\n else:\r\n dex+=int(i)\r\nprint(dex)", "# LUOGU_RID: 113662250\na=list(input())\nl=len(a)\nfor i in range(l):\n if a[i]=='A':\n a[i]=1\n elif a[i]=='1':\n a[i]=10\n else:\n a[i]=int(a[i])\nprint(sum(a))", "s = input()\r\npos = 1\r\nanswer = 0\r\nwhile (pos < len(s)):\r\n if (s[pos] == '1'):\r\n answer += 10\r\n pos += 2\r\n else:\r\n answer += ord(s[pos]) - ord('0') \r\n pos += 1\r\nprint(1 + answer)", "num = 0\r\nfor i in input().strip():\r\n if i == 'A':\r\n num += 1\r\n elif i == '1':\r\n num += 10\r\n else:\r\n num += int(i)\r\nprint(num)", "s = input()\r\ni = 1\r\nv = 1\r\nwhile i < 7:\r\n if s[i] == '1':\r\n v += 10\r\n i += 2\r\n else:\r\n v += int(s[i])\r\n i += 1\r\nprint(v)", "# LUOGU_RID: 101607609\ns = input()\r\nprint(s.count('1') * 9 + sum(int(x) for x in s.replace('A', '1')))", "s = input()\r\np = 0\r\nt = 0\r\nfor i in s[1:]:\r\n\tif i == '0':\r\n\t\tp *= 10\r\n\tt += p\r\n\tp = int(i)\r\nprint(t+p+1)", "def is_number(s):\r\n try:\r\n int(s)\r\n return True\r\n except ValueError:\r\n return False\r\n \r\nx = input()\r\nret = 1\r\nfor s in x:\r\n\tif(is_number(s)):\r\n\t\tif(s == '0'):\r\n\t\t\tret = ret + 9\r\n\t\telse:\r\n\t\t\tret = ret + int(s)\r\n\r\nprint(ret)", "s = input()\r\ns = s[::-1]\r\nf = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n x = 1\r\n else:\r\n x = int(s[i])\r\n if x == 0:\r\n x = 9\r\n f += x\r\nprint(f)\r\n", "s = input()\r\nans = 0\r\nfor letter in s[1:] :\r\n x = int(letter)\r\n ans += x if x > 0 else 9\r\nprint(ans + 1)", "# coding: utf-8\r\n\r\ns = [int(digit) for digit in input()[1:]]\r\n\r\nprint(9 * s.count(0) + sum(s) + 1)", "s = input()\r\nres = 1\r\nfor i in range(1, 7):\r\n if s[i] == '1':\r\n res += 10\r\n i += 1\r\n else:\r\n res += int(s[i])\r\nprint(res)", "S = input()[ 1 : ]\r\nans = 1\r\nfor i in range( len( S ) ):\r\n if S[ i ] == '1':\r\n ans += 10\r\n else:\r\n ans += ord( S[ i ] ) - ord( '0' )\r\nprint( ans )\r\n", "s=input()\r\na=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='A':\r\n\t\ta+=1\r\n\telif s[i]=='1':\r\n\t\ta+=10\r\n\telse:a+=int(s[i])\r\nprint(a)", "s=input()\r\nf=0\r\nc=0\r\nfor i in range(1,6):\r\n if s[i:i+2]=='10':\r\n c+=10\r\n else:\r\n c+=int(s[i])\r\n #print(s[i:i + 2],c,i)\r\nif(s[6]!='0'):\r\n c+=int(s[6])\r\nprint(c+1)\r\n", "ans = 0\nfor c in input():\n if c == 'A':\n ans += 1\n elif c == '1':\n ans += 10\n else:\n ans += int(c)\nprint(ans)\n", "n = input()\r\nsum = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'A':\r\n sum = sum + 1\r\n elif n[i] == '1':\r\n sum = sum + 10\r\n else:\r\n sum = sum + int(n[i])\r\nprint(sum)\r\n", "a=input().strip()\nx=0\nfor i in a:\n try:\n q=int(i)\n if q-1:\n x+=q\n else:\n x+=10\n except:\n x+=1\nprint(x)", "s = [int(c) for c in input()[1:]]\nprint(1 + sum(s) + 9 * s.count(0))\n", "s = input()\r\nans = 1\r\nfor i in range(1, len(s)):\r\n if s[i] != '1':\r\n ans += int(s[i])\r\n else:\r\n ans += 10\r\n i += 1\r\nprint(ans)# 1692045137.8134844", "def f(n):\r\n if n == 'A':\r\n return 1\r\n if n == '1':\r\n return 10\r\n return int(n)\r\n\r\n\r\nprint(sum(map(f, input())))\r\n", "s=input()\r\ni=len(s)\r\nt=0\r\nwhile i:\r\n i=i-1\r\n if s[i]=='A': t=t+1\r\n elif s[i]=='1': t=t+10\r\n else: t=t+int(s[i])-int('0')\r\nprint(t)", "print ( __import__(\"functools\").reduce (lambda ans, c: ans + (1 if c == \"A\" else 10 if c == \"1\" else int(c)), [0] + list(input())) )", "import sys, os\r\nimport math\r\nfrom itertools import combinations, permutations\r\nfrom turtle import st\r\n\r\nTC = False\r\n\r\ndef solve():\r\n s = str(input())\r\n res = 0\r\n for i in range(len(s)):\r\n if s[i] == 'A':\r\n res += 1\r\n elif s[i] == '1':\r\n res += 10\r\n else:\r\n res += ord(s[i]) - 48\r\n print(res)\r\n\r\nif os.path.exists('input.txt'):\r\n debug = True\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n #sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nif TC:\r\n for _ in range(int(input())):\r\n solve()\r\nelse:\r\n solve()", "a = list(input())\ns = 0\nfor i in a:\n if i == \"A\":\n s += 1\n elif i == \"1\":\n s += 10\n else:\n s += int(i)\nprint(s)", "\r\na = input()\r\ns = 1\r\nfor i in range(1 , len(a)):\r\n if a[i] == '0':\r\n s = s + 9\r\n else:\r\n s = s + int(a[i])\r\n \r\nprint(s)\r\n ", "s = list(input())\r\nif s[-1]=='\\n':\r\n s.pop()\r\n\r\nans = 1\r\nfor i in range(1,7):\r\n d = int(s[i])\r\n if d==1:\r\n ans += 10\r\n else:\r\n ans += d\r\n\r\nprint(ans)", "s=input();ans=0\nfor i in range(0,len(s)):\n if s[i]=='1':\n ans+=10\n elif s[i]=='A':\n ans+=1\n else:\n ans+=int(s[i])\nprint(ans)", "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ns = input().strip()[1:]\r\nprint(str(1+sum(int(x) for x in s)+9*s.count('0'))+\"\\n\")\r\n", "sum=0\r\nfor i in input():\r\n if i=='A':sum=sum+1\r\n elif i=='1':sum=sum+10\r\n else:sum=sum+int(i)\r\nprint(sum)", "a=list(input())\nb=int(0)\nfor i in range(len(a)):\n if a[i]==\"1\":\n b+=10\n elif a[i]==\"2\":\n b+=2\n elif a[i]==\"3\":\n b+=3\n elif a[i]==\"4\":\n b+=4\n elif a[i]==\"5\":\n b+=5\n elif a[i]==\"6\":\n b+=6\n elif a[i]==\"7\":\n b+=7\n elif a[i]==\"8\":\n b+=8\n elif a[i]==\"9\":\n b+=9\n elif a[i]==\"0\":\n b+=0\n elif a[i]==\"A\":\n b+=1\nprint(int(b))", "a=input()\r\n#a=a[1:]\r\ns=1\r\nfor i in a[1:] :\r\n if i=='1' :\r\n s=s+10\r\n else :\r\n s=s+int(i)\r\nprint(s) \r\n", "nums = input()\r\ncounter = 0\r\nfor i in nums:\r\n if i == 'A':\r\n counter += 1\r\n elif i == '1':\r\n counter += 10\r\n else:\r\n counter += int(i)\r\nprint(counter)\r\n", "s=input()\nsum=0\nfor i in s:\n if i=='1':\n sum+=10\n elif i=='A':\n sum+=1\n else:\n sum+=int(i)\nprint(sum)", "s = input()\r\nalc = 0\r\nfor c in s:\r\n if c != '0':\r\n if c == '1':\r\n alc += 10\r\n elif '1' < c <= '9':\r\n alc += ord(c) - ord('0')\r\n else:\r\n alc += (lambda x: {'J': 11, 'Q': 12, 'K': 13, 'A': 1}[x])(c)\r\nprint(alc)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 23:31:38\nLastEditTime: 2021-11-06 23:35:18\nDescription: Ace It!\nFilePath: CF656F.py\n'''\n\n\ndef func():\n s = list(input().strip())\n count = 0\n for item in s:\n if item == \"A\":\n count += 1\n elif item == \"1\":\n count += 10\n else:\n count += int(item)\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "s = input()\r\nans = 1\r\n\r\nfor i in s[1:]:\r\n x = int(i)\r\n if x == 0:\r\n x = 9\r\n ans += x\r\n \r\nprint(ans) \r\n \r\n\r\n \r\n", "s=input()\r\nt=int(0)\r\nfor i in range(1,7):\r\n if(s[i]=='1'):\r\n t+=10\r\n else:\r\n a=int(s[i])\r\n t+=a\r\nprint(t+1)\r\n", "s = input()[1:]\r\nprint(1+sum(int(x) for x in s)+9*s.count('0'))", "s = input()\r\nans = int(0)\r\nfor i in s:\r\n\tif(i == 'A'):\r\n\t\tans += 1\r\n\telif(i == '1'):\r\n\t\tans += 10\r\n\telse:\r\n\t\tans += int(i)\r\nprint(ans)" ]

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\nN,Q=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\ndp=[[0]*N for i in range(N)]\r\nfor i in range(N):\r\n for j in range(N):\r\n if A[i]<A[j]:\r\n dp[i][j]=1\r\nfor _ in range(Q):\r\n X,Y=map(int,readline().split())\r\n X-=1;Y-=1\r\n dct={}\r\n for i in range(N):\r\n if i in (X,Y):\r\n continue\r\n x=(dp[i][X]+dp[i][Y])/2\r\n dp[i][X],dp[i][Y]=x,x\r\n x=(dp[X][i]+dp[Y][i])/2\r\n dp[X][i],dp[Y][i]=x,x\r\n x=(dp[X][Y]+dp[Y][X])/2\r\n dp[X][Y],dp[Y][X]=x,x\r\nans=0\r\nfor i in range(N):\r\n for j in range(i):\r\n ans+=dp[i][j]\r\nprint(ans)" ]

[ "import sys\r\nimport math\r\n\r\nn = int(input())\r\nif(n > 20):\r\n print(0)\r\n sys.exit()\r\n\r\npoints = []\r\nfor i in range(n):\r\n p = list(map(int, input().split()))\r\n points.append(p)\r\n\r\ngood = []\r\n\r\nclass Vector:\r\n def __init__(self, first, last):\r\n self.elems = [last[i] - first[i] for i in range(5)]\r\n def __iter__(self):\r\n return self.elems.__iter__()\r\n def l(self):\r\n return (sum(item**2 for item in self))**0.5\r\n def ac(self, other):\r\n ch = sum(self.elems[i] * other.elems[i] for i in range(5))\r\n z = self.l() * other.l()\r\n return ch / z\r\n \r\n\r\ndef check(index):\r\n for i in range(n):\r\n if i == index:\r\n continue\r\n for j in range(i + 1, n):\r\n if j == index:\r\n continue\r\n f = Vector(points[index], points[i])\r\n s = Vector(points[index], points[j])\r\n tmp = f.ac(s)\r\n if math.acos(tmp) < math.pi / 2:\r\n return False\r\n return True\r\n\r\nfor i in range(n):\r\n if(check(i)):\r\n good.append(str(i + 1))\r\n\r\nprint(len(good))\r\nif(len(good)):\r\n print(' '.join(good))\r\n", "n = int(input())\r\npoints = [[-1, -1, -1, -1, -1]]\r\nfor _ in range(n):\r\n pts = list(map(int, input().split()))\r\n points.append(pts)\r\n\r\ndef check(i, j, k):\r\n res = 0\r\n for t in range(5):\r\n a = points[j][t] - points[i][t]\r\n b = points[k][t] - points[i][t]\r\n res += a * b\r\n return res > 0\r\n\r\nres = []\r\nfor i in range(1, n+1):\r\n valid = True\r\n for j in range(1, n+1):\r\n if j != i and valid:\r\n for k in range(1, n+1):\r\n if j != k:\r\n if check(i, j, k):\r\n valid = False\r\n break\r\n if not valid:\r\n break\r\n if valid:\r\n res.append(i)\r\nprint(len(res))\r\nprint(*res)\r\n", "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\nfrom math import acos\r\n\r\ndef check(i,j,k):\r\n num = 0\r\n for l in range(0,5):\r\n num += (points[j][l]-points[i][l])*(points[k][l]-points[i][l])\r\n return num > 0\r\nn = int(input())\r\npoints = [[-1,-1,-1,-1,-1]]\r\nans = []\r\nfor _ in range(0,n):\r\n pts = [int(i) for i in input().split()]\r\n points.append(pts)\r\nfor i in range(1,n+1):\r\n put = True\r\n for j in range(1,n+1):\r\n if j != i and put:\r\n for k in range(1,n+1):\r\n if j != k:\r\n if check(i,j,k):\r\n put = False\r\n break\r\n if not put:\r\n break\r\n if put:\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n6\r\n0 0 0 0 0\r\n1 0 0 0 0\r\n0 1 0 0 0\r\n0 0 1 0 0\r\n0 0 0 1 0\r\n0 0 0 0 1\r\n\r\n\r\n3\r\n0 0 1 2 0\r\n0 0 9 2 0\r\n0 0 5 9 0\r\n\r\n\r\n\"\"\"", "def vec(c0, a, b):\n an = 0\n for i in range(5):\n an += (a[i] - c0[i]) * (b[i] - c0[i])\n return an\n\n\nn = int(input())\nif n > 80:\n print(0)\n exit(0)\na = [[0] * 5 for i in range(n)]\nfor i in range(n):\n a[i] = [int(j) for j in input().split()]\nans = []\nfor i in range(n):\n flag = True\n for j in range(n):\n for k in range(n):\n if i != j and j != k and k != i and vec(a[i], a[j], a[k]) > 0:\n flag = False\n if flag:\n ans.append(i)\nprint(len(ans))\nfor i in ans:\n print(i + 1)", "#!/usr/bin/env python3\r\n\r\ndef ip(x, y):\r\n return sum([a*b for a, b in zip(x,y)])\r\n\r\n\r\ndef dif(a, b):\r\n return [b-a for a, b in zip(a, b)]\r\n\r\n\r\ndef calcAng(a, b, c):\r\n return ip(dif(a, b), dif(a, c))\r\n\r\n\r\ndef testCase(pts):\r\n n = len(pts)\r\n if n > 35:\r\n return []\r\n ans = []\r\n for i in range(n):\r\n acs = 0\r\n for j in range(n):\r\n for k in range(n):\r\n if i == j or j == k or i == k:\r\n continue\r\n if calcAng(pts[i], pts[j], pts[k]) > 0:\r\n acs += 1\r\n if acs == 0:\r\n ans.append(i)\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n pts = []\r\n for i in range(n):\r\n pts.append([int(x) for x in input().split()])\r\n ans = testCase(pts)\r\n print(len(ans))\r\n for x in ans:\r\n print(x+1)\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\np = [tuple(map(int, input().split())) for i in range(n)]\r\n\r\ndef d(a, b):\r\n return (a[0]-b[0], a[1]-b[1], a[2]-b[2], a[3]-b[3], a[4]-b[4])\r\n\r\ndef m(a, b):\r\n t = 0\r\n for i in range(5):\r\n t += a[i] * b[i]\r\n return t\r\n\r\ngood_points = []\r\nfor i in range(n):\r\n good = True\r\n\r\n for j in range(n):\r\n if j == i:\r\n continue\r\n \r\n ab = d(p[j], p[i])\r\n\r\n for k in range(j + 1, n):\r\n if k == i:\r\n continue\r\n \r\n ac = d(p[k], p[i])\r\n \r\n if m(ab, ac) > 0:\r\n good = False\r\n break\r\n \r\n if not good:\r\n break\r\n \r\n if good:\r\n good_points.append(i)\r\n\r\nprint(len(good_points))\r\nfor i in good_points:\r\n print(i + 1)\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/19 17:35\r\n\r\n\"\"\"\r\nN = int(input())\r\nP = []\r\nfor i in range(N):\r\n P.append([int(x) for x in input().split()])\r\n\r\n\r\ndef length(a):\r\n return math.sqrt(sum([x**2 for x in a]))\r\n\r\ndef angle(a, b):\r\n c = sum(a[i]*b[i] for i in range(len(a)))\r\n la = length(a)\r\n lb = length(b)\r\n if la and lb:\r\n return math.acos(c/la/lb)\r\n return -1\r\n\r\ndef cos(a, b, c):\r\n\r\n x = [b[i]-a[i] for i in range(len(a))]\r\n y = [c[i]-a[i] for i in range(len(a))]\r\n\r\n c = sum(x[i] * y[i] for i in range(len(x)))\r\n\r\n return c\r\n\r\nans = []\r\nfor i in range(N):\r\n bad = False\r\n for j in range(N):\r\n if bad:\r\n break\r\n if i != j:\r\n for k in range(N):\r\n if k != i and k != j:\r\n if cos(P[i], P[j], P[k]) > 0:\r\n bad = True\r\n break\r\n if not bad:\r\n ans.append(i+1)\r\nprint(len(ans))\r\nif ans:\r\n print(' '.join(map(str, ans)))", "import math\n\n\ndef check(i, j, k):\n a = []\n b = []\n for ii in range(len(i)):\n a.append(j[ii] - i[ii])\n b.append(k[ii] - i[ii])\n la = 0\n lb = 0\n scal = 0\n for ii in range(len(i)):\n la += a[ii] * a[ii]\n lb += b[ii] * b[ii]\n scal += a[ii] * b[ii]\n return (scal / (la * lb)) <= 0\n\n\ndef count(w):\n ans = []\n for i in range(len(w)):\n f = 1\n for j in w:\n if (w[i] == j):\n continue\n for k in w:\n if (w[i] == k or j == k):\n continue\n f &= check(w[i], j, k)\n ans += [i + 1] if f else []\n return [len(ans)] + ans\n\n\n\nn = int(input())\nw = []\nfor i in range(n):\n w.append(list(map(int, input().split())))\nif (n < 20):\n print(*count(w), end='\\n')\nelse:\n print(0)", "n, p, ans = int(input()), [], []\r\nif n > 123: print(0), exit(0)\r\nfor _ in range(n):\r\n p.append(list(map(int, input().split())))\r\n\r\nfor i in range(0, n):\r\n good = True\r\n for j in range(0, n):\r\n for k in range(j + 1, n):\r\n good &= sum((p[j][l] - p[i][l]) * (p[k][l] - p[i][l]) for l in range(5)) <= 0\r\n if good: ans.append(1 + i)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "# ------------------- fast io --------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# ------------------- fast io --------------------\r\nfrom math import gcd, ceil\r\n\r\ndef prod(a, mod=10**9+7):\r\n ans = 1\r\n for each in a:\r\n ans = (ans * each) % mod\r\n return ans\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\ndef binary(x, length=16):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n\r\nfor _ in range(int(input()) if not True else 1):\r\n n = int(input())\r\n #a, b = map(int, input().split())\r\n #c, d = 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 from math import acos,pi,sqrt\r\n points = []\r\n for i in range(n):\r\n points += [list(map(int, input().split()))]\r\n if n <= 69:\r\n ans = []\r\n for i in range(n):\r\n pos=True\r\n for j in range(n):\r\n for k in range(n):\r\n if j==i or k==i or j==k:continue\r\n ab = [points[i][x] - points[j][x] for x in range(5)]\r\n ac = [points[i][x] - points[k][x] for x in range(5)]\r\n xy = sum([ab[x]*ac[x] for x in range(5)])\r\n m = sqrt(sum(x**2 for x in ab)) * sqrt(sum(x**2 for x in ac))\r\n angle = acos(xy/m)*180/pi\r\n if angle < 90:\r\n pos=False\r\n break\r\n if not pos:break\r\n if pos:ans+=[i+1]\r\n print(len(ans))\r\n print(*ans)\r\n else:\r\n print(0)", "from math import acos,sqrt,pi\r\n\r\ndef norm(x):\r\n if x==0:\r\n return 0\r\n else:\r\n return sqrt(scalar(x,x))\r\n\r\ndef scalar(x,y):\r\n return sum([x[i]*y[i] for i in range(5)])\r\ndef vector(p,q):\r\n return ([ (q[i]-p[i]) for i in range(5) ])\r\n\r\nnumber=0\r\ngood_points=[]\r\n\r\nn=int(input())\r\nliste=[]\r\nfor _ in range(n):\r\n x=list(map(int,input().split(\" \")))\r\n liste.append(x)\r\n\r\nif n>11:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n bool=True\r\n for j in range(n):\r\n if j!=i:\r\n for k in range(n):\r\n if k!=j and k!=i:\r\n x=vector(liste[i],liste[j])\r\n y=vector(liste[i],liste[k])\r\n angle=acos(scalar(x,y)/norm(x)/norm(y))\r\n if angle<pi/2:\r\n bool=False\r\n if bool:\r\n good_points.append(i+1)\r\n number+=1\r\n if number>0:\r\n answer=str(number)+' '\r\n good_points.sort()\r\n for element in good_points:\r\n answer+='\\n'+str(element)\r\n print(answer)\r\n else:\r\n print(0)", "from math import acos, sqrt, degrees\n\n\nclass BadPoint(Exception):\n pass\n\n\ndef vect(point1, point2):\n return [p2 - p1 for p1, p2 in zip(point1, point2)]\n\n\ndef product(vect1, vect2):\n return sum([v1*v2 for v1, v2 in zip(vect1, vect2)])\n\n\ndef angle(vect1, vect2):\n return degrees(acos(product(vect1, vect2)/(sqrt(product(vect1, vect1))*sqrt(product(vect2, vect2)))))\n\nn = int(input())\npoints = []\nfor _ in range(n):\n points.append(list(map(int, input().split())))\n\nif n > 15:\n print(0)\n exit(0)\ncnt = []\nfor i in range(n):\n vectors = []\n for j in range(n):\n if i != j:\n vectors.append(vect(points[i], points[j]))\n try:\n for ii in range(len(vectors)):\n for jj in range(len(vectors)):\n if ii != jj:\n if angle(vectors[ii], vectors[jj]) < 90:\n raise BadPoint()\n except BadPoint:\n pass\n else:\n cnt.append(i)\n\nprint(len(cnt))\nprint(*sorted(map(lambda x: x+1, cnt)), sep='\\n')\n\n", "from sys import exit\r\n\r\nn = int(input())\r\nP = []\r\n\r\nif n >= 38:\r\n print(\"0\")\r\n exit()\r\n\r\nfor i in range(n):\r\n tmp = input().split()\r\n tmp = [int(k) for k in tmp]\r\n P.append(tuple(tmp))\r\n\r\nisGood = [True for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(j):\r\n dp = 0\r\n for d in range(5):\r\n dp += (P[j][d] - P[i][d])*(P[k][d] - P[i][d])\r\n if dp > 0:\r\n isGood[i] = False\r\n\r\nprint(isGood.count(True))\r\nfor i in range(n):\r\n if isGood[i]:\r\n print(i + 1)\r\n \r\n \r\n", "d = lambda i, j, k: sum((a - c) * (b - c) for a, b, c in zip(p[i], p[j], p[k]))*(i!=j)\r\nn = int(input())\r\nr = range(n)\r\np = [list(map(int, input().split())) for i in r]\r\nt = [k + 1 for k in r if all(d(i, j, k) <= 0 for i in r for j in r)] if n <12 else []\r\nprint(len(t))\r\nfor q in t: print(q)", "n = int(input())\nX = []\nfor i in range(n):\n U = list(map(int,input().split()))\n X.append(U)\ncnt = 0 \nans = []\nfor i in range(n):\n ok = True \n for j in range(n):\n for k in range(n):\n if i!=j and j!=k and k!=i:\n x = [X[i][l] - X[j][l] for l in range(5)]\n y = [X[i][l] - X[k][l] for l in range(5)]\n s = 0 \n for c in range(5):\n s += x[c]*y[c]\n if s>0:\n ok = False \n if ok == False:\n break \n if ok == False:\n break \n \n if ok == True:\n cnt +=1 \n ans.append(i)\n \n \nprint(cnt)\nfor c in ans:\n print(c+1)", "n=int(input())\nA=[]\njs=0\nB=[]\nfor i in range(n):\n A.append(list(map(int,input().split())))\n\ndef product(a,b,c):\n pr=0\n for m in range(5):\n pr=pr+(A[b][m]-A[a][m])*(A[c][m]-A[a][m])\n return (pr)\n\nif(n>11):\n print(0)\nelse:\n for j in range(n):\n k=0\n l=0\n flag=0\n while(k<n):\n l=k+1\n while(l<n):\n pro=product(j,k,l)\n if(l!=j and k!=j and pro>0):\n flag=1\n break\n else:\n l=l+1\n if(flag==1):\n break\n else:\n k=k+1\n if(k==n):\n js=js+1\n B.append(j+1)\n print(js)\n for f in range(js):\n print(B[f])\n \t \t \t\t \t \t\t \t \t\t \t", "n = int(input())\r\np = []\r\nans = []\r\nfor _ in range(n):\r\n p.append(list(map(int, input().split())))\r\n\r\nif n > 100:\r\n print(0)\r\n exit(0)\r\n\r\nfor i in range(0, n):\r\n good = True\r\n for j in range(0, n):\r\n for k in range(j + 1, n):\r\n if i == j or i == k: continue;\r\n dp = 0\r\n for l in range(5):\r\n dp += (p[j][l] - p[i][l]) * (p[k][l] - p[i][l]);\r\n if dp > 0: good = False;\r\n if good: ans.append(i)\r\n\r\nprint(len(ans))\r\nout = \"\"\r\nfor e in ans:\r\n out += str(e + 1) + \" \"\r\nprint(out)\r\n", "n=int(input())\r\np=[]\r\nanswer=[]\r\n\r\nfor j in range(n):\r\n p.append(list(map(int, input().split())))\r\n\r\ndef g(i):\r\n for j in range(n):\r\n for k in range(j+1, n):\r\n if i==j or i==k:\r\n continue;\r\n if sum((p[j][l] - p[i][l]) * (p[k][l] - p[i][l]) for l in range(5)) > 0:\r\n return ;\r\n answer.append(i+1)\r\n \r\nfor i in range(n):\r\n g(i)\r\n\r\nprint(len(answer))\r\nprint(*answer)\r\n", "n = int(input());\r\n\r\na = [];\r\nused = [0 for i in range(n)];\r\n\r\ndef judge(s1, s2, s3):\r\n sum = 0;\r\n for i in range(5):\r\n sum += (a[s1][i] - a[s3][i]) * (a[s2][i] - a[s3][i]);\r\n\r\n if sum <= 0:\r\n return 1;\r\n else:\r\n return 0;\r\n\r\nfor i in range(n):\r\n\tb = [int (x) for x in input().split(' ')];\r\n\ta.append(b);\r\n\r\nif n <= 100:\r\n\tnum = 0;\r\n\tflag = 0;\r\n\tfor i in range(n):\r\n\t\tflag = 0;\r\n\t\tfor j in range(n):\r\n\t\t\tif i == j:\r\n\t\t\t\tcontinue;\r\n\t\t\tfor k in range(j+1, n):\r\n\t\t\t\tif judge(k, j, i) == 0:\r\n\t\t\t\t\tflag = 1;\r\n\t\tif flag == 0:\r\n\t\t\tused[i] = 1;\r\n\t\t\tnum += 1;\r\n\r\n\tprint(num, '\\n');\r\n\tfor i in range(n):\r\n\t if (used[i] == 1):\r\n\t print(i+1, ' ');\r\nelse:\r\n\tprint(\"0\");\t \r\n", "class PV: #Point or Vector\r\n def __init__(self,L):\r\n self.x = L\r\n\r\n def __mul__(self,o): #inner product of vector\r\n return sum([self.x[i]*o.x[i] for i in range(len(self.x))])\r\n\r\n def __sub__(self,o): #vector = point - point\r\n return PV([self.x[i]-o.x[i] for i in range(len(self.x))])\r\n\r\nn = int(input())\r\nP = [PV(list(map(int,input().split()))) for _ in range(n)]\r\nG = []\r\nfor i in range(n):\r\n good = True\r\n for j in range(n):\r\n if j==i: continue\r\n v1 = P[j]-P[i]\r\n for k in range(n):\r\n if k==i or k==j: continue\r\n v2 = P[k]-P[i]\r\n if v1*v2>0:\r\n good = False\r\n break\r\n if not good:\r\n break\r\n if good: G.append(i+1)\r\nprint(len(G))\r\n[print(i) for i in G]\r\n\r\n\r\n", "n = int(input())\r\npoints = []\r\nfor p in range(n):\r\n\tpoints.append(list(map(int, input().split())))\r\n\r\ndef dot(x, y):\r\n\tres = 0\r\n\tfor a, b in zip(x, y):\r\n\t\tres += a*b\r\n\treturn res\r\n\r\ndef minus(x, y):\r\n\tres = []\r\n\tfor a, b in zip(x, y):\r\n\t\tres.append(a-b)\r\n\treturn res\r\n\r\nindices = set(range(n))\r\nif n <= 50:\r\n\tfor x in range(n):\r\n\t\tfor y in range(n):\r\n\t\t\tif x != y:\r\n\t\t\t\tfor z in range(n):\r\n\t\t\t\t\tif z != y and z != x:\r\n\r\n\t\t\t\t\t\tif dot(minus(points[y], points[x]), minus(points[z], points[x])) > 0:\r\n\t\t\t\t\t\t\tindices.discard(x)\r\n#\t\t\t\t\t\t\tindices.discard(z)\r\n\tprint(len(indices))\r\n\tfor i in sorted(indices):\r\n\t\tprint(i+1)\t\t\t\t\t\t\r\nelse:\r\n\tprint(0)\r\n", "def check(a, b, c):\r\n s = 0\r\n for i in range(5):\r\n s += (b[i] - a[i]) * (c[i] - a[i])\r\n return s <= 0\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nif n == 1 or n == 2:\r\n print(n)\r\n print(1)\r\n if n == 2:\r\n print(2)\r\n exit()\r\n\r\nv = -1\r\ni = 0\r\nwhile i + 1 < n:\r\n if v == -1:\r\n if i + 2 < n:\r\n if check(a[i], a[i + 1], a[i + 2]):\r\n v = i\r\n elif check(a[i + 1], a[i], a[i + 2]):\r\n v = i + 1\r\n elif check(a[i + 2], a[i], a[i + 1]):\r\n v = i + 2\r\n else:\r\n break\r\n else:\r\n if not check(a[v], a[i], a[i + 1]):\r\n if check(a[i], a[v], a[i + 1]):\r\n v = i\r\n elif check(a[i + 1], a[v], a[i]):\r\n v = i + 1\r\n else:\r\n v = -1\r\n i += 1\r\n\r\nif v == -1:\r\n print(0)\r\n exit()\r\n\r\nfor i in range(n):\r\n if i == v:\r\n continue\r\n for j in range(i + 1, n):\r\n if j == v:\r\n continue\r\n if not check(a[v], a[i], a[j]):\r\n print(0)\r\n exit()\r\n\r\nprint(1)\r\nprint(v + 1)\r\nexit()\r\n", "n = int(input())\nif n > 20:\n print(0)\nelse:\n s = []\n for i in range(n):\n s.append([int(i) for i in input().split()])\n p = []\n for i in range(n):\n p.append(0)\n for j in range(n):\n for l in range(j):\n b = 0\n for k in range(5):\n b += (s[i][k]-s[j][k])*(s[i][k]-s[l][k])\n if b > 0:\n p[-1] += 1\n u = 0\n ans = []\n for i in range(n):\n if p[i]==0:\n u+=1\n ans.append(i+1)\n print(u)\n for i in ans:\n print(i)", "from sys import stdin, stdout\nfrom math import hypot\nimport random\nimport itertools\nfrom functools import reduce\nimport operator\n\nreduce(operator.mul, (3, 4, 5), 1)\n\ndef isAcute(x,y):\n return sum([i*j for (i, j) in zip(x,y)])\n\nn = int(stdin.readline().rstrip())\npointList = [(0,0,0,0,0)]*n\nfor i in range(n):\n a,b,c,d,e = map(int,stdin.readline().rstrip().split())\n pointList[i] = (a,b,c,d,e)\n\nnotConsidered = set(range(n))\nisGood = set()\n\nwhile len(notConsidered)>0:\n i = random.sample(notConsidered,1)[0]\n x = pointList[i]\n for j,k in itertools.combinations(range(n),2):\n if j==i or k==i:\n continue\n y = pointList[j]\n z = pointList[k]\n xy = [n-m for (n, m) in zip(y,x)]\n yz = [n-m for (n, m) in zip(z,y)]\n xz = [n-m for (n, m) in zip(z,x)]\n if isAcute(yz,xz)>0:\n notConsidered.discard(k)\n if isAcute(xy,yz)<0:\n notConsidered.discard(j)\n if isAcute(xy,xz)>0:\n notConsidered.discard(i)\n break\n if i in notConsidered:\n isGood.add(i)\n notConsidered.discard(i)\n\nisGood = list(sorted(list(isGood)))\nprint(len(isGood))\nfor x in isGood:\n print(x+1)\n \n" ]

[ "import sys\nlines = sys.stdin.readlines()\nn = int(lines[0].strip())\nquery = []\nfor i in range(1, n+1):\n (a, b, c) = lines[i].strip().split(\" \")\n query.append((a, int(b), int(c)))\ndef compare(i):\n digits = str(i)\n digits = \"0\" *(4-len(digits)) + digits\n if len(set(list(digits))) != 4: return False\n for q in query:\n (a, b, c) = q\n m, n = 0, 0\n for i in range(4):\n if a[i] == digits[i]: m += 1\n for l in a:\n if l in digits: n += 1\n n -= m\n if m != b or n != c:\n return False\n return True\nres = 0\ncount = 0\nfor i in range(123, 9877):\n if compare(i): count += 1; res = i\n if count >= 2: break\nif count == 0: print(\"Incorrect data\")\nelif count == 1:\n digits = str(res)\n digits = \"0\" *(4-len(digits)) + digits\n print(digits)\nelse: print(\"Need more data\")\n", "def filter(candidates, num, rp, wp):\r\n ans = []\r\n for cand in candidates:\r\n crp = cwp = 0\r\n for a, b in zip(cand, num):\r\n if a == b:\r\n crp += 1\r\n elif a in num:\r\n cwp += 1\r\n\r\n if crp == rp and cwp == wp:\r\n ans.append(cand)\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n candidates = []\r\n for i in range(123, 9877):\r\n num = str(i).zfill(4)\r\n if len(set(num)) == 4:\r\n candidates.append(num)\r\n\r\n for _ in range(n):\r\n a, b, c = input().split()\r\n candidates = filter(candidates, a, int(b), int(c))\r\n if not candidates:\r\n print('Incorrect data')\r\n return\r\n\r\n print(candidates[0] if len(candidates) == 1 else 'Need more data')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v=['%04d'%t for t in range(9876)if len(set('%04d'%t))==4]\r\nfor _ in range(int(input())):\r\n\ta,b,c=input().split()\r\n\tb=int(b)\r\n\tc=int(c)\r\n\tv=[u for u in v if len(set(u)&set(a))==b+c and sum(u[i]==a[i]for i in range(4))==b]\r\nprint(v[0]if len(v)==1 else['Incorrect data','Need more data'][len(v)>0])", "#! /usr/bin/python3\nimport sys\nimport pprint\n\ndef main():\n input_list = []\n for line in sys.stdin:\n input_list.append(line.rstrip(\"\\n\"))\n \"\"\"\n # DEBUG\n if line.rstrip(\"\\n\") == \"exit\":\n break\n \"\"\"\n possible_nums = [\"{0:04}\".format(i) for i in range(123, 10000)] # List of all possible 4 digit numbers as strings form \"0123\" to \"9999\"\n\n for i in range(int(input_list[0])):\n check_list = input_list[i + 1].split(\" \")\n possible_nums = filter(possible_nums, check_list[0], check_list[1], check_list[2])\n \"\"\"\n # DEBUG\n print(possible_nums)\n \"\"\"\n if len(possible_nums) == 0:\n print(\"Incorrect data\")\n elif len(possible_nums) == 1:\n print(possible_nums[0])\n else:\n print(\"Need more data\")\n \ndef check_cow(input_num, check_num, cow):\n cow_num = 0\n union_set = set(ordered_union(list(input_num), list(check_num))) # Set of Strings\n cow_num = len((set(input_num) - union_set).intersection(set(check_num) - union_set))\n\n return cow_num == cow\n\ndef check_bull(input_num, check_num, bull):\n bull_num = 0\n bull_num = len(ordered_union(list(input_num), list(check_num)))\n\n return bull_num == bull\n\ndef filter(possible_nums, input_num, bull, cow):\n filtered_list = []\n\n for num in possible_nums:\n if check_cow(input_num, num, int(cow)) and check_bull(input_num, num, int(bull)) and not has_repeat(num):\n filtered_list.append(num)\n\n return filtered_list\n\ndef ordered_union(list1, list2):\n union_list = []\n\n for i in range(len(list1)):\n if list1[i] == list2[i]:\n union_list.append(list1[i])\n return union_list\n\ndef has_repeat(num):\n return len(set(num)) != len(num)\n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\n\r\ndef tolist(i):\r\n listx = list()\r\n while i > 0:\r\n listx.append(i % 10)\r\n i //= 10\r\n while len(listx) < 4: listx.append(0)\r\n return listx[::-1]\r\n\r\ndef diff(i):\r\n count = [0] * 10\r\n for x in range(4):\r\n count[i % 10] += 1\r\n i //= 10\r\n for val in count:\r\n if val > 1: return False\r\n return True\r\n\r\nn, = map(int, input().split())\r\nworks = 0\r\nlastworks = -1\r\nguesses = list()\r\nfor i in range(n):\r\n a, b, c, = map(int, input().split())\r\n acopy = a\r\n charcount = [0] * 10\r\n for x in range(4):\r\n charcount[acopy % 10] += 1\r\n acopy //= 10\r\n guesses.append((tolist(a), b, c, charcount))\r\n\r\nfor i in range(1, 10000):\r\n if diff(i):\r\n l = tolist(i)\r\n icopy = i\r\n charcount = [0] * 10\r\n for x in range(4):\r\n charcount[icopy % 10] += 1\r\n icopy //= 10\r\n count = 0\r\n for guess in guesses:\r\n bulls, cows = 0, 0\r\n for j in range(4):\r\n if l[j] == guess[0][j]: bulls += 1\r\n for j in range(10):\r\n if charcount[j] > 0 and guess[3][j] > 0: cows+=1\r\n cows -= bulls\r\n if bulls == guess[1] and cows == guess[2]:\r\n count += 1\r\n if count == n:\r\n works += 1\r\n lastworks = l\r\nif works == 0:\r\n print(\"Incorrect data\")\r\nelif works == 1:\r\n print(''.join(map(str, lastworks)))\r\nelse:\r\n print(\"Need more data\")\r\n", "import collections\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\n\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 option=[0]*123+[1]*(9754)\n for i in range(123,len(option)):\n tmp=f'{i:04d}'\n if len(set(tmp))!=4:option[i]=0\n for _ in range(inp()):\n num,b,c=input().split()\n b=int(b);c=int(c)\n for i in range(123,len(option)):\n if option[i]==1:\n tmp=f'{i:04d}'\n m= len(set(tmp)& set(num))\n o=sum([h==k for h,k in zip(num,tmp) ])\n if m-o!=c or o!=b:option[i]=0\n \n if sum((option))==0:return 'Incorrect data'\n elif sum((option))>1: return 'Need more data'\n else:return f'{option.index(1):04d}'\n\n\n\nif __name__ == \"__main__\":\n # for i in range(inp()):\n print(solve())\n", "import itertools\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = [list(input().rstrip().split()) for _ in range(n)]\r\na, b, c = [], [], []\r\nfor i in range(n):\r\n a.append(list(x[i][0]))\r\n b.append(int(x[i][1]))\r\n c.append(int(x[i][2]))\r\nans = \"Incorrect data\"\r\nfor p in itertools.permutations(list(\"0123456789\"), 4):\r\n ok = 1\r\n for i in range(n):\r\n ai = a[i]\r\n d = [0] * 2\r\n for j in range(4):\r\n aij = ai[j]\r\n for k in range(4):\r\n if aij == p[k]:\r\n d[min(1, j ^ k)] += 1\r\n if b[i] ^ d[0] or c[i] ^ d[1]:\r\n ok = 0\r\n break\r\n if not ok:\r\n continue\r\n if not ans == \"Incorrect data\":\r\n ans = \"Need more data\"\r\n break\r\n ans = \"\".join(p)\r\nprint(ans)", "from itertools import permutations\r\n\r\na, result = [], []\r\n\r\nfor _ in range(int(input())):\r\n s, bull, cow = input().split()\r\n a.append([[int(i) for i in s], int(bull), int(cow)])\r\n \r\nfor c in permutations([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], 4):\r\n ok = True\r\n for trying in a:\r\n bull, cow = 0, 0\r\n for i in range(4):\r\n x = c[i]\r\n if trying[0].count(x) == 1:\r\n if x == trying[0][i]:\r\n bull += 1\r\n else:\r\n cow += 1\r\n if bull != trying[1] or cow != trying[2]:\r\n ok = False\r\n break\r\n if ok:\r\n result.append(c)\r\n\r\nl = len(result)\r\nif l == 0:\r\n print('Incorrect data')\r\nelif l == 1:\r\n print(''.join(map(str, result[0])))\r\nelse:\r\n print('Need more data')", "from itertools import *\nimport string\n\nn = int(input())\nA = [[j for j in input().split()] for i in range(n)]\nfor i in range(n):\n for j in range(1,3):\n A[i][j] = int(A[i][j])\nchecker = [False for i in range(n)]\nans = ''\n\ndef process(x):\n global ans\n num_satis=0\n for i in range(n):\n exact = 0\n x_list = list(x)\n target = list(A[i][0])\n for j in range(3,-1,-1):\n if target[j]==x_list[j]:\n exact += 1\n del target[j]\n del x_list[j]\n count_inter = len(set(target).intersection(set(x_list))) # intersect\n if exact == A[i][1] and count_inter == A[i][2]: \n num_satis+=1\n if num_satis == n:\n ans = x\n return 1\n else:\n return 0\n\ncounter = 0\nfor i in permutations(string.digits, 4):\n counter += process(''.join(i))\n if counter > 1:\n print('Need more data')\n break\nelse:\n if counter == 1: \n print(ans)\n else: \n print('Incorrect data')\n \t \t\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t \t", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import product\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\ncand = set()\r\n\r\nfor i, (a, b, c) in enumerate(input().split() for _ in range(n)):\r\n a = list(map(int, a))\r\n b, c = int(b), int(c)\r\n s = set()\r\n\r\n for p in product(range(10), repeat=4):\r\n if len(set(p)) < 4:\r\n continue\r\n b_, c_ = 0, 0\r\n for j in range(4):\r\n if p[j] == a[j]:\r\n b_ += 1\r\n elif p[j] in a:\r\n c_ += 1\r\n if b == b_ and c == c_:\r\n s.add(''.join(map(str, p)))\r\n\r\n if i == 0:\r\n cand = s\r\n else:\r\n cand &= s\r\n\r\nif len(cand) == 1:\r\n print(cand.pop())\r\nelif len(cand) > 1:\r\n print('Need more data')\r\nelif not cand:\r\n print('Incorrect data')\r\nelse:\r\n assert False\r\n", "# https://codeforces.com/problemset/problem/63/C\r\n\r\nnumbers = []\r\n\r\ndef init():\r\n global numbers\r\n for i in range(10):\r\n for j in range(10):\r\n for k in range(10):\r\n for l in range(10):\r\n if i != j and i != k and i != l and j != k and j != l and k != l:\r\n number_str = str(i) + str(j) + str(k) + str(l)\r\n numbers.append(number_str)\r\n\r\ndef reduce_numbers(a: str, b: int, c: int):\r\n global numbers\r\n removed_numbers = []\r\n\r\n for number in numbers:\r\n same_digits = 0\r\n for i in range(10):\r\n if str(i) in number and str(i) in a:\r\n same_digits += 1\r\n \r\n bulls = 0\r\n for i in range(4):\r\n if number[i] == a[i]:\r\n bulls += 1\r\n \r\n cows = same_digits - bulls\r\n\r\n if bulls != b or cows != c:\r\n removed_numbers.append(number)\r\n\r\n for number in removed_numbers:\r\n numbers.remove(number)\r\n\r\nif __name__ == '__main__':\r\n init()\r\n n = int(input())\r\n for _ in range(n):\r\n a, b, c = input().split()\r\n b = int(b)\r\n c = int(c)\r\n reduce_numbers(a, b, c)\r\n \r\n remain_numbers = len(numbers)\r\n if remain_numbers == 0:\r\n print('Incorrect data')\r\n elif remain_numbers == 1:\r\n print(numbers[0])\r\n else:\r\n print('Need more data')", "'''input\n8\n7954 0 1\n5638 0 1\n8204 0 2\n8293 1 1\n3598 0 1\n0894 0 1\n6324 1 2\n0572 0 1\n'''\nfrom sys import stdin, setrecursionlimit\nimport math\nfrom collections import defaultdict, deque\nimport time\nfrom itertools import combinations, permutations\nfrom copy import deepcopy\n\nsetrecursionlimit(15000)\n\n\ndef take_intersection():\n\tpass\n\ndef discover_digits(guess):\n\tmyset = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}\n\tflag = 0\n\tcount = 0\n\tfinal = []\n\tcomb = permutations(myset, 4)\n\tfor i in comb:\n\t\tans = get_answer(guess, list(i))\n\t\tif len(ans) == 4:\n\t\t\tcount += 1\n\t\t\tfinal.append(ans)\n\t\t\tflag = 1\n\n\tif count == 1:\n\t\tfor i in final[0]:\n\t\t\tprint(i, end = '')\n\telif count > 1:\n\t\tprint(\"Need more data\")\n\tif flag == 0:\n\t\tprint(\"Incorrect data\")\n\n\ndef check(arr, guess, index):\n\tfirst = 0\n\ttotal = 0\n\tsecond = 0\n\tfor i in range(4):\n\t\tif arr[i] == int(guess[index][0][i]):\n\t\t\tfirst += 1\n\t\tif str(arr[i]) in guess[index][0]:\n\t\t\ttotal += 1\n\tsecond = total - first\n\tif first == int(guess[index][1]) and second == int(guess[index][2]):\n\t\treturn True\n\telse:\n\t\treturn False\n\n\ndef get_answer(guess, answer):\n\tflag = 0\n\tans = []\n\tfor j in range(len(guess)):\n\t\tnum = guess[j][0]\n\t\tif check(answer, guess, j):\n\t\t\tpass\n\t\telse:\n\t\t\tbreak\n\telse:\n\t\tans = answer\n\n\treturn ans\n\n\n# main starts\nn = int(stdin.readline().strip())\nguess = []\nfor _ in range(n):\n\tguess.append(list(map(str, stdin.readline().split())))\n\n\n# getting ready final list\nfinal = []\nbase = set()\ndiscover_digits(guess)\n", "\r\ndef verify(guess, give, b, c):\r\n bl=0\r\n pk = set(list(give))\r\n bc=0\r\n for i in range(4):\r\n bl += (guess[i] == give[i])\r\n bc += (guess[i] in pk and guess[i] != give[i])\r\n return bl==b and bc==c\r\n \r\n\r\n\r\nn = int(input())\r\ndata = [ list(input().split()) for i in range(n)]\r\nspace = []\r\nfor i in range(100, 10000):\r\n ni = str(i)\r\n if i < 1000:\r\n ni = \"0\"+ni\r\n if len(set(list(ni))) == len(ni):\r\n space.append(ni)\r\nspace.insert(0, '1243')\r\nfor num, bull, cow in data:\r\n prob = []\r\n for guess in space:\r\n if verify(guess, num, int(bull), int(cow)):\r\n prob.append(guess)\r\n space = prob.copy()\r\nif len(space) == 1:\r\n print(space[0])\r\nelif len(space) > 0:\r\n print(\"Need more data\")\r\nelse:\r\n print(\"Incorrect data\")", "def func(x):\r\n for a,p,q in matx:\r\n\r\n for i in range(4):\r\n\r\n if a[i]==x[i]:\r\n p-=1\r\n elif a[i] in x:\r\n q-=1\r\n if p!=0 or q!=0:\r\n return 0\r\n return 1\r\nn=int(input())\r\nmatx=[]\r\n\r\nfor _ in range(n):\r\n x,y,z=input().split()\r\n xx=([int(p) for p in list(x)],int(y),int(z))\r\n\r\n matx.append(xx)\r\ntt,an=0,0\r\nfor i in range(100,10000):\r\n x=[int(p) for p in list(str(i))]\r\n if len(x)!=4:\r\n\r\n x=[0]+x\r\n if len(x)==len(set(x)) and func(x):\r\n tt=x\r\n an+=1\r\nif an>1:\r\n print(\"Need more data\")\r\nelif an==0:\r\n\r\n\r\n print(\"Incorrect data\")\r\nelse:\r\n print(''.join([str(i) for i in tt]))" ]

[ "n=int(input())\r\na=sorted(map(int,input().split()))\r\nb,c=0,-1\r\nfor i in a:\r\n b+=i\r\n if i%2==1 and c==-1:\r\n c=i\r\nif b%2:\r\n print(b)\r\nelse:\r\n print(0 if c==-1 else b-c)", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\na = invr()\r\n\r\nodd = []\r\neven = []\r\na = sorted(a)\r\no = 0\r\ne = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even.append(a[i])\r\n e += 1\r\n else:\r\n odd.append(a[i])\r\n o += 1\r\n\r\n\r\ntotal = sum(even)\r\nif o > 0:\r\n if o % 2 != 0:\r\n total += sum(odd)\r\n else:\r\n total += sum(odd[1:])\r\nelse:\r\n total = 0\r\nprint(total)\r\n", "# cook your dish here\r\nimport sys\r\nn=int(input())\r\ns=input().split()\r\neven=[]\r\nodd=[]\r\nfor i in s:\r\n if int(i)%2==0:\r\n even.append(int(i))\r\n else:\r\n odd.append(int(i))\r\neven.sort(reverse=True)\r\nodd.sort(reverse=True)\r\nsum=0\r\nif len(odd)==0:\r\n print(0)\r\n sys.exit()\r\nfor i in odd:\r\n sum+=i\r\nif len(odd)%2==0:\r\n sum-=odd[len(odd)-1]\r\nfor i in even:\r\n sum+=i\r\nprint(sum)\r\n ", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nminn = min([i for i in a if i % 2 == 1]) if [i for i in a if i % 2 == 1] else 0\r\nif minn:\r\n print(sum(a) if sum(a) % 2 == 1 else sum(a) - minn)\r\nelse:\r\n print(0)\r\n\r\n", "n = int(input())\r\nlof = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor a in lof:\r\n if a%2 == 0:\r\n even.append(a)\r\n else:\r\n odd.append(a)\r\nif sum(lof)%2 != 0:\r\n f = sum(lof)\r\nelif sum(lof)%2 == 0 and len(odd) != 0:\r\n f = sum(lof) - min(odd)\r\nelif len(odd) == 0:\r\n f = 0\r\n \r\ndef ans():\r\n if f%2 == 0:\r\n print(0)\r\n else:\r\n print(f)\r\nans()", "n = int(input())\r\nl = list(map(int,input().split())) \r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n even.append(l[i])\r\n else:\r\n odd.append(l[i]) \r\n\r\nodd.sort() \r\n\r\nif(len(odd)%2!=0):\r\n print(sum(l)) \r\nelse:\r\n if(len(odd)==0):\r\n print(0) \r\n else:\r\n print(sum(l) -odd[0])", "n = int(input())\r\nflowerArray = list(map(int, input().split()))\r\n#check the sum of petals if it's odd then ans is sum becuase loves start every time first so if the sum is odd that means the loves count is maximum\r\ntotalPetals = sum(flowerArray)\r\nif totalPetals & 1 == 1:\r\n print(totalPetals)\r\nelse:\r\n arrayOddpetals = []\r\n for i in flowerArray:\r\n if i & 1 == 1:\r\n arrayOddpetals.append(i)\r\n if arrayOddpetals:\r\n print(totalPetals - min(arrayOddpetals))\r\n else:\r\n print(0)", "import math\r\nimport sys\r\nfrom collections import defaultdict,Counter,deque\r\nimport bisect\r\n#sys.setrecursionlimit(1000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\n#def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#INF = 10 ** 18\r\n#MOD = 1000000000 + 7\r\nfrom itertools import accumulate,groupby\r\ndp = []\r\n\r\nN = int(input())\r\nA = alele()\r\nx = sum(A)\r\nif x%2 !=0:\r\n print(x)\r\nelse:\r\n mini = 101\r\n for i in A:\r\n if i%2 != 0:\r\n mini = min(mini,i)\r\n if mini == 101:\r\n print(0)\r\n else:\r\n print(x-mini)", "n=int(input())\r\nsum=0\r\nmn=105\r\nl=map(int,input().split())\r\nfor x in l:\r\n\tsum=sum+x\r\n\tif x%2==1:\r\n\t\tmn=min(mn,x)\r\nif sum%2==0:\r\n\tif mn==105:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(sum-mn)\r\nelse:\r\n\tprint(sum)", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = sum(arr)\r\nif s&1:\r\n print(s)\r\nelse:\r\n a = -1\r\n for e in arr:\r\n if e&1:\r\n a = e \r\n break\r\n if a==-1:\r\n print(0)\r\n else:\r\n for e in arr:\r\n if e&1:\r\n a = min(a,e)\r\n print(s-a) ", "n, a = int(input()), list(map(int, input().split()))\ns, o = sum(a), [x for x in a if x % 2]\nif s % 2:\n print(s)\nelif o:\n print(s - min(o))\nelse:\n print(0)\n", "# LUOGU_RID: 113214771\ndef main():\r\n n=int(input())\r\n a=input().split()\r\n for i in range(n):\r\n a[i]=int(a[i])\r\n s=sum(a)\r\n a.sort(reverse=True)\r\n if s%2==1:\r\n print(s)\r\n return\r\n l=len(a)\r\n for i in range(l):\r\n if (s-min(a))%2==1:\r\n print(s-min(a))\r\n return\r\n else:\r\n a.pop()\r\n print(0)\r\nmain()", "dp={}\r\nmaxodd=0\r\ndef rec(idx1,idx2,lenev,lenodd,ctr):\r\n global maxodd\r\n if ctr%2==1:maxodd=max(maxodd,ctr)\r\n if (idx1,idx2) not in dp.keys():\r\n dp[(idx1,idx2)]=maxodd\r\n else:return\r\n if idx1<lenev:\r\n rec(idx1+1,idx2,lenev,lenodd,ctr+even[idx1])\r\n if idx2<lenodd:\r\n rec(idx1,idx2+1,lenev,lenodd,ctr+odd[idx2])\r\n return\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nodd,even=[],[]\r\nfor i in arr:\r\n if i%2==0:even.append(i)\r\n else:odd.append(i)\r\neven.sort(reverse=True)\r\nodd.sort(reverse=True)\r\nrec(0,0,len(even),len(odd),0)\r\nprint(maxodd)", "#from dust i have come dust i will be\n\nn=int(input())\na=list(map(int,input().split()))\n\no=[]\n\ncnt=0\nfor i in range(n):\n if a[i]%2==1:\n o.append(a[i])\n\n cnt+=a[i]\n\nif len(o)==0:\n print(0)\n exit(0)\n\no.sort(reverse=True)\n\nidx=len(o)-1\nwhile cnt>0 and len(o)>0:\n if cnt%2==0:\n cnt-=o[idx]\n idx-=1\n o.pop()\n\n else:\n break\n\nprint(cnt)\n\n \t\t \t\t\t\t \t \t \t \t \t \t\t \t \t", "n = int(input())\r\nsum_even = 0\r\nodd = []\r\n\r\nx = input()\r\nxlist = x.split(\" \")\r\n\r\nfor i in range(0, n):\r\n temp = int(xlist[i])\r\n if temp % 2 == 0:\r\n sum_even = sum_even + temp\r\n else:\r\n odd.append(temp)\r\n\r\nodd.sort()\r\nlength = len(odd)\r\n\r\nfor i in range(0, length):\r\n sum_even = sum_even + odd[i]\r\nif length == 0:\r\n print(0)\r\nelif length % 2 == 1:\r\n print(sum_even)\r\nelse:\r\n print(sum_even-odd[0])", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = sum(arr)\r\n\r\nif ans&1:\r\n print(ans)\r\nelse:\r\n temp = 1000\r\n for item in arr:\r\n if item&1 and item < temp:\r\n temp = item \r\n \r\n if temp == 1000:\r\n print(0)\r\n else:\r\n print(ans-temp)", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd = [i for i in a if i%2!=0]\r\neven = [i for i in a if i%2==0]\r\nif len(odd)==0:\r\n print(0)\r\nelse:\r\n s = sum(even)\r\n if len(odd)%2!=0:\r\n ans = s+sum(odd)\r\n else:\r\n ans = s+sum(odd)\r\n odd.sort()\r\n ans-=odd[0]\r\n print(ans)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nif sum(a) % 2 == 1:\r\n print(sum(a))\r\nelse:\r\n j = -1\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n j = i\r\n break\r\n if j == -1:\r\n print(0)\r\n else:\r\n print(sum(a) - a[j])", "n = int(input())\r\nminOdd = 100000;\r\nsuum = 0\r\ninp = input().split(' ')\r\nfor p in inp:\r\n p = int(p)\r\n if p % 2 == 1:\r\n minOdd = min(minOdd, p)\r\n suum += p\r\n\r\nif suum % 2 == 0:\r\n if minOdd == 100000:\r\n print(0)\r\n else:\r\n print(suum - minOdd)\r\nelse:\r\n print(suum)", "n = int(input())\n\na = list(map(int, input().split()))\nb = list(filter(lambda x: x % 2 == 0, a))\nc = list(filter(lambda x: x % 2 == 1, a))\nc.sort()\n\nif len(c) == 0:\n print(0)\nelif len(c) % 2 == 0:\n print(sum(a) - c[0])\nelse:\n print(sum(a))\n", "n=int(input())\r\nl=[int(i) for i in input().split()] \r\ns=sum(l)\r\nif s&1: \r\n print(s)\r\n exit()\r\nif all(i%2==0 for i in l):\r\n print(0)\r\n exit() \r\nm=min(i for i in l if i&1) \r\nprint(s-m)\r\n\r\n ", "# LUOGU_RID: 127435034\nn = int(input())\r\na = list(map(int, input().split()))\r\nsa = sum(a)\r\na.sort(reverse = True)\r\ndef main(a, sa):\r\n if sa % 2 == 1:\r\n print(sa)\r\n else:\r\n for i in range(len(a)):\r\n if (sa - min(a)) % 2 == 1:\r\n print(sa - min(a))\r\n return\r\n else:\r\n a.pop()\r\n print(0)\r\nmain(a, sa)", "def solve(n,d):\n odd = None\n for i in d:\n if i % 2 != 0:\n if not odd:\n odd = i\n odd = min(odd,i)\n \n total = 0\n for i in d:\n total += i\n if total % 2 != 0:\n return total\n if odd:\n return total - odd\n return 0\n\n\ndef main():\n # t = int(input())\n # for i in range(t):\n n = int(input())\n d = input()\n d = [int(i) for i in d.split()] \n ans = solve(n,d) \n print(ans) \n # for i in ans:\n # print(i,end = \"\")\n # print() \nmain()", "from sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; arr=list(map(int,input().split())) ; arr.sort(reverse=True) ; odds=0 ; ans=0 ; cond=False\r\nfor i in range(n):\r\n if arr[i]%2==1:\r\n odds+=1\r\nif odds%2==0:\r\n odds-=1\r\nif odds>0:\r\n cond=True\r\n\r\nfor i in range(n):\r\n if arr[i]%2==1:\r\n if odds>0:\r\n ans+=arr[i]\r\n odds-=1\r\n else:\r\n if cond:\r\n ans+=arr[i]\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor p in l:\r\n if p%2==0:\r\n e.append(p)\r\n else:\r\n o.append(p)\r\nans=sum(e)\r\no.sort()\r\nif len(o)%2==0:\r\n ans+=sum(o[1:])\r\nelse:\r\n ans+=sum(o)\r\nif ans%2==0:\r\n print(0)\r\nelse:\r\n print(ans)", "n=int(input())\r\nv=list(map(int,input().split()))\r\nb=99\r\na=s=0\r\nfor i in v:\r\n if(i%2==0):\r\n a+=1\r\n s+=i\r\n if(i%2==1 and i<b):\r\n b=i\r\nif(a==n):\r\n s=0\r\nelif n-a!=0 and (n-a)%2==0:\r\n s-=b\r\nprint(s)", "x=int(input())\r\nlist1=list(map(int,input().split()))\r\nlisteven=[]\r\nlistodd=[]\r\nfor i in list1:\r\n if i%2==0:\r\n listeven+=[i]\r\n else:\r\n listodd+=[i]\r\nlistodd.sort()\r\nif len(listodd)==0:\r\n print(0)\r\nelif len(listodd)%2==1:\r\n print(sum(listeven)+sum(listodd))\r\nelse:\r\n print(sum(listeven)+sum(listodd[1:]))", "# from sys import stdin,stdout\r\n# input = stdin.readli\r\n# from collections import Counter\r\n# import heapq\r\n# for _ in range(int(input())):\r\n# n,p=map(int,input().split())\r\nr=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns=sum(l)\r\nif s%2!=0:\r\n print(s)\r\nelse:\r\n ans=False\r\n for i in range(r):\r\n if l[i]%2!=0:\r\n s-=l[i]\r\n \r\n ans=True\r\n break\r\n if ans:\r\n print(s)\r\n else:\r\n print(0)\r\n", "import math\r\nnum=int(input())\r\ndata=list(map(int,input().split()))\r\nsumData=sum(data)\r\noddData=[i for i in data if i%2==1]\r\nif(sumData%2==0):\r\n if(len(oddData)==0):\r\n print(0)\r\n else:\r\n print(sumData-min(oddData))\r\nelse:\r\n print(sumData)\r\n \r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n odd = []\r\n even = []\r\n for a in A:\r\n if a % 2 == 0:\r\n even.append(a)\r\n else:\r\n odd.append(a)\r\n if len(odd) == 0:\r\n return 0\r\n odd.sort()\r\n if len(odd) % 2 == 0:\r\n return sum(odd[1:]) + sum(even)\r\n return sum(odd) + sum(even)\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n print(solve(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nsumma = sum(arr)\r\nif summa % 2 == 0:\r\n for i in arr:\r\n if i % 2 != 0:\r\n summa -= i\r\n break\r\nif summa % 2 == 0:\r\n print(0)\r\nelse:\r\n print(summa)\r\n", "n = int(input())\r\nw = sorted(map(int, input().split()))\r\n \r\nx = sum(w)\r\nif x % 2:\r\n print(x)\r\nelse:\r\n for i in w:\r\n if i % 2:\r\n print(x-i)\r\n break\r\n else:\r\n print(0)", "n=int(input())\r\ninp = list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor item in inp:\r\n if(item%2==0):\r\n even.append(item)\r\n else:\r\n odd.append(item)\r\nif(len(odd)==0):\r\n print (0)\r\nelse:\r\n if(len(odd)%2==1):\r\n print (sum(even)+sum(odd))\r\n elif(len(odd)%2==0):\r\n print (sum(even)+sum(odd)-min(odd))", "def solve(flowers):\r\n odd = []\r\n even = []\r\n\r\n for f in flowers:\r\n if f % 2 == 0:\r\n even.append(f)\r\n else:\r\n odd.append(f)\r\n\r\n if len(odd) == 0:\r\n return 0\r\n\r\n if len(odd) % 2 == 1:\r\n return sum(flowers)\r\n\r\n odd.sort(reverse=True)\r\n return sum(odd[:-1]) + sum(even)\r\n\r\n\r\n\r\ndef main():\r\n _ = input()\r\n flowers = [int(c) for c in input().split()]\r\n ans = solve(flowers)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# 59B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nn = read_int()\r\neven, odd = [], []\r\nfor x in read_int_ary():\r\n even.append(x) if x % 2 == 0 else odd.append(x)\r\n\r\ncount = 0\r\nodd_len = len(odd)\r\nif odd_len > 0:\r\n count = sum(even)\r\n if odd_len % 2 == 0:\r\n odd.sort()\r\n count += sum(odd[1:odd_len])\r\n else:\r\n count += sum(odd)\r\n\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = 200\r\nf = 0\r\nfor b in a:\r\n if b % 2 == 1:\r\n f += 1\r\n if (b < m):\r\n m = b\r\n\r\n\r\nif (f % 2 == 1):\r\n print(sum(a))\r\nelif (f == 0):\r\n print(0)\r\nelse:\r\n print(sum(a)-m)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nn1=[]\r\ns=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n s+=l[i]\r\n \r\n else:\r\n n1.append(l[i])\r\n\r\nif(len(n1)%2==0 and len(n1)>0):\r\n \r\n s+=sum(n1)-min(n1)\r\nelse:\r\n s+=sum(n1)\r\nif(len(n1)==0):\r\n s=0\r\n \r\nprint(s)", "n = int(input())\narr = list(map(int, input().split()))\narr.sort()\ntot = sum(arr)\nrem = 111\nfor x in arr:\n if x & 1:\n rem = min(x, rem)\n\nif tot & 1:\n print(tot)\nelif rem < 111:\n print(tot - rem)\nelse:\n print(0)\n\n\t\t\t\t\t\t \t \t\t\t \t \t \t \t\t\t \t\t\t", "n=int(input())\r\npetals=list(map(int,input().split()))\r\ntotalpetals=sum(petals)\r\nif totalpetals%2==0:\r\n for i in sorted(petals):\r\n if i%2!=0:\r\n totalpetals-=i\r\n break\r\nif totalpetals%2!=0:\r\n print(totalpetals,end=\"\\n\")\r\nelse:\r\n print(0,end=\"\\n\")", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nl=L()\no=[]\ne=[]\nfor i in l:\n if(i%2==0):\n e.append(i)\n else:\n o.append(i)\nx=0\nif(len(o)>0):\n x+=sum(e)\no.sort()\nif(len(o)%2==0):\n x+=sum(o[1::])\nelse:\n x+=sum(o)\nprint(x)\n \n", "# link: https://codeforces.com/problemset/problem/59/B\r\n\r\nimport sys\r\n\r\ndef solve(n, petals):\r\n if n == 1:\r\n if petals[0]%2 == 0:\r\n return 0\r\n else:\r\n return petals[0]\r\n even = []\r\n odd = []\r\n for i in range(n):\r\n if petals[i]%2 == 0:\r\n even.append(petals[i])\r\n else:\r\n odd.append(petals[i])\r\n odd.sort()\r\n even.sort()\r\n if not even:\r\n total = sum(odd)\r\n if total%2 == 1:\r\n return total\r\n for i in range(len(odd)):\r\n total -= odd[i]\r\n if total%2 == 1:\r\n return total\r\n elif not odd:\r\n return 0\r\n else:\r\n e = len(even)\r\n o = len(odd)\r\n total = sum(odd)\r\n if total%2 == 1:\r\n return total + sum(even)\r\n for i in range(o):\r\n total -= odd[i]\r\n if total%2 == 1:\r\n return total + sum(even) \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n i = sys.stdin.readline\r\n n = int(i())\r\n petals = tuple(map(int, i().split()))\r\n result = solve(n, petals)\r\n print(result)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nmini=1111\r\npetals=0\r\nfor i in range(n):\r\n petals+= x[i]\r\n if x[i]%2 != 0 and x[i] < mini:\r\n mini = x[i]\r\n \r\nif petals % 2 != 0 :\r\n print(petals)\r\nelif mini < 1111 :\r\n print(petals-mini)\r\nelse :\r\n print(0)\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\no=[]\r\n\r\ncnt=0\r\nfor i in range(n):\r\n if a[i]%2==1:\r\n o.append(a[i])\r\n\r\n cnt+=a[i]\r\n\r\nif len(o)==0:\r\n print(0)\r\n exit(0)\r\n\r\no.sort(reverse=True)\r\n\r\nidx=len(o)-1\r\nwhile cnt>0 and len(o)>0:\r\n if cnt%2==0:\r\n cnt-=o[idx]\r\n idx-=1\r\n o.pop()\r\n\r\n else:\r\n break\r\n\r\nprint(cnt)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nsu = sum(s)\r\nif su&1: print(su)\r\nelse:\r\n minOdd = su\r\n for i in s:\r\n if i&1: minOdd = min(minOdd, i)\r\n print(su-minOdd)\r\n", "n = int(input())\nA = list(map(int, input().split()))\n\nE = []\nO = []\nfor a in A:\n if a%2 == 0:\n E.append(a)\n else:\n O.append(a)\n\nif len(O) == 0:\n print(0)\n exit()\n\nans = 0\nO.sort(reverse=True)\nif len(O)%2 == 0:\n ans += sum(O[0:len(O)-1])\nelse:\n ans += sum(O)\nans += sum(E)\nprint(ans)\n", "d =int(input())\na=map(int,input().split())\nodd=[]\neven=[]\nfor i in list(a):\n if i%2==0:\n even.append(i)\n else:\n odd.append(i)\nif len(odd)==0:\n print(0)\nelif (len(odd)%2!=0):\n print(sum(odd)+sum(even))\nelse:\n print(sum(odd)+sum(even)-min(odd))\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\na=list(map(int,input().split()))\r\no=[i for i in a if i%2==1]\r\ne=[i for i in a if i%2==0]\r\nif len(o)==0:\r\n print(0)\r\nelse:\r\n if len(o)%2==0:\r\n o.sort()\r\n print(sum(a)-o[0])\r\n else:\r\n print(sum(a))", "r=range\r\ni=input\r\nn=int(i())\r\nl=list(map(int,i().split()))\r\nt,p=0,101\r\nfor _ in r(len(l)):\r\n t+=l[_]\r\n if(l[_]&1):\r\n p=min(p,l[_])\r\nif(0==t&1):\r\n if(p==101):\r\n t=0\r\n else:t-=p\r\nprint(t)", "def solution(arr,n):\r\n if n == 1 and arr[0]%2 == 1:\r\n return arr[0]\r\n elif(n == 1 and arr[0]%2 == 0):\r\n return 0\r\n else:\r\n sm = 0\r\n mnodd = float(\"inf\")\r\n flag = 0\r\n for i in range(n):\r\n sm += arr[i]\r\n if arr[i]%2 == 1:\r\n flag = 1\r\n mnodd = min(mnodd,arr[i])\r\n if sm %2 == 1:\r\n return sm\r\n elif sm%2 == 0 and flag == 0:\r\n return 0\r\n else:\r\n return sm - mnodd\r\n \r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nprint(solution(arr,n))\r\n", "from sys import stdin\r\ndef check(n):\r\n if n%2==0:\r\n return 0\r\n return 1\r\ndef find(l):\r\n e=[]\r\n o=[]\r\n for i in l:\r\n if check(i)==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\n if len(o)==0:\r\n return 0\r\n else:\r\n s=0\r\n if len(o)%2==0:\r\n while len(o)!=1:\r\n s+=max(o)\r\n o.remove(max(o))\r\n for i in e:\r\n s+=i\r\n else:\r\n for i in o:\r\n s+=i\r\n for i in e:\r\n s+=i\r\n return s\r\nn=int(stdin.readline().rstrip())\r\nl=list(map(int,stdin.readline().split()))\r\nk=find(l)\r\nprint(k)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nif s%2==1:\r\n print(s)\r\nelse:\r\n a = [i for i in a if i % 2]\r\n if len(a)>1:\r\n print(s-min(a))\r\n else:\r\n print(0)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nres = sum(l)\r\njil = []\r\nfor i in range(n):\r\n if l[i] % 2:\r\n jil.append(l[i])\r\njil.sort()\r\nif res % 2:\r\n print(res)\r\nelse:\r\n if len(jil):\r\n print(res - jil[0])\r\n else:\r\n print(0)", "n=int(input())\r\nl=list(map(int, input().split()))\r\neven=[]\r\nodd=[]\r\nfor x in l:\r\n if x%2==0:\r\n even.append(x)\r\n else:\r\n odd.append(x)\r\nodd.sort()\r\nif len(odd)==0:\r\n print(0)\r\nelse:\r\n if len(odd)%2==0:\r\n odd.pop(0)\r\n print(sum(even)+sum(odd))", "#Get the data in.\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsa = sum(a)\r\na.sort(reverse = True)\r\n\r\n#Creat an main function and it'll be easy to stop the program.\r\ndef main(a, sa):\r\n #Check the number especially there's only one.\r\n if sa % 2 == 1:\r\n print(sa)\r\n else:\r\n #Everytime, pop 1 number (the most unusual part, think twice).\r\n for i in range(len(a)):\r\n if (sa - min(a)) % 2 == 1:\r\n print(sa - min(a))\r\n return\r\n else:\r\n a.pop()\r\n #Be careful!\r\n print(0)\r\n\r\n#Call the function.\r\nmain(a, sa)\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nodd_numbers_list = []\r\neven_numbers_list = []\r\n\r\nfor petal in a:\r\n if petal % 2 == 0:\r\n even_numbers_list.append(petal)\r\n else:\r\n odd_numbers_list.append(petal)\r\n\r\nodd_numbers_list.sort(reverse=True)\r\neven_numbers_list.sort(reverse=True)\r\n\r\ns = sum(a)\r\nlargest_odd = max(odd_numbers_list) if odd_numbers_list else 0\r\nlargest_even = max(even_numbers_list) if even_numbers_list else 0\r\nlen1 = len(even_numbers_list)\r\nlen2 = len(odd_numbers_list)\r\nif n == 1:\r\n if largest_even > 0:\r\n print(0)\r\n else:\r\n print(largest_odd)\r\nelse:\r\n if s % 2 == 1:\r\n print(s)\r\n else:\r\n if (len1 !=0 and s - min(even_numbers_list)) % 2 == 1:\r\n print(s - min(even_numbers_list))\r\n elif (len1 == 0):\r\n print(s - min(odd_numbers_list))\r\n else:\r\n if ( len2 !=0 and s - min(odd_numbers_list)) % 2 == 1:\r\n print(s - min(odd_numbers_list))\r\n elif (len2 == 0):\r\n print(0)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nodd = []\r\nfor i in l:\r\n if i % 2: odd.append(i)\r\nif len(odd) == 0: print(0)\r\nelif len(odd) % 2: print(sum(l))\r\nelse: print(sum(l) - min(odd))", "input()\r\n\r\nnums = [[], []]\r\nfor a in input().split():\r\n nums[int(a) % 2].append(int(a))\r\n\r\nnums[0].sort()\r\nnums[1].sort()\r\n\r\nif len(nums[1]) == 0:\r\n print(0)\r\nelse:\r\n print(sum(nums[0]) + sum(nums[1][len(nums[1]) % 2 == 0:]))\r\n", "n = int(input())\r\nflo = sorted(list(map(int, input().split())))\r\n\r\nans = sum(flo)\r\n\r\nif ans % 2 == 0:\r\n\tfor a in flo:\r\n\t\tif a % 2 == 1:\r\n\t\t\tans -= a\r\n\t\t\tbreak\r\n\r\nif ans % 2 == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(ans)\r\n" ]

[ "import sys\r\n\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from collections import *\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from itertools import *\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# region dfsconvert\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n# endregion dfsconvert\r\n\r\n# MOD = 998_244_353\r\n# MOD = 10 ** 9 + 7\r\n# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL\r\n# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))\r\n\r\ndef solve() -> None:\r\n n = sint()\r\n nums = ints()\r\n \r\n left = [-1] * n\r\n right = [-1] * n\r\n \r\n stack = []\r\n for i in range(n):\r\n num = nums[i]\r\n idx = -1\r\n while len(stack) and nums[stack[-1]] >= num:\r\n new_idx = stack.pop()\r\n right[new_idx] = idx\r\n idx = new_idx\r\n if idx != -1: left[i] = idx\r\n stack.append(i)\r\n \r\n idx = -1\r\n root = stack[0]\r\n while len(stack):\r\n new_idx = stack.pop()\r\n right[new_idx] = idx\r\n idx = new_idx\r\n \r\n @bootstrap\r\n def dfs(root, curr, tot_left, tot_right):\r\n ans = 0\r\n if left[root] != -1:\r\n l = left[root]\r\n yield dfs(l, nums[root], tot_left, root - 1)\r\n ans += mem[l]\r\n if right[root] != -1:\r\n r = right[root]\r\n yield dfs(r, nums[root], root + 1, tot_right)\r\n ans += mem[r]\r\n mem[root] = min(ans + nums[root] - curr, tot_right - tot_left + 1)\r\n yield\r\n \r\n mem = [None] * n\r\n dfs(root, 0, 0, n - 1)\r\n print(mem[root])\r\n\r\nsolve()", "from sys import stdin\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nfrom types import GeneratorType\n\ndef bootstrap(f, stack=[]):\n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n\n return wrappedfunc\n\nfrom typing import List\nimport math\n\ndef Build_SparseTable (array : List[int], sparse_table : List[List[int]]) :\n\n rows = len(array)\n cols = len(sparse_table[0])\n\n # Fill base case values\n for r in range(rows) :\n sparse_table[r][0] = array[r]\n\n for c in range(1, cols+1) :\n _range = (1<<c)\n # For c Range c-1 Previous Range\n # 1 2^1 = 2 0 2^0 = 1\n # 2 2^2 = 4 1 2^1 = 2\n # 3 2^3 = 8 2 2^2 = 4\n # ...\n r = 0\n while (r + _range <= rows) :\n # Values in the current column are derived from the\n # values in the previous column.\n sparse_table[r][c] = min (sparse_table[r][c-1],\n sparse_table[r+(1<<(c-1))][c-1])\n r += 1\n\ndef RMQ (left : int, right : int, sparse_table : List[List[int]]) :\n\n # Find the biggest block of size 2^p that fits in the range (left) ... (right).\n\n power_of_2 = int (math.log2(right + 1 - left))\n x = right + 1 - (1 << power_of_2)\n\n if (sparse_table[left][power_of_2] <= sparse_table[right + 1 - ( 1 << power_of_2 )][power_of_2]) :\n return sparse_table[left][power_of_2]\n else :\n return sparse_table[right + 1 - ( 1 << power_of_2)][power_of_2]\n\nMULTIPLE_CASES = 0\n\ndef main():\n N = rd(int)\n A = rl(int)\n\n A2 = [[a,i] for i,a in enumerate(A)]\n\n s = math.ceil(math.log2(N))+1\n sparse_table = [[0]*s for i in range(N)]\n Build_SparseTable(A2,sparse_table)\n\n @bootstrap\n def solve(l,r,h):\n if r < l:\n yield 0\n else:\n m,mi = RMQ(l,r,sparse_table)\n yield min(r-l+1,m-h+(yield solve(l,mi-1,m))+(yield solve(mi+1,r,m)))\n\n print(solve(0,N-1,0))\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "import sys\r\nsys.setrecursionlimit(10**6)\r\ninput=sys.stdin.readline\r\ndef calc(l,r,val):\r\n if r<l:\r\n return 0\r\n idx=l+a[l:r+1].index( min(a[l:r+1]) )\r\n yoko=r-l+1\r\n cur=a[idx]-val+calc(l,idx-1,a[idx])+calc(idx+1,r,a[idx])\r\n return min(yoko,cur)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(calc(0,n-1,0))", "import sys\r\n\r\nsys.setrecursionlimit(10000)\r\n\r\nN = int(input())\r\ncerca = [int(x) for x in sys.stdin.readline().split()]\r\n\r\n\r\ndef Run(l, r, base):\r\n if l >= r:\r\n return 0\r\n #\r\n test = True\r\n for i in range(l,r):\r\n if (cerca[i] - base) > 0:\r\n test=False\r\n if test:\r\n return 0\r\n #\r\n minHigh = min(cerca[l:r]) - base\r\n\r\n if minHigh >= r-l:\r\n return r - l\r\n \r\n conteo = 0\r\n tempIzq = l\r\n tempDer = r\r\n\r\n while True:\r\n if tempIzq >= tempDer:\r\n return conteo\r\n\r\n HighL = cerca[tempIzq] - base\r\n HighR = cerca[tempDer - 1] - base\r\n Maxhigh = max(HighL,HighR)\r\n\r\n if Maxhigh < tempDer - tempIzq:\r\n break\r\n\r\n conteo += 1\r\n if Maxhigh == HighL:\r\n tempIzq +=1\r\n continue\r\n\r\n elif Maxhigh == HighR:\r\n tempDer -= 1\r\n \r\n Min = tempIzq\r\n \r\n for i in range(tempIzq, tempDer):\r\n if cerca[Min] > cerca[i]:\r\n Min=i\r\n tempArry=[]\r\n for i in range(tempIzq, tempDer):\r\n if cerca[i] == cerca[Min]:\r\n tempArry.append(i)\r\n Min = tempArry[len(tempArry)//2]\r\n\r\n return min(r - l,conteo + cerca[Min] - base + Run(tempIzq, Min, cerca[Min])\r\n + Run(Min + 1,tempDer,cerca[Min]))\r\n\r\n\r\nprint(Run(0, N, 0))", "def painting(lst):\r\n ln=len(lst)\r\n dp=[[ln+1]*(ln+1) for i in range(ln+1)]\r\n lst.append(ln)\r\n dp[0][0]=0\r\n for i in range(ln):\r\n j=0\r\n while j<=ln and j<=lst[i]:\r\n if j+1 <=ln and j+1<=lst[i]:\r\n dp[i][j+1]=min(dp[i][j+1], dp[i][j]+1)\r\n k=min(j,lst[i+1])\r\n tmp=0\r\n if j!=lst[i]:\r\n tmp=1\r\n dp[i+1][k]=min(dp[i+1][k], dp[i][j]+tmp)\r\n j+=1\r\n ans=ln\r\n i=0\r\n while i<=ln and i<=lst[ln-1]:\r\n ans=min(ans,dp[ln][i])\r\n i+=1\r\n return ans\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(painting(lst))\r\n" ]

[ "import sys\r\nfin = sys.stdin\r\nn = int(fin.readline())\r\nut = [-1] * n\r\nvc = [[] for i in range(0, n)]\r\ncvc = [[] for i in range(0, n)]\r\nnr = [0] * n\r\nfor i in range(0, n - 1):\r\n a, b = [int(number) for number in fin.readline().split()]\r\n a -= 1\r\n b -= 1\r\n vc[a].append(b)\r\n cvc[b].append(a)\r\n nr[a] += 1\r\nsize = [0] * n\r\nmx = [0] * n\r\ndef nonzero(x):\r\n if not x:\r\n return 0\r\n return 1\r\nstk = []\r\nsize = [0] * n\r\nfor i in range(0, n):\r\n if nr[i] == 0:\r\n stk.append(i)\r\n size[i] = 1\r\norder = []\r\nwhile nonzero(stk):\r\n x = stk.pop(-1)\r\n order.append(x)\r\n for p in cvc[x]:\r\n nr[p] -= 1\r\n if nr[p] == 0:\r\n stk.append(p)\r\nh = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n x = order[i]\r\n for p in vc[x]:\r\n h[p] = h[x] + 1\r\n#parcurg\r\nfor x in order:\r\n for p in vc[x]:\r\n size[x] += size[p]\r\n#maximum\r\ndef solv(tp, mx):\r\n for x in order:\r\n if h[x] % 2 == tp:\r\n r = 999999999\r\n for p in vc[x]:\r\n r = min(r, size[p] - mx[p] + 1)\r\n if r == 999999999:\r\n r = 1\r\n mx[x] = r\r\n else:\r\n r = 0\r\n for p in vc[x]:\r\n r += size[p] - mx[p]\r\n mx[x] = r + 1\r\nsolv(0, mx)\r\nprint(size[0] - mx[0] + 1, end = ' ')\r\nsolv(1, mx)\r\nprint(size[0] - mx[0] + 1)\r\n" ]

[ "n, m, k = map(int, input().split())\r\nmod = 1000000007\r\n\r\nans = pow(m, n, mod) if k == 1 or k > n else (\r\n pow(m, (n + 1) >> 1, mod) if k == n else (m * m if k & 1 else m))\r\n\r\nprint(ans)\r\n", "n, m, k = input().split(' ')\nn = int(n)\nm = int(m)\nk = int(k)\nif k > n:\n\tprint(pow(m, n, 1000000007))\nelif k == n:\n\tif n & 1:\n\t\tprint((m * pow(m, n // 2, 1000000007 )) % 1000000007)\n\telse:\n\t\tprint(pow(m, n // 2, 1000000007 ))\nelif k == 1:\n\tprint(pow(m, n, 1000000007))\nelse:\n\tif k & 1:\n\t\tprint(m * m)\n\telse:\n\t\tprint(m)", "class DSU:\r\n\tdef __init__(self, n):\r\n\t\tself.par = list(range(n))\r\n\t\tself.rank = [1] * n\r\n\t\tself.size = 1\r\n\t\r\n\tdef find(self, u):\r\n\t\tif u != self.par[u]:\r\n\t\t\tself.par[u] = self.find(self.par[u])\r\n\t\treturn self.par[u]\r\n\t\r\n\tdef union(self, u, v):\r\n\t\tuu, vv = self.find(u), self.find(v)\r\n\t\tif uu == vv:\r\n\t\t\treturn False\r\n\t\tif self.rank[uu] > self.rank[vv]:\r\n\t\t\tself.par[vv] = uu\r\n\t\telif self.rank[vv] > self.rank[uu]:\r\n\t\t\tself.par[uu] = vv\r\n\t\telse:\r\n\t\t\tself.par[uu] = vv\r\n\t\t\tself.rank[vv] += 1\r\n\t\tself.size += 1\r\n\t\treturn True\r\n\r\nMOD = 10**9+7\r\nN, M, K = map(int, input().split())\r\nuf = DSU(N)\r\nans = N\r\nfor L in range(N):\r\n\tR = L + K\r\n\tif R > N:\r\n\t\tbreak\r\n\tfor a in range(L, R):\r\n\t\tb = (L + R - 1) - a\r\n\t\tif uf.union(a, b):\r\n\t\t\tans -= 1\r\nprint(pow(M, ans, MOD))\r\n# solve()", "n, m, k = map(int, input().split())\r\n\r\ndef check(l, r) :\r\n\twhile (l < r) :\r\n\t\tif (s[l] != s[r]) :\r\n\t\t\treturn False\r\n\t\tl += 1\r\n\t\tr -= 1\r\n\treturn True\r\n\r\ns = [0] * n\r\n\r\ndef rec(v) :\r\n\tif (v == n) :\r\n\t\tfor i in range(n - k + 1) :\r\n\t\t\tif (not check(i, i + k - 1)) :\r\n\t\t\t\treturn ;\r\n\t\tres = ''\r\n\t\tfor i in range(n) :\r\n\t\t\tres = res + str(s[i]) + ' '\r\n\t\tprint(res)\r\n\telse :\r\n\t\tfor i in range(m) :\r\n\t\t\ts[v] = i\r\n\t\t\trec(v + 1) \t\r\n\r\n\r\nans = 0\r\nbase = 1e9 + 7\r\nbase = int(base)\r\n\r\nif (k > n or k == 1) :\r\n\tans = 1\r\n\tfor i in range(n) :\r\n\t\tans = ans * m % base\r\n\tprint(ans)\r\nelif (n == k) :\r\n\tans = 1\r\n\tfor i in range((n + 1) // 2) :\r\n\t\tans = ans * m % base\r\n\tprint(ans)\r\nelif (n > k) :\r\n\tans = m\r\n\tif (k % 2 == 1) :\r\n\t\tans += m * (m - 1)\r\n\tprint(ans % base)\r\n", "def solution(): # Definición de la función que soluciona el problema.\r\n inp = input().split() # Lectura de la entrada.\r\n n,m,k = int(inp[0]), int(inp[1]), int(inp[2]) # Guardando en n, m y k sus respectivos valores enteros desde la entrada.\r\n mod = 10**9 + 7 # Se guarda el valor con el cual se va a realizar la operación módulo, 1000000007.\r\n if k == 1 or k > n: # Comprobando si k es 1 o si k es mayor que n.\r\n sol = pow(m, n, mod) # De ser así, guardamos la solución m elevado a la n, y todo eso módulo mod.\r\n elif k == n: # Se verifica si k = n.\r\n sol = pow(m, (n + 1) // 2, mod) # Si lo es, elevamos m a la parte entera de (n+1)/2, y todo eso módulo mod lo guardamos en la solución.\r\n elif k % 2 == 1: # Revisamos si k es impar.\r\n sol = pow(m, 2) # Si llegase a serlo, entonces la solución sería m elevado al cuadrado.\r\n elif k % 2 == 0: # Se comprueba si k es par.\r\n sol = m # Si k resulta ser par, entonces la solución sería m.\r\n print(sol) # Imprimimos en consola la solución obtenida.\r\n\r\nsolution() # Llamado a la función que resuleve el problema.\r\n", "n,m,k = map(int,input().split())\r\nmod = 10**9+7\r\nif k > n:\r\n print(pow(m,n, mod))\r\nelif k == n:\r\n print(pow(m, (n+1)//2, mod))\r\nelif k == 1:\r\n print(pow(m,n, mod))\r\nelif k % 2== 1:\r\n print(m*m%mod)\r\nelse:\r\n print(m)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn, m, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nroot = [i for i in range(n)]\r\nrank = [1 for _ in range(n)]\r\nsize = [1 for _ in range(n)]\r\nl = n\r\nfor i in range(n - k + 1):\r\n for j in range(k):\r\n if not same(i + j, i + k - j - 1):\r\n l -= 1\r\n unite(i + j, i + k - j - 1)\r\nans = pow(m, l, mod)\r\nprint(ans)", "import math\r\n#n,m=map(int,input().split())\r\nfrom collections import Counter\r\n#for i in range(n):\r\nimport math\r\n#for _ in range(int(input())):\r\n#n = int(input())\r\nn,m,k= map(int, input().split())\r\nmod=10**9+7\r\nif k==1 or k>n:\r\n print((m**n)%mod)\r\nelif k==n:\r\n var=(n+1)//2\r\n var%=mod\r\n print((m**(var))%mod)\r\nelse:\r\n if k%2==0:\r\n print(m%mod)\r\n else:\r\n print((m*m)%mod)\r\n\r\n", "d = 1000000007\r\nn, m, k = map(int, input().split())\r\nif k == 1 or n < k: print(pow(m, n, d))\r\nelif n == k: print(pow(m, (n + 1) // 2, d))\r\nelif k & 1: print(m * m)\r\nelse: print(m)", "n, m, k = [int(i) for i in input().split(\" \")]\r\n\r\nif k==1 or k>n:\r\n print(pow(m,n,1000000007))\r\nelif k==n:\r\n print(pow(m, (n+1)//2, 1000000007))\r\nelif k%2:\r\n print(pow(m, 2, 1000000007))\r\nelse:\r\n print(pow(m, 1, 1000000007))\r\n", "from collections import deque\nmod = 1000000007\n\ndef solve():\n\tn,m,k = map(int,input().split())\n\tif k == 1 or k>n:\n\t\tprint(m**n%mod)\n\telif k==n:\n\t\tprint(m**((n+1)//2)%mod)\n\telif k%2==1:\n\t\tprint(m*m%mod)\n\telse:\n\t\tprint(m%mod)\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()", "n,m,k = map(int,input().split())\r\nans = 1\r\nif n == k:\r\n for i in range((n+1)//2):\r\n ans *= m\r\n ans %= 10**9 + 7\r\n\r\nelif k == 1 or k > n:\r\n for i in range(n):\r\n ans *= m\r\n ans %= 10 ** 9 + 7\r\nelif k % 2 == 1:\r\n ans = int(m**2)\r\nelse:\r\n ans = int(m)\r\n\r\nprint(ans)", "'''\r\nBeezMinh\r\n10:16 UTC+7\r\n15/09/2023\r\n'''\r\n#4 cases, very easy to understand\r\nmod = 10 ** 9 + 7\r\nn, m, k = map(int, input().split())\r\nif k == 1 or k > n: print(pow(m, n, mod))\r\nelif k == n: print(pow(m, (n + 1) // 2, mod))\r\nelif k & 1: print(m * m)\r\nelse: print(m)", "#!/usr/bin/python3\r\n\r\nMOD = int(1e9 + 7)\r\nN, m, k = [int(x) for x in input().split()]\r\ndef kelk(a, b):\r\n\tret = 1\r\n\twhile b:\r\n\t\tif b % 2:\r\n\t\t\tret = (a*int(ret))%MOD\r\n\r\n\t\ta = int(a*a)%MOD\r\n\t\ta = int(a) % MOD\r\n\t\tb //= 2\r\n\r\n\treturn int(ret) % MOD\r\n\r\nif k > N or k == 1:\r\n\tprint(kelk(m, N))\r\nelif k < N:\r\n\tprint(int(m + m*(m - 1)*(k % 2)))\r\nelif k == N:\r\n\tprint(kelk(m, (N+1)//2))\r\n", "n, m, k = map(int, input().split())\n\nmod = 10 ** 9 + 7\n\nif k == 1 or k > n:\n print(pow(m, n, mod))\nelif k == n:\n print(pow(m, (n + 1) // 2, mod))\nelse:\n print(pow(m, k % 2 + 1, mod))\n" ]

[ "no_inputs = int(input())\nnums = list(map(int, input().split()))\n\nunique_nums = []\nfor num in nums[::-1]:\n if num not in unique_nums:\n unique_nums.append(num)\nprint(len(unique_nums))\nprint(\" \".join(str(item) for item in unique_nums[::-1]))\n\n\t\t\t\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t \t \t\t", "input()\r\nnum = list(map(int, input().split()))\r\nunique = []\r\nfor i in reversed(num):\r\n if i not in unique:\r\n unique.insert(0, i)\r\nprint(len(unique))\r\nprint(\" \".join(map(str, unique)))", "n = int(input()); s = list(map(int,input().split()));s = s[::-1]\r\nl = []\r\nfor i in s:\r\n if(i not in l):l.append(i)\r\nl = l[::-1];print(len(l));print(*l)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n if(a[i] not in a[i+1:]):\r\n ans.append(a[i])\r\nprint(len(ans)) \r\nprint(*ans)", "class Solution:\n def get_nums(self, nums):\n dic = {}\n res = []\n ans = []\n for i, num in enumerate(nums):\n if num in dic:\n dic[num].append(i)\n else:\n dic[num] = [i]\n value = sorted(dic.values())\n for v in value:\n res.append(v[-1])\n res.sort()\n for k in res:\n ans.append(nums[k])\n return ans\n\nn = int(input())\nstr_in = input()\nnums = [int(i) for i in str_in.split(\" \")]\ns = Solution()\nans = s.get_nums(nums)\nprint(len(ans))\nprint(\" \".join(str(i) for i in ans))\n\t\t \t\t \t\t\t\t \t\t\t\t\t\t\t\t \t \t", "# m-a-v-e-r-i-c-k\r\n\r\nimport os, sys, math, heapq, itertools, bisect\r\nfrom string import ascii_lowercase, ascii_uppercase\r\n#from collections import deque,defaultdict, OrderedDict, Counter\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsys.setrecursionlimit(10000)\r\nii = lambda : int(input()) \r\nsi = lambda : input() \r\nmi = lambda : map(int,input().strip().split(\" \")) \r\nmsi = lambda : map(str,input().strip().split(\" \")) \r\nli = lambda : list(mi()) \r\nlsi = lambda : list(msi())\r\ntoBinary = lambda num : int(str(bin(num))[2:])\r\niseven = lambda num : num%2==0 \r\nisodd = lambda num : num%2==1 \r\nisint = lambda num : isinstance(num, int)\r\nisfloat = lambda num : isinstance(num, float)\r\nisPowerOfTwo = lambda num : num and (not(num & (num - 1)))\r\nstore,dick,counter,s,flag,uppercase,lowercase = [],{},0,0,False,[i for i in ascii_uppercase],[i for i in ascii_lowercase]\r\npositive_infinity = float('inf')\r\nnegative_infinity = float('-inf')\r\n\r\ndef swap(array:list,a,b) -> None: array[b],array[a] = array[a],array[b]\r\ndef flush() -> None: global counter,summation,flag; store.clear();dick.clear(); counter,summation,flag = 0,0,False\r\ndef debug(*var) -> None:\r\n import t_o_p_g_u_n\r\n with open(t_o_p_g_u_n.debug_file,\"a\") as f:\r\n for idx,v in enumerate(var): f.write(f\"Query {idx+1}\\t>-> {str(v)}\\n\")\r\ntry: from t_o_p_g_u_n import m_a_v_e_r_i_c_k; m_a_v_e_r_i_c_k()\r\nexcept (FileNotFoundError,ModuleNotFoundError): pass\r\n\r\nlength = ii()\r\nl = li()\r\nidx = length-1\r\nwhile idx >= 0:\r\n if l[idx] not in store: store.append(l[idx])\r\n elif l[idx] in store: l[idx] = 0\r\n idx-=1\r\n\r\nst = [i for i in store[::-1] if i!=0]\r\nprint(f\"{len(st)}\",end=\"\\n\")\r\nprint(*st)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=l[::-1]\r\nk=[]\r\nj=0\r\nfor i in l:\r\n if i not in k:\r\n k.append(i)\r\n j+=1\r\nprint(j)\r\nprint(*k[::-1])", "n = int(input())\r\na = list(map(int,input().split()))\r\na.reverse()\r\ns = []\r\nfor i in range(n):\r\n if(a[i] not in s):\r\n s.append(a[i])\r\ns.reverse()\r\nprint(len(s))\r\nprint(*s)", "n = int(input())\r\nel = input()\r\narr = list(map(int, el.split()))\r\narr.reverse()\r\narr1 = []\r\nfor i in arr:\r\n if not i in arr1:\r\n arr1.append(i)\r\narr1.reverse()\r\nprint(len(arr1))\r\nfor i in arr1:\r\n print(i,end=' ')", "n = int(input())\r\na = [int(x) for x in input().split(\" \")]\r\nyes = [False]*1001\r\nfor i in range(n-1, -1, -1):\r\n if yes[a[i]]:\r\n a.pop(i)\r\n else:\r\n yes[a[i]] = True\r\nprint(len(a))\r\nprint(*a, sep=\" \")", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nse = set()\r\nnew = []\r\nfor x in reversed(l):\r\n if x in se:\r\n continue\r\n else:\r\n se.add(x)\r\n new.append(x)\r\nprint(len(new))\r\nfor o in reversed(new):\r\n print(o,end=\" \")", "a = int(input())\r\nb = [int(a) for a in input().split()]\r\nfinal = []\r\n\r\nb = b[::-1]\r\n\r\nfor n in b:\r\n if n not in final:\r\n final.append(n)\r\n\r\nprint(len(final))\r\nprint(*final[::-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\nfor i in range(n):\r\n x=l[i+1:]\r\n if x.count(l[i])==0:\r\n p.append(l[i])\r\nprint(len(p))\r\nprint(' '.join(map(str,p)))", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n - 1, -1, -1):\n if a[i] not in d:\n d[a[i]] = i\n\nresult = []\nfor index in d.values():\n result.append(a[index])\n\nprint(len(result))\nprint(' '.join(map(str, result[::-1])))\n", "t=int(input())\r\nls=list(map(int,input().split()))\r\narr=[]\r\nfor i in reversed(range(t)):\r\n\tif ls[i] not in arr:\r\n\t\tarr.append(ls[i])\r\narr=arr[::-1]\r\nprint(len(arr))\r\nfor i in range(len(arr)):\r\n\tprint(arr[i],end=' ')", "k=int(input())\r\na=list(map(int,input().split()))\r\na=a[::-1]\r\nans=[]\r\nfor i in a:\r\n if i not in ans:\r\n ans.append(i)\r\nprint(len(ans)) \r\nprint(*ans[::-1])\r\n", "\r\ndef exequal(a,n):\r\n i=n-1\r\n other=[]\r\n while(i>=0):\r\n \r\n if(i==n):\r\n other.append(a[i])\r\n else:\r\n m=0\r\n while(m<len(other)):\r\n if(other[m]==a[i]):\r\n m=52\r\n break\r\n \r\n\r\n \r\n \r\n\r\n m+=1\r\n if(m!=52):\r\n other.append(a[i])\r\n\r\n\r\n i-=1\r\n \r\n\r\n\r\n inverse=[]\r\n h=len(other)-1\r\n while(h>=0):\r\n inverse.append(other[h])\r\n h-=1\r\n \r\n\r\n return inverse\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n data=input()\r\n a=input().split(\" \")\r\n i=0\r\n while(i<len(a)):\r\n a[i]=int(a[i])\r\n i+=1\r\n\r\n\r\n \r\n v=exequal(a, len(a))\r\n\r\n\r\n print(len(v))\r\n i=0\r\n while(i<len(v)):\r\n print(v[i], end=\" \")\r\n i+=1\r\n ", "x=int(input())\r\nA=[int(A) for A in input().split()]\r\nB=[]\r\nz=0\r\nfor i in range(0,len(A)):\r\n c=0\r\n for j in range(i+1,len(A)):\r\n if(A[i]==A[j]):\r\n c=1\r\n break\r\n if (c==0):\r\n z+=1\r\n B.append(A[i])\r\nprint(z)\r\nprint(*B,sep=\" \")\r\n\r\n \r\n\r\n\r\n \r\n", "def main():\r\n size = int(input())\r\n numbers = tuple(map(int, input().split()))\r\n result = []\r\n \r\n for i in range(size - 1):\r\n if numbers[i + 1:].count(numbers[i]) == 0:\r\n result.append(numbers[i])\r\n \r\n result.append(numbers[-1])\r\n \r\n print(len(result))\r\n print(*result)\r\n \r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nx=list(map(int,input().split()))\r\nr=[]\r\nfor i in range(len(x)-1,-1,-1):\r\n if x[i] not in r:\r\n r.append(x[i])\r\nprint(len(r))\r\nr.reverse()\r\nprint(*r)\r\n", "n = int(input())\r\ngiven_array = list(map(int, input().split()))\r\n\r\nvisited_list = []\r\nresult_list = []\r\n\r\nfor i in range(n-1, -1, -1): # LOOP THROUGH THE ARRAY FROM INDEX (n-1) to 0(inclusive) backwards\r\n if given_array[i] not in visited_list:\r\n visited_list.append(given_array[i])\r\n result_list.append(given_array[i])\r\n\r\nprint(len(result_list))\r\nprint(\" \".join(map(str, result_list[::-1])))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = {}\r\nfor x in a:\r\n if x not in cnt:\r\n cnt[x] = 0\r\n cnt[x] += 1\r\n\r\nprint(len(cnt.items()))\r\nfor i in range(n):\r\n cnt[a[i]] -= 1\r\n if cnt[a[i]] == 0:\r\n print(a[i], end=' ')", "N = int(input())\nA = list(map(int, input().split()))\n\nans = []\nseen = set()\nfor x in A[::-1]:\n if x not in seen:\n seen.add(x)\n ans.append(x)\n\nprint(len(ans))\nprint(*ans[::-1])", "input()\r\na = list(map(int, input().split()))\r\na = list(reversed(a))\r\nb = []\r\nfor i in a:\r\n if i not in b:\r\n b.append(i)\r\nprint(len(b))\r\nprint(*reversed(b))\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nseen = set()\nunique = []\n\nfor i in range(n-1, -1, -1):\n if a[i] not in seen:\n unique.append(a[i])\n seen.add(a[i])\n\nunique.reverse()\nprint(len(unique))\nprint(*unique)\n\n\t \t \t \t \t\t \t\t \t \t\t \t", "n = int(input())\r\n\r\nnums = list(map(int,input().split()))\r\n\r\n\r\nres = []\r\nfor i in range(n-1,-1,-1):\r\n if nums[i] not in res:\r\n res.append(nums[i])\r\n else:\r\n continue\r\n\r\nprint(len(res))\r\nprint(*res[::-1])\r\n", "def test():\n n = int(input())\n a = list(map(int, input().split()))\n a.reverse()\n arr = []\n for el in a:\n if el not in arr:\n arr.insert(0, el)\n\n print(len(arr))\n print(*arr)\n\n\nif __name__ == \"__main__\":\n # t = int(input())\n t = 1\n for _ in range(t):\n test()\n", "length= int(input())\nl = []\nfor i in input().split(' '):\n l.append(int(i))\n\nfinal = [l[0]]\nif len(l) > 1:\n for i in l:\n if i in final:\n final.remove(i)\n final.append(i)\n\nprint(len(final))\n\ns=\"\"\nfor i in final:\n s+=str(i)+ \" \"\n\nprint(s)", "\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nunique = []\r\n\r\nwhile n != 0:\r\n if data[n-1] not in unique:\r\n unique.append(data[n-1])\r\n n -= 1\r\n else:\r\n data.remove(data[n-1])\r\n n -= 1\r\n\r\nprint(len(data))\r\nfor i in data:\r\n print(i, end=\" \")", "n = int(input())\r\narr = list(map(int,input().split()))\r\nnew = []\r\nexist = set()\r\nfor i in range(len(arr)-1,-1,-1) :\r\n if(arr[i] not in exist) :\r\n new.append(arr[i])\r\n exist.add(arr[i])\r\nprint(len(new))\r\nfor i in range(len(new)-1,-1,-1) :\r\n print(new[i],end = \" \")\r\n", "_ = int(input())\r\nnums = list(map(int, input().split()))\r\nr = []\r\n\r\nfor x in nums:\r\n if x in r:\r\n r.remove(x)\r\n r.append(x)\r\n\r\nprint(len(r))\r\nvls = [str(x) for x in r]\r\nprint(' '.join(vls))", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl2=l1[::-1]\r\ns2=set(l2)\r\nl3=[]\r\nfor j in s2:\r\n l3.append(l2.index(j))\r\nl3.sort()\r\nl4=[l2[k] for k in l3]\r\nl5=l4[::-1]\r\nprint(len(l5))\r\nprint(*l5,sep=\" \")", "def solve(n, a):\r\n l = []\r\n for i in range(n-1, -1, -1):\r\n if a[i] not in l:\r\n l.append(a[i])\r\n \r\n print(len(l))\r\n for i in range(len(l) - 1, -1, -1):\r\n print(l[i], end=\" \")\r\n print()\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsolve(n, a)", "n = int(input())\r\n\r\nnums = [int(x) for x in input().split()]\r\n\r\nsset = set()\r\n\r\nout = []\r\nfor x in reversed(nums):\r\n if x not in sset:\r\n sset.add(x)\r\n out.append(x)\r\n\r\nprint(len(sset))\r\nprint(*out[::-1])\r\n", "a = input()\r\nb = input().split()\r\n\r\nintList = [int(i) for i in b]\r\n\r\nintList.reverse()\r\n\r\nres = [];\r\n\r\n[res.append(x) for x in intList if x not in res]\r\n\r\n\r\nn = len(res);\r\nprint(str(n))\r\n\r\nfor i in range(n):\r\n\tif i != n-1:\r\n\t\tprint(res[n-i-1], end=\" \")\r\n\telse:\r\n\t\tprint(res[n-i-1])", "n = int(input())\r\nsp = [int(i) for i in input().split(\" \")]\r\nnewsp = []\r\n# y=len(sp)-1\r\n\r\n# while y>=0:\r\n# print(y)\r\n# y-=1\r\nfor i in reversed(range(len(sp))):\r\n if sp[i] not in newsp:\r\n newsp.append(sp[i])\r\nprint(len(newsp)) \r\nprint(*newsp[::-1]) \r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nb.reverse()\r\nq = []\r\nfor x in b:\r\n while x not in q:\r\n q.append(x)\r\nc = set(b)\r\nprint(len(c))\r\nq.reverse()\r\nprint(*q)", "inf=10**18\r\ndxy=[(0,1), (1,0), (-1, 0), (0, -1)]\r\nmod=10**9+7\r\nMOD=998244353\r\n\r\n \r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n\r\n ans = []\r\n seen = set()\r\n for aa in a[::-1]:\r\n if aa not in seen:\r\n ans.append(aa)\r\n seen.add(aa)\r\n print(len(ans))\r\n print(*ans[::-1])\r\n\r\nmain()", "n = int(input())\r\nList = list(map(int,input().split()))\r\nList = List[::-1]\r\nappearances = list()\r\nLisT = list()\r\nfor i in List:\r\n if not(i in appearances):\r\n appearances.append(i)\r\n LisT.append(i)\r\nprint(len(LisT))\r\nprint(*LisT[::-1]) ", "len_ar = int(input())\nar = list(map(int,input().split(\" \")))\n\nn_ar = []\n\nfor b in range(len_ar-1,-1,-1):\n if(ar[b] not in n_ar):\n n_ar.append(ar[b])\n\nprint(len(n_ar))\n\nfor h in range(len(n_ar)-1,-1,-1):\n print(n_ar[h], end=' ')\n\nprint('\\n')\n\n\t\t \t \t \t \t \t \t \t\t \t \t\t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.reverse()\r\nres = []\r\nfor x in lst:\r\n if x not in res: \r\n res.append(x)\r\nres.reverse()\r\nprint(len(res))\r\nprint(\" \".join(str(x) for x in res))", "input()\r\na = list(dict.fromkeys(list(map(int, input().split()))[::-1]))\r\na.reverse()\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nrightmost_index = {}\r\nunique_elements = []\r\n\r\nfor i in range(n - 1, -1, -1):\r\n num = arr[i]\r\n if num not in rightmost_index:\r\n rightmost_index[num] = i\r\n unique_elements.append(num)\r\n\r\nunique_elements.reverse()\r\n\r\nprint(len(unique_elements))\r\nprint(*unique_elements)\r\n", "s = int(input())\r\na = list(map(int,input().split()))\r\nw = 0\r\nl = []\r\nfor i in a :\r\n\tw += 1\r\n\tif i not in a[w:]:\r\n\t\tl.append(i)\r\nprint(len(l))\r\nprint(*l)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split(' ')))\r\n se = set()\r\n ans = []\r\n for x in a[::-1]:\r\n if x not in se:\r\n se.add(x)\r\n ans.append(x)\r\n print(len(ans))\r\n print(*ans[::-1])\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr_copy = arr.copy()\r\n\r\nfor i in range(len(arr)-1,0,-1):\r\n occ = -1\r\n for j in range(len(arr_copy)):\r\n if arr_copy[j] == arr[i]:\r\n occ += 1\r\n \r\n for _ in range(occ):\r\n arr_copy.remove(arr[i])\r\n\r\nprint(len(arr_copy))\r\nprint(*arr_copy, 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\nl = 0 \r\nr = 4\r\n\r\n0 + 1 + 2 + 3 + 4 = 10\r\n\r\n(r-l+1) in length\r\n\r\nl + l + 1\r\n\r\nany odd number\r\n\r\n2l+1\r\n-1,2\r\n\r\n-l + 0 + l + l\r\nahh just return the negative range and set r to be n\r\n\r\n2\r\n-1,2\r\n'''\r\n\r\ninf = 10**9+7\r\nn=II()\r\na=LII()\r\nneed=set(a)\r\nans=[]\r\nfor num in a[::-1]:\r\n if num in need:\r\n ans.append(num)\r\n need.remove(num)\r\nprint(len(ans))\r\nprint(' '.join(map(str,ans[::-1])))", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input(). split()))\r\nans = [ ]\r\nfor i in range(n):\r\n arr = a[i : ]\r\n p = Counter(arr)\r\n if p[a[i]] == 1:\r\n ans += [a[i]]\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n=input()\nl=input().split()[::-1]\nprint(len(set(l)))\nprint(*sorted(set(l),key=l.index,reverse=True))\n\n\t \t \t \t\t\t\t \t \t \t \t \t\t \t \t", "n = int(input())\na = [int(x) for x in input().split()][:n]\na.reverse()\ncheck = {}\nuniq = []\nfor i in range(n):\n\tif a[i] not in check:\n\t\tuniq.append(a[i])\n\t\tcheck[a[i]] = True\nuniq.reverse()\nlen = len(uniq)\nprint(len)\nfor i in range(len):\n\tprint(uniq[i], end = ' ')\nprint()\n\n\t \t\t \t\t \t\t \t\t\t \t \t \t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\na = list(dict((i,1) for i in a))\r\na = a[::-1]\r\nprint(len(a))\r\nprint(' '.join(str(x) for x in a))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=set()\r\nans=[]\r\nfor num in reversed(a):\r\n if num not in x:\r\n x.add(num)\r\n ans.append(num)\r\nprint(len(ans))\r\nprint(\" \".join(map(str,reversed(ans))))", "n = int(input())\r\na = list(map(int, input().split()))\r\notv = []\r\nk = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] not in otv:\r\n otv.append(a[i])\r\n k += 1\r\n\r\notv.reverse()\r\nprint(k)\r\nprint(*otv)", "N = int(input())\r\nlst = list(map(int, input().split()))\r\ns = set()\r\n\r\nfor i in range(len(lst) -1, -1, -1):\r\n if lst[i] in s:\r\n lst.remove(lst[i])\r\n s.add(lst[i])\r\n\r\nprint(len(lst))\r\nprint(*lst)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = l\r\nj = 0\r\nfor i in range(n):\r\n if l[j] in l and l.count(l[j]) > 1:\r\n del l[j]\r\n else:\r\n j = j + 1\r\nprint(len(l))\r\nprint(*l)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(n-1,-1,-1):\r\n if l[i] not in g:\r\n g.append(l[i])\r\nprint(len(g))\r\nprint(*g[::-1])", "from collections import Counter\n\nnumber_in_array = int(input())\narr = list(map(int, input().split(' ')))\n\ncounts = Counter(arr)\nduplicates_number = []\n\nfor number, occurrences in counts.items():\n if occurrences > 1:\n duplicates_number.append(number)\n\nfor number in duplicates_number:\n for i in range(arr.count(number) - 1):\n arr.remove(number)\n\nprint(len(arr))\nprint(*arr)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = n - 2\r\ns = set(a[n - 1:])\r\nwhile i != -1:\r\n if a[i] in s:\r\n a.pop(i)\r\n else:\r\n s.add(a[i])\r\n i -= 1\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = [x for i,x in enumerate(a) if x not in a[i+1:]]\r\nprint(len(b))\r\nprint(*b)", "n=input()\r\nl=[int(x) for x in input().split()]\r\ns=set(l)\r\nprint(len(s))\r\nl.reverse()\r\nm=[]\r\nfor i in l :\r\n if i not in m:\r\n m.append(i)\r\nm.reverse()\r\nfor i in m:\r\n print(i,end=\" \")", "def test(ch):\r\n l=ch.split(\" \")\r\n l.reverse()\r\n i=0\r\n l1=list()\r\n l1.append(l[0])\r\n while(i<len(l)):\r\n if l[i] not in l1:\r\n l1.append(l[i])\r\n i=i+1\r\n l1.reverse()\r\n return(l1)\r\nx=int(input())\r\nch=input()\r\nprint(len(test(ch)))\r\nprint(\" \".join(test(ch)))\r\n", "n = int(input())\narr = [int(x) for x in input().split()]\nlst = []\nfor i in range(n - 1 , -1, -1):\n if arr[i] not in lst:\n lst.append(arr[i])\nprint(len(lst))\nfor i in range(len(lst) - 1, -1, -1):\n print(lst[i], end=' ')\n\t\t\t \t \t \t \t\t\t \t \t \t\t\t", "q = int(input())\r\nw = [0] * 1111\r\ne = []\r\nr = list(map(int, input().split()))\r\nfor i in range(q - 1, -1, -1):\r\n if(w[r[i]] == 0):\r\n w[r[i]] += 1\r\n e.append(r[i])\r\nprint(len(e))\r\nfor i in range(len(e) - 1, -1, -1):\r\n print(e[i], end=\" \")\r\n ", "length = int(input())\r\narray = [int(i) for i in input().split(' ')]\r\nremove = []\r\nfor i in range(len(array)):\r\n if array[i] in array[i+1:]:\r\n continue\r\n if i == (len(array)-1):\r\n remove.append(array[i]) \r\n break\r\n if array[i] not in remove:\r\n remove.append(array[i])\r\n\r\n\r\n \r\nprint(len(remove))\r\nprint(' '.join([str(i) for i in remove]))", "#Shanmukh\r\nn=int(input())\r\nb=input().split()\r\ns=b[::-1]\r\nse=[]\r\nfor j in range(len(b)):\r\n if(s[j] not in se):\r\n se.append(s[j])\r\nprint(len(se))\r\nprint(' '.join(se[::-1]))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nres = []\r\nst = set()\r\nfor v,i in enumerate(arr):\r\n if i in st:\r\n res.remove(i)\r\n res.append(i)\r\n st.add(i)\r\nprint(len(res))\r\nprint(*res)", "n = int(input())\nnums = [int(x) for x in input().split()]\npassados = []\nnova = []\n\nfor i in range(n -1, -1, -1):\n if nums[i] not in passados: \n passados.append(nums[i])\n nova.insert(0,nums[i])\n\nout = \"\"\nout += str(nova[0])\nfor i in range(1,len(nova)):\n out += \" \"\n out += str(nova[i])\n\n\nprint(len(nova))\nprint(out)", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=n-1\r\nb=[]\r\nwhile i>=0:\r\n if a[i] not in b:\r\n b.append(a[i])\r\n i-=1\r\nb=b[::-1]\r\nprint(len(b))\r\nprint(*b)", "n = int(input())\r\nresult = []\r\ncheck = set()\r\n\r\nfor num in list(map(int, input().split()))[::-1]:\r\n if num not in check:\r\n check.add(num)\r\n result.append(num)\r\n\r\nprint(len(result))\r\nfor num in result[::-1]:\r\n print(num, end=\" \")", "n = int(input())\r\na = reversed(list(map(int, input().split())))\r\nresult = []\r\nfor i in a:\r\n if i not in result:\r\n result.append(i)\r\nprint(len(result))\r\nprint(*reversed(result))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\nl1=[]\r\nfor j in l:\r\n if j not in l1:\r\n l1.append(j)\r\nl1.reverse()\r\nprint(len(l1))\r\ns=\"\"\r\nfor i in l1:\r\n s=s+str(i)+\" \"\r\nprint(s)", "a = int(input())\r\nb = list(map(int, input().split()))\r\ni = 0\r\nwhile i < len(b):\r\n if b.count(b[i]) > 1:\r\n b.pop(i)\r\n else:\r\n i += 1\r\nprint(len(b))\r\nprint(' '.join(map(str, b)))\r\n", "from collections import Counter\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\ndic=Counter(a)\r\nfor i in dic.keys():\r\n k=dic[i]\r\n for j in range(k-1):\r\n a.remove(i)\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(a[i],end=\" \")", "n = int(input())\narr = [int(_) for _ in input().split()]\n\nfor j in range(n):\n if arr.count(arr[j]) > 1:\n arr[j] = -1\n\nx = [c for c in arr if c != -1]\n\nprint(len(x))\nprint(*x)\n", "t=int(input())\r\ns=input()\r\narr=s.split()\r\n\r\nfor i in range(t):\r\n arr[i]=int(arr[i])\r\nnew=list(set(arr))\r\nfor i in range(len(new)):#3\r\n c=arr.count(new[i])\r\n #print(c)\r\n p=0\r\n for j in range(len(arr)):\r\n if arr[j]==new[i] and p<c-1:\r\n #print(i,\" \",j,\" \",arr[i])\r\n arr[j]=-1\r\n p=p+1\r\n #print(p)\r\ncount=0\r\nfor i in range(len(arr)):\r\n if arr[i]!=-1:\r\n count=count+1\r\nprint(count)\r\nfor i in range(len(arr)):\r\n if arr[i]!=-1:\r\n print(arr[i],end=\" \")\r\n\r\n\r\n\r\n\r\n", "n = int (input())\r\narr = list (map ( int , input().split(' ')))\r\nans = list() \r\npres = set() \r\nwhile len (arr) > 0 : \r\n x = arr.pop() \r\n if x not in pres:\r\n pres.add(x)\r\n ans.append(x)\r\nans.reverse()\r\nprint (len(ans))\r\nprint (*ans, sep= ' ') ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nx = []\r\nfor i in range(n-1,-1,-1):\r\n if arr[i] not in x:\r\n x.append(arr[i])\r\nx.reverse()\r\nprint(len(x))\r\nprint(*x)", "a=int(input())\r\ng=list(map(int,input().split(' ')))\r\nj=0\r\nh=[]\r\ng=g[::-1]\r\nfor i in range(a):\r\n if g[i] in h:\r\n j+=1\r\n else:\r\n h.append(g[i])\r\nh=h[::-1]\r\nz=len(h)\r\nprint(z)\r\nprint(*h)", "n=input()\na=[]\nx=map(int,input().split())\nfor i in x:\n\twhile i in a:\n\t\tdel a[a.index(i)]\n\ta.append(i)\nprint(len(a))\nprint(*a)\n \t \t\t \t \t \t \t \t \t \t\t \t\t\t\t", "n = int(input())\r\nb = []\r\na=[int(i)for i in input().split()]\r\n\r\nfor i in range(len(a)):\r\n if a[i] not in a[i + 1:] :\r\n b.append(a[i])\r\nprint(len(b))\r\n\r\nfor i in range(len(b)):\r\n print(b[i])", "n = int(input()) # Number of elements in the array\na = list(map(int, input().split())) # The array\n\nresult = []\nfor i in range(n-1, -1, -1):\n if a[i] not in result:\n result.append(a[i])\n\nprint(len(result))\nprint(*reversed(result))\n \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t \t", "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,Counter\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\nn=int(input())\r\nN=1010\r\na=list(map(int,input().split()))\r\nst=[False]*N\r\nans=[]\r\nfor i in range(n-1,-1,-1):\r\n if not st[a[i]]:\r\n ans.append(a[i])\r\n st[a[i]]=True\r\nprint(len(ans))\r\nprint(*ans[::-1])", "t = int(input())\r\nl = list(map(int, input().split(' ')))\r\ns = []\r\nl.reverse()\r\n\r\nfor i in l:\r\n if i not in s:\r\n s.append(i)\r\nq = ''\r\ns.reverse()\r\n\r\nfor i in s:\r\n q += str(i) + ' '\r\n\r\nprint(len(s))\r\nprint(q)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.reverse()\r\nl=list(dict.fromkeys(a))\r\nl.reverse()\r\nprint(len(l))\r\nprint(*l,sep=\" \")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[0]\r\nx=0\r\nfor i in range(n-1,-1,-1):\r\n if a[i] in l:\r\n x=a.pop(i)\r\n else:\r\n l.append(a[i])\r\nprint(len(a))\r\nprint(*a)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nans = list()\r\ni = n - 1\r\nwhile i >= 0:\r\n if l[i] not in ans:\r\n ans.insert(0, l[i])\r\n i -= 1\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\na = set()\r\nb = []\r\nfor i in range(n-1, -1, -1):\r\n if lst[i] not in a:\r\n a.add(lst[i])\r\n b.append(lst[i])\r\nprint(len(b))\r\nprint(*reversed(b))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\nm=[]\r\nc=0\r\nfor i in l:\r\n if i not in m:\r\n m.insert(0,i)\r\n c=c+1\r\nprint(c)\r\nprint(*m)", "from audioop import reverse\r\nfrom cmath import *\r\nfrom math import *\r\nfrom decimal import *\r\nfrom collections import *\r\nfrom re import X\r\nimport sys\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#ord -> chuyen asciiz thanh int\r\n\r\ndef solves():\r\n n= _int()\r\n a=_list()\r\n lst=list(set(a))\r\n m=len(lst)\r\n ans=[]\r\n cnt=0\r\n for i in range(n-1,-1,-1):\r\n if a[i] in lst:\r\n k=lst.index(a[i])\r\n ans.append(a[i])\r\n lst.pop(k)\r\n cnt+=1\r\n if cnt==m:\r\n break\r\n print(m)\r\n print(*reversed(ans))\r\n \r\n\r\n \r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "input()\r\na = [int(i) for i in input().split()]\r\nnew = []\r\nfor i in a[::-1]:\r\n if i not in new:\r\n new.append(i)\r\nprint(len(new))\r\nprint(*new[::-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\na=[]\r\nfor i in l:\r\n if i not in a:\r\n a.append(i)\r\nprint(len(a))\r\na.reverse()\r\nprint(*a,end=\" \")", "import sys\r\n\r\na = int(input(\"\"))\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = []\r\nfor i in range(0, a):\r\n if b[i] in c:\r\n c.remove(b[i])\r\n c.append(b[i])\r\n else:\r\n c.append(b[i])\r\nprint(len(c))\r\ne = \"\"\r\nfor i in range(0, len(c)):\r\n e += str(c[i]) + ' '\r\nprint(e)\r\n", "count=[0 for i in range(1001)]\r\nn=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nfor i in l:\r\n count[i]=1\r\nres=[]\r\nfor i in l[::-1]:\r\n if count[i]==1:\r\n res.insert(0,i)\r\n count[i]=0\r\nprint(len(res))\r\nfor i in res:\r\n print(i,end=' ')\r\nprint()", "n = int(input())\r\nm = list(map(int, input().split()))\r\nm2 = [i for i in m]\r\n\r\nfor i in range(n):\r\n if (m2.count(m[i])) > 1:\r\n for j in range(m.count(m[i]) - 1):\r\n m2.remove(m[i])\r\nprint(len(m2))\r\nfor i in m2:\r\n print(i, end=\" \")\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(len(l)-1,-1,-1):\r\n if(l[i] not in x):\r\n x.append(l[i])\r\nx.reverse()\r\nprint(len(x))\r\nfor item in x:\r\n print(item,end=\" \")", "input()\r\n*l, = map(int, input().split(' '))\r\nans = []\r\n\r\nl.reverse()\r\nfor i in l:\r\n if i not in ans:\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(*ans[::-1])\r\n", "n=int(input())\r\na=input()\r\na1=a.split()\r\nfor i in range(n): a1[i]=int(a1[i])\r\nb=[] #unique\r\nfor i in range(n):\r\n if a1[n-i-1] not in b: b.insert(0,a1[n-i-1])\r\nprint(len(b))\r\nfor i in b: print(i,end=\" \")\r\n", "inp1 = int(input())\r\ninp2 = list(map(int,input().split()))\r\nset1 = len(set(inp2))\r\nlist1 = []\r\ninp2 = inp2[::-1]\r\nfor i in range(len(inp2)):\r\n if inp2[i] not in list1:\r\n list1.append(inp2[i])\r\n\r\nprint(set1)\r\nprint(*list1[::-1])\r\n \r\n \r\n \r\n \r\n", "a = int(input())\r\nb = [*map(int, input().split())]\r\nl = []\r\nfor i in b[::-1]:\r\n if i not in l:\r\n l.append(i)\r\nprint(len(l))\r\nprint(*l[::-1])\r\n\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()][:n]\nuniq = []\nfor i in reversed(range(n)):\n\tif not any(item in uniq for item in uniq if item == a[i]):\n\t\tuniq.append(a[i])\nprint(len(uniq))\nfor i in reversed(range(len(uniq))):\n\tprint(uniq[i], end = ' ')\nprint()\n\n## any key to find element in a list\n \t \t\t\t\t\t \t \t\t\t \t\t \t\t \t\t \t", "inp = int(input())\r\nlista = [int(x) for x in input().split()]\r\nlistaB = []\r\n\r\nfor i in range(len(lista)-1,-1,-1):\r\n if lista[i] not in listaB:\r\n listaB.append(lista[i])\r\n\r\nprint(len(listaB))\r\nfor i in range(len(listaB)-1,-1,-1):\r\n print(listaB[i],end=\" \")", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\narrSet = []\r\n\r\nsetSize = len(set(arr))\r\n\r\nfor i in range(n-1, -1, -1):\r\n if arr[i] not in arrSet:\r\n arrSet.insert(0, arr[i])\r\n if len(arrSet) == setSize:\r\n break\r\n\r\nprint(len(arrSet))\r\nfor i in range(len(arrSet)):\r\n print(arrSet[i], end=' ')\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl = l[::-1]\r\nk = []\r\nfor i in l:\r\n if i in k:\r\n h=1\r\n else:\r\n k.append(i)\r\nprint (len(k))\r\nprint (*k[::-1])", "n=int(input())\r\ns1=input()\r\nnumbers=list(map(int,s1.split()))\r\nno_list=[]\r\nfor i in range(n):\r\n if (not(numbers[i] in numbers[i+1:])):\r\n no_list.append(numbers[i]) \r\n \r\nprint(len(no_list))\r\nfor e in no_list:\r\n print(e,end=\" \")", "n = int(input())\r\nv = list(map(int, input().split()))\r\nd = [0]*1001\r\nv2 = []\r\nfor i in range(n-1, -1, -1):\r\n\tif not d[v[i]]:\r\n\t\tv2.append(v[i])\r\n\t\td[v[i]] = 1\r\nn2 = len(v2)\r\nprint(n2)\r\nfor i in range(n2-1, -1, -1):\r\n\tprint(v2[i], end=\" \")", "n = int(input())\r\na = [int(p) for p in input().split()]\r\nx = len(set(a))\r\nidx = 0\r\nwhile idx < x:\r\n if a[idx] in a[idx + 1:]:\r\n a.pop(idx)\r\n else:\r\n idx += 1\r\nprint(x)\r\nprint(*a)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nresult = []\r\n\r\nfor i in range(n-1,-1,-1):\r\n if a[i] not in result:\r\n result.append(a[i])\r\n \r\nresult.reverse()\r\n\r\nprint(len(result))\r\nprint(\" \".join(str(x) for x in result))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nans=[]\r\nfor i in reversed(lst):\r\n if i not in ans:\r\n ans.append(i)\r\nprint(len(ans))\r\nfor i in reversed(ans):\r\n print(i,end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nunique_elements = set()\nresult = []\nfor i in range(n - 1, -1, -1):\n if a[i] not in unique_elements:\n unique_elements.add(a[i])\n result.append(a[i])\n\nresult.reverse()\nprint(len(result))\nprint(' '.join(map(str, result)))\n\n \t\t\t \t \t \t\t \t \t \t\t\t \t\t\t \t", "a=int(input())\r\ns=[int(i) for i in input().split()]\r\nd=[]\r\nfor i in range(a-1,-1,-1):\r\n if s[i] not in d:\r\n d.append(s[i])\r\nd.reverse()\r\nprint(len(d))\r\nprint(*d)", "input()\r\narray = [int(x) for x in input().split()]\r\narray.reverse()\r\narray = list(dict.fromkeys(array))\r\narray.reverse()\r\n\r\nprint(len(array))\r\n\r\nprint(\" \".join([str(x) for x in array]))", "len=int(input())\r\narr=list(map(int, input().split()))\r\nc = 0\r\nfor i in range(1, 1001) :\r\n if arr.count(i) :\r\n c+=1\r\nprint(c) \r\nnums = [] \r\nfor i in arr :\r\n nums.append(i)\r\n if arr.count(i)==nums.count(i) :\r\n print(i, end=' ') ", "a = input()\r\nb = input().split()\r\nb.reverse()\r\nc = []\r\nfor i in b:\r\n if i not in c:\r\n c.append(i)\r\nc.reverse()\r\nprint(len(c))\r\nprint(' '.join(c))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nj=n-1\r\nans=[]\r\nwhile j>=0:\r\n if lst[j] not in ans:\r\n ans.insert(0,lst[j])\r\n j-=1\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nunique_elements = set()\r\nunique_array = []\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] not in unique_elements:\r\n unique_elements.add(a[i])\r\n unique_array.append(a[i])\r\n\r\nunique_array.reverse()\r\n\r\nprint(len(unique_array))\r\nprint(' '.join(map(str, unique_array)))", "n = int(input())\r\na = list(map(int, input().split()))\r\npos = {}\r\nfor i in range(n):\r\n pos[a[i]] = i\r\n\r\nb = []\r\nfor k in pos:\r\n b.append(pos[k])\r\nb.sort()\r\nprint(len(b))\r\nfor i in range(len(b)):\r\n print(a[b[i]], end=' ')", "n = int(input())\r\na = [i for i in input().split()]\r\n\r\nanswer = []\r\n\r\nfor i in a[::-1]:\r\n if i not in answer:\r\n answer.append(i)\r\n\r\nprint(len(answer))\r\nprint(*answer[::-1])\r\n", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=[]\r\nf=[]\r\nl= len(b)-1\r\nwhile l>=0:\r\n if b[l] not in c:\r\n c.append(b[l])\r\n l-=1\r\nprint(len(c))\r\nprint(*c[::-1])", "input()\r\nx = []\r\nfor i in list(map(int,input().split()))[::-1]:\r\n if not i in x:\r\n x.append(i)\r\nprint(len(x))\r\nprint(*x[::-1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nlastOcc = dict()\r\nfor i in range(len(arr)):\r\n lastOcc[arr[i]] = i\r\nans = []\r\nfor i in range(n):\r\n if(lastOcc[arr[i]] == i):\r\n ans.append(arr[i])\r\nprint(len(ans))\r\nprint(*ans)\r\n", "def st():return str(input())\r\ndef ls():return list(map(int, input().split()))\r\ndef mx(a):return max(a)\r\ndef it():return int(input())\r\ndef mn(a):return min(a)\r\ndef yes():return print('YES')\r\ndef no():return print('NO')\r\ndef pr(a):return print(a)\r\ndef prs(a):return print(str(a))\r\ndef mapa():return map(int, input().split())\r\n\r\nst()\r\na=[]\r\nx=mapa()\r\n\r\nfor i in x:\r\n\twhile i in a:\r\n\t a.remove(a[a.index(i)])\r\n\ta.append(i)\r\npr(len(a))\r\nprint(*a)", "from collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n\r\n\tn= int(input())\r\n\tarray = tuple(map(int,input().split()))\r\n\r\n\tmp = defaultdict(int)\r\n\tindex = []\r\n\r\n\tfor i in array[::-1]:\r\n\t\tif not mp[i]:\r\n\t\t\tindex.append(i)\r\n\t\t\tmp[i] = 1\r\n\r\n\tprint(len(index))\r\n\tprint(*index[::-1])", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nb=a[::-1]\r\nc=[]\r\nfor i in b:\r\n\tif i not in c:\r\n\t\tc.append(i)\r\nprint(len(c))\r\nprint(*c[::-1])", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-08-29 22:05:48\r\n:(\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\nfor x in a[::-1]:\r\n if x not in ans:\r\n ans.append(x)\r\nprint(len(ans))\r\nprint(*ans[::-1])\r\n", "'''\r\n████████████████████████████████████████████████████████████████████████████████████\r\n██████████████████████████████████████████████████████████████████████████████████████\r\n███████████████████████████▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓╬╬╬╬╬╬▓███████████████████████\r\n███████████████████████████▓███████▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓███▓▓▓▓█▓╬╬╬▓███████████████████████\r\n███████████████████████████████▓█████▓▓╬╬╬╬╬╬╬╬▓███▓╬╬╬╬╬╬╬▓╬╬▓███████████████████████\r\n████████████████████████████▓▓▓▓╬╬▓█████╬╬╬╬╬╬███▓╬╬╬╬╬╬╬╬╬╬╬╬╬███████████████████████\r\n███████████████████████████▓▓▓▓╬╬╬╬╬╬▓██╬╬╬╬╬╬▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n████████████████████████████▓▓▓╬╬╬╬╬╬╬▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n███████████████████████████▓█▓███████▓▓███▓╬╬╬╬╬╬▓███████▓╬╬╬╬▓███████████████████████\r\n████████████████████████████████████████▓█▓╬╬╬╬╬▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬███████████████████████\r\n███████████████████████████▓▓▓▓▓▓▓╬╬▓▓▓▓▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n████████████████████████████▓▓▓╬╬╬╬▓▓▓▓▓▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n███████████████████████████▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n█████████████████████████████▓▓▓▓▓▓▓▓█▓▓▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████\r\n█████████████████████████████▓▓▓▓▓▓▓██▓▓▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████████████████████\r\n█████████████████████████████▓▓▓▓▓████▓▓▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████████████████████\r\n████████████████████████████▓█▓▓▓▓██▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████████████████████\r\n████████████████████████████▓▓███▓▓▓▓▓▓▓██▓╬╬╬╬╬╬╬╬╬╬╬╬█▓╬▓╬╬▓████████████████████████\r\n█████████████████████████████▓███▓▓▓▓▓▓▓▓████▓▓╬╬╬╬╬╬╬█▓╬╬╬╬╬▓████████████████████████\r\n█████████████████████████████▓▓█▓███▓▓▓████╬▓█▓▓╬╬╬▓▓█▓╬╬╬╬╬╬█████████████████████████\r\n██████████████████████████████▓██▓███████▓╬╬╬▓▓╬▓▓██▓╬╬╬╬╬╬╬▓█████████████████████████\r\n███████████████████████████████▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬██████████████████████████\r\n███████████████████████████████▓▓██▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓██████████████████████████\r\n████████████████████████████████▓▓▓█████▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓███████████████████████████\r\n█████████████████████████████████▓▓▓█▓▓▓▓▓███▓╬╬╬╬╬╬╬╬╬╬╬▓████████████████████████████\r\n██████████████████████████████████▓▓▓█▓▓▓╬▓██╬╬╬╬╬╬╬╬╬╬╬▓█████████████████████████████\r\n███████████████████████████████████▓▓█▓▓▓▓███▓╬╬╬╬╬╬╬╬╬▓██████████████████████████████\r\n██████████████████████████████████████▓▓▓███▓▓╬╬╬╬╬╬╬╬████████████████████████████████\r\n███████████████████████████████████████▓▓▓██▓▓╬╬╬╬╬╬▓█████████████████████████████████\r\n██████████████████████████████████████████████████████████████████████████████████████\r\n'''\r\nn=int(input());l=list(map(int,input().split()));d=len(set(l));print(d)\r\ns=[]\r\nfor i in range(d):\r\n x=l[-1]\r\n s.append(x)\r\n while l.count(x)!=0:\r\n l.remove(x)\r\nfor i in s[::-1]: print(i,end=' ')", "class Solution:\n def deleteSameElement(self, numsList: list) -> list:\n res = []\n n = len(numsList)\n for i in range(n-1, -1, -1):\n if numsList[i] not in res:\n res.append(numsList[i])\n res.reverse()\n return res\n\nn = int(input())\nstr_in = input()\nnumsList = [int(n) for n in str_in.split(\" \")]\ns = Solution()\nres = s.deleteSameElement(numsList)\nprint(len(res))\nprint(\" \".join(str(i) for i in res))\n\t \t\t\t\t \t \t \t\t \t \t\t\t\t\t\t\t\t\t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nA.reverse()\r\nseen = set()\r\nans = []\r\nfor a in A:\r\n if a in seen:\r\n continue\r\n seen.add(a)\r\n ans.append(a)\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans[::-1])))\r\n", "input()\na = []\nfor x in reversed(list(map(int, input().split()))):\n if x not in a:\n a.append(x)\nprint(len(a))\nprint(*reversed(a))\n", "def solve():\r\n n = int(input())\r\n a = list(set(list(map(int,input().split()))[::-1]))[::-1]\r\n print(len(a))\r\n return a\r\nprint(*solve())", "input()\na = list(map(int, input().split()))\nb = []\ns = set()\nfor n in reversed(a):\n if n not in s:\n s.add(n)\n b.append(n)\nprint(len(b))\nprint(*reversed(b))\n", "n = int(input())\na = list(map(int, input().split()))\nresult = []\n\nfor num in a[::-1]:\n if num not in result:\n result.append(num)\n\nprint(len(result))\nprint(*result[::-1])\n", "\r\ndef getint():\r\n return [int(i) for i in input().split()]\r\ndef get():\r\n return int(input())\r\ndef getstr():\r\n return [i for i in input().split()]\r\ndef S():\r\n for test in range(int(input())):\r\n solve()\r\nimport math\r\nimport itertools as it\r\nimport bisect\r\nimport time\r\nimport collections as ct\r\n\r\ndef lower_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef upper_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<=x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef solve():\r\n n=get()\r\n\r\n\r\n\r\nn=get()\r\na=getint()\r\ndic={}\r\nfor i in a:\r\n dic[i]=0\r\nfor i in a:\r\n dic[i]+=1\r\nans=[]\r\nfor i in range(n):\r\n if dic[a[i]]==1:\r\n ans.append(a[i])\r\n else:\r\n dic[a[i]]-=1\r\nprint(len(ans))\r\nprint(*ans)\r\n", "s = int(input())\r\nsomething = [int(x) for x in input().split()][::-1]\r\nkl = set()\r\nk = 0\r\nanswer = []\r\nfor i in something:\r\n if i not in kl:\r\n kl.add(i)\r\n answer.append(i)\r\n k += 1\r\nprint(k)\r\nprint(*answer[::-1])", "k=int(input())\r\nl=[int(i) for i in input().split()]\r\np=[]\r\ns=set(l)\r\nle=len(s)\r\nfor i in l[::-1]:\r\n \r\n if i not in p:\r\n p.append(i)\r\nprint(le)\r\nfor i in p[::-1]:\r\n print(i,end=\" \")\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\na=a[::-1]\r\ns=[]\r\nfor i in range(n):\r\n if a[i] not in s:\r\n s.append(a[i])\r\ns=s[::-1]\r\nprint(len(s))\r\nfor i in range(len(s)):\r\n print(s[i],end=' ')\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = {}\r\ncnt = 0\r\nres = []\r\na = a[::-1]\r\nfor i in a:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n cnt +=1\r\n\r\nprint(cnt)\r\nfor k,v in d.items():\r\n res.append(k)\r\nfor i in range(len(res)-1,-1,-1):\r\n print(res[i],end =\" \")\r\n ", "input()\r\nt = []\r\nfor q in input().split()[::-1]:\r\n if q not in t: t = [q] + t\r\nprint(len(t), *t)", "input()\r\nsequencia = list(map(int, input().split()))\r\nelementos_filtrados = set()\r\nconta_elementos_filtrados = 0\r\nresultado = \"\"\r\n\r\nfor i in range(len(sequencia) - 1, -1, -1):\r\n if not sequencia[i] in elementos_filtrados:\r\n elementos_filtrados.add(sequencia[i])\r\n conta_elementos_filtrados += 1\r\n\r\n if i == len(sequencia) - 1:\r\n resultado = str(sequencia[i]) + resultado\r\n else:\r\n resultado = str(sequencia[i]) + \" \" + resultado\r\n\r\nprint(conta_elementos_filtrados)\r\nprint(resultado)\r\n", "# num1=int(input())\r\n# num2=int(input())\r\n# act=input()\r\n# if act==\"*\":\r\n# print(num1*num2)\r\n# elif act==\"+\":\r\n# print(num1+num2)\r\n# elif act==\"-\": \r\n# print(num1-num2)\r\n# elif act==\"/\":\r\n# print(num1/num2)\r\n# elif act==\"//\":\r\n# print(num1//num2)\r\n\r\n# for i in range(500,1501):\r\n# print(i)\r\n\r\n# a=int(input())\r\n# if int((str(a))[-1])==8:\r\n# print(\"ok\")\r\n# else:\r\n# print(\"not ok\")\r\n\r\n# b=int(input())\r\n# fact=1\r\n# for i in range(1,b+1):\r\n# fact*=i\r\n# print(fact)\r\n\r\n# c=input()\r\n# max=0\r\n# for i in c:\r\n# if int(i)>max:\r\n# max=i\r\n# print(max)\r\n\r\n# d=input()\r\n# a=[]\r\n# for i in range(len(d)):\r\n# a.append(d[-i])\r\n# print(a)\r\n\r\n# x=0\r\n# while x<=1000:\r\n# if x%4==0 and x%7!=0:\r\n# print(x)\r\n# x+=1\r\n\r\n\r\n# for i in range(1001):\r\n# if i%4==0 and i%7!=0:\r\n# print(i)\r\n# i+=1\r\n\r\n# s=input()\r\n# if \"y\" in s and \"e\" in s and \"s\" in s:\r\n# print(\"ok\")\r\n# else:\r\n# print(\"not ok\")\r\n\r\n# b=int(input())\r\n# fact=0\r\n# for i in range(3):\r\n# fact+=b%10\r\n# b//=10\r\n# print(fact)\r\n\r\n# x=int(input())\r\n# a=[]\r\n\r\n# c=\"\"\r\n# while x>0:\r\n# a.append(x%2)\r\n# x//=2\r\n# print(a)\r\n# b=len(a)-1\r\n# while b>=0:\r\n# c+=str(a[b])\r\n# b-=1\r\n# print(c)\r\n\r\n# a=input()\r\n# b=len(a)-1\r\n# c=\"\"\r\n# while b>=0:\r\n# c+=a[b]\r\n# b-=1\r\n# if a==c:\r\n# print(\"ok\")\r\n# else:\r\n# print(\"not ok\")\r\n\r\n# a=[13,14,11, 56, 4, 5, 5]\r\n# b=0\r\n# for i in range(len(a)):\r\n# for j in range(i):\r\n# for l in range(j):\r\n# print(a[i], a[j], a[l])\r\n# for i in range(len(a)-1):\r\n# if a[i]*a[i+1]%5==0:\r\n# b+=1\r\n# print(b)\r\n\r\n\r\n# s=\"a7b2c3\"\r\n# b=0\r\n# for i in s:\r\n# if i.isdigit():\r\n# b+=int(i)\r\n# print(b)\r\n\r\n\r\n\r\n# a=\"L532ooKOOOJG67\"\r\n# u=0\r\n# for i in a:\r\n# if i.isupper():\r\n# u+=1\r\n# if u%2==0:\r\n# print(\"boy\")\r\n# else:\r\n# print(\"girl\")\r\n\r\n# a=1950\r\n# b=728\r\n# while a+b>1000:\r\n# a-=2\r\n# b-=20\r\n# print(a,b)\r\n\r\n# n=27\r\n# b=0\r\n# while n>0:\r\n# if n%3==0:\r\n# b+=1\r\n# n//=3\r\n# print(b)\r\n\r\n# n=int(input())\r\n# b=0\r\n# for i in range(n):\r\n# b+=int(input())\r\n# print(b/n)\r\n\r\n\r\n# a=[0,-432,-5,-29, 12]\r\n# max1=a[0]\r\n# max2=a[1]\r\n# max3=a[2]\r\n# max1=max(a[0], a[1], a[2])\r\n# max3=min(a[0], a[1], a[2])\r\n# for i in range(3):\r\n# if max1>i>max3:\r\n# max2=i\r\n\r\n# for i in a:\r\n# if i>max1:\r\n# max2=max1\r\n# max1=i\r\n# elif i<max1 and max2<i:\r\n# max2=i\r\n# elif i<max3 and i<max2 and max1:\r\n# max3=i\r\n# print(max1, max2, max3)\r\n\r\n# s=[-12,-10,-1,-3,5,13]\r\n# b=s[0]\r\n# for i in s:\r\n# if i%2==0:\r\n# if b<i:\r\n# b=i\r\n \r\n# if b!=-s[0]:\r\n# print(b)\r\n# else:\r\n# print(-1)\r\n\r\n# for _ in range(int(input())):\r\n# a,b,c = [int(i) for i in input().split(\" \")]\r\n# d=[a,b,c]\r\n# if d[0]+d[1]==d[2]:\r\n# print(\"YES\")\r\n# elif d[0]+d[2]==d[1]:\r\n# print(\"YES\")\r\n# elif d[2]+d[1]==d[0]:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"no\")\r\n\r\n\r\n# s=input()\r\n# l=0\r\n# u=0\r\n# for i in s:\r\n# if i.islower():\r\n# l+=1\r\n# else:\r\n# u+=1\r\n# if l>u or l==u:\r\n# s=s.lower()\r\n# else:\r\n# s=s.upper()\r\n# print(s)\r\n\r\n# w=int(input())\r\n# if w%2==0:\r\n# if (w//2):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\") \r\n# else:\r\n# print(\"NO\") \r\n\r\n# s=input()\r\n# s2=input()\r\n# d={}\r\n# d2={}\r\n# for i in s:\r\n# if i not in d:\r\n# d[i]=0\r\n# d[i]+=1\r\n# for j in s2:\r\n# if j not in d2:\r\n# d2[j]=0\r\n# d2[j]+=1 \r\n# if d==d2:\r\n# print(\"yes\")\r\n# else:\r\n# print(\"no\")\r\n# print(d,d2)\r\n\r\n# n=1000000000000000000\r\n# m=1\r\n# b=100\r\n# c=0\r\n# d=n\r\n# while n>0:\r\n# if c%2==0:\r\n# n-=m\r\n# c+=1\r\n# else:\r\n# n-=b\r\n# c+=1\r\n\r\n# print(c)\r\n\r\n\r\n# s=\"AAAAAAAAAVVVEEEQQQAAAAAFFFGGGG\"\r\n# max1=0\r\n# count=0\r\n# for i in s:\r\n# if i==\"A\":\r\n# count+=1\r\n# max1=max(count, max1)\r\n# else:\r\n# count=0\r\n# print(max1)\r\n\r\n# s=[2,6,9,10,12,15,17]\r\n# k=22\r\n# for i in range(len(s)):\r\n# for j in range(i+1, len(s)):\r\n# print(s[i],s[j])\r\n# l=0\r\n# r=len(s)-1\r\n# res1=0\r\n# res2=0\r\n# while res1==0:\r\n# if s[r]+s[l]>k:\r\n# r-=1\r\n# elif s[r]+s[l]<k:\r\n# l+=1\r\n# elif s[r]+s[l]==k:\r\n# res1=r \r\n# res2=l\r\n# print(res2,res1)\r\n\r\n# s=\"adaada\"\r\n# a=0\r\n# d=0\r\n# for i in s:\r\n# if i==\"a\":\r\n# a+=1\r\n# else:\r\n# d+=1\r\n# if d>a:\r\n# print(\"d\")\r\n# else:\r\n# print(\"a\")\r\n\r\n\r\n# x=0\r\n# n=int(input())\r\n# for i in range(n):\r\n# a=input()\r\n# for i in a:\r\n# if i==\"+\":\r\n# x+=0.5\r\n# elif i==\"-\":\r\n# x-=0.5\r\n# print(int(x))\r\n\r\n# n=int(input())\r\n# a=[]\r\n# res=\"\"\r\n# for i in range(n):\r\n# s=input()\r\n# if len(s)>10:\r\n# res=s[0]+str(len(s)-2)+s[-1]\r\n# a.append(res)\r\n# else:\r\n# a.append(s)\r\n# for i in a:\r\n# print(i)\r\n\r\n\r\n# s=input()\r\n# t=input()\r\n# y=len(s)-1\r\n# r=\"\"\r\n# while y>=0:\r\n# r+=s[y]\r\n# y-=1\r\n# if t==r:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# n=int(input())\r\n# res=[]\r\n# for i in range(n):\r\n# a=input()\r\n# if a.upper()==\"YES\":\r\n# res.append(\"YES\")\r\n# else:\r\n# res.append(\"NO\")\r\n# for i in res:\r\n# print(i)\r\n\r\n# l, b=[int(i) for i in input().split(\" \")]\r\n# x=[int(i) for i in input().split(\" \")]\r\n# y=[int(j) for j in input().split(\" \")]\r\n# x.append(1000000000)\r\n# y.append(1000000000)\r\n# c=[]\r\n# k=0\r\n# a=0\r\n# while len(c)<len(x)+len(y)-2:\r\n# if x[k]<y[a]:\r\n# c.append(x[k])\r\n# k+=1\r\n# else:\r\n# c.append(y[a])\r\n# a+=1\r\n# q=[str(i) for i in c]\r\n# print(\" \".join(q))\r\n\r\n# n=int(input())\r\n# b=[]\r\n# d=0\r\n# res=True\r\n# h1=[]\r\n# h2=[]\r\n# for i in range(n):\r\n# a=input()\r\n# if len(a)%2==0:\r\n# c=len(a)//2\r\n# for i in range(c):\r\n# if a[0:c]==a[c:len(a)]:\r\n# res=True\r\n# else:\r\n# res=False\r\n# else:\r\n# res=False\r\n# if res:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n \r\n# def st(n,n2):\r\n# res=1\r\n# while n2>0:\r\n# res*=n\r\n# n2-=1\r\n# return(res)\r\n\r\n\r\n# def a(n):\r\n# res=0\r\n# for i in range(1, n+1):\r\n# if n%i==0:\r\n# res+=1\r\n# if res>2:\r\n# return False\r\n# else:\r\n# return True\r\n\r\n# print(a(24))\r\n\r\n\r\n# j={\"T\":1,\"i\":1, \"m\":1, \"u\":1, \"r\":1}\r\n# a=int(input())\r\n# for i in range(a):\r\n# l=int(input())\r\n# s=input()\r\n# sl={}\r\n# if l!=5:\r\n# res=\"NO\"\r\n# else:\r\n# for i in s:\r\n# sl[i]=0\r\n# sl[i]+=1\r\n# if j==sl:\r\n# res=\"YES\"\r\n# else:\r\n# res=\"NO\"\r\n# print(res)\r\n\r\n# n=int(input())\r\n# for i in range(n):\r\n# r=0\r\n# r2=0\r\n# a=int(input())\r\n# b=input()\r\n# b2=input()\r\n# for i in range(a):\r\n# if (b[i]==b2[i]==\"R\") or (b[i]==\"B\" and b2[i]==\"G\") or (b[i]==b2[i]==\"G\") or (b[i]==b2[i]==\"B\") or (b[i]==\"G\" and b2[i]==\"B\"):\r\n# res=\"YES\"\r\n# else:\r\n# res=\"NO\"\r\n# break\r\n# print(res)\r\n\r\n# n=int(input())\r\n# for i in range(n):\r\n# a=int(input())\r\n# s1=input().split()\r\n# s2=input().split()\r\n# s3=input().split()\r\n# sl1={}\r\n# sl2={}\r\n# sl3={}\r\n# for i in range(a):\r\n# sl1[s1[i]]=1\r\n# sl2[s2[i]]=1\r\n# sl3[s3[i]]=1\r\n# for i in range(len(sl1)):\r\n# if i not in sl1 and i not in sl2:\r\n \r\n# t=int(input())\r\n\r\n# for i in range(t):\r\n# res=\"\"\r\n# a=input()\r\n# # res+=a[0:len(a):2]\r\n# for i in range(len(a)):\r\n# if i==0 or i==len(a):\r\n# res+=a[i]\r\n# elif i%2!=0:\r\n# res+=a[i]\r\n# print(res)\r\n\r\n# t=int(input())\r\n# for i in range(t):\r\n# s=\"Yes\"*50\r\n# x=input()\r\n# if x in s:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# t=int(input())\r\n# for i in range(t):\r\n# res1=0\r\n# res2=0\r\n# a=int(input())\r\n# for i in range(3):\r\n# res2+=a%10\r\n# a//=10\r\n# for i in range(3):\r\n# res1+=a%10\r\n# a//=10\r\n\r\n# if res1==res2:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# l=0\r\n# r=len(s)-1\r\n# res1=0\r\n# res2=0\r\n# while res1==0:\r\n# if s[r]+s[l]>k:\r\n# r-=1\r\n# elif s[r]+s[l]<k:\r\n# l+=1\r\n# elif s[r]+s[l]==k:\r\n# res1=r \r\n# res2=l\r\n# print(res2,res1)\r\n\r\n# m, n=[int(i) for i in input().split(\" \")]\r\n# s1=input().split()\r\n# s2=input().split()\r\n# a=0\r\n# l=0\r\n# k=0\r\n# res=[]\r\n# s1.append(10000000000)\r\n\r\n# while len(res)!=len(s2):\r\n# if int(s1[l])<int(s2[k]):\r\n# a+=1\r\n# l+=1\r\n# else:\r\n# k+=1\r\n# res.append(a)\r\n# print(*res)\r\n\r\n# n=10000452\r\n# a=0\r\n# while n>0:\r\n# if n%10==4 or n%10==7:\r\n# a+=1\r\n# n//=10\r\n \r\n# if a==7 or a==4 or a==47 or a==74:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# s=[3,2,1,18,15,-9,1]\r\n# a={}\r\n# for i in s:\r\n# if i not in a:\r\n# a[i]=0\r\n# a[i]+=1\r\n\r\n# for i in s:\r\n# if a[i]>1:\r\n# res=True\r\n# break\r\n# else:\r\n# res=False\r\n# print(a)\r\n\r\n# if res:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n#s=[int(i) for i in input().split()]\r\n# nk=input()\r\n# # s1=input().split(\" \")\r\n# # s2=input().split()\r\n# s1=input().split()\r\n# s2=input().split()\r\n\r\n\r\n# while b<10:\r\n# a=(l+r)//2\r\n# if s2[b]==s1[a]:\r\n# print(\"YES\")\r\n# b+=1\r\n# r=len(s1)-1\r\n# l=0 \r\n# elif r<=l+1:\r\n# print(\"NO\")\r\n# b+=1\r\n# r=len(s1)-1\r\n# l=0 \r\n# elif s2[b]>s1[a]:\r\n# l=a\r\n# elif s2[b]<s1[a]:\r\n# r=a\r\n\r\n# def bin(s, f):\r\n# f=int(f)\r\n# l=0\r\n# r=len(s)-1\r\n# a=(l+r)//2\r\n# while s[a]!=f:\r\n# a=(l+r)//2\r\n# if f==int(s[a]):\r\n# print(\"YES\")\r\n# break\r\n# elif r<=l:\r\n# print(\"NO\")\r\n# break\r\n# elif f>int(s[a]):\r\n# l=a+1\r\n# elif f<int(s[a]):\r\n# r=a-1\r\n \r\n# for i in s2:\r\n# bin(s1, i)\r\n\r\n# n=\"1234\"\r\n\r\n# a=0\r\n# for i in range(len(n)-1):\r\n# for j in range(i+1, len(n)):\r\n# print(n[i]+n[j])\r\n# if int(n[i]+n[j])%3==0:\r\n# a+=1\r\n# print(a)\r\n\r\n# n=1024\r\n# while n>2:\r\n# if n**0.5==2:\r\n# print(\"YES\")\r\n# break\r\n# elif n**0.5!=2:\r\n# if n%2==0:\r\n# n/=2\r\n# else:\r\n# print(\"NO\")\r\n# break\r\n\r\n# b=0\r\n# n=1\r\n# maxx=0\r\n# max2=0\r\n# while n!=0:\r\n# n=int(input())\r\n# b+=1\r\n# if n>maxx:\r\n# max2=maxx\r\n# maxx=n\r\n# elif n>maxx and max2<n:\r\n# max2=n\r\n# print(maxx, max2)\r\n\r\n# s=\"fgf fhaug hsugffsa\".split()\r\n# maxx=0\r\n# for i in s:\r\n# if len(i)>maxx:\r\n# maxx=len(i)\r\n# res=i\r\n# print(i)\r\n\r\na=[1,2,8,3,6,8,6]\r\n# for i in range(len(s)-1):\r\n# if s[i]<s[i+1]:\r\n# print(s[i+1])\r\n\r\n# s={}\r\n# b=0\r\n# for i in a:\r\n# if i not in s:\r\n# s[i]=0\r\n# s[i]+=1\r\n# for i in s:\r\n# if s[i]<2:\r\n# b+=1\r\n# print(b)\r\n# b=[]\r\n# c=0\r\n# while c<len(a)-1:\r\n# if c%2==0:\r\n# b.append(a[c+1])\r\n# b.append(a[c])\r\n# c+=1\r\n# if len(a)%2!=0:\r\n# b.append(a[-1])\r\n\r\n# print(b)\r\n\r\n\r\n# b=[3,2,1]\r\n# b[0],b[1]=b[1],b[0]\r\n# print(b)\r\n\r\n# b=0\r\n# j=1\r\n# s=[1,2,2,2,2,3,3,4,4,5,6]\r\n# c=[]\r\n\r\n# for i in s:\r\n# if s.count(i)<2:\r\n# b+=1\r\n# print(b)\r\n\r\n# x=7835465856385693765925692\r\n# b=0\r\n# while x>0:\r\n# if x%12==10:\r\n# b+=1\r\n# x//=12\r\n# print(b)\r\n\r\nn=int(input())\r\nx=input().split()\r\nres=[]\r\nres2=[]\r\n\r\nfor i in reversed(range(len(x))):\r\n if x[i] not in res:\r\n res.append(x[i])\r\n\r\nprint(len(res))\r\nprint(*res[::-1])\r\n", "n = int(input())\r\na = [x for x in input().split()]\r\nb = []\r\ni = n - 1\r\nwhile i >= 0:\r\n if a[i] not in b:\r\n b.append(a[i])\r\n i -= 1\r\n\r\nb.reverse()\r\n\r\nprint(len(b))\r\nprint(*b)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = []\r\nfor i in range(a - 1, -1, -1):\r\n if b[i] not in c:\r\n c = [b[i]] + c\r\nprint(len(c))\r\nprint(*c)", "if __name__ == '__main__':\r\n a = int(input())\r\n li = list(map(int, input().split()))\r\n dic = {}\r\n for i in range(a):\r\n dic[li[i]] = dic.get(li[i], 0) + 1\r\n\r\n li2 = []\r\n for i in range(a-1, -1, -1):\r\n x = li[i]\r\n if dic[x] != -1:\r\n li2.append(x)\r\n dic[x] = -1\r\n\r\n print(len(dic))\r\n li2.reverse()\r\n print(*li2)\r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nans =[]\r\nli.reverse()\r\nfor i in li:\r\n if i not in ans:\r\n ans.append(i)\r\nans.reverse()\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nunique = []\r\nfor i in range(n-1, -1, -1):\r\n if a[i] not in unique:\r\n unique.append(a[i])\r\nunique.reverse()\r\n\r\nprint(len(unique))\r\nprint(' '.join(map(str, unique)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n if((str(l[n-1-i])) not in a):\r\n a.append(str(l[n-1-i]))\r\n\r\na.reverse()\r\nch=' '.join(a)\r\nprint(len(a))\r\nprint(ch)\r\n ", "num=int(input())\r\na=[int(a) for a in input().split()]\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if(a[i]==a[j]):\r\n a[i]=0\r\n num=num-1\r\n break\r\n \r\nprint(num)\r\nfor i in range(0,len(a)):\r\n if(a[i]!=0):\r\n print(a[i], end=\" \")\r\n", "# what i need to do is :\r\n# input size and array \r\n# loop through the array and while each element has bigger than 1 repetition (has duplicates) \r\n# remove the first occurrence of that duplicate until the last of it remains in the array\r\n\r\nsiz=input()\r\narr=list(map(int,input().split()))\r\nuniquest=set(arr)\r\nfor i in uniquest:\r\n while arr.count(i)>1:\r\n arr.remove(i)\r\n \r\nprint(len(arr))\r\nprint(*arr, sep=\" \") \r\n ", "n=int(input()) # length of list\r\na = list(map(int, input().split())) #taking input\r\nb=[]\r\nfor i in a[::-1]:\r\n if i in b:\r\n del a[a.index(i)]\r\n else:\r\n b.append(i)\r\n\r\nprint(len(a))\r\nfor j in a:\r\n print(j,end=\" \")", "n = int(input(''))\r\na = input('')\r\na = a.split(' ')\r\nnr = []\r\nfor i in range(1, len(a)+1):\r\n if a[-i] not in nr:\r\n nr.append(a[-i])\r\nprint(len(nr))\r\nfor j in range(1, len(nr)+1):\r\n print(nr[-j], end = ' ')", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range(1,n+1):\r\n if a[-i] not in b:\r\n b.append(a[-i])\r\nb.reverse()\r\nprint(len(b))\r\nprint(*b)", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-08-29 20:02:14\r\n:(\r\n'''\r\nimport sys\r\nfrom collections import *\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmp = Counter()\r\nans = []\r\nfor x in a[::-1]:\r\n if mp[x]:\r\n continue\r\n ans.append(x)\r\n mp[x] = 1\r\nprint(len(ans))\r\nprint(*ans[::-1])\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nd=[];ans=0\r\nc='';i=len(b)-1\r\nwhile 1:\r\n if i<0:\r\n break\r\n if b[i] not in d:\r\n d.append(b[i])\r\n ans+=1\r\n i-=1\r\nj=len(d)-1\r\nwhile 1:\r\n if j<0:\r\n break\r\n c=c+str(d[j])+' '\r\n j-=1\r\nprint(ans)\r\nprint(c)", "input();l = list(map(int,input().split()));a = list(x for i,x in enumerate(l) if x not in l[i+1:]);print(len(a),*a)", "n = int(input())\r\n\r\narr = input()\r\narr = arr.split(\" \")\r\n\r\nnewArr = set(arr)\r\n\r\nnewArr2 = arr[:]\r\n\r\nnewArr2.reverse()\r\n\r\nindexx = {}\r\nindexxArr = []\r\nfor item in newArr:\r\n indexxArr.append(n - newArr2.index(item))\r\n indexx[n - newArr2.index(item)] = item\r\n\r\nindexxArr.sort()\r\n\r\nans = []\r\nfor key in indexxArr:\r\n ans.append(indexx[key])\r\nprint(len(ans))\r\nprint(\" \".join(ans))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set()\r\nq=[]\r\na=a[::-1]\r\nfor i in range(n):\r\n if a[i] not in s:\r\n s.add(a[i])\r\n q.append(a[i])\r\nprint(len(q))\r\nprint(*q[::-1])", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\nans = []\r\n\r\nfor ind,num in enumerate(arr):\r\n if arr.count(num) == 1:\r\n ans.append(num)\r\n else:\r\n rev = arr.copy() \r\n rev.reverse() \r\n index = len(arr) - rev.index(num) - 1\r\n if ind == index:\r\n ans.append(num)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in a:\r\n if str(i) not in ans:\r\n ans.append(str(i))\r\n else:\r\n ans.remove(str(i))\r\n ans.append(str(i))\r\n\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n", "n = int(input())\r\nli = list(map(int, input().split()))[::-1]\r\n\r\nfound = set()\r\n\r\nans = []\r\nfor i in range(n):\r\n if li[i] not in found:\r\n ans.append(li[i])\r\n found.add(li[i])\r\n\r\nprint(len(ans))\r\nprint(*ans[::-1])", "n = int(input())\r\ns = set()\r\na = list(map(int, input().split(' ')))[::-1]\r\nfor i in range(n):\r\n if a[i] in s:\r\n a[i] = None\r\n else:\r\n s.add(a[i])\r\na = [i for i in a if i]\r\nprint(len(a))\r\nprint(*a[::-1])\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns=s[::-1]\r\np=list(set(s))\r\ns2=[]\r\ni=0\r\nwhile len(s2)!=len(p):\r\n if s[i]in p and s[i] not in s2:\r\n s2.append(s[i])\r\n i+=1\r\nprint(len(p))\r\nprint(*s2[::-1])", "x = int(input())\nlista = list(map(int, input().split()))\n\ncharacter_used = []\nfor i in range(len(lista) - 1, -1, -1):\n if lista[i] in character_used:\n lista.pop(i)\n else:\n character_used.append(lista[i])\n\nprint(len(character_used))\nfor i in lista:\n print(i, end=\" \")\n \t\t\t \t\t \t \t\t\t \t\t\t\t\t\t\t \t \t", "from sys import stdin, setrecursionlimit, stdout\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n mas = [int(s) for s in stdin.readline().split()]\r\n ans_s = set()\r\n ans = []\r\n\r\n for i in range(n-1, -1, -1):\r\n if mas[i] not in ans_s:\r\n ans.append(mas[i])\r\n ans_s.add(mas[i])\r\n\r\n print(len(ans))\r\n print(' '.join(str(s) for s in ans[::-1]))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "intt = int(input())\r\nlistt = list(map(int, input().split()))\r\nsett = set(listt[::-1])\r\nlistt = list(sett)\r\nprint(len(sett))\r\nfor i in reversed(listt):\r\n print(i, sep=\"\", end=\" \")", "a = int(input())\r\nn = list(map(int,input().split()))\r\nn.reverse()\r\nn1 = []\r\nfor i in range(a):\r\n if n[i] in n1:\r\n continue\r\n n1.append(n[i])\r\nprint(len(n1))\r\nn1.reverse()\r\nprint(*n1)", "n = int(input())\r\n\r\nlist1 = list(map(int, input().split()))\r\nlist2 = list1.copy()\r\n\r\n\r\n\r\nfor x in list1:\r\n if list2.count(x) > 1:\r\n list2.remove(x)\r\n \r\nprint(len(list2))\r\n\r\nfor x in list2:\r\n print(x, end = \" \")", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nsol = []\r\n\r\nfor y in reversed(lst):\r\n if y not in sol:\r\n sol.insert(0, y)\r\n \r\n \r\n\r\nprint(len(sol))\r\nprint(*sol)", "import sys\r\ninput = sys.stdin.buffer.readline\r\nn = int(input())\r\nres = []\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i] in a[i+1:]:\r\n continue\r\n else:\r\n if a[i] not in res:\r\n res.append(a[i])\r\n else:\r\n continue\r\nprint(len(res))\r\nprint(*res)", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\na = gets(int)\nb = []\nfor i in range(n):\n if a[i] not in a[i + 1:]:\n b.append(a[i])\nprint(len(b))\nprint(*b)\n", "n= int(input())\r\na = input().split()[::-1]\r\n \r\nprint(len(set(a)))\r\nprint(*sorted(set(a), key=a.index, reverse=True))", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(lambda : 0)\r\nfor i in a:\r\n d[i] = 1\r\nans = []\r\nfor i in a[::-1]:\r\n if d[i] == 1:\r\n ans.append(i)\r\n d[i] = 0\r\nprint(len(ans))\r\nfor i in ans[::-1]:\r\n print(i, end = \" \")\r\nprint()", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nfor i in l:\r\n if(i in d):\r\n d[i]+=1\r\n else:\r\n d[i] = 1\r\nfor i in d:\r\n while(d[i]!=1):\r\n if(i in l):\r\n l.remove(i)\r\n d[i]-=1\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = set(a)\r\nli = []\r\nfor i in range(len(a)-1, -1, -1):\r\n if a[i] in li:\r\n continue\r\n else:\r\n li.append(a[i])\r\n\r\nli.reverse()\r\nprint(len(li))\r\nprint(*li)", "n=int(input())\r\ns=list(map(int,input().split()))[::-1]\r\ng=[]\r\nfor i in s:\r\n if i not in g:\r\n g.append(i)\r\nprint(len(g))\r\nprint(*g[::-1])", "n=input()\r\nl=input().split()[::-1]\r\nprint(len(set(l)))\r\nprint(*sorted(set(l),key=l.index,reverse=True))", "n=int(input())\r\nk=list(map(int,input().split()))\r\nk.reverse()\r\np=list(dict.fromkeys(k))\r\np.reverse()\r\nmy_str=' '.join(map(str,p))\r\nprint(len(p))\r\nprint(my_str)", "n = int(input())\r\ns = list(map(int,input().split()))\r\ns.reverse()\r\ns2=[]\r\nfor i in s :\r\n if i not in s2:\r\n s2.append(i)\r\ns2.reverse()\r\nprint(len(s2))\r\nprint(*s2)\r\n \r\n \r\n \r\n", "n=int(input())\r\ns=list()\r\nsp=list(map(int,input().split()))\r\nsp.reverse()\r\nfor i in sp:\r\n if i not in s:\r\n s.append(i)\r\ns.reverse()\r\nprint(len(s))\r\nfor i in s:\r\n print(i, end = ' ')\r\n", "length = int(input())\r\nuser = list(map(int, input().split()))\r\ncheck = []\r\n\r\nfor i in range(length - 1, -1, -1):\r\n if user[i] not in check:\r\n check.append(user[i])\r\n\r\ncheck = check[::-1]\r\nprint(len(check))\r\ncheck=\" \".join(map(str,check))\r\nprint(check)\r\n", "no_inputs = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nunique_nums = []\r\nfor num in nums[::-1]:\r\n if num not in unique_nums:\r\n unique_nums.append(num)\r\nprint(len(unique_nums))\r\nprint(\" \".join(str(item) for item in unique_nums[::-1]))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n):\r\n s=l[i+1:]\r\n if s.count(l[i])==0:\r\n k.append(l[i])\r\nprint(len(k))\r\np=' '.join(map(str,k))\r\nprint(p)\r\n ", "'''\nAuthor: Kolyanchick\nDate: 16-01-2023\n'''\n\n\nn = int(input())\na = list(map(int, input().split()))\nans1 = 0\nans2 = list()\nans = set()\nfor i in range(n - 1, -1, -1):\n if a[i] not in ans:\n ans.add(a[i])\n ans2 = [a[i]] + ans2\n ans1 += 1\nprint(ans1)\nprint(*ans2)", "t=int(input())\r\nl=[int(i) for i in input().split()]\r\nk=l[0:]\r\nfor i in range(t):\r\n if k.count(l[i])>1:\r\n k.remove(l[i])\r\nprint(len(k))\r\nfor i in k:\r\n print(i,end=\" \")", "input()\r\nres = []\r\nfor a in reversed(input().split()):\r\n if a not in res:\r\n res.append(a)\r\nprint(len(res))\r\nprint(*list(reversed(res)))", "n = int(input())\r\narr = list(map(int, input().split()))\r\na= []\r\nfor i in range(n-1, -1, -1):\r\n if arr[i] not in a:\r\n a.append(arr[i]) \r\nprint(len(a))\r\nprint(*a[::-1])", "ln = int(input())\nl_input = input().split(' ')\n\nl_input.reverse()\nl_fitlred = list(set(l_input))\nanswr = []\nexist = []\n\nfor i in l_input:\n if i not in exist:\n exist.append(i)\n answr.append(i)\n\nanswr.reverse()\nprint(len(l_fitlred))\nprint(*answr, sep=' ')\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nunique_elements = []\r\nfor i in range(n-1, -1, -1):\r\n if arr[i] not in unique_elements:\r\n unique_elements.append(arr[i])\r\n\r\nprint(len(unique_elements))\r\nprint(' '.join(map(str, unique_elements[::-1])))\r\n", "n = int(input())\r\ns = []\r\na = list(map(int, input().split()))\r\na.reverse()\r\nfor i in range(len(a)):\r\n if a[i] not in s:\r\n s.append(a[i])\r\nprint(len(s))\r\ns.reverse()\r\nprint(*s)", "num=int(input())\r\nnew=[]\r\nhelp=0\r\nx=[int(x) for x in input().split()]\r\nfor i in range(0,num):\r\n count=0\r\n for j in range(i,num):\r\n if(x[i]==x[j] and i!=j):\r\n count=1\r\n break\r\n if(count==0):\r\n help+=1\r\n new.append(x[i])\r\nprint(help) \r\nprint(*new, sep=\" \")", "a=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nl=l[::-1]\r\nm=[]\r\nfor i in l:\r\n if i not in m:\r\n m.append(i)\r\nprint(len(m))\r\nprint(*m[::-1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\n\r\ni = n - 1\r\nwhile i >= 0:\r\n if a[i] not in b:\r\n b.append(a[i])\r\n i -=1\r\n\r\nb.reverse()\r\n\r\nprint(len(b))\r\nprint(*b)# 1689786990.7404149", "n = int(input())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\nans = []\r\nfor i in a:\r\n if i not in ans:\r\n ans.append(i)\r\n \r\nprint(len(ans))\r\nprint(*ans[::-1])\r\n" ]

[ "from collections import defaultdict\r\ndef put(): return map(int, input().split())\r\n\r\ndef dfs():\r\n s = [(1,0)]\r\n ans = 0\r\n vis = [0]*(n+1)\r\n while s:\r\n i,p = s.pop()\r\n if vis[i]==0:\r\n vis[i]=1\r\n s.append((i,p))\r\n for j in tree[i]:\r\n if j!=p:\r\n s.append((j,i))\r\n elif vis[i]==1:\r\n vis[i]=2\r\n for j in tree[i]:\r\n if j != p:\r\n mark[i]+= mark[j]\r\n ans += min(mark[i], 2*k - mark[i])\r\n print(ans)\r\n \r\n\r\n\r\n\r\n\r\nn,k = put()\r\nl = list(put())\r\n\r\nedge = defaultdict()\r\ntree = [[] for i in range(n+1)]\r\nmark = [0]*(n+1)\r\nfor i in l:\r\n mark[i]=1\r\nfor _ in range(n-1):\r\n x,y = put()\r\n tree[x].append(y)\r\n tree[y].append(x)\r\ndfs()", "(n, k) = map(int, input().split())\ns = [0] * n\nfor i in map(int, input().split()):\n s[i - 1] = 1\ne = [[] for _ in range(n)]\nfor _ in range(n - 1):\n (x, y) = (int(s) - 1 for s in input().split())\n e[x].append(y)\n e[y].append(x)\nq = [0]\nfa = [-1] * n\nfa[0] = 0\nfor i in range(n):\n x = q[i]\n for y in e[x]:\n if fa[y] == -1:\n fa[y] = x\n q.append(y)\ndp = [0] * n\nk2 = k * 2\nfor x in reversed(q):\n for y in e[x]:\n if fa[y] == x:\n i = s[y]\n s[x] += i\n dp[x] += dp[y] + (k2 - i if i > k else i)\nprint(dp[0])\n\t \t \t\t\t \t\t\t\t\t\t\t\t \t\t \t\t\t", "# [https://codeforces.com/contest/700/submission/19421380]\r\n\r\n(n, k) = map(int, input().split())\r\ns = [0] * n\r\nfor i in map(int, input().split()):\r\n s[i - 1] = 1\r\ne = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n (x, y) = (int(s) - 1 for s in input().split())\r\n e[x].append(y)\r\n e[y].append(x)\r\nq = [0]\r\nfa = [-1] * n\r\nfa[0] = 0\r\nfor i in range(n):\r\n x = q[i]\r\n for y in e[x]:\r\n if fa[y] == -1:\r\n fa[y] = x\r\n q.append(y)\r\ndp = [0] * n\r\nk2 = k * 2\r\nfor x in reversed(q):\r\n for y in e[x]:\r\n if fa[y] == x:\r\n i = s[y]\r\n s[x] += i\r\n dp[x] += dp[y] + (k2 - i if i > k else i)\r\nprint(dp[0])", "def main():\n n, k = map(int, input().split())\n s = [0] * n\n for i in map(int, input().split()):\n s[i - 1] = 1\n e = [[] for _ in range(n)]\n for _ in range(n - 1):\n x, y = (int(s) - 1 for s in input().split())\n e[x].append(y)\n e[y].append(x)\n q, fa = [0], [-1] * n\n fa[0] = 0\n for i in range(n):\n x = q[i]\n for y in e[x]:\n if fa[y] == -1:\n fa[y] = x\n q.append(y)\n dp, k2 = [0] * n, k * 2\n for x in reversed(q):\n for y in e[x]:\n if fa[y] == x:\n i = s[y]\n s[x] += i\n dp[x] += dp[y] + (k2 - i if i > k else i)\n print(dp[0])\n\n\nif __name__ == \"__main__\":\n main()\n", "#parsea una línea\ndef parser():\n return [int(x) for x in input().split()]\n\n#Método usado para contar las universidades en cada subárbol\ndef DFS():\n visited[0]=True\n stack=[]\n introduction_order=[]\n stack.append(0)\n while len(stack)>0:\n v=stack.pop()\n for u in adjacents_list[v]:\n if not visited[u]:\n pi[u]=v\n visited[u]=True\n if university_in_city[u]:\n count_universities_subtree[u]+=1\n stack.append(u)\n introduction_order.append(u)\n \n #Recorriendo para saber la cantidad de universidades que hay en el subarbol de cada vertice\n for v in introduction_order[::-1]:\n count_universities_subtree[pi[v]]+=count_universities_subtree[v]\n\n#Recibiendo los valores de n y k\nn,k=parser()\n#visitados\nvisited=[False for x in range(n)]\n#padres\npi=[0 for x in range(n)]\n#universidades en el subarbol\ncount_universities_subtree=[0 for x in range(n)]\n#universidad en la ciudad\nuniversity_in_city=[False for x in range(n)]\n\n#Recibiendo las ciudades que tienen universidades\ncities_universities=parser()\nfor i in cities_universities:\n university_in_city[i-1]=True\n\n#Armando el árbol que representa a Treeland\nadjacents_list=[[] for x in range(n)]\nfor i in range(n-1):\n #Leyendo una arista\n edge=parser()\n adjacents_list[edge[0]-1].append(edge[1]-1)\n adjacents_list[edge[1]-1].append(edge[0]-1)\n\nDFS()\n\n#Calculando el total\ntotal=0\nfor i in range(1,n):\n total+=min(count_universities_subtree[i],2*k-count_universities_subtree[i])\n\n#Imprimiendo el resultado\nprint(total)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(n, U, G):\r\n k2 = len(U)\r\n g = [[] for i in range(n+1)]\r\n parent = [None for i in range(n+1)]\r\n splits = [0 for i in range(n+1)]\r\n u_status = [0 for i in range(n+1)]\r\n answer = 0\r\n for univ in U:\r\n u_status[univ] = 1\r\n for i in range(n-1):\r\n u, v = G[i]\r\n g[u].append(v)\r\n g[v].append(u)\r\n parent[1] = -1\r\n depths = [[1]]\r\n while True:\r\n next_s = []\r\n for x in depths[-1]:\r\n for y in g[x]:\r\n if parent[y] is None:\r\n parent[y] = x\r\n next_s.append(y)\r\n if len(next_s)==0:\r\n break\r\n depths.append(next_s)\r\n while len(depths) > 0:\r\n for x in depths[-1]:\r\n if u_status[x]==1:\r\n splits[x]+=1\r\n y = parent[x]\r\n if y != -1:\r\n splits[y]+=splits[x]\r\n depths.pop()\r\n for x in range(1, n+1):\r\n for y in g[x]:\r\n if parent[y]==x:\r\n c2 = splits[y]\r\n \"\"\"\r\n so \r\n x\r\n |\r\n y\r\n there are c2 univeristies at \r\n or below y\r\n and thus k2-c2 univeristies at or above x\r\n \r\n \"\"\"\r\n \r\n entry = min(c2, k2-c2)\r\n answer+=entry\r\n return answer\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nn, k = [int(x) for x in input().split()]\r\nU = [int(x) for x in input().split()]\r\nG = []\r\nfor i in range(n-1):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprint(process(n, U, G))", "def parser():\n return [int(x) for x in input().split(\" \")]\n\ndef DFS():\n visited[0]=True\n stack=[]\n intruduction_order=[]\n stack.append(0)\n while len(stack)>0:\n v=stack.pop()\n for u in adjacents_list[v]:\n if not visited[u]:\n pi[u]=v\n visited[u]=True\n if university_in_city[u]:\n count_universities_subtree[u]+=1\n stack.append(u)\n intruduction_order.append(u)\n for v in intruduction_order[::-1]:\n count_universities_subtree[pi[v]]+=count_universities_subtree[v]\n\n\nn,k=parser()\nvisited=[False for x in range(n)]\npi=[0 for x in range(n)]\ncount_universities_subtree=[0 for x in range(n)]\nuniversity_in_city=[False for x in range(n)]\n\ncities_universities=parser()\nfor i in range(2*k):\n university_in_city[cities_universities[i]-1]=True\n\nadjacents_list=[[] for x in range(n)]\nfor i in range(n-1):\n edge=parser()\n adjacents_list[edge[0]-1].append(edge[1]-1)\n adjacents_list[edge[1]-1].append(edge[0]-1)\n\nDFS()\n\ntotal=0\n\nfor i in range(1,n):\n total+=min(count_universities_subtree[i],2*k-count_universities_subtree[i])\n\nprint(total)" ]

[ "#!/usr/bin/pypy3\n\nfrom sys import stdin,stderr\nfrom collections import defaultdict\n\ndef readInts(): return map(int,stdin.readline().strip().split())\ndef print_err(*args,**kwargs): print(*args,file=stderr,**kwargs)\n \ndef dfs(n,g,b):\n s = [(1,0,1)]\n b_depth = 0\n parents = [ None for _ in range(n+1) ]\n while s:\n node,depth,pn = s.pop()\n parents[node] = pn\n if node==b:\n b_depth = depth\n break\n depth += 1\n for nn in g[node]:\n if nn == pn: continue\n s.append( (nn,depth,node) )\n \n anc_node = b\n for _ in range((b_depth-1)//2):\n anc_node = parents[anc_node]\n s = [(1,False,0,1)]\n best = 0\n while s:\n node,bd,depth,pn = s.pop()\n bd |= node==anc_node\n if bd and best < depth:\n best = depth\n depth += 1\n for nn in g[node]:\n if nn == pn: continue\n s.append( (nn,bd,depth,node) )\n return best\n\ndef run():\n n,x = readInts()\n g = defaultdict(list)\n for _ in range(n-1):\n a,b = readInts()\n g[a].append(b)\n g[b].append(a)\n print(dfs(n,g,x)*2)\n \nrun()\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,x=map(int,input().split())\r\nx-=1\r\nedge=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n a,b=map(lambda x:int(x)-1,input().split())\r\n edge[a].append(b)\r\n edge[b].append(a)\r\n\r\ndef dfs(r):\r\n dist=[0]*n\r\n todo=[(r,-1)]\r\n while todo:\r\n v,p=todo.pop()\r\n for u in edge[v]:\r\n if u!=p:\r\n todo.append((u,v))\r\n dist[u]=dist[v]+1\r\n return dist\r\n\r\ndist1=dfs(0)\r\ndist2=dfs(x)\r\n\r\nans=0\r\nfor i in range(n):\r\n if dist1[i]>dist2[i]:\r\n ans=max(ans,dist1[i]*2)\r\n\r\nprint(ans) ", "\"\"\"INPUT TEMPLATE - I copy paste this part to the top of every solution\"\"\"\nimport sys\nfrom collections import deque\n\ntoks = (tok for tok in sys.stdin.read().split())\n\"\"\"END OF TEMPLATE\"\"\"\n\n# Read in the input:\nN = int(next(toks))\nX = int(next(toks))-1\n\nadj = [[] for _ in range(N)]\n\nfor _ in range(N-1):\n # Subtract 1 for zero-based indexing\n v1 = int(next(toks))-1\n v2 = int(next(toks))-1\n \n # Add an edge between v1 and v2\n adj[v1].append(v2)\n adj[v2].append(v1)\n\n\"\"\"\nFirst, Alice's optimal strategy is simple:\nSince the graph is a tree,\nthere is always a unique path between Alice and Bob,\nso since Alice always wants to minimize the number of moves,\nAlice wants to get to Bob as soon as possible,\nso Alice should always go to the next vertex along the unique path\nbetween Alice and Bob.\n\nThus, if, when the game ends, Bob is on some vertex\nwhich is distance D from Alice,\nit will have taken 2*D moves to get there\n(2*D because it takes Alice D moves to get there,\n and that means Bob makes D moves as well).\n\nErgo, we simply need to find the maximum distance\naway from Alice that Bob can reach and multiply by 2.\n\nHowever, there's an important catch:\nIf Bob ever goes to a vertex\nwhere the distance from Alice to V < distance from Bob to V,\nthen the game immediately ends on Bob's move.\nThis is because if Bob went to such a vertex,\nAlice would reach that vertex first and\nthe game would immediately end when Bob went there.\n\nMoreover, if Bob ever goes to a vertex\nwhere the distance from Alice to V = distance from Bob to V,\nthen game ends on Alice's next move because,\nif Bob went to such a vertex,\nAlice would take the same number of moves to get to that vertex,\nand thus would get there on the next move after Bob got there.\n\nTherefore, the overall strategy to solve the problem is,\nwe can use BFS to find distance from Alice to every vertex\nand distance from Bob to every vertex,\nand then we can do BFS from Bob's vertex to find\nthe maximum number of moves that the game can make,\nkeeping in mind the above two rules.\n\"\"\"\n \n# Given a starting vertex st,\n# return an array dsts where dsts[i] is the distance from i to st\ndef find_dsts(st):\n dsts = [None for _ in range(N)]\n\n # Initialize our BFS queue with just the starting vertex\n bfs_q = deque()\n bfs_q.append(st)\n # The distance from st to st is just 0:\n dsts[st] = 0\n\n while len(bfs_q) > 0:\n cur_v = bfs_q.popleft()\n\n # For every neighbor of cur_v...\n for next_v in adj[cur_v]:\n # If dsts[next_v] is None, then we haven't visited next_v yet,\n # so set dsts[next_v] and then add next_v to the BFS queue\n if dsts[next_v] == None:\n # To go from st to next_v,\n # we simply need to go to st to cur_v and then take 1 more step,\n # which is why dsts[next_v] is just the distance to cur_v plus 1\n dsts[next_v] = dsts[cur_v]+1\n bfs_q.append(next_v)\n \n return dsts\n\n# Find the distance from every vertex to both Alice and Bob\ndsts_from_alice = find_dsts(0)\ndsts_from_bob = find_dsts(X)\n\n# answer is maximum number of moves the game will take\n# if Bob plays optimally\n# We initialize answer to 2*dsts_from_alice[X]\n# because that's what happens if Bob never moves\nanswer = 2*dsts_from_alice[X]\nvis = [False for _ in range(N)]\n\nbfs_q = deque()\nbfs_q.append(X)\nvis[X] = True\n\nwhile len(bfs_q) > 0:\n cur_v = bfs_q.popleft()\n\n for next_v in adj[cur_v]:\n if vis[next_v]: continue\n\n # In this case, the game immediately ends on Bob's move,\n # so the number of moves is 2*dsts_from_bob[next_v]-1\n # (because Bob made dsts_from_bob[next_v] moves to get to next_v,\n # meaning Alice made dsts_from_bob[next_v]-1 moves).\n if dsts_from_alice[next_v] < dsts_from_bob[next_v]:\n answer = max(answer, 2*dsts_from_bob[next_v]-1)\n # In this case, the game ends on Alice's next move,\n # so the number of moves is 2*dsts_from_bob[next_v]\n # (because both Alice and Bob Bob made\n # dsts_from_bob[next_v] moves to get to next_v)\n elif dsts_from_alice[next_v] == dsts_from_bob[next_v]:\n answer = max(answer, 2*dsts_from_bob[next_v])\n # Finally, in this case,\n # if Bob chooses to stay at this location for the rest of the game,\n # then the game will end in 2*dsts_from_alice[next_v] moves\n # (because Alice will make dsts_from_alice[next_v] moves to get to Bob,\n # meaning Bob will also make dsts_from_alice[next_v] moves).\n else:\n answer = max(answer, 2*dsts_from_alice[next_v])\n # This is the only case where the game is not forced to end\n # when Bob reaches next_v, so add next_v to the BFS queue\n vis[next_v] = True\n bfs_q.append(next_v)\n\nprint(answer)\n\t \t \t\t\t \t\t \t \t \t\t\t \t \t", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n dist = [-1] * (n + 1)\r\n dist[s] = 0\r\n while q:\r\n i = q.popleft()\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == -1:\r\n dist[j] = di + 1\r\n q.append(j)\r\n return dist\r\n\r\ndef bfs2(s):\r\n q = deque()\r\n q.append(s)\r\n visit = [0] * (n + 1)\r\n visit[s] = 1\r\n ans = 0\r\n while q:\r\n i = q.popleft()\r\n ans = max(ans, 2 * dist1[i])\r\n for j in G[i]:\r\n if not visit[j]:\r\n visit[j] = 1\r\n if dist1[j] > dist2[j]:\r\n q.append(j)\r\n return ans\r\n\r\nn, x = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n G[a].append(b)\r\n G[b].append(a)\r\ndist1 = bfs(1)\r\ndist2 = bfs(x)\r\nans = bfs2(x)\r\nprint(ans)", "from sys import stdin\r\nfrom collections import *\r\nfrom copy import copy\r\n\r\n\r\nclass graph:\r\n def __init__(self):\r\n self.gdict = defaultdict(list)\r\n\r\n def addEdge(self, node1, node2, w=None):\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n\r\n def dfsUtil(self, v):\r\n stack, self.visit = [v], [0] * (n + 1)\r\n while stack[-1] != 1:\r\n for i in self.gdict[stack[-1]]:\r\n if self.level1[i] < self.level1[stack[-1]]:\r\n stack.append(i)\r\n break\r\n\r\n stack.pop()\r\n ans = self.level[stack[0]] << 1\r\n\r\n for i in range(1, len(stack)):\r\n if i < len(stack) - i:\r\n ans = max(ans, self.level[stack[i]] << 1)\r\n\r\n print(ans)\r\n\r\n def subtree(self, v):\r\n queue, visit, ans = deque([[v, 0]]), [0] * (n + 1), []\r\n visit[v], self.level = 1, [0] * (n + 1)\r\n\r\n while queue:\r\n s, lev = queue.popleft()\r\n\r\n for i in self.gdict[s]:\r\n if not visit[i]:\r\n queue.append([i, lev + 1])\r\n visit[i], self.level[i] = 1, lev + 1\r\n ans.append([i, s])\r\n\r\n self.level1 = copy(self.level)\r\n for i, j in ans[::-1]:\r\n self.level[j] = max(self.level[j], self.level[i])\r\n\r\n\r\nrints = lambda: [int(x) for x in stdin.readline().split()]\r\nn, m = rints()\r\ng = graph()\r\nfor _ in range(n - 1):\r\n u, v = rints()\r\n g.addEdge(u, v)\r\n\r\ng.subtree(1)\r\ng.dfsUtil(m)\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,x = map(int, input().split())\r\nx-=1\r\nP = [[] for _ in range(N)]\r\nfor _ in range(N-1):\r\n a,b = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append(b)\r\n P[b].append(a)\r\n \r\nv = deque([(0,0,0)])\r\nseen = [0]*N\r\nwhile v:\r\n i,p,d = v.popleft()\r\n seen[i] = d\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,d+1))\r\n\r\nans = 0\r\nv = deque([(x,x,0)])\r\nwhile v:\r\n i,p,d = v.popleft()\r\n if d>=seen[i]:continue\r\n ans = max(ans, seen[i])\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,d+1))\r\nprint(2*ans)\r\n \r\n", "from collections import defaultdict\r\nfrom sys import stdin, setrecursionlimit\r\ninput=stdin.readline\r\n\r\nfrom types import GeneratorType\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n\tdef wrappedfunc(*args, **kwargs):\r\n\t\tif stack:\r\n\t\t\treturn f(*args, **kwargs)\r\n\t\telse:\r\n\t\t\tto = f(*args, **kwargs)\r\n\t\t\twhile True:\r\n\t\t\t\tif type(to) is GeneratorType:\r\n\t\t\t\t\tstack.append(to)\r\n\t\t\t\t\tto = next(to)\r\n\t\t\t\telse:\r\n\t\t\t\t\tstack.pop()\r\n\t\t\t\t\tif not stack:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tto = stack[-1].send(to)\r\n\t\t\treturn to\r\n\r\n\treturn wrappedfunc\r\n@bootstrap\r\ndef dfs(node, parent, g, d, dp):\r\n\ttt = 0\r\n\tif parent != -1:\r\n\t\td[node] = d[parent] + 1\r\n\tdp[node] = max(dp[node], d[node])\r\n\tfor i in g[node]:\r\n\t\tif i != parent:\r\n\t\t\tpp=yield dfs(i, node, g, d, dp)\r\n\t\t\ttt = max(tt, pp)\r\n\tdp[node] = max(tt, dp[node])\r\n\tyield dp[node]\r\n@bootstrap\r\ndef dfs2(node,parent,g,d,dp,X,cd):\r\n\tif node!= X and d[node]>cd:\r\n\t\tdp[X]=max(dp[X],dp[node])\r\n\tfor i in g[node]:\r\n\t\tif i!=parent:\r\n\t\t\tyield dfs2(i,node,g,d,dp,X,cd+1)\r\n\tyield 1\r\ng = defaultdict(list)\r\n# print(\"sas\")\r\nn, X = map(int, input().strip().split())\r\nfor i in range(n - 1):\r\n\tx, y = map(int, input().strip().split())\r\n\tg[x - 1].append(y - 1)\r\n\tg[y - 1].append(x - 1)\r\nd = [0] * (n)\r\ndp = [0] * n\r\ndfs(0, -1, g, d, dp)\r\nX-=1\r\ndfs2(X,-1,g,d,dp,X,0)\r\nprint(dp[X]*2)\r\n\r\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\n# n,m=map(int,input().split())\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n,x=map(int,input().split())\r\n graph=[[] for i in range(n)]\r\n for i in range(n-1):\r\n u,v=map(int,input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n x-=1\r\n d1=[-1]*(n)\r\n d2=[-1]*(n)\r\n stk=[0]\r\n d1[0]=0\r\n while(stk!=[]):\r\n f=stk.pop()\r\n for i in graph[f]:\r\n if(d1[i]!=-1):\r\n continue\r\n d1[i]=1+d1[f]\r\n stk.append(i)\r\n \r\n stk=[x]\r\n d2[x]=0\r\n while(stk!=[]):\r\n f=stk.pop()\r\n for i in graph[f]:\r\n if(d2[i]!=-1):\r\n continue\r\n d2[i]=1+d2[f]\r\n stk.append(i)\r\n ma=0\r\n for i in range(n):\r\n if(len(graph[i])==1):\r\n if(d1[i]>d2[i]):\r\n ma=max(ma,d1[i])\r\n print(2*ma)\r\nmain()", "\"\"\"INPUT TEMPLATE - I copy paste this part to the top of every solution\"\"\"\nimport sys\nfrom collections import deque\n\ntoks = (tok for tok in sys.stdin.read().split())\n\"\"\"END OF TEMPLATE\"\"\"\n\nN = int(next(toks))\nX = int(next(toks))-1\n\nadj = [[] for _ in range(N)]\n\nfor _ in range(N-1):\n v1 = int(next(toks))-1\n v2 = int(next(toks))-1\n adj[v1].append(v2)\n adj[v2].append(v1)\n\ndef find_dsts(st):\n dsts = [None for _ in range(N)]\n \n bfs_q = deque()\n bfs_q.append(st)\n dsts[st] = 0\n\n while len(bfs_q) > 0:\n cur_v = bfs_q.popleft()\n\n for next_v in adj[cur_v]:\n if dsts[next_v] == None:\n dsts[next_v] = dsts[cur_v]+1\n bfs_q.append(next_v)\n \n return dsts\n\ndsts_from_alice = find_dsts(0)\ndsts_from_bob = find_dsts(X)\n\nfarthest_dst = dsts_from_alice[X]\nvis = [False for _ in range(N)]\n\nbfs_q = deque()\nbfs_q.append(X)\nvis[X] = True\n\nwhile len(bfs_q) > 0:\n cur_v = bfs_q.popleft()\n\n for next_v in adj[cur_v]:\n if vis[next_v]: continue\n \n if dsts_from_alice[next_v] > dsts_from_bob[next_v]:\n vis[next_v] = True\n bfs_q.append(next_v)\n if dsts_from_alice[next_v] >= dsts_from_bob[next_v]:\n farthest_dst = max(farthest_dst, dsts_from_alice[next_v])\n\nprint(2*farthest_dst)\n\n \t \t \t \t \t\t\t\t\t\t \t\t \t\t \t\t\t", "from sys import stdin, stdout\r\nimport math,sys,heapq\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\r\n\r\ndef dict(a):\r\n d={}\r\n z=[]\r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n z.append(x)\r\n return [d,z]\r\n\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_right(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\n\r\n\r\n\r\ndef dfs(d,n,s):\r\n alice=[0]*(n+1)\r\n visit=[False]*(n+1)\r\n parent=[-1]*(n+1)\r\n parent[1]=0\r\n q=deque([s])\r\n cnt=0\r\n while q:\r\n temp=q.popleft()\r\n \r\n for x in d[temp]:\r\n if visit[x]==False:\r\n q.appendleft(x)\r\n parent[x]=temp\r\n alice[x]=alice[temp]+1\r\n visit[temp]=True\r\n return alice\r\ndef main():\r\n try:\r\n n,s=In()\r\n d=defaultdict(list)\r\n for x in range(n-1):\r\n a,b=In()\r\n d[a].append(b)\r\n d[b].append(a)\r\n \r\n alice=dfs(d,n,1)\r\n bob=dfs(d,n,s)\r\n #print(alice)\r\n ans=0\r\n for i in range(1,n+1):\r\n if bob[i]<alice[i]:\r\n ans=max(ans,2*(alice[i]))\r\n print(ans)\r\n \r\n\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n #for _ in range(I()):main()\r\n for _ in range(1):main()\r\n\r\n\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\ndef dfs(i):\n vis = [0]*N\n ans = [0]*N\n l = [(-1,i)]\n while l:\n pre,x = l.pop()\n if vis[x]==1:continue\n vis[x] = 1\n if pre!=-1:\n ans[x] = ans[pre]+1\n for y in P[x]:\n if vis[y]==1:continue\n l.append((x,y))\n return ans\n\nN,X = map(int,input().split())\nP = [[] for _ in range(N)]\nfor _ in range(N-1):\n a,b = map(int,input().split())\n P[a-1].append(b-1)\n P[b-1].append(a-1)\n\nans = dfs(0)\nans1 = dfs(X-1)\nnum = -float('inf')\nfor i in range(N):\n if ans1[i]<ans[i]:\n num = max(num,max(ans1[i],ans[i])*2)\nprint(num)\n# print(ans)\n# print(ans1)", "from collections import defaultdict as df\r\nimport sys\r\nfrom sys import stdin, stdout\r\nfrom collections import deque\r\n\r\nsys.setrecursionlimit(10 ** 5 + 30000)\r\n\r\n\r\ndef dfs(i, visited):\r\n s = deque()\r\n s.append(i)\r\n visited[i] = True\r\n while s:\r\n y = s.popleft()\r\n\r\n for j in d[y]:\r\n if visited[j] == False:\r\n visited[j] = True\r\n s.append(j)\r\n distance[j] = distance[y] + 1\r\n\r\n\r\nn, m = list(map(int, stdin.readline().rstrip().split()))\r\nd = df(list)\r\nfor i in range(n - 1):\r\n a, b = list(map(int, stdin.readline().rstrip().split()))\r\n d[a].append(b)\r\n d[b].append(a)\r\ndistance = [0] * (n + 1)\r\nvisited = [0] * (n + 1)\r\ndfs(1, visited)\r\ndistance1 = [] + distance\r\ndistance = [0] * (n + 1)\r\nvisited = [0] * (n + 1)\r\ndfs(m, visited)\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if distance1[i] > distance[i]:\r\n ans = max(ans, 2 * distance1[i])\r\nstdout.write(str(ans))\r\n\n# Wed Jul 12 2023 11:58:30 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin,stderr\r\nfrom collections import defaultdict,deque\r\ndef main():\r\n n,x=map(int,stdin.readline().strip().split())\r\n X=x-1\r\n graph=[[] for i in range(n)]\r\n for i in range(n):\r\n graph[i]=[]\r\n for _ in range(n-1):\r\n a,b=map(int,stdin.readline().strip().split())\r\n #a,b=a-1,b-1\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n #def bfs(graph):\r\n q=deque([0])\r\n #level=[0 for i in range(len(graph))]\r\n parent=[-1]*len(graph)\r\n visit=[]\r\n while q:\r\n v=q.popleft()\r\n visit.append(v)\r\n for adj in graph[v]:\r\n if adj!=parent[v]:\r\n #level[adj]=level[v]+1\r\n parent[adj]=v\r\n q.append(adj)\r\n\r\n #return parent,visit\r\n\r\n\r\n #parent,visit=bfs(graph) \r\n #print(level,parent,visit)\r\n \r\n cur=X\r\n path=[X]\r\n #print(path,'path')\r\n while(parent[X]!=-1):\r\n X=parent[X]\r\n path+=[X]\r\n\r\n P=len(path)-1 \r\n \r\n toleft=parent\r\n #bfsvisit=visit[::-1]\r\n for i in range(1,len(visit)):\r\n x=visit[-i]\r\n \r\n if [parent[x]]==graph[x]:\r\n toleft[x]=0\r\n else:\r\n ans=0\r\n for adj in graph[x]:\r\n if adj!=parent[x]:\r\n ans=max(toleft[adj],ans)\r\n ans+=1\r\n toleft[x]=ans\r\n \r\n\r\n #print(path,toleft) \r\n #print(P,'P')\r\n MAX=0\r\n \r\n for t in range(0,P+1):\r\n if 2*t<P:\r\n temp=2*t+(2*toleft[path[t]]+2*abs(P-2*t))\r\n if temp>MAX:\r\n MAX=temp\r\n else:\r\n break\r\n\r\n print(MAX) \r\n\r\n\r\n #print(toleft[2],path) \r\nmain()" ]

[ "import math\r\no = 524288\r\npi = math.acos(-1)\r\na = [0] * (2 * o)\r\nx = [0.0] * (2 * o)\r\ny = [0.0] * (2 * o)\r\nz = [0] * (2 * o)\r\n\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n a[i + o] = x[i + o] = 1\r\nfor i in range(o - 1, 0, -1):\r\n x[i] = x[i << 1] + x[i << 1 | 1]\r\nfor _ in range(m):\r\n i, j, k = map(int, input().split())\r\n j += o - 1\r\n if i == 1:\r\n a[j] += k\r\n else:\r\n z[j] = (z[j] + k) % 360\r\n x[j] = a[j] * math.cos(z[j] * pi / 180)\r\n y[j] = a[j] * -math.sin(z[j] * pi / 180)\r\n while j > 1:\r\n if j % 2 == 0: \r\n x[j // 2] = (\r\n x[j] + x[j + 1] * math.cos(z[j] * pi / 180)\r\n + y[j + 1] * math.sin(z[j] * pi / 180)\r\n )\r\n y[j // 2] = (\r\n y[j] - x[j + 1] * math.sin(z[j] * pi / 180)\r\n + y[j + 1] * math.cos(z[j] * pi / 180)\r\n )\r\n z[j // 2] = (z[j] + z[j + 1]) % 360\r\n else: \r\n x[j // 2] = (\r\n x[j - 1] + x[j] * math.cos(z[j - 1] * pi / 180)\r\n + y[j] * math.sin(z[j - 1] * pi / 180)\r\n )\r\n y[j // 2] = (\r\n y[j - 1] - x[j] * math.sin(z[j - 1] * pi / 180)\r\n + y[j] * math.cos(z[j - 1] * pi / 180)\r\n )\r\n z[j // 2] = (z[j - 1] + z[j]) % 360\r\n j //= 2\r\n print(\"%.10f %.10f\" % (x[1], y[1]))# 1692888501.6278377" ]

[ "from datetime import date, timedelta\r\nimport math\r\n\r\n\r\nw=open('output.txt', 'w')\r\nr=open('input.txt', 'r')\r\noplympiads = []\r\n\r\nmin_date = date(2014,1,1)\r\nmax_date = date(2011,1,1)\r\n\r\nn = int(r.readline())\r\n\r\nfor _ in range(n):\r\n m, d, p, t = map(int, r.readline().split())\r\n oplympiads.append((m,d,p,t))\r\n if (date(2013, m, d) > max_date):\r\n max_date = date(2013, m, d)\r\n if (date(2013, m, d) - timedelta(t) < min_date):\r\n min_date = date(2013, m, d) - timedelta(t)\r\n \r\ndays_needed = (max_date - min_date).days\r\nnumber_of_workers_in_day = [0] * days_needed\r\nfor m,d,p,t in oplympiads:\r\n for dte in range(t):\r\n number_of_workers_in_day[((date(2013, m, d) - timedelta(t - dte)) - min_date).days] += p\r\nw.write('{}'.format(max(number_of_workers_in_day)))", "from collections import Counter\r\ndm = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ndef dec(d):\r\n d[2] -= 1\r\n if d[2] == 0:\r\n d[1] -= 1\r\n if d[1] == 0:\r\n d[0] -= 1\r\n d[1] = 12\r\n d[2] = dm[d[1]]\r\nf = open('input.txt', 'r')\r\nc = Counter()\r\nfor i in range(int(f.readline())):\r\n d = [2013] + list(map(int, f.readline().split())) \r\n for j in range(d[4]):\r\n dec(d)\r\n c[10000 * d[0] + 100 * d[1] + d[2]] += d[3]\r\nprint(c.most_common()[0][1], file=open('output.txt', 'w'))", "import sys\r\nsys.stdin = open('input.txt','r')\r\nsys.stdout = open('output.txt','w')\r\n\r\ndi = {}\r\nk = 1\r\ndays = [31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nfor i in range(12):\r\n\tfor j in range(days[i]):\r\n\t\tdi[(i+1, j+1)] = k\r\n\t\tk+=1\r\n\r\nn = int(input())\r\na = [0]*512\r\nfor _ in range(n):\r\n\tm, d, p, t = map(int, input().split())\r\n\ttemp = di[(m,d)]\r\n\tfor x in range(temp-t, temp):\r\n \t\ta[x]+=p\r\n\r\nprint(max(a))", "w, r = open('output.txt', 'w'), open('input.txt', 'r')\r\ns, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434]\r\nfor i in range(int(r.readline())):\r\n m, d, p, t = map(int, r.readline().split())\r\n x = y[m] + d\r\n s[x] -= p\r\n s[x - t] += p\r\nfor i in range(465):\r\n s[i + 1] += s[i]\r\nw.write(str(max(s)))\r\n", "s = []\r\ndef fill(day, t, p, c):\r\n for i in range(1, t + 1):\r\n c[day - i] += p\r\nwith open('input.txt') as f:\r\n n = int(f.readline())\r\n for i in range(n):\r\n s.append([int(x) for x in f.readline().split()])\r\n#print(s)\r\nc = [0] * 500\r\nr = [0] * 12\r\nr[0] = 0\r\nr[1] = r[0] + 31\r\nr[2] = r[1] + 28\r\nr[3] = r[2] + 31\r\nr[4] = r[3] + 30\r\nr[5] = r[4] + 31\r\nr[6] = r[5] + 30\r\nr[7] = r[6] + 31\r\nr[8] = r[7] + 31\r\nr[9] = r[8] + 30\r\nr[10] = r[9] + 31\r\nr[11] = r[10] + 30\r\nlap = 110\r\nfor i in range(n):\r\n m, d, p, t = s[i]\r\n day = lap + r[m - 1] + d\r\n fill(day, t, p, c)\r\nf = open('output.txt', 'w')\r\nf.write(str(max(c)))\r\nf.close()", "\r\nfin = open(\"input.txt\", \"r\")\r\nfout = open(\"output.txt\", \"w\")\r\n\r\nmon = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nans = [0]*500\r\nba = []\r\nfor i in range(int(fin.readline())):\r\n m,d,p,t = map(int,fin.readline().split())\r\n ba.append([m,d,p,t])\r\n\r\nfor i in ba:\r\n days = sum(mon[:i[0]]) + i[1] + 100\r\n for j in range(1,i[3]+1):\r\n ans[days - j]+=i[2]\r\n\r\nprint(max(ans), file=fout)\r\n\r\n\r\n\r\n\r\n", "w=open('output.txt', 'w')\r\nr=open('input.txt', 'r')\r\ns=[0]*466\r\ny=[0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434]\r\nn=int(r.readline())\r\nfor i in range(n):\r\n m, d, p, t = map(int, r.readline().split())\r\n x = y[m] + d\r\n s[x] -= p\r\n s[x - t] += p\r\nfor i in range(465):\r\n s[i + 1] += s[i]\r\nw.write(str(max(s)))", "from datetime import datetime\r\n\r\ndef get_min_jury_count():\r\n\trd = open(\"input.txt\", \"r\")\r\n\twr = open(\"output.txt\", \"w\")\r\n\tolympiads = int(rd.readline())\r\n\r\n\tdays_in_month = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\t# 100 days needed from 1st Jan 2013 will start 23rd Sept 2012\r\n\tjuries_needed_on_days = [0]*466\r\n\treference_date = datetime.strptime(\"2012-9-23\", \"%Y-%m-%d\").date()\r\n\tfor _ in range(olympiads):\r\n\t\tend_month, end_date, juries, total_days_needed = map(int, rd.readline().split())\r\n\t\tend_year = start_year = 2013\r\n\t\tstart_month = end_month\r\n\t\tdays_needed = end_date-total_days_needed\r\n\t\twhile days_needed <= 0:\r\n\t\t\tstart_month -= 1\r\n\t\t\tif start_month < 1:\r\n\t\t\t\tstart_month = 12\r\n\t\t\t\tstart_year -= 1\r\n\t\t\tdays_needed = days_in_month[start_month]+days_needed\r\n\t\t\tif days_needed > 0:\r\n\t\t\t\tbreak\r\n\t\t\r\n\t\tstart_date_str = \"{}-{}-{}\".format(start_year, start_month, days_needed)\r\n\t\tend_date_str = \"{}-{}-{}\".format(end_year, end_month, end_date)\r\n\t\tstart_date_index = (datetime.strptime(start_date_str, \"%Y-%m-%d\").date() - reference_date).days\r\n\t\tend_date_index = (datetime.strptime(end_date_str, \"%Y-%m-%d\").date() - reference_date).days\r\n\t\t# increment juries count as those are simultaniously needed number\r\n\t\tfor index in range(start_date_index, end_date_index):\r\n\t\t\tjuries_needed_on_days[index] += juries\r\n\r\n\twr.write(str(max(juries_needed_on_days)))\r\n\r\nget_min_jury_count()\r\n", "fin = open(\"input.txt\", \"r\")\nfout = open(\"output.txt\", \"w\")\nday = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ntable = []\nfor i in range(int(fin.readline())):\n table.append([int(i) for i in fin.readline().split()])\n\nans = [0]*500\nfor it in table:\n days = sum(day[0:it[0]]) + it[1] + 100\n for i in range(1, it[3]+1):\n ans[days - i] += it[2]\nprint(max(ans), file=fout)\n\n \t \t \t \t \t\t\t \t \t \t\t\t \t" ]

[ "n, a = int(input()), [int(x) for x in input().split()]\r\nprint(n - min([a[:i].count(1) + a[i + 1:].count(0) for i in range(n)]))\r\n", "n = int(input())\r\nm=list(map(int,input().split()))\r\nx=m.count(0)\r\ny=n-x\r\na=0\r\nb=0\r\nl=max(x,y)\r\nfor i in range(n):\r\n if m[i]==1:\r\n a+=1\r\n c=[]\r\n d=0\r\n e=0\r\n for j in range(i+1):\r\n if m[j]==1:\r\n d+=1\r\n else:\r\n e+=1\r\n c.append(e+a-d)\r\n l=max(l,max(c)+y-a)\r\n\r\n \r\n \r\n else:\r\n b+=1\r\nprint(l)\r\n \r\n ", "n = int(input())\r\np = list(map(int, input().split()))\r\nind_z = []\r\nind_o = []\r\nfor i in range(n):\r\n if p[i] == 0:\r\n ind_z.append(i)\r\n else:\r\n ind_o.append(i)\r\nz = [0] * len(ind_z)\r\no = [0] * len(ind_o)\r\nfor i in range(len(z)):\r\n z[i] = i + 1\r\n for j in range(ind_z[i], n):\r\n if p[j] == 1:\r\n z[i] += 1\r\nfor i in range(len(o)):\r\n o[i] = len(o) - i \r\n for j in range(ind_o[i] - 1, -1, -1):\r\n if p[j] == 0:\r\n o[i] += 1 \r\nz = [0] + z\r\no = [0] + o\r\nprint(max(max(o), max(z)))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nN = 107\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\n\r\nf = [[0 for j in range(N)] for i in range(N)]\r\nf[0][0] = 0\r\nf[1][0] = 0\r\nf[1][1] = 1\r\nfor i in range(2, n+1):\r\n for j in range(i):\r\n if a[j] == 0 or (a[j] == 1 and a[i] == 1):\r\n f[i][i] = max(f[i][i], f[i-1][j]+1)\r\n f[i][j] = max(f[i][j], f[i-1][j])\r\nres = 0\r\nfor i in range(n+1):\r\n res = max(res, f[n][i])\r\nprint(res)\r\n ", "a=int(input())\r\nb=list(map(int,input().split()))\r\n\r\nc=[]\r\nd=[]\r\ncount=0\r\nfor i in b:\r\n if i ==0:\r\n count+=1\r\n c.append(count)\r\n\r\ncount=0\r\nfor i in b[::-1]:\r\n if i==1:\r\n count+=1\r\n d.append(count)\r\nd=d[::-1]\r\n\r\nx=[]\r\nfor i in range(a):\r\n x.append(c[i]+d[i])\r\nprint(max(x))\r\n", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nb=x.count(1)\r\nm=0\r\ny=0\r\nfor i in x:\r\n if i==1:\r\n m=max(m,y+b)\r\n b-=1\r\n else:\r\n y+=1\r\n m=max(m,y+b)\r\nprint(m)", "n = int(input())\r\n\r\ndef it():\r\n A = list(map(int,input().split()))\r\n A.reverse()\r\n\r\n c1 = 0\r\n r0 = len(A) - sum(A)\r\n yield r0\r\n\r\n for a in A:\r\n if a == 1:\r\n c1 += 1\r\n yield c1 + r0\r\n else:\r\n r0 -= 1\r\n\r\nprint(max(it()))\r\n\r\n\r\n", "n = int(input())\nt = list(map(int, input().split()))\n#print(t)\nprint( max( [ i-sum(t[:i]) + sum(t[i:]) for i in range(n+1) ] ))\n\n", "def rezume(lst):\r\n ones, zeros = 0, 0\r\n l, r = [0] * len(lst), [0] * len(lst)\r\n result = 0\r\n for i in range(len(lst)):\r\n l[i] = ones\r\n if lst[i]:\r\n ones += 1\r\n r[len(lst) - i - 1] = zeros\r\n if not lst[len(lst) - i - 1]:\r\n zeros += 1\r\n for i in range(len(lst)):\r\n result = max(result, len(lst) - l[i] - r[i])\r\n return result\r\n\r\n\r\nn = int(input())\r\nc = [int(j) for j in input().split()]\r\nprint(rezume(c))\r\n", "n, t = int(input()), input()[::2]\r\nprint(max(t[:i].count('0') + t[i:].count('1') for i in range(n + 1)))", "n=int(input())\r\narr=list(input().split())\r\nmp0=[0]*n\r\nmp1=[0]*n\r\nif arr[0]=='0':mp0[0]+=1\r\nif arr[-1]=='1':mp1[-1]+=1\r\nfor i in range(1,n):\r\n if arr[i]=='0':mp0[i]=mp0[i-1]+1\r\n else:mp0[i]=mp0[i-1]\r\nfor i in range(n-2,-1,-1):\r\n if arr[i]=='1':mp1[i]=mp1[i+1]+1\r\n else:mp1[i]=mp1[i+1]\r\n#print(mp0)\r\n#print(mp1)\r\nans=-1\r\nfor i in range(n):\r\n if arr[i]=='1':\r\n ans=max(ans,mp0[i]+mp1[i])\r\nans=max(ans,arr.count('0'),arr.count('1'))\r\nprint(ans)", "n=int(input())\r\na=''\r\ncount=0\r\nfor j in input().split():\r\n count=count+1\r\n if a!='' and j=='0':\r\n a=a[:-1]\r\n count=count-1\r\n elif j=='1':\r\n a=a+j\r\nprint(count) \r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nresult = -1\r\n\r\nfor l in range(n):\r\n r = l + 1\r\n tempresult = nums[:l + 1].count(0) + nums[r:].count(1)\r\n result = max(result, tempresult)\r\n\r\nresult = max(result, nums.count(1))\r\nresult = max(result, nums.count(0))\r\n\r\nprint(result)\r\n", "n = int(input())\nt = list(map(int, input().split()))\n\nzeros = 0\nones = sum(t)\n\nm = zeros + ones\n\nfor b in range(n):\n\n if t[b] == 0:\n zeros += 1\n else:\n ones -= 1\n\n if m < zeros + ones:\n m = zeros + ones\n\nprint(m)\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n b = list(map(int, input().split(' ')))\n a = [0]\n a += b\n \n pre = [0] # 前缀0的个数\n for i in range(n):\n j = i + 1\n pre.append(pre[j - 1] + (a[j] == 0))\n \n ans = 0\n for i in range(n):\n j = i + 1\n cnt = n - j + 1 - (pre[n] - pre[j - 1]) # 1的个数\n ans = max(ans, pre[j] + cnt)\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t \t \t \t\t \t \t\t \t \t\t \t", "n=int(input())\nq=input().split(\" \")\nt=q.count('0')\na=t\nfor s in q[::-1]:\n t=t+1 if s=='1' else t-1\n a=max(a, t)\nprint(a)", "# import sys\n# sys.stdin = open('in', 'r')\n\nn = int(input())\ns = list(map(int, input().split()))\n\nprint(max([s[:i].count(0) + s[i:].count(1) for i in range(n+1)]))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max(a[:i].count(0)+a[i:].count(1) for i in range(n+1)))", "import sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\ndef parser():\r\n while 1:\r\n data = list(input().split(' '))\r\n for number in data:\r\n if len(number) > 0:\r\n yield(number) \r\n\r\ninput_parser = parser()\r\n\r\ndef get_word():\r\n global input_parser\r\n return next(input_parser)\r\n\r\ndef get_number():\r\n data = get_word()\r\n try:\r\n return int(data)\r\n except ValueError:\r\n return float(data)\r\n\r\nans = 0\r\n\r\n \r\na = input()\r\nst = input().split()\r\nm0 = 0\r\nm1 = 0\r\nans = 0\r\nfor i in st:\r\n if int(i):\r\n m1 = max(m0, m1) + 1\r\n else:\r\n m0 += 1\r\n ans = max(m0, m1)\r\nprint(ans)\r\n ", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nmax_games = [1 for i in range(n)]\r\n\r\nif n > 1:\r\n if l[1] == 0:\r\n if l[0] == 1:\r\n max_games[1] = 1\r\n else:\r\n max_games[1] = 2\r\n else:\r\n max_games[1] = 2\r\n\r\nt_max = max(max_games)\r\n\r\nif n > 2:\r\n for i in range(2, n):\r\n if l[i] == 0:\r\n j = i - 1\r\n while (j >= 0):\r\n if l[j] == 0:\r\n max_games[i] = max_games[j] + 1\r\n t_max = max([t_max, max_games[i]])\r\n break\r\n j -= 1\r\n else:\r\n max_games[i] = t_max + 1\r\n t_max += 1\r\n\r\n\r\n\r\nprint(t_max)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = ''.join(input()[:-1].split())\r\nc = 0\r\nfor i in range(n+1):\r\n x = sum(1 for j in w[:i] if j == '0') + sum(1 for j in w[i:] if j == '1')\r\n c = max(c, x)\r\nprint(c)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\npref1 = [0]\r\nfor i in arr:\r\n pref1.append(pref1[-1] + i)\r\nsuf0 = [0]\r\nfor i in arr[::-1]:\r\n suf0.append(suf0[-1] + (i + 1) % 2)\r\nans = []\r\nfor i in range(n + 1):\r\n ans.append(n - (suf0[::-1][i] + pref1[i]))\r\nprint(max(ans))", "def solve(n, games):\r\n games_to_keep = 0\r\n # Calculate prefix for ones (how many ones from start to i)\r\n ones_prefix = [0 for i in range(n)]\r\n if games[0] == '1':\r\n ones_prefix[0] = 1\r\n \r\n for i in range(1, n):\r\n ones_prefix[i] = ones_prefix[i-1]\r\n if games[i] == '1':\r\n ones_prefix[i] += 1\r\n \r\n # Find max subsequence [0000000.....11111111]\r\n def ones_after(pos):\r\n return ones_prefix[-1] - ones_prefix[pos]\r\n \r\n zeros_cnt = 0\r\n for i, game in enumerate(games):\r\n if game == '0':\r\n zeros_cnt += 1\r\n ones_after_zero = ones_after(i)\r\n \r\n games_lasts = zeros_cnt + ones_after_zero\r\n if games_lasts > games_to_keep:\r\n games_to_keep = games_lasts\r\n \r\n \r\n # Leave only zeros or only ones\r\n ones_count = ones_prefix[-1]\r\n zeros_count = n - ones_count\r\n games_to_keep = max(games_to_keep, ones_count, zeros_count)\r\n return games_to_keep\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n games = input().split()\r\n \r\n print(solve(n, games))\r\n \r\nmain()", "i=int(input())\r\nl=list(map(int,input().split()))\r\na=l.count(0);b=l.count(1)\r\nans=max(a,b)\r\nc=i\r\nfor x in l:\r\n if x==1:\r\n c-=1\r\n b-=1\r\n else:\r\n a-=1\r\n ans=max(ans,c-a)\r\nprint(ans)", "def procv(s,n):\n for i in range(n-1):\n if s[i] == '1':\n for j in range(i,n-1):\n if s[j+1] == '0':\n s[j+1] = 'x'\n break\n\n f = list(filter(lambda v: v != 'x', s))\n return len(f)\n\nn = int(input())\ns = list(input().split())\n\nprint(procv(s,n))\n", "n = int(input())\r\narr = input()\r\narr = arr.split(' ')\r\narr = list(map(int, arr))\r\nmaxi = -1\r\nones = list(range(n+1))\r\nones[n]=0\r\nfor j in range(1, n):\r\n if arr[n-j] == 1:\r\n ones[n-j] = ones[n-j+1] + 1\r\n else:\r\n ones[n-j] = ones[n-j+1]\r\nif arr[0] == 1:\r\n ones[0] = ones[1] + 1\r\nelse:\r\n ones[0] = ones[1]\r\ncounter = 0\r\nif arr[0] == 1:\r\n maxi = ones[0]\r\nfor i in range(0, n):\r\n if arr[i] == 0:\r\n counter = counter + 1\r\n if i < n-1:\r\n if maxi < counter + ones[i + 1]:\r\n maxi = counter + ones[i + 1]\r\n elif i == n-1:\r\n if maxi < counter:\r\n maxi = counter\r\nprint(maxi)\r\n# 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0\r\n", "waste = input()\r\ns = input()\r\nm = -1\r\nfor i in range(len(s)+1):\r\n\tp = s[:i].count('0') + s[i:].count('1')\r\n\tif p > m:\r\n\t\tm = p\r\nprint(m)", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndp = [[-10**9, -10**9] for _ in range(n+1)]\r\ndp[0][0] = 0\r\n\r\nfor i, x in enumerate(a):\r\n if x == 0:\r\n dp[i+1][0] = dp[i][0]+1\r\n dp[i+1][1] = dp[i][1]\r\n else:\r\n dp[i+1][0] = dp[i][0]\r\n dp[i+1][1] = max(dp[i][0], dp[i][1]) + 1\r\n\r\nprint(max(dp[-1]))\r\n", "n = int(input())\nlst = list(map(int, input().split()))\nl = [lst[:i].count(0)+lst[i:].count(1) for i in range(n+1)]\nprint (max(l))\n", "n = int(input())\r\nres = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n+1):\r\n x = res[:i].count(0)\r\n y = res[i:].count(1)\r\n ans = max(ans, x + y)\r\nprint(ans)\r\n", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n left = [0] * n\r\n left[0] = int(a[0] == 0)\r\n for p in range(1, n):\r\n left[p] = left[p - 1] + int(a[p] == 0)\r\n right = [0] * n\r\n right[n - 1] = int(a[n - 1] == 1)\r\n for p in range(n - 2, -1, -1):\r\n right[p] = right[p + 1] + int(a[p] == 1)\r\n total = 0\r\n for p in range(n):\r\n cand = left[p] + right[p]\r\n total = max(total, cand)\r\n print(total)\r\nif __name__ == \"__main__\":\r\n main()# 1691751995.0136547", "n = int(input())\r\na = list(map(int, input().split()))\r\none = []\r\nzero = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n one.append(i)\r\n else:\r\n zero += 1\r\n\r\nif len(one) == 0:\r\n print(zero)\r\nelse:\r\n num = zero\r\n for i in range(len(one)):\r\n pre0 = 0\r\n suf0 = 0\r\n tmp1 = 0\r\n for j in range(n):\r\n if j < one[i] and a[j] == 0:\r\n pre0 += 1\r\n elif one[i] <= j and a[j] == 1:\r\n tmp1 += 1\r\n num = max(pre0 + tmp1, num)\r\n print(num)\r\n", "n = int(input())\ns = list(map(int, input().split()))\nmax_games = 0\nfor i in range(n+1):\n max_games = max(max_games, s[:i].count(0) + s[i:].count(1))\nprint(max_games)\n", "n = int(input())\r\nm = 0\r\nls = list(map(int,input().split()))\r\nfor i in range(n+1):\r\n s = 0\r\n for j in range(i) : s+=(not ls[j])\r\n for j in range(i,n) : s+=ls[j]\r\n m = max(s,m)\r\nprint(m)\r\n", "n = int(input())\r\n\r\ns = [int(x) for x in input().split()]\r\n\r\nmax_fails = []\r\n\r\nfails = 0\r\n\r\nfor i in range(n):\r\n if s[i] == 0:\r\n fails += 1\r\n max_fails.append(fails)\r\n\r\nmax_successes = []\r\nsuccesses = 0\r\nfor i in range(n-1, -1, -1):\r\n if s[i] == 1:\r\n successes += 1\r\n max_successes.append(successes)\r\n\r\nmax_successes = reversed(max_successes)\r\n\r\nprint(max([x + y for x,y in zip(max_fails,max_successes)]))\r\n\r\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in range(n + 1):\r\n x = s[:i].count(0)\r\n y = s[i:].count(1)\r\n k = max(k, x + y)\r\nprint(k)", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\none=x.count(1)\r\nm=0\r\na=0\r\nfor i in x:\r\n if i==1:\r\n m = max(m, a + one)\r\n one-=1\r\n else:\r\n a+=1\r\n m=max(m,a+one)\r\nprint(m)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nzc, res = [0 for i in range(105)], 0\r\n\r\nfor i in range(1, n+1):\r\n zc[i] = zc[i-1] + (1 if s[i-1] == 0 else 0)\r\nfor i in range(1, n+1):\r\n lzc = zc[i-1]\r\n roc = (n-i) - (zc[n] - zc[i])\r\n res = max(res, lzc + 1 + roc)\r\nprint(res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = [a[i+1:].count(0)+a[:i].count(1) for i in range(n)]\r\nprint(n - min(l))", "n = int(input())\ns = list(map(int, input().split()))\n\nans = 0\nx0 = 0\nx1 = 0\nfor i in range(n):\n if s[i] == 1:\n x1 = max(x0, x1) + 1\n else:\n x0 = x0 + 1\n ans = max(x0, x1)\nprint(ans)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(a.count(0) + 1):\r\n zc = 0\r\n for j in range(n):\r\n if a[j] == 0:\r\n zc += 1\r\n if zc == i:\r\n break\r\n ans = max(ans, i + a[j:].count(1))\r\nprint(ans)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n+1):\r\n x=s[:i].count(0)\r\n y=s[i:].count(1)\r\n ans=max(ans,x+y)\r\nprint(ans)\r\n\r\n", "n=int(input())\r\ns=[int(c) for c in input().split()]\r\nr=0\r\nfor i in range(n+1):\r\n res=s[:i].count(0)\r\n res+=s[i:].count(1)\r\n r=max(res,r)\r\nprint(r)\r\n\r\n\r\n", "n = int(input())\nq = input().split(\" \")\n\nt = q.count('0')\n\na = t\no = 0\nz = 0\t\nfor s in q[::-1]:\n\tif s == '1':\n\t\to += 1\n\telse:\n\t\tz += 1\n\ta = max(a, t+o-z)\n\nprint(a)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nr=0\r\nfor i in range(n+1):\r\n x=a[:i].count(0)\r\n y=a[i:].count(1)\r\n r=max(r,x+y)\r\nprint(r)", "def test(i):\r\n answer = s[:i].count(0) + s[i:].count(1)\r\n return answer\r\n\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\n\r\n\r\nanswer = []\r\nfor i in range(n + 1):\r\n answer.append(test(i))\r\n\r\n# print(answer)\r\nprint(max(answer))\r\n", "n = int(input())\r\nxs = list(map(int, input().split()))\r\n\r\ns = [0] * n\r\n\r\nif xs[-1] == 1:\r\n s[-1] = 1\r\n\r\nfor i in range(n - 2, -1, -1):\r\n s[i] = s[i + 1]\r\n if xs[i] == 1:\r\n s[i] += 1\r\n\r\nres = 0\r\n\r\ntmp = 0\r\nfor i in range(n):\r\n if xs[i] == 0:\r\n tmp += 1\r\n res = max(res, tmp + s[i])\r\n\r\nprint(res)\r\n", "n = int(input())\r\nprojects = input().split(' ')\r\n\r\nbest = 0\r\nfor i in range(len(projects)):\r\n\tcur = 1\r\n\tcur += projects[:i].count('0')\r\n\tcur += projects[i+1:n].count('1')\r\n\tbest = max(best, cur)\r\n\r\nprint(best)\r\n", "a=int(input())\nb=input().split()\nzerocount=0\nzero=[]\nonecount=0\none=[]\nmaxi=0\n\nfor i in range(a):\n\tif(b[i]=='0'):\n\t\tzerocount+=1\n\tzero.append(zerocount)\n\nfor i in range(a-1, -1, -1):\n\tif(b[i]=='1'):\n\t\tonecount+=1\n\tone.append(onecount)\none.reverse()\n\nif(maxi<one[0]):\n\tmaxi=one[0]\n\nfor i in range(a-1):\n\tif(maxi<zero[i]+one[i+1]):\n\t\tmaxi=zero[i]+one[i+1]\n\nif(maxi<zero[a-1]):\n\tmaxi=zero[a-1]\n\nprint(maxi)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nmaxi = 0\r\nfor i in range(n+1):\r\n cur = m[:i].count(0) + m[i:].count(1)\r\n if cur > maxi:\r\n maxi = cur\r\nprint(maxi)", "KoKoKo = int\r\nkudaxKudax = input\r\nkukareku = max\r\nkokokokoko = print\r\nkudkudax = range\r\n\r\n\r\n\r\n\r\nkokoko = KoKoKo(kudaxKudax())\r\nko = [KoKoKo(x) for x in kudaxKudax().split()]\r\nKO = KOKOKO = 0\r\nfor kok in kudkudax(kokoko - 1, -1, -1):\r\n KO += ko[kok]\r\n KOKOKO = kukareku(KOKOKO, KO + ko[:kok + 1].count(0))\r\nkokokokoko(KOKOKO)", "\r\n\r\ndef solve(s):\r\n '''\r\n >>> solve([1, 1, 0, 1])\r\n 3\r\n >>> solve([0, 1, 0, 0, 1, 0])\r\n 4\r\n >>> solve([0])\r\n 1\r\n '''\r\n zeroes = accum(s, 0)\r\n ones = list(reversed(accum(reversed(s), 1)))\r\n return max(x + y for x, y in zip(zeroes, ones))\r\n\r\n\r\ndef accum(lst, value):\r\n counts = [0]\r\n for el in lst:\r\n if el == value:\r\n counts.append(counts[-1] + 1)\r\n else:\r\n counts.append(counts[-1])\r\n return counts\r\n\r\n\r\ndef main():\r\n n = input()\r\n s = list(map(int, input().split()))\r\n print(solve(s))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "waste = input()\r\ns = input()\r\nm = -1#you want a seq like [...0 0 0 0 0 0 0 1 1 1 1 1 ...]\r\nfor i in range(len(s)+1):\r\n\tp = s[:i].count('0') + s[i:].count('1')\r\n\tif p > m:\r\n\t\tm = p\r\nprint(m)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nres = max([len(s[:i])-sum(s[:i])+sum(s[i:]) for i in range(n+1)])\r\nprint(res)", "n = int(input())\r\ngames = list(map(int, input().split()))\r\n\r\nstrike = [0] * n\r\n\r\nfor i in range(n):\r\n\tstrike[i] = 1\r\n\tfor j in range(i):\r\n\t\tif games[j] <= games[i]:\r\n\t\t\tstrike[i] = max(strike[i], strike[j] + 1)\r\n\r\n# print(strike)\r\nprint(max(strike))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nr = 0\r\nfor i in range(n + 1) :\r\n x = a[:i].count(0)\r\n y = a[i:].count(1)\r\n r = max(r, x + y)\r\n \r\nprint(r)", "n = int(input())\r\nstring = ''.join(map(str, input().split()))\r\nmaxx = 0\r\nfor i in range(n+1):\r\n maxx = max(maxx, string[:i].count('0')+string[i:].count('1'))\r\nprint(maxx)", "\n\nINF = 10 ** 9 + 7\n\n\ndef cutoff(games, pos):\n leave = 0\n\n for i, g in enumerate(games):\n if i < pos:\n if g == 0:\n leave += 1\n else:\n if g == 1:\n leave += 1\n\n return leave\n\n\ndef main():\n n = int(input())\n\n games = [int(x) for x in input().split()]\n\n max_leave = -INF\n\n for i in range(n+1):\n max_leave = max(max_leave, cutoff(games, i))\n\n print(max_leave)\n\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\ndata2 = [0] * n\r\ndata2[0] = data[0]\r\nfor i in range(1, n):\r\n if data[i]:\r\n data2[i] = data2[i - 1] + 1\r\n else:\r\n data2[i] = data2[i - 1]\r\ndata2 = [0] + data2\r\nma = -2\r\nfor i in range(n + 1):\r\n ma = max(ma, data2[-1] - data2[i] + i - data2[i])\r\nprint(ma)", "total = 0\nn = int(input())\na = [int(i) for i in input().split()]\nmax1 = 0\nfor i in range(n+1):\n\tsum1 = 0\n\tfor j in range(n):\n\t\tif(a[j] == 1 and j>=i):\n\t\t\tsum1 += 1\n\t\telif(a[j] == 0 and j<i):\n\t\t\tsum1 += 1\n\tmax1 = max(max1,sum1)\nprint(max1)", "\"\"\"\nCodeforces Round #334 (Div. 2)\n\nProblem 846 A. Curriculum Vitae\n\n@author yamaton\n@date 2017-09-13\n\"\"\"\n\n\ndef count(xs, i):\n return xs[:i].count(0) + xs[i:].count(1)\n\n\ndef solve(xs):\n n = len(xs)\n return max(count(xs, i) for i in range(n + 1))\n\n\ndef main():\n n = int(input())\n xs = [int(c) for c in input().split()]\n assert len(xs) == n\n result = solve(xs)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = [0]+list(map(int, input().split()))\r\na, b = [0]*(n+1), [0]*(n+2)\r\nfor i in range(n):\r\n a[i+1] = a[i] if s[i+1] else a[i]+1\r\n b[n-i] = b[n-i+1]+1 if s[n-i] else b[n-i+1]\r\nans = 0\r\nfor i in range(n+1):\r\n ans = max(ans, a[i]+b[i+1])\r\nprint(ans)\r\n", "def list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\nn = int(input()) \r\na = list_input()\r\ncur = 0\r\nans = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n cur += 1\r\n ans = max(ans,cur+a[i+1:].count(1))\r\nprint(max(ans,a.count(1))) ", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=b.copy()\r\nans=0\r\nfor i in range(a):\r\n if b[i]==1:\r\n ans+=(b[i:].count(1))\r\n break\r\n ans+=1\r\nans1=0\r\nfor i in range(a):\r\n if b[i]==1:\r\n ans1=max(ans1,b[:i].count(0)+b[i:a].count(1))\r\nprint(max(ans,ans1,b.count(0),b.count(1)))\r\n\r\n \r\n", "n = int(input())\nlis = list(map(int,input().split()))\nmaxi = 0\nfor i in range(n+1):\n y = lis[:i].count(0) + lis[i:].count(1)\n if y > maxi:\n maxi = y\nprint(maxi)\n \t\t \t \t\t\t \t\t \t\t \t \t", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[21]:\n\n\nn=int(input())\nA=input().split()\n#print(A)\n#cons_0=[]\n#cons_1=[]\ncount_0=0\ncount_1=0\ni=0\nif n==1:\n print(n)\nelse:\n for i in range(0,n):\n if A[i]=='0':\n count_0+=1\n if A[i]=='1':\n count_1+=1\n \n maxm=max(count_0, count_1)\n for i in range(0,n):\n max_now=0\n for j in range(0,i+1):\n if A[j]=='0':\n max_now+=1\n for j in range(i+1,n):\n if A[j]=='1':\n max_now+=1\n #print(max_now)\n if max_now>maxm:\n maxm=max_now\n \n #print(cons_0)\n #print(cons_1)\n \n print(maxm)\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "n=input()\r\na = [int(x) for x in input().split()]\r\nsum0=0\r\nsum1=0\r\nfor i in a:\r\n if i==1:\r\n sum1=max(sum1+1,sum0+1)\r\n else: \r\n sum0=sum0+1\r\nprint(max(sum1,sum0))", "n = int(input())\r\ns = list(map(int, input().split(' ')))\r\n\r\nones = sum(1 for v in s if v == 1)\r\nzeroes = sum(1 for v in s if v == 0)\r\nzero_ones = 0\r\n\r\nloss = 0\r\nfor i in range(n):\r\n if s[i] == 1:\r\n loss += 1\r\n continue\r\n\r\n loss_zeroes = 0\r\n j = i + 1\r\n while (j < n):\r\n if (s[j] == 0 and s[j-1] == 1):\r\n while (j < n and s[j] == 0):\r\n loss_zeroes += 1\r\n j += 1\r\n\r\n continue\r\n\r\n j += 1\r\n\r\n zero_ones = max(zero_ones, (n - loss - loss_zeroes))\r\n\r\n# print (f\"leading {leading_zeroes}\")\r\n# print (f\"ones {ones}\")\r\n# print (f\"zeroes {zeroes}\")\r\n\r\nprint(max(ones, zeroes, zero_ones))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nafter=sum(l)\r\nbefore=0\r\nbest=after\r\nfor i in range(n):\r\n if l[i]:after-=1\r\n else:before+=1\r\n best=max(best,after+before)\r\nprint(best)", "n=int(input())\nl=input().split()\nz,o=1,l.count('1')\nmaxi=max(o,n-o)\nfor i in l:\n if i=='1':\n o-=1\n if o+z>maxi:\n maxi=o+z\n else:\n z+=1\nprint(maxi)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_l = 0\r\nz, o = 0, 0\r\nfor i in range(n):\r\n o = 0\r\n if a[i] == 0:\r\n z += 1\r\n for j in range(i, n):\r\n if a[j] == 1:\r\n o += 1\r\n max_l = max(max_l, z + o)\r\nprint(max_l)\r\n", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\n\r\nprint(max([s[:i].count(0) + s[i:].count(1) for i in range(n + 1)]))", "n = int(input())\n\n# ['1'] - barrier element\ns = input().split() + ['1']\n\nzeroes_before = []\nzeroes = 0\nones = 0\n\nfor c in s:\n if c == '0':\n zeroes += 1\n elif c == '1':\n zeroes_before.append(zeroes)\n ones += 1\n\n# print(zeroes, ones, zeroes_before)\n\nres = 0\nfor z in range(ones):\n res = max(res, zeroes_before[z] + (ones - 1 - z))\n\nprint(res)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n #print(i-sum(a[:i]), sum(a[i:]))\r\n res = max(res, i-sum(a[:i]) + 1 + sum(a[i+1:]))\r\nprint(res)", "length = int(input())\r\narray = list(map(int, input().split()))\r\n\r\ncount = []\r\ntotal = 0\r\n\r\nfor k in range(length):\r\n if array[length - 1 - k] == 1:\r\n total += 1\r\n count.append(total)\r\ncount.reverse()\r\n\r\ntotal = 0\r\nmaximum = 0\r\nfor k in range(length):\r\n if array[k] == 0:\r\n total += 1\r\n\r\n maximum = max(maximum, total + count[k])\r\n\r\nprint(maximum)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\ndp = [0,0]\r\n\r\nfor a in A:\r\n ndp = dp[::]\r\n if a==0:\r\n ndp[0] = dp[0]+1\r\n else:\r\n ndp[1] = max(dp[0], dp[1])+1\r\n dp = ndp\r\n \r\nprint(max(dp))\r\n \r\n \r\n \r\n ", "n=int(input())\r\ns=input().split()\r\nk=0\r\nm=0\r\nfor i in range(n):\r\n if s[i]=='0':\r\n k+=1\r\n x=0\r\n for j in range(i,n):\r\n if s[j]=='1':\r\n x+=1\r\n if k+x>m:\r\n m=k+x\r\nprint(m)\r\n \r\n \r\n", "input()\r\ns = input()\r\nprint(max([s[:i].count('0') + s[i:].count('1') for i in range(len(s) + 1)]))", "input()\r\na = list(map(int,input().split()))\r\nf = 0\r\nfor i in range(len(a)):\r\n s = 0\r\n for j in range(len(a)):\r\n if j <= i:\r\n if a[j] == 0:\r\n s += 1\r\n if j >= i:\r\n if a[j] == 1:\r\n s += 1\r\n if s > f:\r\n f = s\r\nprint(f)", "n = int(input())\r\ngames = list(map(int, input().split()))\r\nafter = [0] * n\r\nif games[-1] == 1:\r\n after[-1] = 1\r\nelse:\r\n after[-1] = 0\r\nfor i in range(n - 2, -1, -1):\r\n if games[i] == 1:\r\n after[i] = after[i + 1] + 1\r\n else:\r\n after[i] = after[i + 1]\r\ncurnull = 0\r\nans = 0\r\nfor i in range(n):\r\n if games[i] == 0:\r\n curnull += 1\r\n ans = max(ans, curnull + after[i])\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = a.count(0)\r\nans = 0\r\nfor i in range(cnt + 1):\r\n a1 = a[::-1]\r\n a2 = []\r\n cnt1 = i\r\n index = 0\r\n while cnt1:\r\n if not a1[index]:\r\n cnt1 -= 1\r\n else:\r\n a2.append(a1[index])\r\n index += 1\r\n for j in range(index, n):\r\n a2.append(a1[j])\r\n a2 = a2[::-1]\r\n index = len(a2) - 1\r\n ansi = 0\r\n while index > -1 and a2[index]:\r\n index -= 1\r\n for o in range(index, -1, -1):\r\n if a2[o]:\r\n ansi += 1\r\n ans = max(len(a2) - ansi, ans)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\np = [0] * n\r\np[0]= a[0]\r\nfor i in range(1, n):\r\n p[i] = p[i - 1] + a[i]\r\nans = min(n, n - p[n - 1])\r\nfor i in range(n):\r\n l = p[i]\r\n r = (n - i - 1) - (p[n - 1] - p[i])\r\n ans = min(ans, l + r)\r\nprint(n - ans)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = sum(a)\r\nfor i in range(len(a) - 1, - 1, -1):\r\n ans = min(ans, (len(a) - i - sum(a[i:])) + sum(a[:i]))\r\nprint(len(a) - ans)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nl,r = 0,lst.count(0)\r\nres=r\r\nfor i,x in enumerate(lst):\r\n if x==0:r-=1\r\n else:l+=1\r\n if l+r<res:res=l+r\r\nprint(n-res)", "n = int(input())\nval = list(map(int, input().split()))\nk = 0\nfor i in range(n + 1):\n k = max(k, i - sum(val[:i]) + sum(val[i:]))\nprint(k)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\ncnt0, cnt1 = [0] * n, [0] * n\r\nfor i in range(n):\r\n if s[i]:\r\n cnt1[i] += 1\r\n else:\r\n cnt0[i] += 1\r\nfor i in range(1, n):\r\n cnt0[i] += cnt0[i - 1]\r\nfor i in range(n - 2, -1, -1):\r\n cnt1[i] += cnt1[i + 1]\r\nans = max(cnt0[-1], cnt1[0])\r\nfor i in range(n - 1):\r\n ans = max(ans, cnt0[i] + cnt1[i + 1])\r\nprint(ans)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nres = max([(i-sum(s[:i])) + 1 + sum(s[i+1:]) for i in range(n)])\r\nprint(res)", "n = int(input())\r\ns = input()\r\n\r\ndef max_l(s):\r\n\tif len(s) <= 1:\r\n\t\treturn len(s)\r\n\tlenE = 0\r\n\tind = 0\r\n\tprev = -1\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == '1':\r\n\t\t\tlenE += 1\r\n\t\tif s[i] == '1' and prev == '0':\r\n\t\t\tind = i - 1\r\n\t\tprev = s[i]\r\n\tlenZ=0\r\n\tfor i in range(ind+1):\r\n\t\tif s[i] == '0':\r\n\t\t\tlenZ +=1\r\n\treturn max(lenE, lenZ+max_l(s[ind+1:]))\t\r\n\t\r\na = max_l(s)\r\nprint(a)\r\n\t\t" ]

[ "maxn = 10**5 + 5\nmod = 10**9 + 7\ntest_case, k = map(int, input().split())\n\ndp = [0] * maxn\nsum = [0] * maxn\ndp[0] = 1\nfor i in range(1, maxn):\n dp[i] = dp[i - 1]\n if (i >= k):\n dp[i] = (dp[i] + dp[i - k]) % mod\nfor i in range(1, maxn):\n sum[i] = (sum[i - 1] + dp[i]) % mod\n\nfor _ in range(test_case):\n a, b = map(int, input().split())\n print((sum[b] - sum[a - 1] + mod) % mod)\n", "t,k=map(int,input().split())\r\nlistt=[]\r\nmod=10**9+7\r\nif k==1:\r\n listt.append(2)\r\n a=2\r\nelse:\r\n a=1\r\n\r\nfor i in range(a,10**5+1):\r\n if i<k:\r\n listt.append(1)\r\n else:\r\n listt.append((listt[-1]+listt[i-k-1])%mod)\r\nsum=0\r\npre_sum=[0]\r\nfor i in range(len(listt)):\r\n sum+=listt[i]\r\n sum%=mod\r\n pre_sum.append(sum)\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n print((pre_sum[b]-pre_sum[a-1]+mod)%mod)", "import sys\r\nimport sys, threading\r\nfrom heapq import heapify, heappop, heappush\r\nfrom math import log10, floor, pow, gcd, sqrt, inf, log2\r\nfrom collections import defaultdict, deque, Counter\r\ninput = sys.stdin.readline\r\n \r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\ndef main():\r\n \r\n MOD = 1000000007\r\n N = 100005\r\n \r\n def solve(n, k, test_cases):\r\n dp = [0] * N\r\n \r\n i = 1\r\n while i < k:\r\n dp[i] = 1\r\n i += 1\r\n \r\n dp[k] = 2\r\n \r\n for i in range(k + 1, N):\r\n dp[i] = (dp[i - k] + dp[i - 1]) % MOD\r\n \r\n for i in range(1, N):\r\n dp[i] = (dp[i] + dp[i - 1]) % MOD\r\n \r\n result = []\r\n for a, b in test_cases:\r\n k = (dp[b] - dp[a - 1]) % MOD\r\n if k < 0:\r\n k += MOD\r\n result.append(k)\r\n \r\n return result\r\n \r\n # Read input\r\n n, k = map(int, input().split())\r\n test_cases = []\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n test_cases.append((a, b))\r\n \r\n # Solve and print output\r\n output = solve(n, k, test_cases)\r\n for ways in output:\r\n print(ways)\r\n \r\n \r\n \r\n \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()\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nMOD = 1000000007\r\n\r\nt , k = map( int , input( ).split( ) )\r\nf = [0] * 100005\r\nf[0] = 1 \r\nfor i in range( 1 , 100005 ) : \r\n f[i] = f[i-1]\r\n if i >= k : f[i] += f[i-k]\r\n f[i] %= MOD \r\nf[0] = 0 \r\nfor i in range( 1 , 100001 ) : \r\n f[i] += f[i-1] \r\n f[i] %= MOD \r\nfor _ in range( t ) : \r\n l , r = map( int , input( ).split( ) )\r\n print( ( f[r] - f[l-1] + MOD ) % MOD )", "MOD = 10**9 + 7\r\nMAX = 10**5 + 1\r\n\r\ndef flowers():\r\n t, k = map(int, input().split())\r\n \r\n # Precompute the number of ways to eat exactly i flowers\r\n ways = [0] * MAX\r\n ways[0] = 1\r\n for i in range(1, MAX):\r\n ways[i] = ways[i - 1]\r\n if i >= k:\r\n ways[i] = (ways[i] + ways[i - k]) % MOD\r\n \r\n # Compute prefix sums\r\n prefix_sums = [0] * MAX\r\n for i in range(1, MAX):\r\n prefix_sums[i] = (prefix_sums[i - 1] + ways[i]) % MOD\r\n\r\n # Process the test cases\r\n for _ in range(t):\r\n a, b = map(int, input().split())\r\n print((prefix_sums[b] - prefix_sums[a - 1] + MOD) % MOD)\r\n\r\nflowers()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nMOD = 1000000007\r\n\r\nt , k = map( int , input( ).split( ) )\r\nf = [[0,0] for _ in range( 100002 ) ]\r\nf[0][0] = 1 \r\nfor i in range( 1 , 100001 ) : \r\n f[i][0] = ( f[i-1][0] + f[i-1][1] ) % MOD \r\n if i >= k : f[i][1] = ( f[i-k][0] + f[i-k][1] ) % MOD \r\nf[0][0] = 0 \r\nfor i in range( 1 , 100001 ) : \r\n f[i][0] = ( f[i][0] + f[i-1][0] ) % MOD \r\n f[i][1] = ( f[i][1] + f[i-1][1] ) % MOD \r\nfor i in range( t ) : \r\n l , r = map( int ,input( ).split( ) ) \r\n print( ( sum( f[r] ) - sum( f[l-1] ) + MOD ) % MOD )", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\n\r\nM = int(1e9) + 7\r\nN = int(1e5) + 5\r\n\r\nt, k = map(int, input().split())\r\ndp = [0]*N\r\ndp[0] = 1\r\n\r\nfor i in range(1, N):\r\n dp[i] = dp[i-1] + (i >= k) * dp[i-k]\r\n dp[i] %= M\r\n\r\nfor i in range(1, N):\r\n dp[i] += dp[i-1]\r\n dp[i] %= M\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n print((dp[b] - dp[a-1]) % M)", "mod=7+10**9\r\nt,k=map(int,input().split())\r\nx=[1]*(100001)\r\nfor i in range(k,100001):\r\n\tx[i]=(x[i-1]+x[i-k])%mod\r\nfor i in range(1,100001):\r\n\tx[i]=(x[i]+x[i-1])%mod\r\nfor i in range(t):\r\n\ta,b=map(int,input().split())\r\n\tprint ((x[b]-x[a - 1])%mod)", "m, b = 1000000007, 100001\r\nc = lambda:map(int, input().split())\r\na = [1] * b\r\nt, k = c()\r\nfor i in range(k, b):\r\n\ta[i] = (a[i - 1] + a[i - k]) % m\r\nfor i in range(1, b):\r\n\ta[i] = (a[i] + a[i - 1]) % m\r\nwhile t:\r\n\tt -= 1\r\n\tx, y = c()\r\n\tprint ((a[y] - a[x - 1]) % m)\r\n", "def R():return map(int,input().split())\r\na,b=R();n=100001;k=10**9+7;A=[1]*b;B=list(range(1,b+1))\r\nfor i in range(b,n):t=A[-1]+A[-b];A+=[t%k];B+=[(B[-1]+t)%k]\r\nfor _ in range(a):m,n=R();print((B[n]-B[m-1])%k)", "MOD = 1000000007\r\nt, k = map(int, input().split())\r\nmemo = [1] * k # ending with R, ending with W\r\npartials = [i for i in range(1, k+1)]\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n for n in range(len(memo), b+1):\r\n memo.append((memo[n-1] + memo[n-k]) % MOD)\r\n for n in range(len(partials), len(memo)):\r\n partials.append((partials[n-1] + memo[n]) % MOD)\r\n print((partials[b] - partials[a-1]) % MOD)\r\n", "# numOfWays[i] = ans for i num of flowers\r\n\r\n# numOfWays[i] = numOfWays[i - 1] + numOfWays[i - k]\r\n\r\nt, k = list(map(int, input().split()))\r\n\r\nnumOfWays = [0] * (int(1e5) + 1)\r\n# exit()\r\nnum = 0\r\nwhile num < k:\r\n numOfWays[num] = 1\r\n num += 1\r\nnumOfWays[k] = 2\r\n\r\nnum = k + 1\r\nwhile num < int(1e5) + 1:\r\n numOfWays[num] = (numOfWays[num - 1] + numOfWays[num - k]) % 1000000007\r\n num += 1\r\n\r\nind = 2\r\nwhile ind < len(numOfWays):\r\n numOfWays[ind] = (numOfWays[ind] + numOfWays[ind - 1]) % 1000000007\r\n ind += 1\r\nnumOfWays[0] = 0\r\n# print(numOfWays[:10])\r\nfor _ in range(t):\r\n a, b = list(map(int, input().split()))\r\n print((numOfWays[b] - numOfWays[a - 1]) % 1000000007)", "MODULO = 1000000007\nnum_casos, tam_grupo_blancas = map(int, input().split())\ndinamica = [0 for _ in range(100001)]\nsuma_prefijos = [0 for x in range(100001)]\ndinamica[0] = 1\nfor i in range(1, 100001):\n dinamica[i] = dinamica[i - 1]\n if i >= tam_grupo_blancas:\n dinamica[i] = (dinamica[i] + dinamica[i - tam_grupo_blancas]) % MODULO\n suma_prefijos[i] = (suma_prefijos[i - 1] + dinamica[i]) % MODULO\nfor y in range(num_casos):\n rango_inferior, rango_superior = map(int, input().split())\n formas = (suma_prefijos[rango_superior] - suma_prefijos[rango_inferior - 1] + MODULO) % MODULO\n print(formas)\n\n\t \t\t\t\t\t \t \t\t \t \t \t\t\t \t \t", "mod = 1000000007\r\nN = 100005\r\n\r\ndef solve():\r\n dp = [0] * N\r\n i = 1\r\n while i < k:\r\n dp[i] = 1\r\n i += 1\r\n\r\n dp[k] = 2\r\n\r\n for i in range(k + 1, N):\r\n dp[i] = (dp[i - k] % mod + dp[i - 1] % mod) % mod\r\n\r\n for i in range(1, N):\r\n dp[i] = (dp[i] % mod + dp[i - 1] % mod) % mod\r\n\r\n return dp\r\n\r\nn, k = map(int, input().split())\r\ndp = solve()\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n res = (dp[b] - dp[a - 1]) % mod\r\n if res < 0:\r\n res += mod\r\n print(res)\r\n\r\n\r\n", "a,b=map(int,input().split());t=b;z=[i for i in range(1,b+1)]\r\nwhile(t<100001):z+=[(z[t-1]+z[t-b]+1)%1000000007];t+=1\r\nfor i in range(a):x,y=map(int,input().split());print((z[y]-z[x-1])%1000000007)\r\n", "t,k = map(int,input().split())\r\nl=[i for i in range(1,k+1)]\r\nfor i in range(k,100001):\r\n l.append((l[i-1]+l[i-k]+1)%1000000007)\r\nfor _ in range(t):\r\n a,b = map(int,input().split())\r\n print((l[b]-l[a-1])%1000000007) ", "n,k = list(map(int, input().split(' ')))\n\ndp = [0] * 100005\nmod=1000000007\ni=1\n\nwhile(i<k):\n\tdp[i]=1\n\ti+=1\n\t\ndp[k] =2\nfor i in range(k+1, 100005):\n\tdp[i] = (dp[i - k] % mod + dp[i - 1] % mod) % mod\n\t\nfor i in range(1, 100005):\n\tdp[i] = (dp[i] % mod + dp[i - 1] % mod)%mod;\n\t\nfor i in range(n):\n\ta,b = list(map(int, input().split(' ')))\n\t\n\tk = (dp[b] - dp[a - 1]) % mod\n\t\n\tif(k<0):\n\t\tk+=mod\n\t\t\n\tprint(k)\n \t\t\t\t \t \t \t\t\t \t \t\t\t\t\t \t\t \t\t", "MOD=pow(10,9)+7\nt,k=map(int,input().split())\nref=[0]*(10**5+2)\nq=0\nfor q in range(k-1):\n ref[q]=1\nref[q+1]=2\nq+=1\n#print(q)\nfor i in range(q+1,10**5+2):\n ref[i]=(ref[i-1]+ref[i-k])%MOD\n#print(ref)\nmain_ref=[0]\ntemp=0\nfor i in range(10**5+1):\n temp+=(ref[i])\n main_ref.append(temp)\n#print(main_ref)\nfor i in range(t):\n a,b=map(int,input().split())\n if k!=1:\n print((main_ref[b]-main_ref[a-1])%MOD)\n else:\n print((main_ref[b+1]-main_ref[a])%MOD)\n \t \t \t\t\t \t\t\t\t \t\t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nM = 10**9+7\r\nt, k = map(int, input().split())\r\nd = [1]*k\r\nfor i in range(10**5):\r\n d.append((d[-1]+d[-k])%M)\r\nq = [0]\r\nfor i in range(1, 10**5+1):\r\n q.append((q[-1]+d[i])%M)\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n print((q[b]-q[a-1])%M)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations, accumulate\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom bisect import bisect_left,bisect_right\r\nfrom math import lcm,gcd,sqrt,ceil,comb\r\nfrom heapq import heappop,heappush,heapify\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\"\r\nMOD=10**9+7;N=300010;fac=[1]*N;invfac=[1]*N #Fill out N to calculate combinations\r\nfor i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\ninvfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\nfor i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\ndef c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\n\r\ndef solve():\r\n t,k=map(int,input().split());dp=[1]+[0]*(10**5);dp0=[0]\r\n for i in range(1,10**5+1):\r\n dp[i]=(dp[i]+dp[i-1]+(dp[i-k] if i-k>=0 else 0))%MOD\r\n dp0.append((dp0[-1]+dp[i])%MOD)\r\n for _ in range(t):\r\n a,b=map(int,input().split())\r\n print((dp0[b]-dp0[a-1])%MOD)\r\n\r\nif __name__==\"__main__\":\r\n solve()", "def R():return map(int,input().split())\r\na,b=R();n=100001;k=10**9+7;A=list(range(1,b+1))\r\nfor _ in range(b,n):A+=[(A[-1]+A[-b]+1)%k]\r\nfor _ in range(a):m,n=R();print((A[n]-A[m-1])%k)", "import heapq \r\nfrom collections import defaultdict \r\nimport math \r\nimport collections\r\n\r\n\r\n\r\nmod=10**9+7\r\nalp='#abcdefghijklmnopqrstuvwxyz'\r\ncap='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndigit='1234567890'\r\n\r\n\r\n\r\n#math.facorial(n)------>gives the factorial \r\n\r\nY=\"YES\"\r\nN=\"NO\"\r\nminus=-1\r\n\r\nmod=10**9+7\r\nt,k=map(int,input().split())\r\npart=[i for i in range(1,k+1)]\r\ndp=[1]*(k)\r\nfor _ in range(t):\r\n \r\n # =int(input()) \r\n a, b=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n #s=input()\r\n for i in range(len(dp),b+1):\r\n dp.append((dp[i-1]+dp[i-k])%mod)\r\n le =len(dp)\r\n for j in range(len(part),le):\r\n part.append((part[j-1]+dp[j])%mod)\r\n print((part[b]-part[a-1])%mod)\r\n \r\n ", "MOD = int(1e9) + 7\r\nN = 100000\r\n\r\ndef calculate_ways(tc, k, test_cases):\r\n dp = [0] * (N + 1)\r\n dp[0] = 1\r\n\r\n for i in range(1, N + 1):\r\n dp[i] = dp[i - 1]\r\n if i >= k:\r\n dp[i] = (dp[i] + dp[i - k]) % MOD\r\n\r\n sum_dp = [0] * (N + 1)\r\n sum_dp[0] = dp[0]\r\n for i in range(1, N + 1):\r\n sum_dp[i] = (sum_dp[i - 1] + dp[i]) % MOD\r\n\r\n results = []\r\n for i in range(tc):\r\n a, b = test_cases[i]\r\n result = (sum_dp[b] - sum_dp[a - 1] + MOD) % MOD\r\n results.append(result)\r\n\r\n return results\r\n\r\n# Read input\r\ntc, k = map(int, input().split())\r\ntest_cases = []\r\nfor _ in range(tc):\r\n a, b = map(int, input().split())\r\n test_cases.append((a, b))\r\n\r\n# Calculate and print results\r\nresults = calculate_ways(tc, k, test_cases)\r\nfor result in results:\r\n print(result)", "MOD = 1000000007\r\n\r\nt, k = map(int, input().split())\r\n\r\ndp = [0] * 100001\r\ndp[0] = 1\r\nfor i in range(1, 100001):\r\n dp[i] = dp[i - 1]\r\n if i >= k:\r\n dp[i] = (dp[i] + dp[i - k]) % MOD\r\n\r\nfor i in range(1, 100001):\r\n dp[i] = (dp[i] + dp[i - 1]) % MOD\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n print((dp[b] - dp[a - 1]) % MOD)\r\n", "N = 100000\r\nMOD = 1000000007\r\n\r\ndp = [0] * (N + 1)\r\nsum = [0] * (N + 1)\r\n\r\ndef main():\r\n tc, k = map(int, input().split())\r\n\r\n dp[0] = 1\r\n for i in range(1, N + 1):\r\n dp[i] = dp[i - 1]\r\n if i >= k:\r\n dp[i] = (dp[i] + dp[i - k]) % MOD\r\n\r\n for i in range(1, N + 1):\r\n sum[i] = (sum[i - 1] + dp[i]) % MOD\r\n\r\n for i in range(tc):\r\n a, b = map(int, input().split())\r\n print((sum[b] - sum[a - 1] + MOD) % MOD)\r\n\r\nmain()", "import array\r\n\r\nMOD = 1000000007\r\nTOP = 10**5\r\n\r\nt, k = map(int, input().split())\r\n\r\ndp = [0] * (TOP + 10)\r\ndp[0] = 1\r\n\r\nfor i in range(1, TOP + 2):\r\n dp[i] += dp[i - 1]\r\n if i >= k:\r\n dp[i] += dp[i - k]\r\n dp[i] %= MOD\r\n\r\nprev = [0] * (TOP + 10)\r\nfor i in range(0, TOP + 2):\r\n prev[i] += prev[i - 1] + dp[i]\r\n prev[i] %= MOD\r\n\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n print((prev[b] - prev[a - 1]) % MOD)\r\n", "# t, k = list(map(int, input().split()))\r\n# MOD = 1000000007\r\n# for _ in range(t):\r\n# a, b = list(map(int, input().split()))\r\n# res = 0\r\n# dp = [1] * (b + 1)\r\n# for i in range(k, b + 1):\r\n# dp[i] = ((dp[i - 1] % MOD) + (dp[i - k] % MOD)) % MOD\r\n# for i in range(a, b + 1):\r\n# res = (dp[i] + res) % MOD # exceeded\r\n# print(res)\r\nt, k = list(map(int, input().split()))\r\nMOD = 1000000007\r\na_b = []\r\na, b = 0, 0\r\nfor _ in range(t):\r\n a_b.append(list(map(int, input().split())))\r\n a = max(a, a_b[-1][0])\r\n b = max(b, a_b[-1][1])\r\ndp = [1] * (b + 1)\r\nprefix = [i + 1 for i in range(b + 1)]\r\nfor i in range(k, b + 1):\r\n dp[i] = ((dp[i - 1] % MOD) + (dp[i - k] % MOD)) % MOD\r\n prefix[i] = ((prefix[i - 1] % MOD) + dp[i]) % MOD\r\nfor i in range(t):\r\n res = 0\r\n print((prefix[a_b[i][1]] - prefix[a_b[i][0] - 1]) % MOD)\r\n", "t, k = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\ndp = [0 for i in range(10 ** 5 + 1)]\r\ndp[0] = 1\r\nfor i in range(1, 10 ** 5 + 1):\r\n dp[i] = dp[i - 1]\r\n if i >= k:\r\n dp[i] += dp[i - k]\r\n dp[i] %= mod\r\n\r\nprefix = [0]\r\n\r\nfor i in range(10 ** 5 + 1):\r\n prefix += [(prefix[-1] + dp[i]) % mod]\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n print((prefix[b + 1] - prefix[a]) % mod)\r\n" ]

[ "import math\r\na , b, n= [int(i) for i in input().split()]\r\nans = False\r\nwhile True:\r\n if ans == False:\r\n g = math.gcd(a,n)\r\n n -=g\r\n if n <=0:\r\n print(int(ans))\r\n break\r\n ans = not ans\r\n else:\r\n g = math.gcd(b,n)\r\n n -=g\r\n if n <=0:\r\n print(int(ans))\r\n break\r\n ans = not ans", "from math import gcd \r\na,b,n=map(int,input().split())\r\nx=n\r\nflag=1\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tg=gcd(a,x)\r\n\t\tif x>=g:\r\n\t\t\tflag=0\r\n\t\t\tx=x-g\r\n\t\telse:\r\n\t\t\tbreak\t\r\n\telse:\r\n\t\tg=gcd(b,x)\r\n\t\tif x>=g:\r\n\t\t\tflag=1\r\n\t\t\tx=x-g\r\n\t\telse:\r\n\t\t\tbreak\t\t\t\t\t\r\nprint(flag)\t", "\"\"\"\r\nSolution to Codeforces Problem 119A : https://codeforces.com/problemset/problem/119/A\r\n\r\nDifficulty: 800\r\n\"\"\"\r\nimport math\r\n\r\nsolve = lambda a, b, n, i: solve(b, a, n - math.gcd(a, n), i+1) if n != 0 else i % 2\r\n\r\nprint(solve(*list(map(int, input().split(' '))), 1))\r\n", "# from math import gcd\r\n\r\na, b, n = map( int, input().split() )\r\n\r\n\r\n# def nod(x, y):\r\n# while(y): \r\n# x, x = y, x % y \r\n# return x\r\n\r\ndef gcd_rem_division(num1, num2):\r\n while num1 != 0 and num2 != 0:\r\n if num1 >= num2:\r\n num1 %= num2\r\n else:\r\n num2 %= num1\r\n return num1 or num2\r\n\r\n\r\nlast_move = True\r\n\r\nwhile n > 0:\r\n \r\n n -= gcd_rem_division(a, n) if last_move else gcd_rem_division(b, n)\r\n last_move = False if last_move else True\r\n\r\n\r\n\r\nprint(1) if last_move else print(0)\r\n", "from math import *\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n\tif i==0:\r\n\t\tre=gcd(a,n)\r\n\t\tn-=re\r\n\t\ti=1\r\n\telif i==1:\r\n\t\tre=gcd(b,n)\r\n\t\tn-=re\r\n\t\ti=0\r\nif i==1:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "a, b, c = map(int, input().split())\r\ne = 1\r\n\r\ndef gcd(x, y):\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y, x % y)\r\n\r\nwhile True:\r\n if e % 2 != 0:\r\n s = gcd(a, c)\r\n else:\r\n s = gcd(b, c)\r\n\r\n if s > c:\r\n break\r\n else:\r\n c -= s\r\n e += 1\r\n\r\nif e % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1) \r\n", "from math import gcd\r\na,b,c=map(int,input().split())\r\nx=True\r\nk=0\r\nwhile x:\r\n if k%2==0:\r\n if c-gcd(a,c)>=0:\r\n c-=gcd(a,c)\r\n k+=1\r\n else:\r\n print(1)\r\n x=False\r\n else:\r\n if c-gcd(b,c)>=0:\r\n c-=gcd(b,c)\r\n k+=1\r\n else:\r\n print(0)\r\n x=False\r\n", "def gcd(a, b): return max(a, b) if min(a, b) == 0 else gcd(b, a%b)\r\n[a, b, n] = [int(x) for x in input().split()]\r\ni = 0\r\nwhile n >= 0:\r\n if i%2 == 0: n -= gcd(n, a)\r\n else: n -= gcd(n, b)\r\n i += 1\r\nprint(0 if i%2 == 0 else 1)\r\n", "import math\r\n\r\ndef solve():\r\n a, b, n = map(int, input().split())\r\n turn_a = True\r\n while True:\r\n if turn_a:\r\n if n == 0: return \"1\"\r\n x = math.gcd(a, n)\r\n if n < x:\r\n return \"1\"\r\n n -= x\r\n else:\r\n if n == 0: return \"0\"\r\n x = math.gcd(b, n)\r\n if n < x:\r\n return \"0\"\r\n n -= x\r\n \r\n turn_a = not turn_a\r\n \r\n \r\nans = solve()\r\nprint(ans)", "a,b,n=map(int,input().split())\r\ndef gcd(a,b,n,c):\r\n if c==0:\r\n m=min(a,n)\r\n else:\r\n m=min(b,n)\r\n \r\n while True: \r\n if c==0:\r\n if a%m==0 and n%m==0:\r\n return n-m\r\n else:\r\n m-=1\r\n else:\r\n if b%m==0 and n%m==0:\r\n return n-m\r\n else:\r\n m-=1\r\ni=0\r\nwhile n!=0:\r\n if i%2==0:\r\n c=0\r\n else:\r\n c=1\r\n n=gcd(a,b,n,c)\r\n i+=1\r\nprint(c)", "from math import gcd\r\n\r\na, b, n = list(map(int, input().split()))\r\namount = [a, b]\r\nturn = 0\r\n\r\nwhile True:\r\n\ttoPick = gcd(amount[turn], n)\r\n\tif toPick > n:\r\n\t\tprint((turn+1)%2)\r\n\t\tbreak\r\n\tn -= toPick\r\n\tif n == 0:\r\n\t\tprint(turn)\r\n\t\tbreak\r\n\tturn = (turn+1)%2", "import math\r\na,b,n=map(int,input().split())\r\ntemp,res=math.gcd(a,n),False\r\nwhile n>temp:\r\n n-=temp\r\n temp=math.gcd(b,n) if not res else math.gcd(a,n)\r\n res=not res\r\nprint(1 if res else 0)\r\n", "a,b,n=map(int,input().split())\r\ndef NODa(a,n):\r\n while n>0:\r\n a,n=n,a%n\r\n return a\r\n\r\ndef NODb(b,n):\r\n while n>0:\r\n b,n=n,b%n\r\n return b\r\n\r\ndef vse(a,b,n):\r\n s=0\r\n while n>0:\r\n if n>0:\r\n n=n-NODa(a,n)\r\n s=0\r\n if n>0:\r\n n=n-NODb(b,n)\r\n s=1\r\n return s\r\nprint(vse(a,b,n))\r\n", "from math import gcd\r\n\r\na,b,n = map(int, input().split())\r\nwhile 1:\r\n if n==0: print(1); break\r\n else:n-=gcd(n,a)\r\n if n==0: print(0); break\r\n else:n-=gcd(n,b)", "def gcd(a, b):\r\n q = a % b\r\n if q:\r\n return gcd(b, q)\r\n else:\r\n return b\r\n\r\na, b, n = map(int, input().split())\r\nremained = [a, b]\r\ni = 0\r\n\r\nwhile n:\r\n n -= gcd(remained[i], n)\r\n i = 1 - i\r\n\r\nprint(1 - i)\r\n", "# t=int(input())\r\n# while t>0:\r\n # x,k=input().split(' ')\r\n # x=int(x)\r\n # k=int(k)\r\n # if(k==2):\r\n # if(x%2==0):\r\n # print(2)\r\n # print(1,x-1)\r\n # else:\r\n # if(x>1):\r\n # print(3)\r\n # print(1,1,x-2)\r\n # else:\r\n # print(1)\r\n # print(1)\r\n # else:\r\n # if x%2==0:\r\n # if((x/2)%k!=0):\r\n # print(2)\r\n # print(x/2,x/2)\r\n # else:\r\n # print(2)\r\n # print(x/2-1,x/2+1)\r\n # else:\r\na,b,n=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\ndef gcd(a,b):\r\n if a==0:\r\n return b\r\n elif b==0:\r\n return a\r\n elif a%b==0:\r\n return b\r\n elif b%a==0:\r\n return a\r\n else:\r\n return 1\r\nx=a#x=3\r\ni=1\r\nwhile gcd(x,n)<=n:\r\n m=gcd(x,n)#m=3\r\n n-=m#n=0\r\n i+=1#i=6\r\n if i%2==0:\r\n x=b#x=5\r\n else:\r\n x=a\r\nif i%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n # t-=1", "import math\r\na,b,n = map(int,input().split())\r\nkhodov=0\r\nwhile n>0:\r\n n=n-math.gcd(a,n)\r\n a,b = b,a\r\n khodov=khodov+1\r\n\r\nif khodov%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "import math\r\na= list(map(int, input().split()))\r\ni=1\r\n\r\nwhile i>0: \r\n if i%2!=0:\r\n b= math.gcd(a[0],a[2])\r\n if b<=a[2]:\r\n a[2]=a[2]-b\r\n \r\n i+=1\r\n else:\r\n print(\"1\")\r\n break\r\n else:\r\n c= math.gcd(a[1],a[2])\r\n if c<=a[2]:\r\n a[2]=a[2]-c\r\n i+=1\r\n else:\r\n print(\"0\")\r\n break\r\n \r\n", "def gcd(a,b):\r\n while b!=0:\r\n a,b=b,a%b\r\n return a\r\na,b,n = map(int, input().split())\r\ncnt = 0\r\nwhile n!=0:\r\n if cnt%2 == 0:\r\n n -= gcd(a,n)\r\n else:\r\n n -= gcd(b,n)\r\n cnt += 1\r\nif cnt%2 == 0:\r\n print(1)\r\nelse:\r\n print(0)", "import math\r\nx = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\nn = int(x[-1])\r\nwhile True:\r\n x = math.gcd(a,n)\r\n n-=x\r\n if n==0 or n<x:\r\n print(\"0\")\r\n break\r\n y = math.gcd(b,n)\r\n n -= y\r\n if n==0 or n<y:\r\n print(\"1\")\r\n break\r\n ", "def gcd(x,y):\n for i in range(min(x,y),0,-1):\n if(x%i==0 and y%i==0):\n return(i)\nst=list(map(int,input().split()))\nx=[]\nx.append(st[0])\nx.append(st[1])\nn=st[2]\ngagneur=0\ni=0\nwhile(n>0):\n gagneur=i%2\n n-=gcd(x[i%2],n)\n i+=1\nprint(gagneur)\n \t \t\t\t \t\t\t \t\t\t\t \t\t\t \t \t\t\t \t\t", "def gcd(a,b):\r\n\tif(b==0):\r\n\t\treturn a\r\n\treturn gcd(b, a%b)\r\n\r\na,b,n = map(int, input().split())\r\ncount = 0\r\nwhile(True):\r\n\tif(count%2==0):\r\n\t\tx = gcd(a,n)\r\n\t\tif x<=n:\r\n\t\t\tn-=x\r\n\t\t\tcount += 1\r\n\t\telse:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\ty = gcd(b,n)\r\n\t\tif y<=n:\r\n\t\t\tn-=y\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n", "a,b,n = map(int,input().split())\r\nak,bk=a,b\r\nt=1\r\nost=n\r\nif 1<=a and a<=100 and 1<=b and b<=100 and 1<=n and n<=100:\r\n while ost>=0:\r\n n=ost\r\n if t%2!=0:\r\n a=ak\r\n while n>0:\r\n a,n=n,a%n\r\n if a>ost:\r\n print(1)\r\n break\r\n else:\r\n ost-=a\r\n else:\r\n b=bk\r\n while n>0:\r\n b,n=n,b%n\r\n if b>ost:\r\n print(0)\r\n break\r\n else:\r\n ost-=b\r\n t+=1\r\nelse:\r\n print('proverte chisla')", "import math\r\na,b,n= input().split()\r\nc=0\r\nwhile math.gcd(int(a), int(n))<=int(n):\r\n x= math.gcd(int(a), int(n))\r\n n=int(n)-x\r\n c=0\r\n if math.gcd(int(b),int(n))<=n:\r\n y= math.gcd(int(b),int(n))\r\n n=int(n)-y\r\n c=1\r\nif c==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "import math\na, b, capacity = map(int, input().split(' '))\nflag = 0\nwhile True:\n if not flag:\n req = math.gcd(a,capacity)\n flag = 1\n if req > capacity:\n print('1')\n break\n else:\n capacity -= req\n if flag:\n req = math.gcd(b,capacity)\n flag = 0\n if req > capacity:\n print('0')\n break\n else:\n capacity -= req\n\n", "import math\r\na,b,c = map(int, input().split())\r\n\r\ncheck = 0\r\n\r\nwhile(True):\r\n\r\n if check%2==0:\r\n if math.gcd(a, c) < c:\r\n c-=math.gcd(a,c)\r\n check+=1\r\n else:\r\n print(0)\r\n break\r\n\r\n else:\r\n if math.gcd(b, c) < c:\r\n c-=math.gcd(b,c)\r\n check += 1\r\n else:\r\n print(1)\r\n break\r\n\r\n\r\n", "import math\r\nsTurn = True\r\nm,n,k = map(int,input().split())\r\nwhile True:\r\n if sTurn:\r\n k -= math.gcd(m,k)\r\n sTurn = False\r\n else:\r\n k -= math.gcd(n,k)\r\n sTurn = True\r\n if k-math.gcd(n,k)<0 and not sTurn:\r\n print(0)\r\n break\r\n elif k-math.gcd(m,k)<0 and sTurn:\r\n print(1)\r\n break", "import math\ndef main():\n a, b, n = map(int, input().split())\n now = 0\n while(True):\n if now == 0:\n g = math.gcd(a, n)\n else:\n g = math.gcd(b, n)\n if g > n:\n print(now ^ 1)\n break\n else:\n n -= g\n now ^= 1\n\nmain()", "import math\r\na,b,c=map(int,input().split());i=0\r\nwhile True:\r\n i+=1\r\n if i%2==1:\r\n c-=math.gcd(a,c)\r\n p=0\r\n else:\r\n c-=math.gcd(b,c)\r\n p=1\r\n if c<=0:\r\n break\r\nif c==0:\r\n print(p)\r\nelse:\r\n print(abs(p-1))\r\n", "# import math\r\n\r\ndef gcd(x, y):\r\n if (x == 0):\r\n return y\r\n else:\r\n return gcd(y % x, x)\r\n\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n k = 0\r\n while (n >= 0):\r\n k += 1\r\n if (k & 1):\r\n n = n-gcd(a, n)\r\n else:\r\n n = n-gcd(b, n)\r\n\r\n if (k & 1):\r\n print(1)\r\n else:\r\n print(0)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from fractions import gcd\ns=input().split()\nn=int(s[2])\nwhile True:\n n=n-gcd(n,int(s[0]))\n if n==0 :\n print(0)\n break\n else :\n if n<=0 :\n print(1)\n break\n n=n-gcd(n,int(s[1]))\n if n==0 :\n print(1)\n break\n else :\n if n<=0 :\n print(0)\n break", "#Epic_Game\r\nimport math\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n n-=math.gcd(a,n)\r\n if(n<0):\r\n print(1)\r\n break\r\n n-=math.gcd(b,n)\r\n if(n<0):\r\n print(0)\r\n break\r\n \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\na,b,n = map(int,input().split())\r\ni = 1\r\nwhile n >= 0 :\r\n if i % 2 != 0 :\r\n c = gcd(a,n)\r\n n = n - c\r\n if n == 0 :\r\n print('0')\r\n else :\r\n d = gcd(b,n)\r\n n = n - d\r\n if n == 0 :\r\n print('1')\r\n i += 1 ", "from math import gcd\r\na,b,n=map(int,input().split())\r\nc=0\r\nwhile(n!=0):\r\n if c%2==0:\r\n n-=gcd(a,n)\r\n else:\r\n n-=gcd(b,n)\r\n c+=1\r\n# print(c)\r\nif c%2==1:\r\n print(0)\r\nelse:\r\n print(1)", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n\r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef solve():\r\n\ta,b,n = [int(q) for q in input().split()]\r\n\tans = 0\r\n\twhile n > 0:\r\n\t\tif ans == 0:\r\n\t\t\tn -= gcd(a,n)\r\n\t\telse:\r\n\t\t\tn -= gcd(b,n)\r\n\t\tans += 1\r\n\t\tans %= 2\r\n\tprint((ans+1)%2)\r\n\r\nsolve()", "import math\r\na, b, c = map(int, input().split())\r\ni=0\r\nwhile c>=0:\r\n if i%2==0: c -= math.gcd(a,c)\r\n else: c-= math.gcd(b,c)\r\n i+=1\r\nif (i%2==0): print(0)\r\nelse: print(1) \r\n", "from math import gcd\r\n\r\ndef main():\r\n a,b,n = map(int, input().split())\r\n while True:\r\n n = n - gcd(a,n)\r\n if n == 0:\r\n print(\"0\")\r\n break\r\n n = n - gcd(b, n)\r\n if n == 0:\r\n print(\"1\")\r\n break\r\nmain()", "def nok(a, b):\r\n ch_1,ch_2=a,b\r\n while b > 0:\r\n c = a % b\r\n a = b\r\n b = c\r\n return a\r\n\r\n\r\nx,y,n=map(int,input().split())\r\ni=1\r\nwhile n>0:\r\n if i%2==0:\r\n n -= nok(y, n)\r\n else:\r\n n -= nok(x, n)\r\n i+=1\r\nif i%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n\r\n", "a,b,n=map(int,input().split())\r\n\r\ndef gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n return gcd(b,a%b)\r\n\r\ni=1\r\nwhile n>0:\r\n if i%2==1:\r\n c=gcd(max(a,n),min(a,n))\r\n if c<n:\r\n n=n-c\r\n elif c-n==0:\r\n print(0)\r\n break\r\n elif c>n:\r\n print(1)\r\n break\r\n\r\n else:\r\n c=gcd(max(b,n),min(b,n))\r\n if c<n:\r\n n=n-c\r\n elif c-n==0:\r\n print(1)\r\n break\r\n elif c>n:\r\n print(0)\r\n break\r\n i=i+1\r\n\r\n\r\n", "import math\r\na,b,n = map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n x = math.gcd(a,n)\r\n if n>=x:\r\n n-=x\r\n else:\r\n i+=1\r\n break\r\n else:\r\n x = math.gcd(b,n)\r\n if n>=x:\r\n n-=x\r\n else:\r\n i+=1\r\n break\r\n i+=1\r\nprint((i-1)%2)", "from math import ceil, floor, sqrt, log, gcd\r\ndef solve ():\r\n\tA, B, N = [int(X) for X in input().split()]\r\n\tturn = 0\r\n\twhile N >= 0 :\r\n\t\t\r\n\t\tif turn %2 == 0:\r\n\t\t\tN -= gcd (N,A)\r\n\t\telse :\r\n\t\t\tN -= gcd (N,B)\r\n\t\tturn += 1\r\n\tprint (turn%2)\r\nif __name__ == '__main__':\r\n\tT = 1\r\n\t# T = int (input())\r\n\tfor _ in range (T):\r\n\t\tsolve ()\r\n\r\n'''\r\n100 100 10 \r\n\r\nAns = 0\r\n'''\r\n'''\r\n2\r\n3 5 9\r\n1 1 100\r\n----------\r\n0\r\n1\r\n'''", "from math import *\r\ninp = list(map(int,input().split()))\r\na,b,n = inp[0],inp[1],inp[2]\r\ncurrent = 1 #simon\r\nwhile True:\r\n if current == 1:\r\n g = gcd(a,n)\r\n #print(\"Simon playing:\",g)\r\n current = 0 #antisimon\r\n if g <= n:\r\n n -= g\r\n else:\r\n print(\"1\")\r\n break\r\n \r\n else:\r\n g = gcd(b,n)\r\n #print(\"Antisimon playing:\",g)\r\n current = 1 #simon\r\n if g <= n:\r\n n -= g\r\n else:\r\n print(\"0\")\r\n break", "\ndef gcd(a, b):\n if (a == 0):\n return b\n if (b == 0):\n return a\n if a == b:\n return b\n if a > b:\n return gcd(a - b, b)\n else:\n return gcd(a, b - a)\n\n[a, b, n] = map(int, input().split(\" \"))\nis_a_play = True\ncurrent = 0\nwhile current < n:\n n -= current\n if is_a_play:\n current = gcd(a ,n)\n else:\n current = gcd(b, n)\n is_a_play = not is_a_play\n\nprint(1 if is_a_play else 0)", "import math\r\n\r\na, b, n = list(map(int, input().split()))\r\nSimon_turn = True\r\n\r\nwhile True:\r\n if Simon_turn == True:\r\n value = a\r\n else:\r\n value = b\r\n\r\n n -= math.gcd(value, n)\r\n\r\n if 0 > n:\r\n print(int(bool(Simon_turn)))\r\n break\r\n\r\n Simon_turn = not(Simon_turn)", "import math\r\na,b,s=map(int,input().split())\r\nwhile s>0:\r\n s=s-math.gcd(a,s)\r\n s=s-math.gcd(b,s)\r\nif s==0:\r\n print(1)\r\nelse:\r\n print(0)", "a,b,c=map(int,input().split())\r\ndef br_antisem(k,o,q):\r\n c1=q\r\n o1=o\r\n while q>0:\r\n o,q=q,o%q\r\n c1-=o\r\n o=o1\r\n q=c1\r\n if q>0:\r\n br_sem(k,q,o)\r\n else:\r\n print(1)\r\ndef br_sem(a,c,b):\r\n c1=c\r\n a1=a\r\n while c>0:\r\n a,c=c,a%c\r\n c1-=a\r\n c=c1\r\n a=a1\r\n if c>0:\r\n br_antisem(a,b,c)\r\n else:\r\n print(0)\r\nbr_sem(a,c,b)\r\n", "a, b, n = map(int,input().split())\r\n\r\ndef fpb(num):\r\n arr = []\r\n for i in range(1, num + 1):\r\n if num % i == 0:\r\n arr.append(i)\r\n \r\n return arr\r\n\r\ndef sameMax(num, num2):\r\n while len(num):\r\n maxN = max(num)\r\n if maxN in num2:\r\n return maxN\r\n else:\r\n num.remove(maxN)\r\n\r\ndef fpbAB(a, b): \r\n a = fpb(a)\r\n b = fpb(b)\r\n\r\n if len(a) < len(b):\r\n return sameMax(a, b)\r\n else:\r\n return sameMax(b, a)\r\n\r\ni = 1\r\nwhile True:\r\n \r\n if i % 2:\r\n if not n:\r\n print(1)\r\n break\r\n \r\n n -= fpbAB(a, n)\r\n else:\r\n if not n:\r\n print(0)\r\n break\r\n \r\n n -= fpbAB(b, n)\r\n \r\n i += 1", "from math import gcd\r\na,b,n = map(int, input().split())\r\nturn = 1\r\nwhile n>0:\r\n if turn&1:\r\n n-=gcd(n,a)\r\n else:\r\n n-=gcd(b,n)\r\n turn+=1\r\nprint(1 if turn&1 else 0)", "import math\r\na,b,c = map(int,input().split())\r\ni = 0\r\nwhile c>=0:\r\n if i % 2 == 0: c -= math.gcd(a,c)\r\n else: c -= math.gcd(b,c)\r\n i += 1\r\nif(i % 2 == 0): print('0')\r\nelse: print('1')", "(a,b,n)=map(int,input().split())\r\ndef nabla(x,y):\r\n if y==0:return x\r\n else:return nabla(y,x%y)\r\nfor i in range(1,101):\r\n if i%2!=0:\r\n p=nabla(a,n)\r\n n=n-p\r\n if (n==0):\r\n print(0)\r\n break\r\n elif i%2==0:\r\n p=nabla(b,n)\r\n n=n-p\r\n if(n==0):\r\n print(1)\r\n break\r\n\r\n\r\n\r\n", "a,b,n=input().split()\r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\n\r\nfrom math import gcd\r\ndef f(a,b,n):\r\n\twhile True:\r\n\t\tn-=gcd(a,n)\r\n\t\tif n<0:\r\n\t\t\treturn \"1\"\r\n\t\tn-=gcd(b,n)\r\n\t\tif n<0:\r\n\t\t\treturn \"0\"\r\nprint(f(a,b,n))", "import math\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n c=math.gcd(a,n)\r\n else:\r\n c=math.gcd(b,n)\r\n # print(c)\r\n i+=1\r\n if c<=n:\r\n \t\r\n \tn-=c\r\n else:\r\n break\r\n# print(t)\r\nif i%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "def GCD(m, n):\r\n while n != 0:\r\n r = m % n\r\n m = n\r\n n = r\r\n return m\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n n -= GCD(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n n -= GCD(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\n", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\nans = 0\r\nfor i in range(101):\r\n if i % 2 == 0:\r\n if n < gcd(a, n):\r\n ans = 1\r\n break\r\n else:\r\n n -= gcd(a, n)\r\n else:\r\n if n < gcd(b, n):\r\n ans = 0\r\n break\r\n else:\r\n n -= gcd(b, n)\r\nprint(ans)", "def GCD(x, y):\r\n while y != 0:\r\n x, y = y, x % y\r\n return x\r\n\r\na, b, heap = map(int, input().split())\r\n\r\nfor i in range(100):\r\n if heap == 0:\r\n break\r\n\r\n if i % 2 == 0:\r\n take = GCD(a, heap)\r\n if take >= heap:\r\n print(0)\r\n break\r\n heap -= take\r\n else:\r\n take = GCD(b, heap)\r\n if take >= heap:\r\n print(1)\r\n break\r\n heap -= take", "import io\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n# Reinitialize the Input function\r\n# to take input from the Byte Like \r\n# objects\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n# #read n = # scores\r\n# n= int(input().decode().strip())\r\n\r\na,b,n= [int(i) for i in input().decode().strip().split()]\r\n\r\ndef compute_hcf(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\nwhile(n>=0):\r\n simon = compute_hcf(a,n)\r\n if simon <= n:\r\n n = n - simon\r\n else:\r\n print(\"1\")\r\n break\r\n anti = compute_hcf(b,n)\r\n if anti <= n:\r\n n = n - anti\r\n else:\r\n print(\"0\")\r\n break\r\n \r\n \r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(a, b, n):\r\n cnt = 0\r\n while n:\r\n if cnt % 2 == 0:\r\n n -= math.gcd(n, a)\r\n else:\r\n n -= math.gcd(n, b)\r\n cnt += 1\r\n return cnt % 2 == 1\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n if solve(a, b, n):\r\n print(0)\r\n else:\r\n print(1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nl = list(map(int, input().split()))\r\n\r\nfirst = l[0]\r\nsecond = l[1]\r\nheap = l[2]\r\n\r\nwho = 0\r\n\r\nwhile True:\r\n if who % 2 == 0:\r\n if math.gcd(heap, first) > heap:\r\n print(1)\r\n break\r\n heap -= math.gcd(heap, first)\r\n who = 1\r\n else:\r\n if math.gcd(heap, second) > heap:\r\n\r\n print(0)\r\n break\r\n heap -= math.gcd(heap,second)\r\n who = 0\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from math import *\r\na,b,n = map(int,input().split())\r\nwhile n>0:\r\n n-=gcd(a,n)\r\n if n<=0:\r\n print(0); break\r\n n-=gcd(b,n)\r\n \r\nelse: print(1)", "def gcd(a,b):\r\n if a==0 or b==0:\r\n return 0\r\n elif a>b:\r\n return gcd(a-b,b)\r\n elif a==b:\r\n return a\r\n else:\r\n return gcd(a,b-a)\r\n \r\n\r\ndef count(a,b,n,t):\r\n if t%2!=0:\r\n if n==0:\r\n return 1\r\n else:\r\n n=n-gcd(a,n)\r\n t+=1\r\n return count(a,b,n,t)\r\n else:\r\n if n==0:\r\n return 0\r\n else:\r\n n=n-gcd(b,n)\r\n t+=1\r\n return count(a,b,n,t)\r\n \r\na, b, n=map(int,input().split())\r\nma=count(a,b,n,1)\r\nprint(ma)", "def gcd(a, b):\r\n if (b == 0):\r\n return a\r\n return gcd(b, a % b)\r\n\r\na,b,n = list(map(int,input().split()))\r\nsum = n\r\nm = True\r\nc = 0\r\nwhile m:\r\n if c%2==0:\r\n sum = sum - gcd(a,sum)\r\n c = c + 1\r\n if sum==0:\r\n print(0)\r\n break\r\n else:\r\n sum = sum - gcd(b,sum)\r\n c = c + 1\r\n if sum==0:\r\n print(1)\r\n break\r\n\r\n\r\n\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 play():\r\n a,b,n = map(int,input().split())\r\n winner = 1\r\n ab=a\r\n while True:\r\n g = gcd(ab,n)\r\n #print(g,n)\r\n if g>n:\r\n print(winner)\r\n return\r\n n-=g\r\n ab = a+b-ab\r\n winner = 1-winner\r\n\r\nplay()", "def gcd(m,n):\r\n if m == 0:\r\n return n\r\n elif n == 0:\r\n return m\r\n else:\r\n return gcd(n,m%n)\r\n\r\na1,b1,n1 = input().split()\r\na = int(a1)\r\nb = int(b1)\r\nn = int(n1)\r\n\r\ncnt = 0\r\nwhile n != 0:\r\n if cnt % 2 == 0:\r\n cnt = cnt + 1\r\n g = gcd(a,n)\r\n n = n - g\r\n if n <= 0:\r\n print(\"0\")\r\n break\r\n else:\r\n cnt = cnt + 1\r\n g = gcd(b,n)\r\n n = n - g\r\n if n <= 0:\r\n print(\"1\")\r\n break\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def NOD(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef winner(a, b, n):\r\n while True:\r\n n -= NOD(a, n)\r\n if n < 0:\r\n print(1)\r\n break\r\n n -= NOD(b, n)\r\n if n < 0:\r\n print(0)\r\n break\r\n\r\n\r\na, b, n = map(int, input().split())\r\nwinner(a, b, n)", "def nod(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return(a)\r\n\r\n\r\na, b, n = map(int, input().split())\r\ncount = 0\r\nc_nod = nod(n,(a,b)[count%2])\r\nwhile c_nod <= n:\r\n c_nod = nod(n, (a, b)[count % 2])\r\n n -= c_nod\r\n count += 1\r\nprint((count+1) % 2)", "def gcd(x,y):\r\n if y==0:\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\n \r\na,b,n=[int(i) for i in input().split()]\r\nflag=0\r\nwhile True:\r\n if n>=gcd(a,n):\r\n n-=gcd(a,n)\r\n else:\r\n flag=1\r\n break\r\n if n>=gcd(b,n):\r\n n-=gcd(b,n)\r\n else:\r\n flag=2\r\n break\r\nif flag==1:\r\n print(\"1\")\r\nelif flag==2:\r\n print(\"0\")\r\n \r\n ", "a,b,c=map(int,input().split())\r\nx=0\r\nwhile c>0:\r\n d=0\r\n if x%2==0:\r\n for y in range(1,min(a,c)+1):\r\n if a%y==0 and c%y==0:\r\n d=y\r\n else:\r\n for y in range(1,min(b,c)+1):\r\n if b%y==0 and c%y==0:\r\n d=y\r\n c-=d\r\n x+=1\r\nprint(1-x%2)", "import math\n\nA, B, N = map(int, input().split())\n\nfor i in range(1000):\n N -= math.gcd(A if i % 2 == 0 else B, N)\n if N == 0:\n print(i % 2)\n", "import math\r\na,b,n = map(int,input().split())\r\nx = 0\r\nwhile (n>0):\r\n\tn = n - math.gcd(n,a)\r\n\tx+=1\r\n\tif n<=0:\r\n\t\tbreak\r\n\telse:\r\n\t\tn = n- math.gcd(n,b)\r\n\t\tx+=1\r\nif x%2==0:\r\n\tprint(1)\r\nelse:\r\n\tprint(0)", "'''\nThis is a base snippet for cp\n'''\n\ndef gcd(a,b): #a>=b\n c = max(a,b)\n d = min(a,b)\n a = c\n b = d\n if b==0:\n return a\n else:\n return gcd(b,a%b)\n\n\ndef main():\n #code Here\n a,b,n = map(int, input().split())\n turn = 0\n while n>=0:\n if turn == 0:\n n-=gcd(n,a)\n turn = 1\n else:\n n-=gcd(n,b)\n turn = 0\n print(turn)\n\n\nif __name__ == '__main__':\n for i in range(1):\n main()\n", "a,b,c=map(int,input().split())\r\nd=0\r\nwhile (c>0):\r\n i=a\r\n while (i>0):\r\n if (a%i==0 and c%i==0):\r\n c=c-i\r\n d=0\r\n if c == 0:\r\n print(0)\r\n exit()\r\n break\r\n else:\r\n d+=1\r\n i-=1\r\n\r\n j=b\r\n while(j>0):\r\n if (b%j==0 and c%j==0):\r\n c = c-j\r\n d=0\r\n break\r\n else:\r\n d+=1\r\n j-=1\r\nif c==0:\r\n print(1)", "import math\na,b,n = map(int,input().split())\nk = 0 \nwhile n>=0:\n k +=1 \n if k%2 == 1:\n n -= math.gcd(a,n)\n else:\n n -= math.gcd(b,n)\nif k % 2 != 0:\n print(\"1\")\nelse:\n print('0')\n ", "def gcd(x,y):\r\n if x>y:\r\n ma=x\r\n mi=y\r\n else:\r\n ma=y\r\n mi=x\r\n if mi!=0:\r\n return gcd(mi,ma%mi)\r\n else:\r\n return ma\r\na,b,n=map(int,input().split())\r\ni=0\r\nx=a\r\nwhile n>=gcd(x,n):\r\n if i%2==0:\r\n x=a\r\n n=n-gcd(x,n)\r\n i+=1\r\n else:\r\n x=b\r\n n=n-gcd(x,n)\r\n i+=1\r\nprint((i+1)%2)\r\n \r\n \r\n", "def gcd(x,y):\r\n\tif x == 0:\r\n\t\treturn y\r\n\telif y == 0:\r\n\t\treturn x\r\n\t\t\r\n\tif x < y:\r\n\t\tn = x\r\n\t\twhile n > 0:\r\n\t\t\tif x % n == 0 and y % n == 0:\r\n\t\t\t\treturn n\r\n\t\t\tn -= 1\r\n\telif y < x:\r\n\t\tn = y\r\n\t\twhile n > 0:\r\n\t\t\tif y % n == 0 and x % n == 0:\r\n\t\t\t\treturn n\r\n\t\t\tn -= 1\r\n\telse:\r\n\t\treturn x\r\n\r\narr = input()\r\n\r\narr = arr.split(\" \")\r\n\r\na = int(arr[0])\r\nb = int(arr[1])\r\nn = int(arr[2])\r\n\r\nplayer = 0\r\n\r\nwhile True:\r\n\tif player == 0:\r\n\t\tcomDiv = gcd(a,n)\r\n\t\tn -= comDiv\r\n\t\tif n < 0:\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\t\tplayer = 1\r\n\telif player == 1:\r\n\t\tcomDiv = gcd(b, n)\r\n\t\tn -= comDiv\r\n\t\tif n < 0:\r\n\t\t\tprint(0)\r\n\t\t\tbreak\r\n\t\tplayer = 0\r\n\t\t\t", "from math import gcd\r\na, b, n = map(int, input().split())\r\nturn = True\r\nwhile True:\r\n if turn:\r\n turn = False\r\n if n<gcd(a, n):\r\n print(1)\r\n break\r\n else:\r\n n -= gcd(a, n)\r\n else:\r\n turn = True\r\n if n<gcd(b, n):\r\n print(0)\r\n break\r\n else:\r\n n -= gcd(b, n)", "a, b, n = [int(a) for a in input().split()]\r\ndef gcd(a, b):\r\n if a == 0 or b == 0:\r\n return 0\r\n elif a > b:\r\n if a%b == 0:\r\n return b\r\n return 1\r\n else:\r\n if b%a == 0:\r\n return a\r\n return 1\r\nplayer = 0\r\nwhile n > 0:\r\n GCD = gcd(a, n)\r\n if GCD < n:\r\n n-= GCD\r\n else:\r\n print(0)\r\n break\r\n player += 1\r\n GCD = gcd(b, n)\r\n if GCD < n:\r\n n -= GCD\r\n else:\r\n print(1)\r\n break\r\n player -= 1", "from math import *\r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef main():\r\n a,b,n = nextInts()\r\n\r\n Simon = True\r\n while True:\r\n g = 1\r\n if Simon:\r\n g = gcd(a,n)\r\n else:\r\n g = gcd(b,n)\r\n\r\n if n-g < 0:\r\n break\r\n else:\r\n n-=g\r\n\r\n Simon ^= 1\r\n \r\n if Simon:\r\n print(1)\r\n else:\r\n print(0)\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n", "import math\r\narr = [int(x) for x in input().split(' ')]\r\na,b,n = arr[0],arr[1],arr[2]\r\n\r\nplayers = {\r\n\t'simon': a,\r\n\t'antisimon': b\r\n}\r\n\r\nturn = 'simon'\r\nwhile n > 0 and math.gcd(players[turn], n) <= n :\r\n\tn = n - math.gcd(players[turn],n)\r\n\tturn = 'simon' if turn == 'antisimon' else 'antisimon'\r\n\r\nif turn == 'simon':\r\n\tprint(1)\r\nelse:\r\n\tprint(0)", "def hcfnaive(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return hcfnaive(b,a%b)\r\na,b,n=list(map(int,input().split()))\r\nc=0\r\nwhile n>0:\r\n c+=1\r\n if c%2 == 1:\r\n n= n-hcfnaive(a,n)\r\n else:\r\n n = n - hcfnaive(b, n)\r\nif c%2 == 0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n\r\n", "a, b, n = map(int, input().split())\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\nfor _ in range(n):\n if _ % 2 == 0:\n x = gcd(n, a)\n if x < n:\n n -= x\n elif x == n:\n print(0)\n break\n else:\n print(1)\n break\n else:\n x = gcd(n, b)\n if x < n:\n n -= x\n elif x == n:\n print(1)\n break\n else:\n print(0)\n break\n", "import math\r\na, b, n = map(int,input().split())\r\nx = [a, b]\r\ni = 0\r\nwhile n >= 0:\r\n\tn -= math.gcd(x[i], n)\r\n\ti = 1 - i\r\nprint(i)", "def gcd(a, b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\treturn gcd(b, a % b)\r\n\r\n\r\ndef solve():\r\n\ta, b, n = [int(i) for i in input().split()]\r\n\tans = 0\r\n\twhile n >= 0:\r\n\t\tif ans % 2 == 0:\r\n\t\t\tn -= gcd(a, n)\r\n\t\telse:\r\n\t\t\tn -= gcd(b, n)\r\n\t\tans += 1\r\n\treturn ans % 2\r\n\r\n\r\nt = 1\r\nans = []\r\nwhile t:\r\n\tans.append(str(solve()))\r\n\tt -= 1\r\nprint(\"\\n\".join(ans))", "s, a, n = map(int, input().split())\r\n\r\n\r\ndef NOD(x, y):\r\n mn = min(x, y)\r\n div = 1\r\n while n > 0:\r\n if x % mn == 0 and y % mn == 0:\r\n div = mn\r\n break\r\n mn -= 1\r\n return div\r\n\r\n\r\nwhile True:\r\n k = NOD(s, n)\r\n n -= k\r\n if n < 0:\r\n print(1)\r\n break\r\n k = NOD(a, n)\r\n n -= k\r\n if n < 0:\r\n print(0)\r\n break\r\n", "\r\n\r\nfrom math import gcd\r\n\r\na, b, c = list(map(int, input().split()))\r\n\r\n\r\nwhile 1:\r\n f = gcd(a, c)\r\n c -= f\r\n if c < 0:\r\n print(1)\r\n break\r\n s = gcd(b, c)\r\n c -= s\r\n # print(c)\r\n if c < 0:\r\n print(0)\r\n break\r\n ", "import math\r\na,b,n=map(int,input().split())\r\nflag=True\r\nwhile n>=0:\r\n n=n-math.gcd(n,a)\r\n if n<0:\r\n flag=False\r\n print(1)\r\n break\r\n n= n-math.gcd(n,b)\r\nif flag:\r\n print(0)\r\n ", "from math import gcd\r\na,b,n = list(map(int,input().split()))\r\np1 = 0 \r\np2 = 0 \r\nfor i in range(n): \r\n if n<= 0:\r\n break\r\n elif i%2 == 0:\r\n g = gcd(a,n)\r\n p1+=1 \r\n n-=g \r\n else:\r\n g = gcd(b,n)\r\n p2+=1 \r\n n-=g \r\nif p1 > p2:\r\n print(0)\r\nelse:\r\n 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\nt,m,n=input().split()\r\nn,m,t=int(n),int(m),int(t)\r\ni=1\r\nflag = True\r\nwhile (i):\r\n if i%2==1 :\r\n num=gcd(t,n)\r\n if num>n :\r\n flag=False\r\n break\r\n n=n-num\r\n else :\r\n num1=gcd(m,n)\r\n if num1>n :\r\n break\r\n n=n-num1\r\n i=i+1\r\nif(flag):\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n \r\n", "def NOD(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef epic(a, b, s):\r\n while True:\r\n s -= NOD(a, s)\r\n if s < 0:\r\n return 1\r\n s -= NOD(b, s)\r\n if s < 0:\r\n return 0\r\n\r\n\r\na, b, s = map(int, input().split())\r\nprint(epic(a,b, s))", "a,b,n=map(int,input().split())\r\ngcd = lambda a,b : a if not b else gcd(b, a%b)\r\nwhile n>=0:\r\n gcda=gcd(a,n)\r\n if n-gcda>=0:\r\n n-=gcda\r\n else:\r\n print(\"1\")\r\n break\r\n gcdb=gcd(b,n)\r\n if n-gcdb>=0:\r\n n-=gcdb\r\n else:\r\n print(\"0\")\r\n break\r\n \r\n", "def common(a,b):\r\n if a*b == 0:\r\n return max(a,b)\r\n else:\r\n c = min(a,b)\r\n while c > 1:\r\n if b % c == 0 and a % c == 0:\r\n return c\r\n else:\r\n c -= 1\r\n return c\r\na,b,n = map(int,input().split())\r\nleft = n\r\nwhile True:\r\n x = common(left,a)\r\n left -= x\r\n if left < 0:\r\n print(1)\r\n break\r\n y = common(left,b)\r\n left -= y\r\n if left < 0:\r\n print(0)\r\n break\r\n", "# 코드포스 119A Epic Game\r\nimport sys\r\nfrom math import gcd\r\nput = sys.stdin.readline\r\n\r\na, b, n = map(int, put().split())\r\n\r\nfor i in range(n+1):\r\n if i % 2:\r\n gcd_i = gcd(b, n)\r\n else:\r\n gcd_i = gcd(a, n)\r\n\r\n if n:\r\n n -= gcd_i\r\n else:\r\n print((i % 2) ^ 1)\r\n break", "a,b,c=map(int,input().split())\r\nimport math\r\naturn=True\r\nwhile c>=0:\r\n if aturn:\r\n g=math.gcd(a,c)\r\n c-=g\r\n aturn=False\r\n else:\r\n g=math.gcd(b,c)\r\n c-=g\r\n aturn=True\r\nif aturn:\r\n print(0)\r\nelse:\r\n print(1)\r\n ", "def gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n\r\n return x\r\n\r\n\r\na, b, n = map(int, input().split())\r\nchance = 0\r\nwhile n > 0:\r\n n -= gcd(a, n) if chance % 2 == 0 else gcd(b, n)\r\n chance += 1\r\n\r\nprint((chance - 1) % 2)\r\n", "def uscln(a, b):\r\n if (b == 0):\r\n return a\r\n return uscln(b, a % b)\r\n\r\nip = input().split(\" \")\r\na = int(ip[0]) # Simon\r\nb = int(ip[1]) # Antisimon\r\nstones = int(ip[2]) # stones\r\n\r\ncheck = True\r\nwin = \"\"\r\nwhile(check):\r\n aStone = uscln(a, stones)\r\n if(aStone <= stones):\r\n stones = stones - aStone\r\n else:\r\n win = \"Antisimon\"\r\n break\r\n bStone = uscln(b, stones)\r\n if(bStone <= stones):\r\n stones = stones - bStone\r\n else:\r\n win = \"Simon\"\r\n break\r\nif(win == \"Simon\"):\r\n print(0)\r\nelse: print(1)", "import math\r\na, b, n = map(int, input().split())\r\n\r\nwhile n >= 0:\r\n x = math.gcd(a, n)\r\n if x <= n:\r\n n -= x\r\n else:\r\n print(1)\r\n break\r\n y = math.gcd(b, n)\r\n if y <= n:\r\n n -= y\r\n else:\r\n print(0)\r\n break", "import math\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>=0:\r\n n=n-(1-i)*math.gcd(n,a)-i*math.gcd(n,b)\r\n i=1-i\r\nprint(i)", "a,b,n=map(int,input().split())\r\n\r\ndef gcd(a,b):\r\n while b>0:\r\n a,b=b,a%b\r\n return a\r\ni=0\r\nper=0\r\n\r\nwhile n>per:\r\n n=n-per\r\n if i==0:\r\n per=gcd(a,n)\r\n i=1\r\n else:\r\n per=gcd(b,n)\r\n i=0\r\nif i==1:\r\n print('0')\r\nelse:\r\n print('1')\r\n", "import math\r\nc=0\r\na,b,n=map(int,input().split())\r\nwhile n>0:\r\n n-=math.gcd(a,n)\r\n a,b=b,a\r\n c+=1\r\nif c%2==0:\r\n print('1')\r\nelse:\r\n print('0')", "import string\r\nimport math\r\nimport time\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(x, y):\r\n return (x*y)//gcd(x,y)\r\n\r\ndef prime(x):\r\n if x == 2:\r\n return True \r\n for i in range(2, x):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n# start = time.process_time()\r\n#calculate time here\r\n# print(time.process_time() - start)\r\n\r\nsimon, antisimon, heap = map(int, input().split(\" \"))\r\ni = 1\r\nwhile heap >= 0:\r\n if i % 2 == 0:\r\n heap -= gcd(antisimon, heap)\r\n else:\r\n heap -= gcd(simon, heap)\r\n i += 1\r\nprint(\"0\" if i % 2 else \"1\") \r\n ", "import math\r\na,b,n=[int(i) for i in input().split()]\r\nk=True\r\nwhile n > 0 :\r\n if k :\r\n n-=math.gcd(a,n)\r\n k=False\r\n else:\r\n n-=math.gcd(b,n)\r\n k=True\r\n\r\nif k :\r\n print(1)\r\nelse:\r\n print(0)", "\"\"\"\r\nSolution to Codeforces Problem 119A : https://codeforces.com/problemset/problem/119/A\r\n\r\nDifficulty: 800\r\n\"\"\"\r\nimport math\r\ns=lambda a,b,n,i:s(b,a,n-math.gcd(a,n),i+1)if n!=0 else i%2\r\nprint(s(*list(map(int, input().split(' '))), 1))\r\n", "import math\r\n\r\na, b, n = map(int,input().split())\r\nwinner = 1\r\n\r\nwhile n>0:\r\n\tn-=math.gcd(a,n)\r\n\twinner = 0\r\n\tif n>0:\r\n\t\tn-=math.gcd(b,n)\r\n\t\twinner = 1\r\n\r\nprint(winner)", "from math import gcd\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n:\r\n t=gcd(b if i%2 else a,n)\r\n n-=t\r\n i+=1\r\nprint((i+1)%2)", "def gcd(a,b):\r\n m = min(a,b)\r\n n = max(a,b)\r\n l = 0\r\n if a==0 or b==0:\r\n return max(a,b)\r\n else:\r\n for i in range(1000):\r\n l = n % m\r\n if l==0:\r\n return m\r\n else:\r\n n=m\r\n m=l\r\n continue\r\nk = list(int(x) for x in input().split())\r\na = k[0]\r\nb = k[1]\r\nn = k[2]\r\nc = 0\r\nwhile(n>=0):\r\n if c%2==0:\r\n if n<=0:\r\n print (1)\r\n break\r\n elif n>=gcd(a,n):\r\n n-=gcd(a,n)\r\n c+=1\r\n else:\r\n if n<=0:\r\n print (0)\r\n break\r\n elif n>=gcd (b, n):\r\n n-=gcd (b, n)\r\n c+=1", "a,b,n=map(int,input().split())\r\nx=0\r\nwhile(n>0):\r\n if x%2==0:\r\n d=min(a,n)\r\n e=1\r\n for i in range(1,d+1):\r\n if a%i==0 and n%i==0:\r\n e=i\r\n n-=e\r\n x+=1\r\n else:\r\n d=min(b,n)\r\n e=1\r\n for i in range(1,d+1):\r\n if b%i==0 and n%i==0:\r\n e=i\r\n n-=e\r\n x+=1\r\nif x%2!=0:\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n", "a, b, c = map(int, input().split())\r\n\r\n\r\ndef Nod(x, y):\r\n while x > 0:\r\n z = y % x\r\n y = x\r\n x = z\r\n return y\r\n\r\n\r\nn = 0\r\nwhile c > 0:\r\n if n % 2 == 0:\r\n c = c - Nod(a, c)\r\n else:\r\n c = c - Nod(b, c)\r\n n += 1\r\nprint((n + 1) % 2)", "a,b,n=map(int,input().split())\r\ndef gcd(u,v):\r\n while(v):\r\n u,v=v,u%v\r\n return u\r\n#import math \r\nwhile(1):\r\n n=n-gcd(a,n)\r\n if(n<=0):\r\n print(0)\r\n break\r\n n=n-gcd(b,n)\r\n if(n<=0):\r\n print(1)\r\n break\r\n", "from math import gcd\na,b,n = map(int, input().split())\na=[b,a]\ns = 1\nwhile n:\n n -= gcd(a[s], n)\n s = not s\nprint(int(s))", "from math import gcd\r\na,b,n = map(int,input().split())\r\nchance = 1\r\nwhile True:\r\n if chance%2 != 0:\r\n s = gcd(a,n)\r\n if (n-s) >= 0:\r\n n -= s\r\n chance += 1\r\n else:\r\n break\r\n else:\r\n s = gcd(b, n)\r\n if (n - s) >= 0:\r\n n -= s\r\n chance += 1\r\n else:\r\n break\r\n\r\nif chance%2 == 0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "A=list(map(int,input().split()))\r\na=A[0]\r\nb=A[1]\r\nn=A[2]\r\nwhile n>=0:\r\n k=n\r\n if n>a:k=a\r\n while k>0:\r\n if a%k==0 and n%k==0:\r\n n-=k\r\n break\r\n k-=1\r\n if n<0:\r\n print(\"1\")\r\n break\r\n if n==0:\r\n print(\"0\")\r\n break\r\n k=n\r\n if n>b:k=b\r\n while k>0:\r\n if b%k==0 and n%k==0:\r\n n-=k\r\n break\r\n k-=1\r\n if n<0:\r\n print(\"0\")\r\n break\r\n if n==0:\r\n print(\"1\")\r\n break", "def gcd(a, b):\r\n if (a == 0):\r\n return b\r\n if (b == 0):\r\n return a\r\n if (a == b):\r\n return a\r\n if (a > b):\r\n return gcd(a - b, b)\r\n return gcd(a, b - a)\r\na,b,n=map(int,input().split())\r\nl1,l2=[],[]\r\nwhile(n>0):\r\n z=gcd(a,n)\r\n n=n-z\r\n l1.append(n)\r\n if (n == 0):\r\n break\r\n z1=gcd(b,n)\r\n n=n-z1\r\n l2.append(n)\r\n if(n==0):\r\n break\r\n#print(l1)\r\n#print(l2)\r\nif(len(l1)>len(l2)):\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n\r\n\r\n", "temp = input().split()\r\nsimon = int(temp[0])\r\nantisimon = int(temp[1])\r\nheap = int(temp[2])\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n if b == 0:\r\n return a\r\n if a == b:\r\n return a\r\n elif a < b:\r\n return gcd(b,a)\r\n else:\r\n return gcd(b, a-b)\r\n\r\nwhile True:\r\n heap = heap - gcd(simon,heap)\r\n if heap < 0:\r\n print(1)\r\n break\r\n heap = heap - gcd(antisimon,heap)\r\n if heap <0:\r\n print(0)\r\n break", "a,b,n=map(int,input().split())\r\nk=1\r\nr=n\r\nd=a\r\nwhile r>0:\r\n d,r=r,d%r\r\nwhile n>=d:\r\n n=n-d\r\n k+=1\r\n t=n\r\n if k%2==0:\r\n d=b\r\n else:\r\n d=a\r\n while t>0:\r\n d,t=t,d%t \r\nif k%2==0:\r\n print('0')\r\nelse:\r\n print('1')", "def gcd(num, n):\r\n while num != n:\r\n if num > n:\r\n num -= n\r\n else:\r\n n -= num\r\n\r\n return num\r\n\r\n\r\na, b, stones = map(int, input().split())\r\n\r\nsimon_turn = True\r\nwhile stones:\r\n if simon_turn:\r\n stones -= gcd(a, stones)\r\n else:\r\n stones -= gcd(b, stones)\r\n\r\n simon_turn = not simon_turn\r\n\r\nprint(int(simon_turn))\r\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n n -= gcd(n, a)\r\n if n < 0:\r\n print(1)\r\n break\r\n n -= gcd(n, b)\r\n if n < 0:\r\n print(0)\r\n break\r\n", "from math import gcd\r\np = input().split()\r\nSimon = int(p[0])\r\nAntisimon = int(p[1])\r\nStones = int(p[2])\r\n\r\nwhile Stones >= 0:\r\n if gcd(Simon, Stones) <= Stones:\r\n Stones -= gcd(Simon, Stones)\r\n else:\r\n print(1)\r\n break\r\n\r\n if gcd(Antisimon, Stones) <= Stones:\r\n Stones -= gcd(Antisimon, Stones)\r\n Winner = 1\r\n else:\r\n print(0)\r\n break\r\n", "def gcd(a1, b1):\r\n while a1 != b1:\r\n if a1 > b1:\r\n a1 = a1 - b1\r\n else:\r\n b1 = b1 - a1\r\n return a1\r\n\r\n\r\na, b, n = map(int, input().split())\r\nwhile True:\r\n if n > 0:\r\n n -= gcd(a, n)\r\n if n > 0:\r\n n -= gcd(b, n)\r\n else:\r\n print(0)\r\n exit()\r\n else:\r\n print(1)\r\n exit()\r\n\r\n# import sys\r\n# a = [1, 2, 3, 4]\r\n# b = {1:0, 2:0, 3:0, 4:0}\r\n# print(sys.getsizeof(a), sys.getsizeof(b))\r\n", "a, b, c = [int(x) for x in input().split()]\r\n\r\ndef nod(lhs, rhs):\r\n if rhs==0:\r\n return lhs\r\n else:\r\n return nod(rhs, lhs%rhs)\r\nd=nod(a,c)\r\nk=0\r\n\r\nwhile c>0:\r\n\r\n if k==0:\r\n d=nod(a,c)\r\n else:\r\n d=nod(b,c)\r\n c -= d\r\n k = (k + 1) % 2\r\nprint((k + 1) % 2)", "a, b, n = map(int, input().split())\r\ni, ai = 0, 0\r\n\r\n\r\ndef gcd(x, y):\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\nwhile n > 0:\r\n i1, ai1 = 0, 0\r\n while i1 != 1 and n > 0:\r\n n = n - gcd(a, n)\r\n i += 1\r\n i1 += 1\r\n while ai1 != 1 and n > 0:\r\n n = n - gcd(b, n)\r\n ai += 1\r\n ai1 += 1\r\n\r\nif i > ai:\r\n print(0)\r\nelif i <= ai:\r\n print(1)\r\n", "# A. Epic Game\r\ndef gcd(x,y):\r\n for i in range(1,min(x,y)+1):\r\n if x%i==0 and y%i==0:\r\n gcd=i\r\n return gcd\r\na,b,temp=map(int,input().split())\r\nchance=0\r\nwhile temp>=1:\r\n \r\n if chance==0 :\r\n g=gcd(a,temp)\r\n if g>temp:\r\n w=1\r\n else:\r\n temp-=g\r\n chance=1\r\n else:\r\n g=gcd(b,temp)\r\n if g>temp:\r\n w=0\r\n else:\r\n temp-=g\r\n chance=0\r\n \r\nprint(abs(1-chance))", "from math import *\r\na, b, n = map(int, input().split())\r\nfor i in range(100000000):\r\n if i % 2 == 0:\r\n temp = gcd(a, n)\r\n if temp > n:\r\n print(1)\r\n break\r\n else:\r\n n -= temp\r\n elif i % 2 != 0:\r\n temp = gcd(b, n)\r\n if temp > n:\r\n print(0)\r\n break\r\n else:\r\n n -= temp\r\n#veerascode ", "def gcd(list):\r\n big = max(list)\r\n small = min(list)\r\n if small == 0:\r\n return big\r\n return small if big % small == 0 else gcd([small, big % small])\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nwhile numbers[2] >= gcd([numbers[2], numbers[count % 2]]):\r\n # print(f\"{numbers[2]} {numbers[count % 2]}\")\r\n numbers[2] -= gcd([numbers[2], numbers[count % 2]])\r\n count += 1\r\n\r\nprint(1 - count % 2)\r\n\r\n", "from math import gcd\r\na,b,n=map(int,input().split())\r\nf=1\r\nwhile n>0:\r\n if f==1:\r\n n-=gcd(n,a)\r\n ans=0\r\n else:\r\n n-=gcd(n,b)\r\n ans=1\r\n f*=-1\r\nprint(ans)", "a, b, n = map(int, input().split())\r\na1 = 0\r\nb1 = 0\r\nwhile n > 0:\r\n if a1 == b1:\r\n a1+=1\r\n if n % a == 0:\r\n n = n - a\r\n elif a % 2 == 0 and n % 2 == 0:\r\n n = n - 2\r\n else:\r\n n = n - 1\r\n else:\r\n b1+=1\r\n if n % b == 0:\r\n n = n - b\r\n elif b % 2 == 0 and n % 2 == 0:\r\n n = n - 2\r\n else:\r\n n = n - 1\r\nif a1 > b1:\r\n print('0')\r\nelse:\r\n print('1')", "import math\r\nn , m , k = map(int , input().split())\r\ngcdvar = 0\r\ngcdvar2 = 0\r\nc = 0\r\nc1 = 0\r\nwhile True:\r\n gcdvar= math.gcd(n , k)\r\n k = k - gcdvar\r\n if k == 0:\r\n c+=1\r\n break\r\n gcdvar2 = math.gcd(m, k)\r\n k = k- gcdvar2\r\n if k == 0:\r\n c1+=1\r\n break\r\nif c == 1:\r\n print(0)\r\nelif c1 == 1:\r\n print(1)", "\r\nfrom math import gcd\r\na, b, n = map(int, input().split())\r\nco = 0\r\n\r\n\r\nwhile True:\r\n\tif co % 2 == 0:\r\n\t\tni = gcd(a, n)\r\n\r\n\t\tif ni <= n:\r\n\t\t\tn -= ni\r\n\r\n\t\telse:\r\n\t\t\tprint(1)\r\n\t\t\texit()\r\n\telse:\r\n\t\tni = gcd(b, n)\r\n\t\tif ni <= n:\r\n\t\t\tn -= ni\r\n\t\telse:\r\n\t\t\tprint(0)\r\n\t\t\texit()\r\n\t\r\n\tco += 1", "import math\r\na,b,n = map(int, input().split())\r\ni = 0\r\nF = None\r\nwhile n>0:\r\n if i%2==0:\r\n F=False\r\n n-=math.gcd(a,n)\r\n else:\r\n F=True\r\n n-=math.gcd(b,n)\r\n i+=1\r\nprint(1 if F else 0)", "# -*- coding: utf-8 -*-\r\nimport sys\r\nimport math\r\nimport os\r\nimport itertools\r\nimport string\r\nimport heapq\r\nimport _collections\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nimport bisect\r\nimport re\r\nimport queue\r\nfrom decimal import *\r\n\r\n\r\nclass Scanner():\r\n @staticmethod\r\n def int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def string():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def map_int():\r\n return [int(x) for x in Scanner.string().split()]\r\n\r\n @staticmethod\r\n def string_list(n):\r\n return [input() for i in range(n)]\r\n\r\n @staticmethod\r\n def int_list_list(n):\r\n return [Scanner.map_int() for i in range(n)]\r\n\r\n @staticmethod\r\n def int_cols_list(n):\r\n return [int(input()) for i in range(n)]\r\n\r\n\r\nclass Math():\r\n @staticmethod\r\n def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return Math.gcd(b, a % b)\r\n\r\n @staticmethod\r\n def lcm(a, b):\r\n return (a * b) // Math.gcd(a, b)\r\n\r\n @staticmethod\r\n def divisor(n):\r\n res = []\r\n i = 1\r\n for i in range(1, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n res.append(i)\r\n if i != n // i:\r\n res.append(n // i)\r\n return res\r\n\r\n @staticmethod\r\n def round_up(a, b):\r\n return -(-a // b)\r\n\r\n @staticmethod\r\n def is_prime(n):\r\n if n < 2:\r\n return False\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n d = int(n ** 0.5) + 1\r\n for i in range(3, d + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nclass PriorityQueue:\r\n def __init__(self, l=[]):\r\n self.q = l\r\n heapq.heapify(self.q)\r\n return\r\n\r\n def push(self, n):\r\n heapq.heappush(self.q, n)\r\n return\r\n\r\n def pop(self):\r\n return heapq.heappop(self.q)\r\n\r\n\r\ndef pop_count(x):\r\n x = x - ((x >> 1) & 0x5555555555555555)\r\n x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\r\n x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f\r\n x = x + (x >> 8)\r\n x = x + (x >> 16)\r\n x = x + (x >> 32)\r\n return x & 0x0000007f\r\n\r\n\r\nMOD = int(1e09) + 7\r\nINF = int(1e15)\r\n\r\n\r\ndef main():\r\n # sys.stdin = open(\"sample.txt\")\r\n turn = 0\r\n a, b, n = Scanner.map_int()\r\n while n > 0:\r\n if turn == 0:\r\n n -= Math.gcd(a, n)\r\n else:\r\n n -= Math.gcd(b, n)\r\n turn = 1 - turn\r\n print(1-turn)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n\r\ninlet = input().split(' ')\r\na, b, n = int(inlet[0]), int(inlet[1]), int(inlet[2])\r\nflag = 1\r\n\r\nwhile n >= 1:\r\n if flag == 1 and math.gcd(a, n) >= 1:\r\n n -= math.gcd(a, n)\r\n elif flag == 1:\r\n print(0)\r\n exit()\r\n elif flag == -1 and math.gcd(b, n) >= 1:\r\n n -= math.gcd(b, n)\r\n elif flag == -1:\r\n print(1)\r\n exit()\r\n flag *= -1\r\n\r\nif flag == 1:\r\n print(1)\r\n exit()\r\nprint(0)\r\n", "\r\nimport math\r\n\r\na=list(map(int,input().split()))\r\nd=-1\r\nwhile(a[2]>0):\r\n d+=1\r\n tam=math.gcd(a[d%2],a[2])\r\n a[2]-=tam\r\nprint(d%2)", "import math\r\n\r\na, b, n = map(int,input().split())\r\n\r\nwhile(True):\r\n c = math.gcd(a,n)\r\n n -= c\r\n if(n == 0):\r\n print(0)\r\n break\r\n d = math.gcd(b,n)\r\n n -= d\r\n if(n == 0):\r\n print(1)\r\n break", "import math\r\na,b,n=map(int, input().split())\r\nc=0\r\nwhile n>0:\r\n n-=(math.gcd(a,n))\r\n if n>0:\r\n c+=1\r\n n-=(math.gcd(b,n))\r\n if n>0:\r\n c+=1\r\nif c%2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "import math\r\na, b, n = [int(s) for s in input().split()]\r\nans = 0\r\ni=1\r\nwhile n > 0:\r\n if(i%2!=0):\r\n ans=0\r\n else:\r\n ans=1\r\n if(ans == 0):\r\n n = n - math.gcd(n, a)\r\n else:\r\n n = n - math.gcd(n, b)\r\n i+=1 \r\nprint(ans)\r\n", "def zdg(x,y):\r\n a=min(x,y)\r\n for i in range(1,a+1):\r\n if x%i==0 and y%i==0:\r\n g=i\r\n return g\r\ns,a,heap=[int(x) for x in input().split()]\r\nc=-1\r\nwhile heap>0:\r\n c+=1\r\n if heap>zdg(s,heap) and c%2==0:\r\n heap-=zdg(s,heap)\r\n elif heap>zdg(a,heap) and c%2==1:\r\n heap-=zdg(a,heap)\r\n else:\r\n break\r\nif c%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "def computeGCD(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return abs(x)\r\n \r\na,b,k=map(int,input().split())\r\nwhile(k>=0):\r\n an=computeGCD(a,k)\r\n if(k-an>=0):\r\n k=k-an\r\n else:\r\n print(\"1\")\r\n break\r\n an=computeGCD(b,k)\r\n if(k-an>=0):\r\n k=k-an\r\n else:\r\n print(\"0\")\r\n break\r\n ", "a,b,c=map(int,input().split())\r\nk=0\r\nimport math\r\nwhile c!=0:\r\n k+=1\r\n if k%2!=0:\r\n v=math.gcd(a,c)\r\n c-=v\r\n else:\r\n v=math.gcd(b,c)\r\n c-=v\r\nif k%2==True:\r\n print(0)\r\nelse:\r\n print(1)", "#1 ≤ a, b, n ≤ 100\r\nfrom math import gcd\r\na,b,n = map(int, input().split( ))\r\ncnt = 0\r\nwhile n>0:\r\n if not cnt:\r\n n -= gcd(a,n)\r\n else:\r\n n-=gcd(b,n)\r\n cnt^=1\r\n\r\nprint(cnt^1)", "def nod(a, b):\r\n while b > 0:\r\n c = a % b\r\n a = b\r\n b = c\r\n return a\r\n\r\na, b, n = map(int, input().split())\r\nanswer = 0\r\nwhile n >= 0:\r\n # число камней, которое нужно взять Семену\r\n num_stone1 = nod(a, n)\r\n # проверяем может ли Семен сделать свой ход\r\n # если может, то Семен делает ход\r\n if num_stone1 <= n:\r\n n = n - num_stone1\r\n # иначе он проиграл\r\n else:\r\n answer = 1\r\n break\r\n # аналогично для Антисемена\r\n num_stone2 = nod(b, n)\r\n if num_stone2 <= n:\r\n n = n - num_stone2\r\n else:\r\n break\r\nprint(answer)", "a , b , n = map(int , input().split())\r\n\r\ndef gcd(a , b) :\r\n if b == 0 : return a \r\n else : return gcd(b , a % b)\r\n\r\n\r\ndef solve(a , b, n) :\r\n turn = 0 ;\r\n player = [a , b] \r\n while n > 0 :\r\n n = n - gcd(player[turn % 2] , n )\r\n\r\n turn += 1 \r\n \r\n return 1 if turn % 2 == 0 else 0\r\n\r\n\r\nprint(solve(a , b, n))", "def nsd(a,b):\r\n\r\n if min(a,b)==0:\r\n return max(a,b)\r\n ost=a%b\r\n while ost!=0:\r\n a=b\r\n b=ost\r\n ost=a%b\r\n return b\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile (i%2==0 and n>=nsd(a,n)) or (i%2==1 and n>=nsd(b,n)):\r\n if i%2==0:\r\n n-=nsd(a,n)\r\n else:\r\n n-=nsd(b,n)\r\n i=1-i\r\nprint(1-i)\r\n", "import math\r\n\r\nl=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nn=int(l[2])\r\ni=0\r\nwhile(True):\r\n if(i%2==0):\r\n p=math.gcd(n,a)\r\n if(n-p>=0):\r\n n=n-p\r\n else:\r\n print(\"1\")\r\n break\r\n else:\r\n p=math.gcd(b,n)\r\n if(n-p>=0):\r\n n=n-p\r\n else:\r\n print(\"0\")\r\n break\r\n \r\n i=i+1", "def gcd(x,y):\r\n while y:\r\n x,y = y,x%y\r\n return x\r\na,b,n = map(int,input().split())\r\nwhile n > 0:\r\n n -= gcd(a,n)\r\n if n == 0:print(0)\r\n n -= gcd(b,n)\r\n if n == 0:print(1)\r\n", "from math import *\r\na,b,n=[int(x) for x in input().split()]\r\ncount=0\r\nwhile n>0:\r\n n-=gcd(a,n)\r\n count+=1 \r\n if n>0:\r\n n-=gcd(b,n)\r\n count+=1 \r\nif count%2==0:\r\n print('1')\r\nelse: \r\n print('0')", "import math\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n\tx=math.gcd(a,n)\r\n\tn=n-x\r\n\tif n<=0:\r\n\t\tprint(\"0\")\r\n\t\tbreak\r\n\tx=math.gcd(b,n)\r\n\tn=n-x\r\n\tif n<=0:\r\n\t\tprint(\"1\")\r\n\t\tbreak", "from math import gcd as g\r\na,b,n=map(int,input().split())\r\ni=1\r\ncount=0\r\nwhile n>0:\r\n\tif i%2!=0:\r\n\t\tl=g(a,n)\r\n\t\tcount=1\r\n\t\tn-=l\r\n\telse:\r\n\t\tl=g(b,n)\r\n\t\tcount=0\r\n\t\tn-=l\r\n\ti+=1\r\nif count==1:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "import math\r\n\r\na,b,c= map(int,input().split(\" \"))\r\ncounter=0\r\n#counter2=0\r\n\r\nwhile c>0:\r\n nod = math.gcd(a,c)\r\n c-=nod\r\n counter+=1\r\n nod1 = math.gcd(b,c)\r\n c-=nod1\r\n counter+=1\r\n if c<0:\r\n counter-=1\r\nif counter%2!=0:\r\n print(0)\r\nelse: print(1)", "import math\r\nx,y,n=map(int,input().split())\r\nfor i in range(int(n)):\r\n k=n-math.gcd(x,n)\r\n if k==0:\r\n print(0)\r\n break\r\n else:\r\n n=k\r\n h=n-math.gcd(y,n)\r\n if h==0:\r\n print(1)\r\n break\r\n else:\r\n n=h", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\nints = [a, b]\r\nnames = [\"Simon\", \"Antisimon\"]\r\nt = 0\r\nwhile gcd(ints[t%2], n)<=n:\r\n n -= gcd(ints[t%2], n)\r\n t += 1\r\nprint((t+1)%2)", "a, b, n = map(int, input().split())\r\nwhile n > 0:\r\n A = a\r\n N = n\r\n while N > 0:\r\n A, N = N, A%N\r\n if n < A:\r\n print(1)\r\n else:\r\n n -= A\r\n## print('A = ', A, 'n = ', n)\r\n B = b\r\n N = n\r\n while N > 0:\r\n B, N = N, B%N\r\n if n < B:\r\n print(0)\r\n else:\r\n n -= B\r\n if n < B:\r\n print(1)\r\n## print('B = ', B, 'n = ', n)\r\n", "from math import gcd\r\na,b,k = map(int, input().split())\r\nwhile k >= 0:\r\n if k > 0 and gcd(a,k) <= k:\r\n k -= gcd(a,k)\r\n else:\r\n print(1)\r\n break\r\n if k > 0 and gcd(b,k) <= k:\r\n k -= gcd(b,k)\r\n else:\r\n print(0)\r\n break", "a,b,n = map(int,input().split())\nsem = a\nant = b\ni=1\nn1 = n\ndef min_mnog(x,y):\n while x > 0 and y > 0:\n x, y = y, x % y\n # print(x,y)\n return x\n\nwhile n1 > 0:\n a = sem\n b = ant\n n = n1\n if i%2 != 0:\n # while a > 0 and n > 0:\n # a,n=n,a%n\n n1 = n1-min_mnog(a,n)\n## print('MIr',a,n1)\n else:\n # while b > 0 and n > 0:\n # b,n=n,b%n\n n1 = n1 - min_mnog(b,n)\n## print('Ant',b,n1)\n i+=1\nif i%2 != 0:\n print('1')\nelse:\n print('0')\n\n", "\r\nimport math\r\na,b,n=map(int,input().split())\r\na1=b1=0\r\nx=1\r\nwhile n>0:\r\n\tif x%2!=0:\r\n\t\ty=(math.gcd(a,n))\r\n\t\ta1=a1+1\r\n\telse:\r\n\t\ty=(math.gcd(b,n))\r\n\t\tb1=b1+1\r\n\tn=n-y\r\n\tx=x+1\r\nif a1>b1:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)\r\n", "import math\r\n\r\ndef fun(a,b,n,gcd,count):\r\n if n<=gcd:\r\n return count\r\n n-=gcd\r\n if count%2==0:\r\n gcd=math.gcd(b,n)\r\n count=1\r\n else:\r\n gcd=math.gcd(a,n)\r\n count=0\r\n return fun(a,b,n,gcd,count)\r\n\r\na,b,n=map(int,input().split())\r\ngcd=math.gcd(a,n)\r\ncount=0\r\nprint(fun(a,b,n,gcd,count))", "def gcd(num,n):\r\n while(num%n!=0):\r\n temp=n\r\n n=num%n\r\n num=temp\r\n return n\r\na,b,n=map(int,input().split())\r\nturn=True\r\nwhile(n>0):\r\n if turn == True:\r\n res=gcd(a,n)\r\n n=n-res\r\n turn=False\r\n else:\r\n res=gcd(b,n)\r\n n=n-res\r\n turn=True\r\n #print(n)\r\nif turn==True:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "def nod(x,y):\r\n while x>0:\r\n y,x=x,y%x\r\n return y\r\na,b,n=map(int,input().split())\r\nwhile n>0:\r\n n=n-nod(a,n)\r\n if n<nod(a,n):\r\n print(0)\r\n break\r\n n=n-nod(b,n)\r\n if n<nod(a,n):\r\n print(1)\r\n break\r\n \r\n", "import math\r\na,b,n = map(int,input().split())\r\ncount = 0\r\nwhile n > 0:\r\n\tn -= math.gcd(a,n)\r\n\ta,b = b,a\r\n\tcount +=1\r\n\r\nif count%2 == 0:\r\n\tprint(1)\r\nelse:\r\n\tprint(0)\t", "x = list(map(int,input().split()))\na = x[0]\nb = x[1]\nn = x[2]\n\ndef gcd(a,b):\n if(b>a):\n return gcd(b,a)\n if(b==0):\n return a\n return gcd(b,a%b)\n\nwinner = 0\n\nwhile(n>0):\n if(winner==0):\n y = gcd(a,n)\n n = n-y\n winner=1\n else:\n y = gcd(b,n)\n n = n-y\n winner = 0\n\nif(winner==0):\n print(1)\nelse:\n print(0)\n", "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\nfrom math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n x=gcd(a,n)\r\n if n<x:\r\n print(1)\r\n break\r\n n-=x\r\n y=gcd(b,n)\r\n if n<y:\r\n print(0)\r\n break\r\n n-=y", "a,b,c=map(int,input().split())\r\ndef nod(a,b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return max(a,b)\r\nwhile True:\r\n if c > nod(a,c):\r\n c -= nod(a,c)\r\n else:\r\n print(0)\r\n break\r\n if c > nod(b,c):\r\n c -= nod(b,c)\r\n else:\r\n print(1)\r\n break", "# 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\nimport math\r\na, b, n = map(int, input().split())\r\nflag = True\r\nturn = True\r\n\r\nwhile flag:\r\n if turn:\r\n zz = math.gcd(a,n)\r\n if zz <= n:\r\n n-=zz\r\n turn = False\r\n else:\r\n flag = False\r\n else:\r\n zz = math.gcd(b,n)\r\n if zz <= n:\r\n n-=zz\r\n turn = True\r\n else:\r\n flag = False\r\nif turn:\r\n print(1)\r\nelse:\r\n print(0)", "a,b,n=map(int,input().split())\r\nt=n\r\ndef gcd(x,y):\r\n gcd=[]\r\n mi=min(x,y)\r\n if mi>0:\r\n for i in range(1,mi+1):\r\n if x%i==0 and y%i==0:\r\n gcd.append(i)\r\n great=max(gcd)\r\n if mi==0:\r\n great=max(x,y)\r\n return great\r\nfor i in range(1, t + 10):\r\n if i % 2 == 1:\r\n ta = gcd(a, n)\r\n k = 1\r\n elif i % 2 == 0:\r\n ta = gcd(b, n)\r\n k = 0\r\n if n < ta:\r\n break\r\n if n >= ta:\r\n n-=ta\r\nprint(k)", "def gcd(a, b):\n\tif a < 0:\n\t\treturn gcd(-a, b)\n\tif b < 0:\n\t\treturn gcd(a, - b)\n\tif b == 0:\n\t\treturn a\n\tif a < b:\n\t\treturn gcd(b, a)\n\treturn gcd(b, a % b)\n\na, b, n = [int(tmp) for tmp in input().split()]\nk = 0\nd = gcd(a, n)\nwhile d <= n:\n\tn -= d\n\tk += 1\n\tif k % 2 == 1:\n\t\td = gcd(b, n)\n\telse:\n\t\td = gcd(a, n)\nprint(1 - k % 2)\n\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\nwinner = None\r\nwhile True:\r\n if n == 0:\r\n winner = 1\r\n break\r\n n -= gcd(n, a)\r\n if n == 0:\r\n winner = 0\r\n break\r\n n -= gcd(n, b)\r\nprint(winner)\r\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\ncnt = 0\r\nwhile n > 0:\r\n cnt += 1\r\n n -= gcd(a, n)\r\n if n <= 0:\r\n break\r\n n -= gcd(b, n)\r\n cnt += 1\r\n\r\nif cnt % 2 == 0:\r\n print(1)\r\nelif cnt % 2 != 0:\r\n print(0)\r\n", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a;\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\na,b,k=map(int,input().split())\r\nwhile(1):\r\n\ts=gcd(a,k)\r\n\tk-=s\r\n\t#print(\"s\",s)\r\n\tif k<0:\r\n\t\tprint(1)\r\n\t\tbreak\r\n\tt=gcd(b,k)\r\n\t#print(\"t\",t)\r\n\tk-=t\r\n\tif k<0:\r\n\t\tprint(0)\r\n\t\tbreak", "import math\r\n\r\ntest_case=input().split(' ')\r\n\r\n\r\ndef heap_left(fixed,gcd):return gcd-math.gcd(fixed,gcd)\r\n\r\n\r\ndef assignment(p1,p2,n):\r\n list=[int(n)]\r\n flag=int(n)\r\n count=0\r\n while flag!=0:\r\n if count%2==0:flag=heap_left(int(p1),list[count]);list.append(heap_left(int(p1),list[count]))\r\n else:flag=heap_left(int(p2),list[count]);list.append(heap_left(int(p2),list[count]))\r\n count+=1\r\n\r\n if len(list)%2==0:print(0)\r\n else:print(1)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n assignment(test_case[0],test_case[1],test_case[2])\r\n #print(test_case[0],test_case[1],)", "from math import gcd\r\na,b,n=map(int,input().split())\r\n\r\nj=0\r\nwhile n > 0:\r\n\ts = gcd(a,n)\r\n\tsem = s\r\n\tn-=s\r\n\tif n == 0:\r\n\t\tj+=2\r\n\ts1=gcd(b,n)\r\n\tantsem = s1\r\n\tn -= s1\r\n\tif n == 0:\r\n\t\tj+=1\r\nprint(\"0\" if j==2 else \"1\")", "a, b, n = map(int, input().split())\r\nq = a\r\nw = b\r\ne = n\r\ns = 0\r\nwhile n != 0:\r\n e = n\r\n q = a\r\n while e > 0:\r\n q, e = e, q % e\r\n n = n - q\r\n s = 0\r\n if n > 0:\r\n e = n\r\n w = b\r\n while e > 0:\r\n w, e = e, w % e\r\n n = n - w\r\n s = 1\r\nprint(s)\r\n", "def gcdc(n,m):\r\n gcd=0\r\n for i in range(1,min(n,m)+1):\r\n if n%i==0 and m%i==0:\r\n gcd=i\r\n if n==0:\r\n gcd=m\r\n if m==0:\r\n gcd=n\r\n return gcd\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>=0:\r\n if i==0:\r\n x=gcdc(a,n)\r\n n=n-x\r\n i=1\r\n else:\r\n x=gcdc(b,n)\r\n n=n-x\r\n i=0\r\nprint(i)\r\n", "from math import gcd\r\na,b,n = map(int,input().split(' '))\r\nx = a\r\nset = 0\r\nwhile gcd(x,n)<=n and n != 0:\r\n n -= gcd(x,n)\r\n if set == 0:\r\n x = b\r\n set = 1\r\n else:\r\n x = a\r\n set = 0\r\nprint(1-set)\r\n ", "def gcd(a,b):\r\n r = a % b\r\n while r != 0:\r\n a = b\r\n b = r\r\n r = a % b\r\n return b\r\na,b,n = input().split(\" \")\r\nwhile True:\r\n n = int(n) - gcd(int(a), int(n))\r\n if n == 0:\r\n print(0)\r\n break\r\n n = int(n) - gcd(int(b), int(n))\r\n if n == 0:\r\n print(1)\r\n break", "def gcd(a, b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n return a + b\r\n\r\n\r\na, b, n = map(int, input().split())\r\n\r\ni = 0\r\nwhile n != 0:\r\n i += 1\r\n if i % 2 == 1:\r\n n -= gcd(a, n)\r\n else:\r\n n -= gcd(b, n)\r\n\r\nif i % 2 == 1:\r\n print(0)\r\nelse:\r\n print(1)", "x,y,z=map(int,input().split())\r\nd=0\r\ne=0\r\nwhile z>0:\r\n\t\r\n\tfor i in range(x,0,-1):\r\n\r\n\t\tif x%i==0 and z%i==0 and z>=i:\r\n\t\t\tz=z-i\r\n\t\t\tif z==0:\r\n\t\t\t\td+=1\r\n\t\t\tbreak\r\n\t#print(z)\r\n\tfor i in range(y,0,-1):\r\n\t\tif y%i==0 and z%i==0 and z>=i:\r\n\t\t\tz=z-i\r\n\t\t\tif z==0:\r\n\t\t\t\te+=1\r\n\t\t\tbreak\r\nif d>e:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "from math import gcd\r\na , b , n = map(int,input().split())\r\nfor i in range(n+1):\r\n\tif i%2==0:\r\n\t\tif gcd(a,n)<=n:\r\n\t\t\tn -= gcd(a,n)\r\n\t\telse:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif gcd(b,n)<=n:\r\n\t\t\tn -= gcd(b,n)\r\n\t\telse:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak", "from math import gcd\r\na, b, n = map(int, input().split())\r\nf = False\r\nwhile f == False:\r\n if gcd(a, n) < n:\r\n n -= gcd(a, n)\r\n else:\r\n print(0)\r\n break\r\n if gcd(b, n) < n:\r\n n -= gcd(b, n)\r\n else:\r\n print(1)\r\n f = True", "def gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\na,b,n = input().split(\" \")\r\nwhile True:\r\n n = int(n) - gcd(int(a), int(n))\r\n if n == 0:\r\n print(0)\r\n break\r\n n = int(n) - gcd(int(b), int(n))\r\n if n == 0:\r\n print(1)\r\n break\r\n", "from math import gcd as g\r\na,b,n=map(int,input().split())\r\nt=1\r\nwhile n:t=1-t;n-=g(n,b)if t else g(n,a)\r\nprint(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\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n \r\n while n >= 0:\r\n n -= gcd(a, n)\r\n if n < 0:\r\n print(\"1\")\r\n quit()\r\n \r\n n -= gcd(b, n)\r\n if n < 0:\r\n print(\"0\")\r\n quit()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def gcd(a,b):\r\n h=1\r\n for i in range(1,min(a,b)+1):\r\n if a%i==0 and b%i==0:\r\n h=i\r\n return h\r\n\r\ndef func(a,b,n):\r\n w=-1\r\n y=0\r\n while n!=0:\r\n if y%2==0:\r\n if gcd(a,n)<=n:\r\n n-=gcd(a,n)\r\n w=0\r\n else:\r\n break\r\n else:\r\n if gcd(b,n)<=n:\r\n n-=gcd(b,n)\r\n w=1\r\n else:\r\n break\r\n y+=1\r\n return w\r\n \r\n\r\na,b,n=map(int,input().split())\r\nprint(func(a,b,n))", "import math\r\na,b,n=map(int,input().split())\r\nx=0\r\ny=0\r\nwhile n>0:\r\n\tn = n - math.gcd(n,a)\r\n\tif n<=0:\r\n\t\tx=1\r\n\t\tbreak\r\n\telse:\r\n\t\tn = n- math.gcd(n,b)\r\n\t\tif n<=0:\r\n\t\t\ty=1\r\n\t\t\tbreak\r\nif x==1:\r\n\tprint(0)\r\nelif y==1:\r\n\tprint(1)", "def gcd(x, y):\n while y != 0:\n r = x % y\n x = y\n y = r\n return x\n\n#---main---#\na, b, n = map(int, input().split())\ncheck = True\nfor i in range(100):\n if n <= 0: break\n if i % 2 == 0:\n remove = gcd(a,n)\n n -= remove\n check = True\n else:\n remove = gcd(b,n)\n n -= remove\n check = False\nif check: print(0)\nelse: print(1)\n \t\t \t \t\t\t\t \t \t\t \t\t \t\t \t \t", "from math import gcd\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile True:\r\n if i%2==0:\r\n x=gcd(a,n)\r\n elif i%2==1:\r\n x=gcd(b,n)\r\n n-=x\r\n if n==0:\r\n if i%2==0:\r\n print(0)\r\n elif i%2==1:\r\n print(1)\r\n break\r\n i+=1\r\n", "a,b,n = [int(x) for x in input().split()]\r\ndef gcd(a,b):\r\n while(a*b):\r\n if a>b:\r\n a-=b\r\n else:\r\n b-=a\r\n return max(a,b)\r\nlis = [b,a]\r\ni=1\r\nwhile(True):\r\n n = n-gcd(lis[i],n)\r\n if n<0:\r\n print(i)\r\n break\r\n if i==0:\r\n i=1\r\n else:\r\n i=0", "import math\r\na,b,n = list(map(int, input().split()))\r\nc = 0\r\nwhile n >= 0:\r\n if c % 2 == 0:\r\n n -= math.gcd(a,n)\r\n else:\r\n n -= math.gcd(b,n)\r\n c += 1\r\n\r\nif c % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "def gcd(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nnum1, num2, n = map(int, input().split())\r\n\r\nturn = 0\r\nwhile n > 0:\r\n if turn % 2 == 0:\r\n n -= gcd(num1, n)\r\n else:\r\n n -= gcd(num2, n)\r\n turn += 1\r\n\r\nif turn % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)", "from math import gcd\na, b, n = [int(i) for i in input().split()]\nk=0\nwhile True:\n if k%2==0:\n num_needed = gcd(n, a)\n if n<num_needed:\n print(1)\n break\n else:\n n-=num_needed\n else:\n num_needed=gcd(n, b)\n if n<num_needed:\n print(0)\n break\n else:\n n-=num_needed\n k+=1", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef NOD(x, y):\r\n while y != 0:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef game(a, b, n):\r\n while True:\r\n n -= NOD(a, n)\r\n if n < 0:\r\n print(1)\r\n break\r\n n -= NOD(b, n)\r\n if n < 0:\r\n print(0)\r\n break\r\n\r\n\r\ngame(a, b, n)\r\n", "def GCD(x, y):\r\n gcd = None\r\n for i in range(1, x+1):\r\n if x%i == 0 and y%i == 0:\r\n gcd = i\r\n return gcd\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n Turn = 0\r\n while True :\r\n if Turn == 0:\r\n if n < 0:\r\n print(\"0\")\r\n break\r\n k = GCD(a, n)\r\n n = n - k\r\n Turn = 1\r\n else:\r\n if n < 0:\r\n print(\"1\")\r\n break\r\n k = GCD(b, n)\r\n n = n - k\r\n Turn = 0\r\nmain()", "import math as m\r\na, b,n = map (int, input ().split ())\r\npl=\"Semen\"\r\nwhile n>0:\r\n pl=\"Antismen\"\r\n n-=m.gcd(a,n)\r\n if n<=0:\r\n break\r\n pl=\"Semen\"\r\n n -= m.gcd(b, n)\r\n if n<=0:\r\n break\r\nif pl==\"Antismen\":\r\n print(0)\r\nelse:\r\n print(1)", "import math\r\n\r\ndef nod(x,n):\r\n return math.gcd(x,n)\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile n>=0:\r\n nod_a = nod(a,n)\r\n if n>abs(n-nod_a):\r\n n -= nod_a\r\n else:\r\n print(1)\r\n break\r\n nod_b = nod(b,n)\r\n if n>abs(n-nod_b):\r\n n-=nod_b\r\n else:\r\n print(0)\r\n break\r\n", "#!/usr/bin/env python\r\n\r\nimport math, sys, itertools\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\ta, b, n = map(int, wtf[0].split())\r\n\twhile n > 0:\r\n\t\tag = math.gcd(a, n)\r\n\t\tif ag > n:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\t\tif ag == n:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\t\tn -= ag\r\n\t\tbg = math.gcd(b, n)\r\n\t\tif bg > n:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\t\tif bg == n:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\t\tn -= bg", "import math\r\n\r\na,b,n=map(int,input().split())\r\nwhile 1>0:\r\n m=math.gcd(a,n)\r\n if m>n:\r\n print(1)\r\n break\r\n\r\n else:\r\n n-=m\r\n \r\n m=math.gcd(b,n)\r\n if m>n:\r\n print(0)\r\n break\r\n\r\n else:\r\n n-=m", "import math\n\na, b, n = map(int, input().split())\nh = 0\nwhile n:\n if h % 2:\n n -= math.gcd(n, b)\n else:\n n -= math.gcd(a, n)\n h += 1\nprint(0 if h % 2 else 1)\n", "import math\r\na,b,c=map(int,input().split())\r\ns=1\r\nd=math.gcd(a,c)\r\nwhile c>=d:\r\n s+=1\r\n c=c-d\r\n if s%2==0:\r\n d=math.gcd(b,c)\r\n else:\r\n d=math.gcd(a,c)\r\nif s%2==0:\r\n print(0)\r\nelse:\r\n print(1)", "import math\r\na, b, n = map(int,input().split());\r\ncount = 0;\r\nwhile (n > 0):\r\n s = math.gcd(a,n);\r\n if(n>=s):\r\n n = n-s;\r\n #print(s,n);\r\n count = count + 1;\r\n else:\r\n break;\r\n p = math.gcd(b,n);\r\n if(n>=p):\r\n n = n - p;\r\n #print(p,n);\r\n count = count + 1;\r\n else:\r\n break;\r\n#print(count)\r\nif (count%2==0):\r\n print(\"1\");\r\nelse:\r\n print(\"0\");", "def gcd_func(a, b):\r\n if a == b:\r\n return a\r\n elif a > b:\r\n if b == 0:\r\n return a\r\n else:\r\n for x in range(b, 0, -1):\r\n if a % x == 0 and b % x ==0:\r\n return x\r\n else:\r\n return gcd_func(b, a)\r\n\r\ninputs_list = list(map(int, input().split()))\r\nn = inputs_list[2]\r\na = inputs_list[0]\r\nb = inputs_list[1]\r\n\r\nturn = 0\r\n\r\nwhile True:\r\n if turn == 0:\r\n a1 = gcd_func(n,a)\r\n if a1 <= n:\r\n n -= a1\r\n turn = 1\r\n else:\r\n print(\"1\")\r\n break\r\n if turn == 1:\r\n a2 = gcd_func(n,b)\r\n if a2 <= n:\r\n n -= a2\r\n turn = 0\r\n else:\r\n print(\"0\")\r\n break", "import math\r\n\r\na, b, n = map(int, input().split())\r\nk = 0\r\nwhile n >= 0:\r\n n -= math.gcd(n, (a, b)[k])\r\n k = 1 - k\r\nprint(k)\r\n", "from math import gcd\r\n\r\nstrn = input().split(' ')\r\na = int(strn[0])\r\nb = int(strn[1])\r\nn = int(strn[2])\r\nstart = 0\r\nwhile n != 0:\r\n if start == 0:\r\n n -= gcd(n, a)\r\n start = 1\r\n elif start == 1:\r\n n -= gcd(n, b)\r\n start = 0\r\nif start == 0:\r\n print(1)\r\nif start == 1:\r\n print(0)\r\n", "import math\r\na,b,n=map(int,input().split())\r\ntemp=a\r\ncount=0\r\nwhile(1):\r\n\tif n>=(math.gcd(temp,n)):\r\n\t\tn=n-math.gcd(temp,n)\r\n\t\tcount=count+1\r\n\t\ttemp=b if count%2 else a \r\n\telse:\r\n\t\tbreak\r\nprint ('0' if count%2 else '1') ", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\nimport math\r\na,b,h = [int(x) for x in input().split()]\r\n\r\nisA = False\r\nwhile True:\r\n\tisA = not isA\r\n\tif isA:\r\n\t\th -= math.gcd(a,h)\r\n\t\tif h < 0:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\th -= math.gcd(b,h)\r\n\t\tif h < 0:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\r\n", "from fractions import gcd\r\na,b,n=map(int,input().split())\r\nc=0\r\nwhile n>=0:\r\n n=n-(1-c)*gcd(n,a)-c*gcd(n,b)\r\n c=1-c\r\nprint(c)", "import math\r\na, b, n = map(int, input().split())\r\n\r\nturns = [a, b]\r\n\r\ni = 0\r\nk = turns[i % 2]\r\nwhile n >= math.gcd(k, n):\r\n n -= math.gcd(k, n)\r\n i += 1\r\n k = turns[i % 2]\r\n\r\nprint((i-1) % 2)\r\n", "\r\ns = input()\r\n\r\na , b, n = s.split(\" \")\r\n\r\n\r\nturn = 1\r\nwhile int(n) != 0:\r\n if turn % 2 == 0:\r\n for i in range(int(b),0,-1):\r\n if (int(b) % i == 0) and (int(n) % i == 0):\r\n break\r\n n = int(n) - i\r\n turn +=1\r\n\r\n else:\r\n for i in range(int(a),0,-1):\r\n if (int(a) % i == 0 ) and (int(n) % i == 0):\r\n break\r\n n = int(n) - i\r\n turn += 1\r\n\r\n\r\nif turn% 2 == 0 :\r\n print (\"0\")\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 \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "import math\r\n\r\nli = input()\r\nli = li.split()\r\na = int(li[0])\r\nb = int(li[1])\r\nn = int(li[2])\r\nt = 0\r\n\r\nwhile n:\r\n if t % 2 == 0:\r\n n = n - math.gcd(a,n)\r\n if n == 0:\r\n print(\"0\")\r\n else:\r\n n = n - math.gcd(b,n)\r\n if n == 0:\r\n print(\"1\")\r\n t += 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", "# cook your dish here\n\ndef gcd(x,y):\n while(y):\n x,y=y,x%y\n return x\n\na,b,n = list(map(int, input().split()))\ni=0\nwhile(n):\n if i%2==0:\n n-=gcd(a,n)\n else:\n n-=gcd(b,n)\n i+=1\n\nprint(1 if i%2==0 else 0)\n ", "x=list(map(int,input().split()))\r\na=semen=x[0]\r\nb=antisemen=x[1]\r\nn=kucha=x[2]\r\nwhile kucha>=0:\r\n while n>0: #define nod for semen\r\n a,n=n,a%n\r\n if kucha>=a:\r\n kucha=kucha-a\r\n## print('kucha after s',kucha)\r\n n=kucha\r\n a=semen \r\n else:\r\n print(1)\r\n break\r\n while n>0: #define nod for antisemen\r\n b,n=n,b%n\r\n if kucha>=b:\r\n kucha=kucha-b\r\n## print('kucha after as',kucha)\r\n n=kucha\r\n b=antisemen\r\n else:\r\n print(0)\r\n break\r\n\r\n\r\n##c=n*m\r\n##k=m\r\n##while n>0:\r\n## m,n=n,m%n\r\n##print(int((c/m)/k))\r\n", "import fractions\n\n*a,n = map(int,input().split())\nwin = 0\n\nwhile n >= 0:\n\tn -= fractions.gcd(a[win%2],n)\n\twin = 1 - win\n\nprint(win)", "from math import gcd\na, b, n = (int(x) for x in input().split())\nt, x = 1, gcd(n, a)\nwhile n >= x:\n n -= x\n x = gcd(n, b if t % 2 else a)\n t += 1\nprint(t % 2)", "a,b,n=map(int, input().split())\r\ndef bruh(c,d,f):\r\n while True:\r\n for i in range(f,0,-1):\r\n if f%i==0 and c%i==0:\r\n f=f-i\r\n break\r\n if f==0:\r\n return 0\r\n for i in range(f,0,-1):\r\n if f%i==0 and d%i==0:\r\n f=f-i\r\n break\r\n if f==0:\r\n return 1\r\nprint(bruh(a,b,n))", "from sys import stdin, stdout\r\na, b, n = map(int, stdin.readline().split())\r\ndef gcd(x, y):\r\n if(y>x):\r\n temp = x\r\n x = y\r\n y = temp\r\n while(y!=0):\r\n rem = x%y\r\n x = y\r\n y = rem\r\n return x\r\ncount = 0\r\nwhile(n>=0):\r\n if(count%2==0):\r\n n -= gcd(a,n)\r\n else:\r\n n -= gcd(b,n)\r\n count+=1\r\nprint(count%2)\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\na,b,n = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n if i % 2 == 0:\r\n g = gcd(a, n)\r\n if g > n:\r\n print(1)\r\n exit()\r\n n -= g\r\n else:\r\n g = gcd(b, n)\r\n if g > n:\r\n print(0)\r\n exit()\r\n n -= g\r\n i += 1\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\n\r\ndef UnityCheck(m, n, p):\r\n if m == 1 and n == 1 and p % 2 == 0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\ndef AnsCheck(a, b, z):\r\n while z > 0:\r\n z = z - gcd(a, z)\r\n if z == 0:\r\n print(0)\r\n z = z - gcd(b, z)\r\n if z == 0:\r\n print(1)\r\n\r\n\r\nq = input().split()\r\nx = UnityCheck(int(q[0]), int(q[1]), int(q[2]))\r\nif x != 1 or x != 0:\r\n AnsCheck(int(q[0]), int(q[1]), int(q[2]))\r\n", "def gcd(a,b):\r\n large=1\r\n for i in range(1,min(a,b)+1):\r\n if(a%i==0 and b%i==0):\r\n large=i\r\n return large\r\na,b,n=map(int,input().split())\r\nwhile(True):\r\n if(gcd(a,n)<=n):\r\n n-=gcd(a,n)\r\n else:\r\n print(\"1\")\r\n exit()\r\n if(gcd(b,n)<=n):\r\n n-=gcd(b,n)\r\n else:\r\n print(\"0\")\r\n exit()\r\n ", "a, b, n = map(int, input().split())\r\ni = 1\r\nq = n\r\nq1 = n\r\n\r\nwhile q > 0:\r\n if i % 2 == 1:\r\n ac = a\r\n q1 = q\r\n while q1 > 0:\r\n ac, q1 = q1, ac % q1\r\n q = q - ac\r\n if q > 0:\r\n i += 1\r\n else:\r\n i -= 1\r\n break\r\n else:\r\n bc = b\r\n q1 = q\r\n while q1 > 0:\r\n bc, q1 = q1, bc % q1\r\n q = q - bc\r\n if q > 0:\r\n i += 1\r\n else:\r\n i -= 1\r\n break\r\n\r\nif i % 2 == 1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\ndef Game(x, y, n):\r\n temp = n\r\n for i in range(n):\r\n if i%2 == 0:\r\n val = gcd(x, n)\r\n if val <= n:\r\n n -= val\r\n else:\r\n return 1\r\n else:\r\n val = gcd(y, n)\r\n if val <= n:\r\n n -= val\r\n else:\r\n return 0\r\n if temp % 2 == 0:\r\n return 1\r\n else:\r\n return 0\r\n \r\nx, y, n = [int(x) for x in input().split()]\r\nprint(Game(x, y ,n))\r\n \r\n", "from math import gcd\r\na,b, s = map(int,input().split())\r\nwhile True:\r\n if s>=gcd(a,s):\r\n s-=gcd(a,s)\r\n else:\r\n print(1)\r\n break\r\n if s>=gcd(b,s):\r\n s -= gcd(b,s)\r\n else:\r\n print(0)\r\n break", "def GCD(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n n = n - GCD(a, n)\r\n if n==0:\r\n print('0')\r\n break\r\n n = n - GCD(b, n)\r\n if n==0:\r\n print('1')\r\n break", "a,b,n=map(int,input().split())\r\nc=0\r\nd=0\r\nr=a\r\nt=b\r\nwhile c==0:\r\n f = n\r\n if d==0:\r\n while n>0:\r\n a,n=n,a%n\r\n n=f-a\r\n a=r\r\n if n<0:\r\n c=c+1\r\n print(1)\r\n else:\r\n d=d+1\r\n else:\r\n while n>0:\r\n b,n=n,b%n\r\n n=f-b\r\n b=t\r\n if n<0:\r\n c=c+1\r\n print(0)\r\n else:\r\n d=d-1", "import sys\r\nfrom random import choice,randint\r\ninp=sys.stdin.readline\r\nout=sys.stdout.write\r\nflsh=sys.stdout.flush\r\n \r\nsys.setrecursionlimit(10**9)\r\ninf = 10**20\r\neps = 1.0 / 10**10\r\nmod = 10**9+7\r\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\r\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\r\n \r\ndef MI(): return map(int, inp().strip().split())\r\ndef LI(): return list(map(int, inp().strip().split()))\r\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\r\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\r\ndef LF(): return [float(x) for x in inp().strip().split()]\r\ndef LS(): return inp().strip().split()\r\ndef I(): return int(inp().strip())\r\ndef F(): return float(inp().strip())\r\ndef S(): return inp().strip()\r\ndef pf(s): return out(s+'\\n')\r\ndef JA(a, sep): return sep.join(map(str, a))\r\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\r\n\r\ndef main():\r\n from math import gcd\r\n a,b,n=MI()\r\n c=0\r\n while True:\r\n if c%2==0:\r\n x = gcd(a,n)\r\n if x<=n:\r\n n-=x\r\n else:\r\n break\r\n else:\r\n x = gcd(b,n)\r\n if x<=n:\r\n n-=x\r\n else:\r\n break\r\n c+=1\r\n if c%2==0:\r\n pf(\"1\")\r\n else:\r\n pf(\"0\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdin\r\n_input = stdin.readline\r\n_int = int\r\nfrom math import gcd\r\n\r\n\r\ndef solution():\r\n a,b, n = [_int(i) for i in _input().split()]\r\n while n > 0:\r\n n -= gcd(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n n -= gcd(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\nsolution()", "a, b, n = [int(x) for x in input().split()]\r\nr = 0\r\nwhile n > 0:\r\n if r == 0:\r\n t = a\r\n r = 1\r\n else:\r\n t = b\r\n r = 0\r\n gcd = t\r\n while t % gcd != 0 or n % gcd != 0:\r\n gcd -= 1\r\n n -= gcd\r\nprint(1 - r)", "a,b,n=map(int,input().split())\r\ns=0\r\nans=0\r\ndef nob(v,c):\r\n nabor=[]\r\n for i in range(1,v+1):\r\n if v%i==0 and c%i==0:\r\n nabor.append(i)\r\n return max(nabor)\r\nwhile n!=0:\r\n n-=nob(a,n)\r\n if n>0:\r\n n-=nob(b,n)\r\n else:\r\n print('0')\r\n break\r\nelse:\r\n print('1')", "import math\r\na,b,n = map(int,input().split())\r\nwhile(1):\r\n k = math.gcd(a,n)\r\n if(n-k<0):\r\n print(1)\r\n exit()\r\n n-=k\r\n k=math.gcd(b,n)\r\n if(n-k<0):\r\n print(0)\r\n exit()\r\n n-=k", "from fractions import gcd\r\nf=lambda a,b,n:1-f(b,a,n-gcd(n,a)) if n else 1\r\nprint (f(*map(int, input().split())))", "def euclid_gcd(num_1: int, num_2: int) -> int:\r\n if max(num_1, num_2) % min(num_1, num_2) == 0:\r\n return min(num_1, num_2)\r\n else:\r\n return euclid_gcd(min(num_1, num_2), max(num_1, num_2) % min(num_1, num_2))\r\n\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n flag = True\r\n while n:\r\n if flag:\r\n n -= euclid_gcd(a, n)\r\n flag = False\r\n else:\r\n n -= euclid_gcd(b, n)\r\n flag = True\r\n print(0) if not flag else print(1)\r\n\r\n\r\nmain()\r\n", "\r\nimport math\r\n\r\n\r\nn = list(map(int,input().split()))\r\ncounter = False\r\nwhile n[2]>0: \r\n n[2] = n[2] - math.gcd(n[counter],n[2])\r\n counter = not(counter)\r\n\r\nprint(int(not(counter)))\r\n \r\n\r\n\r\n", "def gcd(a,b):\n if a==b:\n return a\n elif a<b:\n return gcd(b,a)\n else:\n return gcd(b,a-b)\na,b,n=map(int,input().split())\ni=1\nwhile True:\n if n==0:\n break\n if i%2!=0:\n m=gcd(a,n)\n elif i%2==0:\n m=gcd(b,n)\n if m>n:\n break\n else:\n n-=m\n i+=1\nif i%2!=0:\n print(1)\nelse:\n print(0)\n", "import math\r\na,b,n=map(int,input().split(' '))\r\nk=1\r\nwhile n>=0:\r\n\tk+=1\r\n\tif k%2==0:\r\n\t\tn-=math.gcd(a,n)\r\n\t\tif n<0:\r\n\t\t\tk=1\r\n\telse:\r\n\t\tn-=math.gcd(b,n)\r\n\t\tif n<0:\r\n\t\t\tk=0\r\nprint(k)", "import math as m\r\nA,B,N=list(map(int,input().split()))\r\nC=0\r\nwhile N>0:\r\n if C%2==0:\r\n X=m.gcd(A,N)\r\n N-=X\r\n else:\r\n X=m.gcd(B,N)\r\n N-=X\r\n C+=1\r\n\r\nif C%2==0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "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\na, b, n = [int(i) for i in input().split()]\r\nsemen = False\r\nwhile n > 0:\r\n n -= gcd(a, n)\r\n if n > 0:\r\n semen = True\r\n n -= gcd(b, n)\r\n if n > 0:\r\n semen = False\r\nprint(int(semen))\r\n", "def gcd(a,b):\r\n c=0\r\n for i in range (max(a,b),0,-1):\r\n if a%i==0 and b%i==0:\r\n c=i\r\n break\r\n return c\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n n-=gcd(a,n)\r\n else:\r\n n-=gcd(b,n)\r\n i+=1\r\nif i%2==1:\r\n print(0)\r\nelse:\r\n print(1)", "# https://codeforces.com/problemset/problem/119/A\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n\r\n return x\r\n\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n a_stones = gcd(a, n)\r\n if a_stones > n:\r\n print(1)\r\n break\r\n n -= a_stones\r\n\r\n b_stones = gcd(b, n)\r\n if b_stones > n:\r\n print(0)\r\n break\r\n n -= b_stones\r\n", "from math import gcd\r\na,b,n=list(map(int,input().split()))\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n n-=gcd(n,a)\r\n else:\r\n n-=gcd(n,b)\r\n i+=1\r\nprint(0 if i%2 else 1)", "def gcd(n,m):\r\n max1=0\r\n if(m>n):\r\n max1=m\r\n else:\r\n max1=n\r\n max2=0\r\n for i in range(1,max1+1):\r\n if(n%i==0 and m%i==0):\r\n max2=i\r\n return max2\r\na,b,n=map(int,input().split())\r\ncount=0\r\nwhile (n!=0 and n>0):\r\n if(count!=2):\r\n x=gcd(a,n)\r\n n=n-x\r\n if(n==0):\r\n count=1\r\n if(count!=1):\r\n y=gcd(b,n)\r\n n=n-y\r\n if(n==0):\r\n count=2\r\n \r\nif(count==1):\r\n print('0')\r\nelse:\r\n print('1')", "import math\r\na,b,n=map(int,input().split())\r\nt=True\r\nwhile n:\r\n if t:c=math.gcd(a,n)\r\n else:c=math.gcd(b,n)\r\n n-=c\r\n t=not t\r\nprint(1 if t else 0)\r\n", "\r\nfrom math import gcd\r\na, b, n = map(int, input().split())\r\nc = n\r\ntmp = 0\r\ni = 0\r\nwhile c > 0:\r\n if i % 2 == 0:\r\n tmp = gcd(a, c)\r\n c -= tmp\r\n if c <= 0:\r\n print('0')\r\n exit()\r\n else:\r\n tmp = gcd(b, c)\r\n c -= tmp\r\n if c <= 0:\r\n print('1')\r\n exit()\r\n i += 1\r\n\r\n# CodeForcesian\r\n# ♥\r\n# Sad\r\n", "def gcd(x, y):\r\n if x == 0:\r\n return y\r\n else:\r\n return gcd(y % x, x)\r\n\r\na, b, n = map(int, input().split())\r\nk = 0\r\nwhile n >= 0:\r\n k += 1\r\n n -= gcd(a if (k & 1) else b, n)\r\nprint(1 if k & 1 else 0)\r\n", "import math\n\na, b, n = tuple([int(i) for i in input().split()])\narr = [a, b]\n\nturn = 0\nwhile(n != 0):\n\tn -= math.gcd(arr[turn], n)\n\tturn = 1 - turn\n\nprint(1 - turn)", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\nturn = 0\r\n\r\nwhile True:\r\n if turn:\r\n needed = gcd(b, n)\r\n if n < needed:\r\n print(0)\r\n break\r\n else:\r\n n -= needed\r\n turn = 0\r\n else:\r\n needed = gcd(a, n)\r\n if n < needed:\r\n print(1)\r\n break\r\n else:\r\n n -= needed\r\n turn = 1\r\n", "import math\r\na,b,n=map(int,input().split())\r\ngame=True\r\nS=A=False\r\ni=0\r\nwhile True:\r\n i=i+1\r\n if i%2==1:\r\n c=math.gcd(a,n)\r\n if n>=c:\r\n n=n-c\r\n S=True\r\n A=False\r\n else:\r\n break\r\n else:\r\n c=math.gcd(b,n)\r\n if n>=c:\r\n n=n-c\r\n S=False\r\n A=True\r\nif S:\r\n print(0)\r\nelse:\r\n print(1)", "import sys\r\nfrom itertools import cycle\r\nfrom math import gcd\r\na, b, n = map(int, sys.stdin.read().strip().split())\r\nc = cycle('01')\r\nfor i in cycle((a,b)):\r\n next(c)\r\n n -= gcd(i,n)\r\n if n < 0: break\r\nprint(next(c))", "import math\na , b , n = map(int,input().split())\nwhile True:\n n -= math.gcd(a,n)\n if n <= 0:\n c = 0\n break\n n -= math.gcd(b,n)\n if n <= 0:\n c = 1\n break\nprint(c)", "import math\r\n\r\na,b,n=map(int, input().split())\r\nf=math.gcd\r\nval=[a,b]\r\nt =0\r\nwhile True:\r\n d=f(val[t], n)\r\n if n < d:\r\n print(1-t)\r\n break\r\n t=1-t\r\n n-=d", "def gcd(a,b):\r\n\tif a==0: return(b)\r\n\treturn(gcd(b%a,a))\r\na,b,n=map(int,input().split())\r\nw=1\r\nwhile(1):\r\n\tx=gcd(n,a)\r\n\tif x<=n:\r\n\t\tn-=x\r\n\t\ta,b=b,a\r\n\telse:\r\n\t\tbreak\r\n\tw^=1\r\nprint(w)", "import math\r\n\r\na, b, n = map(int, input().split())\r\nA_gcd = 0\r\nB_gcd = 0\r\nwhile n != 0:\r\n\r\n # 1st player turn (simons)\r\n\r\n gcd = math.gcd(a, n)\r\n n = n - gcd\r\n\r\n # below is a check if the stones in heap ended. if this condition meets true, the program will end and\r\n # current player (simon) will win bcz heap ended in his turn.\r\n # if it doesn't meet, program will continue to 2nd player turn bcz there are still stones in heap.\r\n\r\n if n == 0:\r\n print(\"0\")\r\n break\r\n\r\n # 2nd player turn (Antisimon)\r\n\r\n B_gcd = math.gcd(b, n)\r\n n = n - B_gcd\r\n\r\n # below is a check if the stones in heap ended. if this condition meets true, the program will end and\r\n # current player (antisimon) will win bcz heap ended in his turn.\r\n # if it doesn't meet, program will continue to 1st player turn (new iteration)\r\n # bcz there are still stones in heap.\r\n\r\n if n == 0:\r\n print(\"1\")\r\n break", "a,b,n=map(int,input().split())\r\ndef NODa(a,n):\r\n while n>0:\r\n a,n=n,a%n\r\n return a\r\n\r\ndef NODb(b,n):\r\n while n>0:\r\n b,n=n,b%n\r\n return b\r\n\r\ndef vse(a,b,n):\r\n while True:\r\n n=n-NODa(a, n)\r\n if n==0:\r\n return 0\r\n n=n-NODb(b, n)\r\n if n==0:\r\n return 1\r\n\r\nprint(vse(a,b,n))\r\n", "import math\r\nx,y,z=map(int,input().split())\r\nwhile(True):\r\n z=z-math.gcd(z,x)\r\n if (z<0):print(1);break\r\n z=z-math.gcd(z,y)\r\n if (z<0):print(0);break\r\n", "from math import gcd\r\na,b,heap_size=map(int,input().split())\r\ntot_simon=a\r\ntot_antisimon=b\r\nstart=0\r\nfor i in range(heap_size):\r\n\tif start==0:\r\n\t\t\r\n\t\theap_size=heap_size-gcd(a,heap_size)\r\n\t\tif heap_size==0:\r\n\t\t\tprint(0)\r\n\t\tstart=1\r\n\telse:\r\n\t\theap_size=heap_size-gcd(b,heap_size)\r\n\t\tif heap_size==0:\r\n\t\t\tprint(1)\r\n\t\tstart=0\r\n\t\t\r\n", "a, b, n = map(int, input().split())\r\ni = 0\r\n\r\n\r\ndef n_o_d(x, y):\r\n nod = 0\r\n while y > 0:\r\n x, y = y, x % y\r\n nod = x\r\n return nod\r\n\r\n\r\ndef game(a, b, n, i):\r\n while n > 0:\r\n if i % 2 == 0:\r\n n -= n_o_d(a, n)\r\n i += 1\r\n else:\r\n n -= n_o_d(b, n)\r\n i += 1\r\n if i % 2 == 0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nprint(game(a, b, n, i))\r\n", "a,b,n = map(int,input().split())\r\nwhile n > 0:\r\n for i in range(1, a + 1):\r\n if a % i == 0 and n % i == 0:\r\n gcd_simon = i\r\n\r\n n = n - gcd_simon\r\n for i in range(1, b + 1):\r\n if b % i == 0 and n % i == 0:\r\n gcd_antisimon = i\r\n n = n - gcd_antisimon\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(0)", "import math\r\nt=1\r\nwhile(t>0):\r\n t-=1\r\n a,b,n=map(int,input().split())\r\n res=0\r\n i=1\r\n while(1):\r\n if(i%2==1 and math.gcd(a,n)<=n):\r\n res=0\r\n n-=math.gcd(a,n)\r\n elif(i%2==0 and math.gcd(b,n)<=n):\r\n res=1\r\n n-=math.gcd(b,n)\r\n else:\r\n break\r\n i+=1\r\n print(res)\r\n\r\n", "a, b, n = map(int, input().split())\r\na1 = [a] * n\r\nb1 = [b] * n\r\ngame = [] # сколько берет каждый игрок по порядку, начиная с Семена\r\nx = 0\r\ny = 0\r\nsemen = 0\r\ns = []\r\nasemen = 0\r\nan = []\r\ncopy4 = n\r\nwhile n >= semen or n >= asemen:\r\n copy = n\r\n copy2 = n\r\n while copy > 0:\r\n a, copy = copy, a % copy\r\n semen = a\r\n a = a1[x]\r\n x += 1\r\n s.append(semen)\r\n game.append(semen)\r\n n -= semen\r\n copy3 = copy2 - semen\r\n while copy3 > 0:\r\n b, copy3 = copy3, b % copy3\r\n asemen = b\r\n b = b1[y]\r\n y += 1\r\n an.append(asemen)\r\n game.append(asemen)\r\n n -= asemen\r\n\r\nwhile sum(game) > copy4:\r\n del game[-1]\r\n\r\nif len(game) % 2 != 0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "def gcd_rec(a, b): \r\n if a > b: \r\n a = a % b \r\n else: \r\n b = b % a \r\n if a != 0 and b != 0: \r\n return gcd_rec(a, b) \r\n else: \r\n return a + b\r\na,b,t = [int(x) for x in input().split()]\r\ni = 1\r\ncount = 0\r\nwhile t>0:\r\n if i%2==1:\r\n t -= gcd_rec(a, t)\r\n i = 0\r\n count +=1\r\n else:\r\n t -= gcd_rec(b, t)\r\n i = 1\r\n count += 1\r\n \r\nif count % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)", "def gcd(x, y):\r\n x, y = max(x, y), min(x, y)\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\n \r\na, b, n = [int(q) for q in input().split()]\r\nwhile(True):\r\n x = gcd(a, n)\r\n if n >= x:\r\n n -= x\r\n else:\r\n print(1)\r\n break\r\n x = gcd(b, n)\r\n if n >= x:\r\n n -= x\r\n else:\r\n print(0)\r\n break", "a, b, n = [int(i) for i in input().split()]\r\na1, b1, n1 = a, b, n\r\ni = gcd = 0\r\nwhile n >= gcd:\r\n if i % 2 == 0:\r\n while a != 0:\r\n n, a = a, n % a\r\n else:\r\n while b != 0:\r\n n, b = b, n % b\r\n gcd = n\r\n n = n1 - gcd\r\n n1 = n\r\n a, b = a1, b1\r\n i += 1\r\nprint(0 if i % 2 != 0 else 1)\r\n", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n if n - gcd(n, a) < 0:\r\n print(1)\r\n break\r\n else:\r\n n -= gcd(n, a)\r\n if n - gcd(n, b) < 0:\r\n print(0)\r\n break\r\n else:\r\n n -= gcd(n, b)\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 01/09/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\na, b, n = iia()\r\ncur = 0\r\nwhile n > 0:\r\n if not cur:\r\n t = gcd(a, n)\r\n if t <= n:\r\n n -= t\r\n else:\r\n t = gcd(b, n)\r\n if t <= n:\r\n n -= t\r\n cur ^= 1\r\nprint(cur ^ 1)\r\n ", "import math\r\na,b,n=map(int,input().split())\r\nx,p=[a,b],0\r\nwhile n>0:\r\n n-=math.gcd(n,x[p])\r\n p^=1 \r\nprint(\"01\"[p^1])\r\n", "simon, antiSimon, stones = map(int,input().split())\r\ndef GCD(a,b):\r\n if b == 0:\r\n return a\r\n else:\r\n return GCD(b,a%b)\r\nturn = 0\r\nwhile stones > 0:\r\n if turn == 0:\r\n toTake = GCD(simon,stones)\r\n else:\r\n toTake = GCD(antiSimon,stones)\r\n turn = (turn+1) % 2\r\n stones -= toTake\r\nprint((turn-1)%2)", "import math\r\na,b,c=[int(x) for x in input().split()]\r\ndem=0\r\nwhile c!=0:\r\n c-=math.gcd(c,a)\r\n dem+=1\r\n if(c!=0):\r\n c-=math.gcd(c,b)\r\n dem+=1\r\nif dem%2!=0:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n", "import math as m\r\na,b,n = map(int,input().split())\r\nh = 0\r\nh+=n\r\n\r\n\r\nfor i in range(h):\r\n if(n<=0):break\r\n n -= m.gcd(a,n)\r\n ca=0\r\n if(n<=0):break\r\n n -= m.gcd(b,n)\r\n ca=1\r\n if(n<=0):break\r\n \r\nif(ca==0):\r\n print(0)\r\nelse:print(1)\r\n", "import math\r\n\r\na, b, n = map(int, input().split())\r\ni = 0\r\nwhile n >= 0:\r\n n -= math.gcd(n, (a, b)[i])\r\n i = 1 - i\r\nprint(i)\r\n", "from math import gcd\r\n*a,n=map(int,input().split())\r\np=1\r\nwhile n:p^=1;n-=gcd(a[p],n)\r\nprint('01'[p])", "import math\r\ns,a,n=map(int,input().split())\r\ncount=0\r\nwhile n>0:\r\n if count%2==0:\r\n #print('gcd of {} and {} is {}'.format(s,n,math.gcd(s,n)))\r\n n = n - math.gcd(s,n)\r\n #print(n)\r\n else:\r\n #print('gcd of {} and {} is {}'.format(a,n,math.gcd(a,n)))\r\n n = n - math.gcd(a,n)\r\n #print(n)\r\n count+=1\r\nprint(abs(count%2 -1))", "from math import gcd\n\nif __name__ == '__main__':\n a, b, n = list(map(int, input().split()))\n i = 0\n while True:\n if i % 2 == 0:\n stonesToRemove = gcd(a, n)\n if stonesToRemove <= n:\n n -= stonesToRemove\n else:\n print(1)\n break\n else:\n stonesToRemove = gcd(b, n)\n if stonesToRemove <= n:\n n -= stonesToRemove\n else:\n print(0)\n break\n\n i += 1\n", "from fractions import gcd\r\n*a,n=map(int,input().split())\r\nt=0\r\nwhile n>=0:\r\n n-=gcd(a[t%2],n)\r\n t=1-t\r\nprint(t)\r\n", "def GYS(m,n):\r\n if m<n:\r\n small = m\r\n else:\r\n small = n\r\n for i in range (small,0,-1):\r\n if m % i == 0 and n %i == 0:\r\n return i\r\n\r\n\r\na,b,n = map(int,input().split())\r\nwhile n>0:\r\n n = n-GYS(a,n)\r\n if n != 0:\r\n n = n-GYS(b,n)\r\n else:\r\n n = -1\r\nprint(n+1)", "\r\nimport math\r\nline = input ()\r\ns, a , n = map(int,line.split())\r\nflage = 1\r\nwhile (n > 0) :\r\n if(n -math.gcd(s,n) >= 0 and flage == 1):\r\n n -= math.gcd(s,n)\r\n flage = 0 \r\n elif (n-math.gcd(a,n) >= 0 and flage == 0 ):\r\n n -=math.gcd(a,n)\r\n\r\n flage = 1\r\n\r\nprint(flage)", "def gcd(a, b): \n if b > a: \n return gcd(b, a)\n if b == 0: \n return a\n return gcd(b, a % b)\n\na, b, n = map(int, input().split())\n\nturn = 1\nwhile n > 0: \n turn += 1\n if turn > 1: \n turn = 0\n if turn == 0: \n n -= gcd(n, a)\n else: \n n -= gcd(n, b)\nprint(turn)\n", "def GCD(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\nm, n, k = map(int, input().split())\r\nwhile True:\r\n k -= GCD(m, k)\r\n if k == 0:\r\n print(0)\r\n break\r\n k -= GCD(n, k)\r\n if k == 0:\r\n print(1)\r\n break", "#119a Epic Game 800\r\n\r\n#Simon a -> 0\r\n#Antisimon b -> 0\r\nimport math\r\na,b,n = list(map(int,input().split()))\r\n\t\r\nturn = False\r\nwhile True:\r\n\t# print(turn)\r\n\tif not turn:\r\n\t\tg = math.gcd(a,n)\r\n\t\tn -= g\r\n\t\tif n == 0:\r\n\t\t\tprint(\"0\")\r\n\t\t\texit()\r\n\telse:\r\n\t\tg = math.gcd(b,n)\r\n\t\tn -= g\r\n\t\tif n == 0:\r\n\t\t\tprint(\"1\")\r\n\t\t\texit()\r\n\tif turn:\r\n\t\tturn = False\r\n\telse:\r\n\t\tturn = True", "def gcd(x, y):\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y, x % y)\r\n\r\n\r\n\r\nx, y, t = map(int, input().split())\r\nwhile t >= 0:\r\n t -= gcd(x, t)\r\n if t < 0:\r\n print(\"1\")\r\n quit()\r\n \r\n t -= gcd(y, t)\r\n if t < 0:\r\n print(\"0\")\r\n quit()", "import math\r\n\r\n\r\ndef runSolution():\r\n mas = input().split(\" \")\r\n a = int(mas[0])\r\n b = int(mas[1])\r\n n = int(mas[2])\r\n\r\n s = 0\r\n while n >= 0:\r\n if s % 2 == 0:\r\n n -= math.gcd(a, n)\r\n else:\r\n n -= math.gcd(b, n)\r\n s += 1\r\n if s % 2 == 0:\r\n print(0)\r\n else:\r\n print(1)\r\n\r\n\r\nif __name__ == '__main__':\r\n runSolution()", "a,b,n = map(int,input().split())\r\nflag = True\r\nwhile (n > 0):\r\n for i in range(1,n+1):\r\n if (n%i == 0 and a%i == 0):\r\n div1 = []\r\n div1.append(i)\r\n temp1 = max(div1)\r\n n-=temp1\r\n if ( n != 0 ):\r\n for i in range(1,n+1):\r\n if (n%i == 0 and b%i == 0):\r\n div2 = []\r\n div2.append(i)\r\n temp2 = max(div2)\r\n n-=temp2\r\n if n== 0: \r\n print(1)\r\n break\r\n else:\r\n print(0) ", "def gcd(a,b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\na, b, n = map(int,input().split())\r\nans = 1\r\nwhile n > 0:\r\n if ans == 1:\r\n n -= gcd(n,a)\r\n else:\r\n n -= gcd(n,b)\r\n ans ^= 1\r\nprint(ans)\r\n", "\r\ndef gcd(a, b):\r\n if (b == 0):\r\n return a\r\n return gcd(b, a % b)\r\nindex = 0\r\nnumbers = [int(item) for item in list(input().split(\" \"))]\r\nwhile numbers[2] >= 0:\r\n if (index == 0):\r\n numbers[2] -= gcd(numbers[0], numbers[2])\r\n index = 1\r\n elif (index == 1):\r\n numbers[2] -= gcd(numbers[1], numbers[2])\r\n index = 0\r\nprint(index)", "import math\r\na,i,c=list(map(int,input().split())),0,0\r\nheap=a[2]\r\nwhile True:\r\n c= math.gcd(a[i],heap)\r\n heap = heap -c\r\n if heap <= 0:\r\n print(i)\r\n break\r\n i = 0 if i == 1 else 1\r\n\r\n", "#funct\r\ndef gcd(x,y):\r\n while x!=0 and y!=0:\r\n if x>y:\r\n x=x%y\r\n else:\r\n y=y%x\r\n return x+y\r\n\r\ndef chet(b,x,y,all):\r\n if b%2==1:\r\n all=all-gcd(x,all)\r\n if all==0:\r\n print(\"0\")\r\n else:\r\n all=all-gcd(y,all)\r\n if all==0:\r\n print(\"1\")\r\n\r\n return all\r\n\r\n\r\n#program\r\nsem,anti,all=map(int,input().split())\r\nb=1\r\nwhile all>0:\r\n all=chet(b,sem,anti,all)\r\n b+=1\r\n\r\n\r\n", "from math import gcd\r\ndef read_array():\r\n x = []\r\n x1 = []\r\n x = input()\r\n x = x.split(' ')\r\n for r in range(len(x)):\r\n x1.append(int(x[r]))\r\n return x1\r\nx=read_array()\r\na=x[0]\r\nb=x[1]\r\nn=x[2]\r\nwin=True\r\nwhile n>0:\r\n n-=gcd(a,n)\r\n if n<0:\r\n win=True\r\n break\r\n n-=gcd(b,n)\r\n if n<0:\r\n win=False\r\n break\r\nif win:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "\r\ndef gcd(m, n):\r\n while n != 0:\r\n r = m % n\r\n m = n\r\n n = r\r\n return m\r\nwhile True:\r\n try:\r\n a, b, n = map(int, input().split())\r\n while True:\r\n \r\n n -= gcd(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n n -= gcd(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\n\r\n except:\r\n break\r\n \r\n", "import math\r\na,b,n = [int(i) for i in input().split()]\r\nt = 0\r\nwhile True:\r\n if t==0:\r\n s = math.gcd(a,n)\r\n else:\r\n s = math.gcd(b,n)\r\n if s<=n:\r\n n -= s\r\n else:\r\n print(abs(t-1))\r\n break\r\n t = abs(t-1) ", "from math import gcd\nfrom typing import Iterator, List\n\n\ndef get_num_input() -> Iterator[int]:\n return map(int, input().split())\n\n\ndef main() -> None:\n turn: int = 1\n\n const: List[int]\n start: int\n *const, start = get_num_input()\n\n while start:\n turn = 1 - turn\n start -= gcd(start, const[turn])\n\n print(turn)\n\n\nif __name__ == \"__main__\":\n ONLY_ONCE: bool = True\n for _ in range(1 if ONLY_ONCE else int(input())):\n main()\n", "def fun(x,y,n):\r\n\twhile True:\r\n\t\tn=n-(math.gcd(x,n))\r\n\t\tif n==0:\r\n\t\t\tprint(0)\r\n\t\t\tbreak\r\n\t\telif n<0:\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\t\tn=n-(math.gcd(y,n))\r\n\t\tif n==0:\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\t\telif n<0:\r\n\t\t\tprint(0)\r\n\t\t\tbreak\r\nimport math\r\na,b,n=map(int,input().split(\" \"))\r\nfun(a,b,n)", "import math\r\na,b,n=map(int,input().split())\r\nfor i in range(max(a,b,n)):\r\n t=math.gcd(a,n)\r\n n=n-t\r\n if n<0:\r\n print(\"1\")\r\n break\r\n g=math.gcd(b,n)\r\n n=n-g\r\n if n<0:\r\n print(\"0\")\r\n break", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\np, q, n = [*map(int, input().split())]\r\ng = gcd(p, n)\r\na = [p, q]\r\nans = 0\r\nwhile g <= n:\r\n n -= g\r\n ans = (ans + 1) % 2\r\n g = gcd(a[ans], n)\r\nprint((ans + 1) % 2)\r\n", "a,b,n=map(int,input().split())\r\ni=1\r\ndef ucln(a,b):\r\n if b==0:\r\n return(a)\r\n return ucln(b,a%b)\r\nwhile n>=ucln(a,n) or n>=ucln(b,n):\r\n if i%2==1:\r\n n-=ucln(a,n)\r\n else:\r\n n-= ucln(b,n)\r\n i+=1\r\n\r\nif i%2==1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "def gcd(a, b):\r\n a, b = max(a, b), min(a, b)\r\n if b==0:\r\n return a \r\n while a%b!=0:\r\n a%=b\r\n a, b = b, a\r\n return b\r\na, b, n=map(int, input().split())\r\nx=a\r\nk=0\r\nwhile n>=gcd(x, n):\r\n n-=gcd(x, n)\r\n x=a+b-x\r\n k+=1\r\nprint(1-k%2)\r\n", "a, b, n = map(int, input().split())\r\ndef gcd(x, y):\r\n for i in range(min(x, y), 0, -1):\r\n if x%i==0 and y%i==0:\r\n return i\r\ncount = 0\r\nwhile n > 0:\r\n if count%2==0:\r\n n -= gcd(n, a)\r\n else:\r\n n -= gcd(n, b)\r\n count += 1\r\nprint(1-count%2)\r\n", "import math\n\n(simon, antisimon, heaps) = map(int, input().split(' '))\n\nturns = 0\n\nwhile heaps > 0:\n heaps -= math.gcd(simon, heaps)\n turns += 1\n if heaps > 0:\n heaps -= math.gcd(antisimon, heaps)\n turns += 1\n\n\nif turns % 2 == 0:\n print(1)\nelse:\n print(0)", "X = list(map(int, input().split()))\r\nTurn = 0\r\nwhile X[2] != 0:\r\n Bigest = 1\r\n if Turn == 0:\r\n for i in range(1, min(X[0], X[2]) + 1):\r\n if X[0] % i == 0 and X[2] % i == 0:\r\n Bigest = i\r\n X[2] -= Bigest\r\n else:\r\n for i in range(1, min(X[1], X[2]) + 1):\r\n if X[1] % i == 0 and X[2] % i == 0:\r\n Bigest = i\r\n X[2] -= Bigest\r\n Turn = (1 if Turn == 0 else 0)\r\nprint(1 if Turn == 0 else 0)\r\n", "a, b, n = map(int, input().split())\r\ni = 1\r\nwhile n > 0:\r\n # print('i:', i)\r\n y = n\r\n if i % 2 == 1:\r\n x = a\r\n elif i % 2 == 0:\r\n x = b\r\n # print('x:', x)\r\n while y > 0:\r\n x, y = y, x % y\r\n # print('НОД:', x)\r\n n = n - x\r\n # print('n:', n)\r\n i += 1\r\nif i % 2 == 1:\r\n print(1)\r\nelif i % 2 == 0:\r\n print(0)", "a,b,n = map(int, input().split(' '))\nimport math\nx=1\nwhile x>0:\n if x%2!=0:\n if math.gcd(a,n)<=n:\n n-=(math.gcd(a,n))\n x+=1\n else:\n print('1')\n break\n else:\n if math.gcd(b,n)<=n:\n n-=(math.gcd(b,n))\n x+=1\n else:\n print('0')\n break", "a,b,n = map(int,input().split())\r\n\r\ndef bajanarar1(a,n):\r\n while n>0:\r\n a,n = n,a%n\r\n return a\r\n\r\ndef bajanarar2(b,n):\r\n while n>0:\r\n b,n = n,b%n\r\n return b\r\n\r\nSemen = bajanarar1(a,n)\r\nAntisemen = bajanarar2(b,n)\r\nwhile n>0:\r\n d=1\r\n if n >= bajanarar1(a,n):\r\n n-=bajanarar1(a,n)\r\n d=0\r\n if n >= bajanarar2(b,n):\r\n n-= bajanarar2(b,n)\r\n d=1\r\n else:\r\n break\r\n else:\r\n break\r\nprint(d)", "from sys import stdin\r\n\r\ndef gcd(x, y):\r\n x,y = max(x, y), min(x, y)\r\n if y == 0:\r\n return x\r\n r = x % y\r\n x = y\r\n y = r\r\n return gcd(x, y)\r\n\r\na, b, n = map(int, stdin.readline().split())\r\nheap = n\r\n\r\nwhile True:\r\n cd = gcd(a,heap)\r\n if cd > heap:\r\n print(\"1\")\r\n break\r\n else:\r\n heap -= cd\r\n\r\n cd = gcd(b, heap)\r\n if cd > heap:\r\n print(\"0\")\r\n break\r\n else:\r\n heap -= cd\r\n", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef NOD(x, y):\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef igra(a, b, n):\r\n i = 0\r\n while n > 0:\r\n if i % 2 == 0:\r\n i += 1\r\n n -= NOD(a, n)\r\n else:\r\n i += 1\r\n n -= NOD(b, n)\r\n if i % 2 == 0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nprint(igra(a, b, n))", "import math\r\na,b,n=map(int,input().split())\r\nc=1\r\nwhile True:\r\n if n==0:\r\n if c&1:\r\n print(\"1\")\r\n else:\r\n print(\"0\")\r\n break\r\n if c&1:\r\n n-=math.gcd(a,n)\r\n else:\r\n n-=math.gcd(b,n)\r\n c+=1\r\n \r\n", "import math\n\na, b, n = map(int, input().split())\n\nst = True\nwhile True:\n fn = a if st else b\n r = math.gcd(fn, n)\n\n if r > n:\n res = 1 if st else 0\n break\n\n st = not st\n n -= r\n\nprint(res)\n", "from math import gcd\r\na, b, n = [int(x) for x in input().split()]\r\nturn = 0\r\nwhile(n >= gcd(a,n) and n >= gcd(b,n)):\r\n if (turn % 2 == 0):\r\n turn += 1\r\n n = n - gcd(a,n)\r\n else:\r\n turn += 1\r\n n = n - gcd(b,n)\r\n\r\nif turn % 2 != 0:\r\n print(0)\r\nelse :\r\n print(1)\r\n\r\n\r\n\r\n", "import math\r\n\r\na, b, n = list(map(int, input().split()))\r\n\r\nfor i in range(100):\r\n if i % 2 == 0:\r\n t = math.gcd(a, n)\r\n if n > t:\r\n n -= t\r\n elif n <= t:\r\n print(0)\r\n break\r\n elif i % 2 == 1:\r\n t = math.gcd(b, n)\r\n if n > t:\r\n n -= t\r\n elif n <= t:\r\n print(1)\r\n break", "from math import gcd\r\na, b, n = map(int, input().split())\r\ncnt = 1\r\nwhile 1:\r\n if cnt % 2: g = gcd(a, n)\r\n else: g = gcd(b, n)\r\n n -= g\r\n if n == 0:\r\n if cnt % 2: print(0)\r\n else: print(1)\r\n exit(0)\r\n cnt -= -1", "p=input().split()\r\na=int(p[0])\r\nb=int(p[1])\r\nn=int(p[2])\r\ng=0\r\nh=0\r\ncount=0\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\nwhile n >= 0:\r\n n=n-gcd(a,n)\r\n\r\n \r\n if n<0:\r\n g+=1\r\n break\r\n n=n-gcd(b,n)\r\n if n<0:\r\n h+=1\r\n break\r\n \r\nif (g==1):\r\n\r\n print(\"1\")\r\nelse:\r\n print(\"0\") ", "def max_gys(a,b):\r\n if a<b:\r\n a,b=b,a\r\n c=b\r\n for i in range(b):\r\n c=b-i\r\n if a%c==0 and b%c==0:\r\n break\r\n return c\r\n\r\na,b,n=(input().split())\r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\nj=1\r\nwhile 1:\r\n ca=int(max_gys(a,n))\r\n n=n-ca\r\n if n==0:\r\n j=0\r\n break\r\n if n<0:\r\n break\r\n ca=int(max_gys(b,n))\r\n n=n-ca\r\n if n==0:\r\n j=1\r\n break\r\n if n<0:\r\n j=0\r\n break\r\nprint(j)", "def gcd(a,b):\r\n i=1\r\n ans=0\r\n while(i<=a and i<=b):\r\n if(a%i==0 and b%i==0):\r\n ans=i\r\n i+=1\r\n return ans\r\na,b,n=map(int,input().split())\r\nturn=0\r\nwhile n!=0:\r\n if turn%2==0:\r\n ans=gcd(a,n)\r\n n=n-ans\r\n turn+=1\r\n else:\r\n ans=gcd(b,n)\r\n n=ans-n\r\n turn+=1\r\nif turn%2!=0:\r\n print(0)\r\nelse:\r\n print(1)\r\n ", "import math\r\na,b,n=map(int,input().split())\r\nd=n\r\nr=0\r\np=0\r\nfor i in range(1,n+1):\r\n if d!=0:\r\n if i%2!=0:\r\n s=math.gcd(a,d)\r\n r+=1\r\n else:\r\n s=math.gcd(b,d)\r\n p+=1\r\n d-=s\r\nif r>p:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n \r\n", "def gcd(a,b) :\r\n if a<b :\r\n a,b=b,a\r\n if a*b == 0 :\r\n return a+b\r\n else :\r\n return gcd(b,a%b)\r\na,b,n = (map(int,input().split()))\r\ni = 0\r\nwhile n>0 :\r\n if i%2==0 :\r\n n=n-gcd(a,n)\r\n else :\r\n n=n-gcd(b,n)\r\n i+=1\r\nif i%2==1 :\r\n print(0)\r\nelse :\r\n print(1)", "import math\r\na,b,n=map(int,input().split())\r\n\r\nwhile True:\r\n n-=math.gcd(a,n)\r\n if(n<0): print(1);break\r\n n-=math.gcd(b,n)\r\n if(n<0): print(0);break\r\n", "import math\r\n\r\na , b , n = map(int, input().strip().split(' '))\r\n\r\nans , x = 0 , a\r\nwhile n >= 0:\r\n n -= math.gcd(n, x)\r\n x ^= a^b\r\n ans ^= 1\r\n\r\nprint(ans)", "from math import gcd\r\na, b, n = map(int, input().split())\r\nwhile n > 0:\r\n take = gcd(a,n)\r\n if take <= n:\r\n n -= take\r\n else:\r\n print(1)\r\n break\r\n if n == 0:\r\n print(0)\r\n break\r\n \r\n take = gcd(b,n)\r\n if take <= n:\r\n n -= take\r\n else:\r\n print(0)\r\n break\r\n if n == 0:\r\n print(1)\r\n break", "import math\r\na, b, n = map(int, input().split())\r\nhod = 1\r\n\r\nwhile math.gcd(a, n) > 0 and math.gcd(b, n) > 0 and n > 0:\r\n\tif hod % 2 != 0:\r\n\t\tn -= math.gcd(a, n)\r\n\telse:\r\n\t\tn -= math.gcd(b, n)\r\n\thod += 1\r\nprint('0' if hod % 2 == 0 else '1')", "import math\r\n\r\na, b, n = map(int, input().split())\r\n\r\ns = 0\r\nwhile n >= 0:\r\n if s % 2 == 0:\r\n n -= math.gcd(a, n)\r\n else:\r\n n -= math.gcd(b, n)\r\n s += 1\r\n\r\nif s % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "from math import gcd\r\n# for _ in range(int(input())):\r\na,b,n = map(int,input().split())\r\n# lst1 = list(map(int,input().split()))\r\n# lst2 = list(map(int,input().split()))\r\n# n = int(input())\r\n# arr = list(map(int,input().split()))\r\ncount = 0\r\ntemp = a\r\nwhile (gcd(temp,n)<n):\r\n # print(gcd(temp,n))\r\n n-=gcd(temp,n)\r\n if temp==a:\r\n temp=b\r\n else:\r\n temp=a\r\n count+=1\r\nprint(count%2)", "def GCD(a,b):\r\n if a==0 or b==0:\r\n return a+b\r\n else:\r\n if b>a: \r\n l=a\r\n a=b\r\n b=l\r\n while not b==0:\r\n l=a%b\r\n a=b\r\n b=l\r\n return a\r\nl=[]\r\nl=[int(x) for x in input().split()]\r\nn=l[2]\r\ni=0\r\nwhile True:\r\n d=GCD(l[i],n)\r\n if n<d:\r\n print(1-i)\r\n break\r\n n=n-d\r\n i=1-i", "a,b,n=map(int,input().split())\r\n\r\nN=n\r\n\r\nA=a\r\n\r\nB=b\r\n\r\nx=0\r\n\r\nwhile 0<n:\r\n\r\n while 0<n:\r\n\r\n C=a%n\r\n\r\n a=n\r\n\r\n n=C\r\n\r\n n=N-a\r\n\r\n N=n\r\n\r\n a=A\r\n\r\n x=x+1\r\n\r\n while 0<n:\r\n\r\n C=b%n\r\n\r\n b=n\r\n\r\n n=C\r\n\r\n n=N-b\r\n\r\n N=n\r\n\r\n b=B\r\n\r\n x=x+1\r\n\r\nif x%2==1 or n==0:\r\n\r\n print(1)\r\n\r\nelse:\r\n\r\n print(0)\r\n", "import math\r\n\r\na , b , n = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\n\r\n\r\ndone = False\r\nturn = True\r\n\r\nwhile done == False:\r\n if turn == True :\r\n if math.gcd(int(a) , int(n)) <= n : n -= math.gcd(a , n)\r\n else : done = True\r\n turn = False\r\n else :\r\n if math.gcd(b, n) <= n:\r\n n -= math.gcd(b, n)\r\n else:\r\n done = True\r\n turn = True\r\n\r\nif turn == False : print(\"1\")\r\nelse : print(\"0\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b, H= map(int, input().split())\r\nz=-1\r\nwhile H>0:\r\n count= 0\r\n for i in range(a,0,-1):\r\n if (a%i==0) and(H%i==0) and (count==0) :\r\n count=count +1\r\n H=H-i\r\n if H == 0:\r\n print(0)\r\n z=0\r\n count= 0\r\n for i in range(b,0,-1): \r\n if (b%i==0) and(H%i==0)and count==0:\r\n count=count+1\r\n H=H-i\r\n if H == 0 and z!=0:\r\n print(1)\r\n", "def gcd (x,y):\r\n while x>0 and y>0:\r\n if x%y == 0 and x>y :\r\n gcdxy = y\r\n elif y%x == 0:\r\n gcdxy = x\r\n else:\r\n gcdxy = 1\r\n return gcdxy\r\n return 0\r\ndef epic_game ():\r\n a,b,n = map(int,input().split())\r\n while n > 0:\r\n x1 = gcd(a,n)\r\n n -= x1\r\n if n==0:\r\n print('0')\r\n if n > 0:\r\n x2 = gcd(b,n)\r\n n -= x2\r\n if n==0:\r\n print('1')\r\nepic_game()\r\n", "def gcd(a,b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n\r\n gcd = a + b\r\n return gcd\r\n\r\na, b, n = map(int, input().split())\r\nwhile True:\r\n if n > 0:\r\n n = n - gcd(a, n)\r\n else:\r\n print('1')\r\n break\r\n if n > 0:\r\n n = n - gcd(b, n)\r\n else:\r\n print('0')\r\n break", "a,b,n=map(int,input().split())\r\nf=0\r\ne=True\r\ndef gcd(x, y):\r\n gcd =1\r\n \r\n if x > y:\r\n small = y\r\n else:\r\n small = x\r\n for i in range(1, small + 1):\r\n if((x % i == 0) and (y % i == 0)):\r\n gcd = i\r\n \r\n return gcd\r\nwhile e:\r\n if f==0:\r\n k=gcd(a,n)\r\n if k<=n:\r\n n-=k\r\n f=1\r\n else:\r\n e=False\r\n else:\r\n k=gcd(b,n)\r\n if k<=n:\r\n n-=k\r\n f=0\r\n else:\r\n e=False\r\nif f==1:\r\n print('0')\r\nelse:\r\n print('1')", "import math\r\na, b, n = input().split()\r\na = int(a)\r\nb = int(b)\r\nn = int(n)\r\na_ = 0\r\nb_ = 0\r\nflag = True\r\nwhile flag:\r\n if n >= math.gcd(n, a):\r\n n -= math.gcd(n, a)\r\n else:\r\n a_ += 1\r\n flag = False\r\n if n >= math.gcd(n, b):\r\n n -= math.gcd(n, b)\r\n else:\r\n b_ += 1\r\n flag = False\r\nif a_ == 1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "def gcd(m,n):\r\n r=0\r\n r=m%n\r\n while (r!=0):\r\n m = n\r\n n = r\r\n r=m%n\r\n return n\r\nx,y,n= input().split()\r\nx=int(x)\r\ny=int(y)\r\nn=int(n)\r\nwhile(True):\r\n n-=gcd(x,n)\r\n if (n==0):\r\n print(0)\r\n break\r\n n-=gcd(y,n)\r\n if (n==0):\r\n print(1)\r\n break\r\n \r\n \r\n", "import math\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n x = math.gcd(a, n)\r\n n-=x\r\n if n==0 or n<x:\r\n print(0)\r\n break\r\n y = math.gcd(b, n)\r\n n -= y\r\n if n==0 or n<y:\r\n print(1)\r\n break", "def gcd(x,y):\r\n\tfor i in range(x,0,-1):\r\n\t\tif x%i==0 and y%i==0:\r\n\t\t\treturn i\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n\tif n>=gcd(a,n):\r\n\t\tn-=gcd(a,n)\r\n\telse:\r\n\t\tprint(1)\r\n\t\tbreak\r\n\tif n>=gcd(b,n):\r\n\t\tn-=gcd(b,n)\r\n\telse:\r\n\t\tprint(0)\r\n\t\tbreak", "\"\"\"\r\nProblem:\r\n\r\nplayer loses when num_stones < gcd(a, current_num in stones)\r\n and this happens only when num_stones = 0\r\n\r\ngcd(a, num_stones) <= a and num_stones unless one of the numbers is 0 because 0 is divisible by any number\r\n\r\n\r\nPseudo:\r\n\r\n while()\r\n\r\n\"\"\"\r\nfrom math import gcd\r\n\r\n\r\ndef main():\r\n \"\"\" Some comment \"\"\"\r\n a, b, n = [int(elem) for elem in input().split()]\r\n\r\n a = int(a)\r\n b = int(b)\r\n\r\n num_steps = 0\r\n while(n != 0):\r\n if(num_steps % 2 == 0):\r\n n -= gcd(a, n)\r\n else:\r\n n -= gcd(b, n)\r\n num_steps += 1\r\n print(1) if num_steps % 2 == 0 else print(0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import gcd\r\na, b, n = map(int, input(). split())\r\nans = 0\r\nwhile n > 0:\r\n if n > 0:\r\n ans = 0\r\n n -= gcd(a, n)\r\n if n > 0:\r\n ans = 1\r\n n -= gcd(b, n)\r\nprint(ans)\r\n", "L=input().split(' ')\r\n\r\nn=int(L[0])\r\nm=int(L[1])\r\na=int(L[2])\r\n\r\ndef pgcd(a,b):\r\n if b==0:\r\n return a\r\n if a%b==0:\r\n return b\r\n else:\r\n return pgcd(b,a%b)\r\n\r\nt='s'\r\n\r\nwhile True:\r\n\r\n if t=='s':\r\n x=pgcd(n,a)\r\n if a>=x:\r\n a=a-x\r\n t='a'\r\n else:\r\n print(\"1\")\r\n break\r\n else:\r\n x=pgcd(m,a)\r\n if a>=x:\r\n a=a-x\r\n t='s'\r\n else:\r\n print(\"0\")\r\n break", "from math import gcd\r\na, b, n = map(int, input().split(' '))\r\nans = 0;s = [a, b]\r\n\r\nwhile n >= 0:\r\n if n >= gcd(n, s[ans % 2]):\r\n n -= gcd(n, s[ans % 2])\r\n ans += 1\r\n else:\r\n break\r\nans += 1\r\nprint(ans % 2)\r\n", "import math\r\n\r\na, b, n = map(int, input().split())\r\nturn = 0\r\n\r\nwhile n >= 0:\r\n g = math.gcd(a, n) if turn == 0 else math.gcd(b, n)\r\n\r\n if g > n:\r\n print(1-turn)\r\n break\r\n else:\r\n n -= g\r\n\r\n turn = 1 - turn\r\n", "a, b, n = list(map(int,input().split()))\r\ndef gcd(x, y):\r\n if x > y:\r\n smaller = y\r\n else:\r\n smaller = x\r\n for i in range(1,smaller + 1):\r\n if((x % i == 0) and (y % i == 0)):\r\n hcf = i\r\n return hcf\r\ny = 0\r\nwhile True:\r\n x = gcd(a,n)\r\n n -= x\r\n if n == 0:\r\n break\r\n x = gcd(b,n)\r\n n -= x\r\n if n == 0:\r\n y = 1\r\n break\r\nprint(y)", "\"\"\"\r\nSimon receives number a and Antisimon receives number b\r\nhave a heap of n stones\r\nplayers take turns to make a move and Simon starts.\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#\r\na,b,n = invr()\r\n\r\ni = 1\r\nwhile True:\r\n prev = n\r\n if i % 2 == 1:\r\n n -= math.gcd(n, a)\r\n if(prev == n or n < 0):\r\n print('1')\r\n break\r\n else:\r\n n -= math.gcd(n, b)\r\n if(prev == n or n < 0):\r\n print('0')\r\n break\r\n i += 1\r\n", "def gcd(n,b):\r\n if(b==0):\r\n return n\r\n else:\r\n return gcd(b,n%b)\r\ndef bla():\r\n a,b,n=list(map(int,input().split())) \r\n v=1\r\n while(n>0):\r\n if(v==1):\r\n n=n-gcd(n,a)\r\n v=0\r\n else:\r\n n=n-gcd(n,b)\r\n v=1\r\n if v==0:\r\n print('0') \r\n else:\r\n print(\"1\")\r\nbla() ", "def hcf(x,y):\r\n s = 0\r\n for i in range(1,min(x,y)+1):\r\n if x%i == 0 and y%i == 0:\r\n s = i\r\n return s\r\na,b,n = [int(x) for x in input().split()]\r\nc = 1\r\nd = [a,b]\r\nwhile n>=max(hcf(d[1-c],n),1):\r\n n -= hcf(d[1-c],n)\r\n c = 1-c\r\nprint(c)", "arr = [int(_) for _ in input().split()]\n\n\ndef hcf(a, b):\n if b == 0:\n return a\n else:\n return hcf(b, a % b)\n\nsi = 0\nan = 0\n\nfor i in range(arr[2]):\n if arr[2] > 0:\n if i % 2 == 0:\n arr[2] -= hcf(arr[0], arr[2])\n si += 1\n else:\n arr[2] -= hcf(arr[1], arr[2])\n an += 1\n else:\n break\n\nif si > an:\n print(0)\nelse:\n print(1)\n", "paso = 1\n\ndef dcm(a, b):\n for i in range(a, 0, -1):\n if a % i == 0:\n if b % i == 0:\n return i\n\n\nnumeros = input()\nlis = []\n\nfor i in numeros.split(\" \"):\n lis.append(int(i))\n\na = lis[0]\nb = lis[1]\nn = lis[2]\n\nwhile n > 0:\n if (paso % 2) != 0:\n n -= dcm(a, n)\n if (paso % 2) == 0:\n n -= dcm(b, n)\n paso += 1\n\nif paso % 2:\n print(1)\nelse:\n print(0)", "def gcd(a,b): \r\n \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\na,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nk=0\r\nh=0\r\nwhile(c>=0):\r\n if h==0:\r\n c=c-gcd(a,c)\r\n h=1\r\n k=0\r\n else:\r\n c=c-gcd(b,c)\r\n h=0\r\n k=1\r\nprint(h)\r\n\r\n \r\n", "from math import gcd\r\nsemen, antisemen, stone = list(map(int, input().split()))\r\nx = 0\r\nwhile stone >= 0:\r\n stone -= gcd(semen, stone)\r\n if stone < 0:\r\n x = 1\r\n stone -= gcd(antisemen, stone)\r\nprint(x)", "def k(x,y):\r\n t=1\r\n for i in range(min(x,y),0,-1):\r\n if x%i==0 and y%i==0:\r\n t=i\r\n break\r\n return t\r\na,b,n=map(int,input().split())\r\nl=-1\r\nwhile n>0:\r\n l+=1\r\n if l%2==0:\r\n n-=k(a,n)\r\n else:\r\n n-=k(b,n)\r\nelse:\r\n if l%2==0:\r\n print(0)\r\n else:\r\n print(1)\r\n", "def gcd(a,b):\r\n if(b==0):\r\n return a\r\n return gcd(b,a%b)\r\na,b,n=map(int,input().split())\r\nt=1\r\nwhile(n>-1):\r\n if(t==1):\r\n m=gcd(a,n)\r\n if(n-m<0):\r\n print('1')\r\n break\r\n n-=m\r\n t=0\r\n else:\r\n m=gcd(b,n)\r\n if(n-m<0):\r\n print('0')\r\n break\r\n n-=m\r\n t=1\r\n \r\n", "def gcd(a, b):\r\n if a == 0: return b\r\n if b == 0: return a\r\n return gcd(b % a, a)\r\na, b, n = map(int, input().split())\r\nturn = -1\r\nwhile n > 0:\r\n turn += 1\r\n turn %= 2\r\n if turn == 0: n -= gcd(a, n)\r\n else: n -= gcd(b, n)\r\nprint(turn)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 20 15:31:36 2018\r\n\r\n@author: jinbin\r\n\"\"\"\r\n\r\na,b,n=map(int,input().split())\r\ndef f(a,b):\r\n m=max(a,b)\r\n n=min(a,b)\r\n while n:\r\n m,n=n,m%n\r\n return m\r\ni=0\r\nwhile n>-1:\r\n if i%2==0:\r\n n-=f(a,n)\r\n else:\r\n n-=f(b,n)\r\n i+=1\r\nprint([0,1][i%2==1])", "a, b, c = list(map(int, input().split()))\r\n\r\n\r\ndef nod(q, w):\r\n while w > 0:\r\n u = q % w\r\n q = w\r\n w = u\r\n return q\r\n\r\n\r\nt = 1\r\ncount = 0\r\nwhile c > 0:\r\n t = (t + 1) % 2\r\n if t == 0:\r\n c -= nod(a, c)\r\n else:\r\n c -= nod(b, c)\r\n count += 1\r\n\r\nif count % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)", "import math\r\nL=[int(i) for i in input().split()]\r\nx=0\r\nwhile L[2]>=0:\r\n L[2]-=math.gcd(L[2],L[x])\r\n x=1-x\r\nprint(x)", "def gcd(a1,b1):\r\n k=min(a1,b1)\r\n list1=[]\r\n for i in range(1,k+1):\r\n if(a1%i==0 and b1%i==0):\r\n list1.append(i)\r\n t=max(list1)\r\n return t \r\n \r\na,b,n=map(int ,input().split())\r\nfor d in range(n):\r\n if(d%2==0):\r\n gcd1=gcd(a,n)\r\n if(n<=gcd1):\r\n print(\"0\")\r\n break\r\n n-=gcd1 \r\n \r\n elif(d%2!=0):\r\n gcd2=gcd(b,n)\r\n if(n<=gcd2):\r\n print(\"1\")\r\n break \r\n n-=gcd2 ", "def NOD(a,b):\r\n while b!=0:\r\n a,b=b,a%b\r\n return a\r\n\r\n\r\ndef winner(a,b,s):\r\n while True:\r\n s=s-NOD(a,s)\r\n if s<0:\r\n print(1)\r\n break\r\n s=s-NOD(b,s)\r\n if s<0:\r\n print(0)\r\n break \r\na,b,s=map(int, input().split())\r\nwinner(a,b,s)", "from fractions import gcd\r\na,b,n = map(int,input().split())\r\ni = 0\r\nj = 0\r\nwhile(i==0):\r\n\tif(j%2==0):\r\n\t\tif(n>gcd(n,a)):\r\n\t\t\tn=n-gcd(a,n)\r\n\t\telse:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif(n>gcd(b,n)):\r\n\t\t\tn=n-gcd(b,n)\r\n\t\telse:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak \r\n\tj=j+1", "a, b, n = list(map(int, input().split()))\r\nd, turn = b - a, 0\r\nwhile n:\r\n x, y = a + d * turn, n\r\n while y:\r\n x, y = y, x % y\r\n n -= x\r\n turn = 1 - turn\r\nprint(1 - turn)", "def naibObDel(x, y):\r\n while x != y and y > 0:\r\n if x > y:\r\n x -= y\r\n else:\r\n y -= x\r\n return(y)\r\n\r\na, b, n = map(int, input().split())\r\nsemScore = 0\r\nantisemScore = 0\r\nwhile True:\r\n delitelA = naibObDel(a, n)\r\n if naibObDel(a, n) > 0:\r\n n -= delitelA\r\n semScore += 1\r\n delitelB = naibObDel(b, n)\r\n if naibObDel(b, n) > 0:\r\n n -= delitelB\r\n antisemScore += 1\r\n if n == 0:\r\n break\r\nif semScore > antisemScore:\r\n print(0)\r\nelse:\r\n print(1)", "a, b, n = map(int,input().split())\r\na1 = a\r\nb1 = b\r\nn1 = n\r\nwhile n > 0:\r\n while n > 0:\r\n a, n = n, a % n\r\n n = n1 - a\r\n n1 = n\r\n a = a1\r\n if n1 == 0:\r\n print(0)\r\n while n > 0:\r\n b, n = n, b % n\r\n n = n1 - b\r\n n1 = n\r\n b = b1\r\n if n1 == 0:\r\n print(1)", "def gcd(a,b):\r\n while b:\r\n a,b=b,a%b\r\n return a\r\n \r\na,b,n=map(int,input().split())\r\nflag=0\r\nwhile n>0:\r\n if flag==0:\r\n n=n-gcd(a,n)\r\n flag=1\r\n else:\r\n n=n-gcd(b,n)\r\n flag=0\r\nif flag==0:\r\n print(1)\r\nelse: print(0)", "import math\na, b, n = map(int,input().split())\nwin= 0\nwhile n> 0:\n n -= math.gcd(a,n)\n if n == 0:\n win = 0\n else:\n n -= math.gcd(b,n)\n win = 1\nprint(win)", "a,b,n = map(int,input().split());a1=a;b1=b;n1=n\r\nwhile n1 >= 0:\r\n\r\n while n > 0:\r\n a, n = n, a % n\r\n if n1 - a < 0:\r\n print('1')\r\n break\r\n n1 = n1 - a\r\n n = n1\r\n a = a1\r\n\r\n while n > 0:\r\n b, n = n, b % n\r\n if n1 - b < 0:\r\n print('0')\r\n break\r\n n1 = n1 - b\r\n n = n1\r\n b = b1", "def gcd(a,b):\n\tif min(a,b)==0:\n\t\treturn max(a,b)\n\telse:\n\t\treturn gcd(min(a,b),max(a,b)%min(a,b))\n\nif __name__=='__main__':\n\ta,b,n = [int(x) for x in input().split()]\n\twhile n>=0:\n\t\tif gcd(a,n)>n:\n\t\t\tprint(1)\n\t\t\tbreak\n\t\tn -= gcd(a,n)\n\t\tif gcd(b,n)>n:\n\t\t\tprint(0)\n\t\t\tbreak\n\t\tn -= gcd(b,n)", "import math\r\nans = 0\r\na,b,n = map(int,input().split())\r\nwhile n>=0:\r\n\tif ans == 0:\r\n\t\tn-= math.gcd(a,n)\r\n\t\tans = 1\r\n\telse:\r\n\t\tn-= math.gcd(b,n)\r\n\t\tans =0\t\t\r\nprint(ans)", "def gcd(a, b):\r\n a, b = max(a, b), min(a, b)\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nl = [int(i) for i in input().split()]\r\nt = 0\r\nwhile l[2] > 0:\r\n l[2] -= gcd(l[t], l[2])\r\n t = abs(t - 1)\r\nprint(abs(t - 1))", "a, b, n = map(int, input().split())\r\ngcd, count = 0, 0\r\nwhile gcd <= n:\r\n n -= gcd\r\n count += 1\r\n gcd, param = (a, n) if count % 2 != 0 else (b, n)\r\n while param > 0:\r\n gcd, param = param, gcd % param\r\n\r\n# print(count)\r\nif count % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "'''\nAuthor : knight_byte\nFile : A_Epic_Game.py\nCreated on : 2021-04-19 11:52:51\n'''\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n return gcd(b % a, a)\n\n\ndef main():\n a, b, n = map(int, input().split())\n turn = True\n while True:\n\n if turn:\n g = gcd(a, n)\n if n < g:\n print(1)\n break\n else:\n n -= g\n turn = not turn\n else:\n g = gcd(b, n)\n if n < g:\n print(0)\n break\n else:\n n -= g\n turn = not turn\n\n\nif __name__ == '__main__':\n main()\n", "s=input()\r\nd=[]\r\nd=s.split()\r\nx=int(d[0])\r\ny=int(d[1])\r\nz=int(d[2])\r\n#print(f'{x} {y} {z}')\r\nred=True\r\nj=0\r\ndef gcd(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\nwhile(red):\r\n if(j%2==0):\r\n k=gcd(x,z)\r\n #print(k)\r\n if (k > z):\r\n #print(f'{k} {z} 1')\r\n print(1)\r\n red=False\r\n break\r\n z=z-k\r\n j+=1\r\n #print(f'{k} {z} {j}')\r\n\r\n\r\n else:\r\n k=gcd(y,z)\r\n #print(k)\r\n if (k > z):\r\n #print(f'{k} {z} 1')\r\n print(\"0\")\r\n red=False\r\n break\r\n z=z-k\r\n j+=1\r\n #print(f'{k} {z} {j}')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def computeGCD(x, y):\r\n\twhile(y):\r\n\t x, y = y, x % y\r\n\treturn abs(x)\r\n[a,b,n]=list(map(int,input().split(\" \")))\r\nres=0\r\nwhile n>0:\r\n temp=computeGCD(a,n)\r\n n=n-temp\r\n temp=computeGCD(b,n)\r\n n=n-temp\r\nif n<0:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n", "def check(num1,num2):\r\n while num2 != 0:\r\n tem = num2\r\n num2 = num1%num2\r\n num1 = tem\r\n gcd = num1\r\n return(gcd)\r\n \r\n\r\na,b,n = list(map(int, input().split()))\r\ncount = 0\r\nwhile n>0:\r\n if count%2 == 0:\r\n ans = check(a,n)\r\n n -= ans\r\n else:\r\n ans = check(b,n)\r\n n-= ans\r\n \r\n # print(n)\r\n count+=1\r\n \r\nif count%2 == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n", "a, b, n = (int(i) for i in input().split())\n\ndef gcd(a, b):\n a, b = max(a, b), min(a, b)\n if b == 0:\n return a\n return gcd(b, a - b)\n\nres = 1\nwhile n:\n n -= gcd(a, n)\n a, b = b, a\n res = (res + 1) % 2\nprint(res)\n", "from math import gcd\na, b, n = map(int, input().split())\ni = 1\nwhile True:\n n -= gcd(a if i % 2 == 1 else b, n)\n if n < 0:\n print(i % 2)\n break\n i += 1\n", "a, b, n = map(int, input().split())\r\nc = 1\r\n\r\n\r\ndef bcd(x, y):\r\n while y > 0:\r\n c = x % y\r\n x = y\r\n y = c\r\n return x\r\n\r\n\r\nwhile True:\r\n if c % 2 != 0:\r\n if n - bcd(a, n) < 0:\r\n print(1)\r\n break\r\n else:\r\n n = n - bcd(a, n)\r\n else:\r\n if n - bcd(b, n) < 0:\r\n print(0)\r\n break\r\n else:\r\n n = n - bcd(b, n)\r\n c += 1\r\n", "import math as m\r\n\r\nA, B, N = list(map(int, input().split()))\r\nC = 0\r\nwhile N > 0:\r\n if C % 2 == 0:\r\n X = m.gcd(A, N)\r\n N -= X\r\n else:\r\n X = m.gcd(B, N)\r\n N -= X\r\n C += 1\r\n\r\nif C % 2 == 0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "a,b,n=map(int,input().split())\r\np=0\r\nwhile n>0:\r\n if p%2==0:\r\n for x in range(1,min(a,n)+1):\r\n if a%x==0 and n%x==0:\r\n nod=x \r\n else:\r\n for x in range(1,min(b,n)+1):\r\n if b%x==0 and n%x==0:\r\n nod=x\r\n n=n-nod\r\n p=p+1\r\nprint(1-p%2)", "import math\r\n\r\na, b, n = [int(x) for x in input().split()]\r\n\r\n\r\nwhile n:\r\n simon = math.gcd(a, n)\r\n if n>simon:\r\n n = n-simon\r\n else:\r\n print(0)\r\n break\r\n antisimon = math.gcd(b, n)\r\n if n > antisimon:\r\n n = n-antisimon\r\n else:\r\n print(1)\r\n break", "n=list(map(int,input().split()))\r\ndef gcd(a,b):\r\n if(a==0):\r\n return b\r\n elif(b==0):\r\n return a\r\n else:\r\n if(a<b):\r\n s=b\r\n t=a\r\n else:\r\n s=a\r\n t=b\r\n while(True):\r\n v=t%s\r\n t=s\r\n s=v\r\n if(v==0):\r\n return t\r\n break\r\n if(t==0):\r\n return v\r\n break\r\nwhile(True):\r\n l=gcd(n[0],n[2])\r\n n[2]=n[2]-l\r\n if(n[2]<l and n[2]!=0):\r\n print('1')\r\n break\r\n m=gcd(n[1],n[2])\r\n n[2]=n[2]-m\r\n if(m>n[2] and n[2]!=0):\r\n print('0')\r\n break\r\n\r\n", "a,b,n=tuple(map(int,input().split()))\r\nfrom math import*\r\nc=0\r\nwhile 1:\r\n if c%2==0:\r\n x=gcd(a,n)\r\n if x>=n:\r\n exit(print(0))\r\n else:\r\n n-=x\r\n else:\r\n x=gcd(b,n)\r\n if x>=n:\r\n exit(print(1))\r\n else:\r\n n-=x\r\n c+=1\r\n", "import math\r\n\r\ndef solve(a,b,n):\r\n # even->simon(a)\r\n # odd ->antisiomn(b)\r\n move=0\r\n while(True):\r\n if(move%2==0):\r\n if(n-(math.gcd(a,n))<0):\r\n return 1\r\n n=n-(math.gcd(a,n))\r\n # print(n,'left after simon move')\r\n else:\r\n if(n-(math.gcd(b,n))<0):\r\n return 0\r\n n=n-(math.gcd(b,n))\r\n # print(n,'left after antisimon move')\r\n move+=1\r\n \r\nif __name__=='__main__':\r\n n=input().split(' ')\r\n n=[int(i) for i in n]\r\n print(solve(n[0],n[1],n[2]))\r\n\r\n", "import math\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>=0:\r\n n-=math.gcd(n,(a,b)[i])\r\n i=1-i\r\nprint(i)", "def gcd(a, b):\r\n if (a == 0):\r\n return b\r\n if (b == 0):\r\n return a\r\n if (a == b):\r\n return a\r\n if (a > b):\r\n return gcd(a - b, b)\r\n return gcd(a, b - a)\r\na,b,n=map(int,input().split())\r\ncount=0\r\nwhile n>0:\r\n if count%2==0:\r\n val=gcd(a,n)\r\n count+=1\r\n if n>=val:\r\n n-=val\r\n else:\r\n break\r\n elif count%2==1:\r\n val=gcd(b,n)\r\n count += 1\r\n if n >= val:\r\n n -= val\r\n else:\r\n break\r\nif count%2==1:\r\n print(0)\r\nelse:\r\n print(1)", "def gcd(a,b):\r\n while b%a!=0:\r\n a,b= b%a,a\r\n return a\r\na,b,n= map(int, input().split())\r\np=0\r\nchance= [a,b]\r\nwhile n>gcd(chance[p%2],n):\r\n n-=gcd(chance[p%2],n)\r\n p+=1\r\nif p%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n", "\r\ndef gcd(a,b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\na,b,n = input().split()\r\na = int(a)\r\nb = int(b)\r\nn = int(n)\r\nq = True\r\nwhile n >= 0:\r\n if q is True:\r\n n -= gcd(a,n)\r\n q = False\r\n else:\r\n n -= gcd(b,n)\r\n q = True\r\nif q is True:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n ", "import math\r\na,b,n=map(int,input().split())\r\nt=1\r\nwhile n:\r\n if t:\r\n n-=math.gcd(a,n)\r\n else:\r\n n-=math.gcd(b,n)\r\n t^=1\r\nprint(t)", "import math\r\na,b,n = map(int,input().split())\r\nf =0\r\nwhile n>=0:\r\n\tif f ==0:\r\n\t\tn-=math.gcd(a,n)\r\n\t\tf =1\r\n\telse:\r\n\t\tn-=math.gcd(b,n)\r\n\t\tf =0\t\t\r\nprint(f)\r\n", "import math\r\na,b,n=map(int,input().split())\r\nv=0\r\nwhile(1):\r\n if(n==0):\r\n v=1\r\n break\r\n if(n!=0):\r\n x=math.gcd(a,n)\r\n n=n-x\r\n if(n==0):\r\n v=2\r\n break \r\n if(n!=0):\r\n y=math.gcd(b,n)\r\n n=n-y\r\nif(v==1):\r\n print(\"1\")\r\nif(v==2):\r\n print(\"0\")\r\n ", "def findGCD(a,b):\r\n \r\n if a % b == 0:\r\n \r\n return b\r\n \r\n return findGCD(b, a%b)\r\n\r\na,b,n = map(int, input().split())\r\n\r\nc,v = 0,a\r\n\r\nwhile n > 0:\r\n \r\n x = findGCD(v,n)\r\n \r\n if n >= x:\r\n \r\n n -= x\r\n \r\n else:\r\n \r\n break\r\n \r\n c += 1\r\n \r\n if c % 2 == 1:\r\n \r\n v = b\r\n \r\n else:\r\n \r\n v = a\r\n \r\nif c % 2 == 0:\r\n \r\n print(1)\r\n \r\nelse:\r\n \r\n print(0)", "from math import gcd\r\na,b,n = map(int, input().split())\r\nmov = 1\r\nwhile True:\r\n A = gcd(a,n)\r\n B = gcd(b,n)\r\n if n<A or n<B:\r\n break\r\n if mov%2:\r\n n-=A\r\n mov+=1\r\n else:\r\n n-=B\r\n mov+=1\r\nprint(mov%2)", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef NOK(p, v):\r\n res = p\r\n for i in range(1, v + 1):\r\n nok = i\r\n if v % nok == 0 and p % nok == 0:\r\n res = i\r\n return res\r\n\r\n\r\nwhile True:\r\n n -= NOK(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n n -= NOK(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\n", "a, b, n = map(int,input().split())\r\nx, a1, b1, n1 = 0, a, b, n\r\ni = True\r\nwhile i:\r\n if x == 0:\r\n while a1%n1 != 0:\r\n a1, n1 = n1, a1%n1\r\n n = n-n1\r\n n1 = n\r\n if n1>0:\r\n b1 = b\r\n x = 1\r\n else: i = False\r\n else:\r\n while b1%n1 != 0:\r\n b1, n1 = n1, b1%n1\r\n n = n-n1\r\n n1 = n\r\n if n1>0:\r\n a1 = a\r\n x = 0\r\n else: i = False\r\n \r\n \r\nprint(x)\r\n", "import math\na, b, n = map(int, input().split())\ni = 1\nwhile True:\n\tif i%2 == 1:\n\t\tn-=math.gcd(a, n)\n\telse:\n\t\tn-=math.gcd(b, n)\n\tif n < 0:\n\t\tif i%2 == 1:\n\t\t\tprint(1)\n\t\telse:\n\t\t\tprint(0)\n\t\tbreak\n\ti+=1", "a,b,n = map(int,input().split())\r\n\r\n#Наибольший общий делитель\r\ndef NOD(x,y):\r\n while y != 0:\r\n x,y = y,x%y\r\n return x\r\ndef game(a,b,n):\r\n while True:\r\n n -= NOD(a,n)\r\n if n == 0:\r\n return print('0')\r\n\r\n n -= NOD(b,n)\r\n if n == 0:\r\n return print('1')\r\n\r\ngame(a,b,n)\r\n", "import math\r\na,i,c=input().split(),1,0\r\nheap=int(a[2])\r\nwhile True:\r\n c= math.gcd(int(a[0]) if i%2==1 else int(a[1]),int(heap))\r\n heap = heap -c\r\n if heap <= 0:\r\n print(0 if i % 2 == 1 else 1)\r\n break\r\n i=i+1\r\n\r\n", "def gcd(a,b):\r\n while(b!=0):\r\n a,b=b,a%b\r\n # print(a,b)\r\n return a\r\n#for _ in range(int(input())):'\r\nif 1:\r\n a,b,n=list(map(int,input().split()))\r\n f=0\r\n while(True):\r\n n=n-gcd(a,n)\r\n if n==0:\r\n f=1\r\n break\r\n n=n-gcd(b,n)\r\n if n==0:\r\n break\r\n if f==1:\r\n print(0)\r\n else:\r\n print(1)", "import math\r\na,b,c=(map(int,input().split()))\r\nsi=False\r\nan=False\r\ncount=1\r\nwhile(True):\r\n if count%2==1:\r\n x=math.gcd(a,c)\r\n c-=x\r\n if c==0:\r\n si=True\r\n break\r\n else:\r\n y=math.gcd(b,c)\r\n c-=y\r\n if c==0:\r\n an=True\r\n break\r\n\r\n count+=1\r\nif si==True:\r\n print(0)\r\nif an==True:\r\n print(1)\r\n \r\n \r\n\r\n\r\n ", "import math\r\n\r\na, b, n = map(int, input().split())\r\nz, w = 0, -1\r\nwhile n > 0:\r\n\tif z == 0:\r\n\t\tif math.gcd(a, n) <= n:\r\n\t\t\tn -= math.gcd(a, n)\r\n\t\t\tz = 1\r\n\t\telse:\r\n\t\t\tw = 1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif math.gcd(b, n) <= n:\r\n\t\t\tn -= math.gcd(b, n)\r\n\t\t\tz = 0\r\n\t\telse:\r\n\t\t\tw = 0\r\n\t\t\tbreak\r\n\r\nif n == 0:\r\n\tprint(1 - z)\r\nelse:\r\n\tprint(w)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\n\ndef gcd(a,b):\n\tif a>b:\n\t\tshort=b\n\telse:\n\t\tshort=a\n\tfor x in range(1,short+1,1):\n\t\tif a%x==0 and b%x==0:\n\t\t\tgcd=x\n\treturn gcd\n\nn=input().strip().split()[:3]\na=int(n[0])\nb=int(n[1])\ns=int(n[2])\nx=0\nwhile s>0:\n\tif x%2==0:\n\t\tk=gcd(a,s)\n\t\tif s-k<=0:\n\t\t\tprint(0)\n\t\t\tbreak\n\t\telse:\n\t\t\ts=s-k\n\telse:\n\t\tk=gcd(b,s)\n\t\tif s-k<=0:\n\t\t\tprint(1)\n\t\t\tbreak\n\t\telse:\n\t\t\ts=s-k\n\tx+=1\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "a, b, n = map(int, input().split())\r\n\r\nfrom fractions import gcd\r\n\r\nwhile True:\r\n if n > 0:\r\n n -= gcd(a, n)\r\n else:\r\n print(\"1\")\r\n break\r\n if n > 0:\r\n n -= gcd(b, n)\r\n else:\r\n print(\"0\")\r\n break\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 5 22:18:49 2019\r\n\r\n@author: Yash\r\n\"\"\"\r\nfrom math import gcd\r\na,b,c=map(int,input().split())\r\nwhile(True):\r\n c-=gcd(a,c)\r\n \r\n if(c<0):\r\n print(1)\r\n break\r\n \r\n c-=gcd(b,c)\r\n \r\n if(c<0):\r\n print(0)\r\n break\r\n", "def findGCD(x,y):\r\n while y:\r\n x,y = y, x%y\r\n return abs(x)\r\nc = 0\r\nflag = -1\r\na,b,n = [int(x) for x in input().split()]\r\nwhile True:\r\n if c%2 == 0:\r\n n = n - findGCD(a,n)\r\n c += 1\r\n if n == 0:\r\n flag = 1\r\n break\r\n else:\r\n n = n - findGCD(b,n)\r\n c += 1\r\n if n == 0:\r\n flag = 0\r\n break\r\nif flag == 0 :\r\n print(1)\r\nelse:\r\n print(0)", "def gcd(x,y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\na, b, n = map(int, input().rstrip().split())\r\nres = 0\r\nwhile n > 0:\r\n if res%2 == 0:\r\n n -= gcd(a, n)\r\n else:\r\n n -= gcd(b, n)\r\n res += 1\r\n\r\nif res%2 == 0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "def gcd(a, b):\r\n while b != 0:\r\n (a, b) = (b, a % b)\r\n return a\r\n\r\n\r\na, b, n = [int(i) for i in input().split()]\r\n\r\ni = 0\r\nwhile n:\r\n if i % 2 == 0:\r\n n -= gcd(a, n)\r\n ans = '0'\r\n else:\r\n n -= gcd(b, n)\r\n ans = '1'\r\n i += 1\r\nprint(ans)\r\n", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\n\r\ni = 1\r\n\r\nwhile True :\r\n x = gcd(n, [b, a][(i)%2])\r\n if n >= x :\r\n n -= x\r\n i += 1\r\n else :\r\n break\r\n \r\nprint(i%2)\r\n ", "'''\r\n9,3\r\n3,0\r\n'''\r\nimport math\r\ns,a,n=map(int,input().split())\r\nsimon=True\r\nwhile True:\r\n # print(s,a,n)\r\n if simon:\r\n x = math.gcd(s,n)\r\n if x > n:\r\n print(1)\r\n break\r\n n -= x\r\n else:\r\n x = math.gcd(a,n)\r\n if x > n:\r\n print(0)\r\n break\r\n n -= x\r\n simon=not simon", "a,b,n=list(map(int,input().split()))\r\n\r\n\r\ndef get_fast_nod(l, n):\r\n if l < n:\r\n l, n = n, l\r\n while n != 0:\r\n l, n = n, l % n\r\n return l\r\n\r\nwhile n!=0:\r\n if n==0:\r\n print(\"1\")\r\n break\r\n\r\n else:\r\n get_fast_nod(a, n)\r\n\r\n x=get_fast_nod(a,n)\r\n n=n-x\r\n if n==0:\r\n print(\"0\")\r\n break\r\n else:\r\n\r\n get_fast_nod(b, n)\r\n\r\n y=get_fast_nod(b,n)\r\n n=n-y\r\n if n==0:\r\n print(\"1\")\r\n break", "def gcd(number, n):\r\n if n%number == 0:\r\n return number\r\n r = n%number\r\n n = number\r\n number = r\r\n return gcd(number, n)\r\n\r\na,b,n = map(int, input().split())\r\n\r\nwhile True:\r\n stones_to_be_taken = gcd(a, n)\r\n if stones_to_be_taken > n:\r\n print(\"1\")\r\n break\r\n n = n-stones_to_be_taken\r\n stones_to_be_taken = gcd(b,n)\r\n if stones_to_be_taken > n:\r\n print(\"0\")\r\n break\r\n n = n-stones_to_be_taken\r\n ", "import math\r\na,b,n=[int(w) for w in input().split()]\r\nx=0\r\nwhile n>=0:\r\n if x%2==0:\r\n n=n-math.gcd(a,n)\r\n if n<0:\r\n print(1)\r\n break\r\n elif n==0:\r\n print(0)\r\n break\r\n else:\r\n n=n-math.gcd(b,n)\r\n if n<0:\r\n print(0)\r\n break\r\n elif n==0:\r\n print(1)\r\n break\r\n x+=1", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\narr = [int(i) for i in filter(None, input().split(\" \"))]\r\na = arr[0]\r\nb = arr[1]\r\nsum = arr[2]\r\nwhile sum >=0:\r\n sum -= gcd(sum,a)\r\n if sum<0:\r\n win = '1'\r\n else:\r\n sum-=gcd(sum,b)\r\n if sum<0:\r\n win='0'\r\nprint(win)", "from math import gcd\r\na,b,n=list(map(int,input().split()))\r\nf=0\r\nwhile True:\r\n if f%2==0: \r\n g=gcd(a,n)\r\n if n-g<0:\r\n print(\"1\")\r\n break\r\n n=n-g\r\n else:\r\n g=gcd(b,n)\r\n if n-g<0:\r\n print(\"0\")\r\n break\r\n n=n-g\r\n f=f+1", "def gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return abs(x)\r\n\r\nl=input().split()\r\nl=[int(i) for i in l]\r\nheap=l[2]\r\ni=0\r\nwhile True:\r\n if heap<gcd(l[i],heap):\r\n if i==0:\r\n print(1)\r\n else:\r\n print(0)\r\n break\r\n else:\r\n heap-=gcd(l[i],heap)\r\n if i==0:\r\n i=1 \r\n else:\r\n i=0", "def gcd(x,y):\r\n if x>y:\r\n smaller=y\r\n else: \r\n smaller=x\r\n if x!=0 and y!=0:\r\n for i in range(1,smaller+1):\r\n if y%i==0 and x%i==0:\r\n output=i\r\n else:\r\n pass\r\n else:\r\n output=x+y\r\n return output\r\n\r\na,b,c=map(int,input().split())\r\nturn=0\r\nwhile c>0:\r\n if turn%2==0:\r\n c-=gcd(a,c)\r\n else:\r\n c-=gcd(b,c)\r\n turn+=1\r\n\r\nif turn%2==0:\r\n print('1')\r\nelse:\r\n print('0')\r\n", "import math\na,b,c = map(int,input().split())\nwhile c>0:\n d = math.gcd(a,c)\n c = c-d\n if c ==0: print(0); exit()\n else:\n d = math.gcd(b,c)\n c = c-d\nprint(1)\n \t \t\t\t \t \t \t \t \t\t\t \t \t", "import math\r\na,b,n=map(int,input().split())\r\nans=1\r\nwhile(True):\r\n if(n<math.gcd(a,n) or n<math.gcd(b,n)):\r\n break\r\n if(ans==1):\r\n n-=math.gcd(a,n)\r\n ans=0\r\n else:\r\n n-=math.gcd(b,n)\r\n ans=1\r\n\r\n \r\nprint(ans)", "import math\r\nresult = [int(item) for item in input().split(\" \")]\r\n\r\ni = 2\r\nwhile True:\r\n if i % 2 == 0:\r\n y = math.gcd(result[0], result[2])\r\n if y > result[2]:\r\n print(1)\r\n break\r\n else:\r\n result[2] = result[2] - y\r\n i += 1\r\n else:\r\n y = math.gcd(result[1], result[2])\r\n if y > result[2]:\r\n print(0)\r\n break\r\n else:\r\n result[2] = result[2] - y\r\n i += 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\ndef array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\nn = array(input(), int)\r\na = n[0]\r\nb = n[1]\r\ntotal = n[2]\r\ni = 0\r\n\r\nwhile total > 0:\r\n if i % 2 == 0:\r\n total -= gcd(total, a)\r\n else:\r\n total -= gcd(total, b)\r\n i += 1\r\n # print(total)\r\n\r\nprint((i-1) % 2)\r\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n \r\ndef epicGame(a, b, n):\r\n sTurn = True\r\n while n > 0:\r\n if sTurn:\r\n if gcd(a, n) > n:\r\n return 1\r\n else:\r\n n -= gcd(a, n)\r\n sTurn = False\r\n else:\r\n if gcd(b, n) > n:\r\n return 0\r\n else:\r\n n -= gcd(b, n)\r\n sTurn = True\r\n return 1 if sTurn else 0\r\n \r\na, b, n = map(int, input().split())\r\nprint(epicGame(a, b, 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\na,b,n=map(int,input().split())\r\ni=1\r\nwhile(n>=0):\r\n if(i%2!=0):\r\n c=gcd(a,n)\r\n n=n-c\r\n if(n==0):\r\n print('0')\r\n else:\r\n d=gcd(b,n)\r\n n=n-d\r\n if(n==0):\r\n print('1')\r\n i+=1\r\n", "a,b,n=map(int,input().split())\r\ndef gcd(x,y):\r\n\tmi=min(x,y)\r\n\tmx=max(x,y)\r\n\tgc=1\r\n\tfor i in range(1,mi+1):\r\n\t\tif mi%i==0 and mx%i==0:\r\n\t\t\tgc=i\r\n\treturn gc\r\nwhile(n>0):\r\n\tx=gcd(a,n)\r\n\tif n>=x:\r\n\t\tn-=x\r\n\t\tif n==0:\r\n\t\t\tprint(0)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(1)\r\n\t\tbreak\r\n\ty=gcd(b,n)\r\n\tif n>=y:\r\n\t\tn-=y\r\n\t\tif n==0:\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(0)\r\n\t\tbreak\r\n\t# print(n)", "def gcd(a,b):\r\n if a<b:\r\n smaller=a\r\n else:\r\n smaller=b\r\n for i in range(1,smaller+1):\r\n if a%i==0 and b%i==0:\r\n hcf= i\r\n\r\n return hcf\r\nx, y ,z= input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=int(z)\r\nif 1<=int(x) and int(z)<=100: \r\n while True:\r\n z=z-gcd(x,z)\r\n if z==0:\r\n print(0)\r\n break\r\n z=z-gcd(y,z)\r\n if z==0:\r\n print(1)\r\n break\r\n \r\n ", "a,b,n = [int(i) for i in input().split(' ')]\ntmp = 0\nplay = a\ndef gcd(a,b):\n if a==0:\n return b\n elif b==0:\n return a\n else:\n c = a%b\n return gcd(b,c)\n \nwhile 0<n:\n diff = gcd(play, n)\n if diff >n:\n break\n else:\n n-=diff\n tmp+=1\n if tmp%2==0:\n play = a\n else:\n play = b\ntmp+=1 \nprint(tmp%2)", "import math\r\na,b,n=list(map(int,input().split()))\r\ng=math.gcd(a,n)\r\ncount=0\r\nwhile n>=g:\r\n n-=g\r\n if count%2==0:\r\n g=math.gcd(b,n)\r\n else:\r\n g=math.gcd(a,n)\r\n count+=1\r\nif count%2==0:\r\n print(1)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "a,b,n=map(int,input().split())\r\nfrom math import gcd\r\nk=False\r\nwhile n>0:\r\n n-=gcd(b if k else a ,n)\r\n k=not k\r\nprint(0 if k else 1)", "from math import gcd\r\ndef f(a,b,n):\r\n\tc=c2=0\r\n\twhile(n>0):\r\n\t\tif gcd(a,n)<=n:\r\n\t\t\tn-=gcd(a,n)\r\n\t\t\tc+=1\r\n\t\tif gcd(b,n)<=n:\r\n\t\t\tn-=gcd(b,n)\r\n\t\t\tc2+=1\r\n\tif c>c2:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn 1\r\na,b,n=map(int,input().split())\r\nprint(f(a,b,n))", "from math import gcd\r\na, b, n = map(int, input().split())\r\n\r\nsimon = True\r\nwhile n:\r\n if simon:\r\n temp = gcd(n, a) \r\n if n < temp:\r\n break\r\n n -= temp \r\n simon = False\r\n else:\r\n temp = gcd(n, b)\r\n if n < temp:\r\n break\r\n n -= temp\r\n simon = True\r\n\r\nif simon:\r\n print(1)\r\nelse:\r\n print(0)", "a, b, n = [int(x) for x in input().split()]\r\ncnt, help = b - a, 0\r\nwhile n:\r\n x, y = a + cnt * help, n\r\n while y:\r\n x, y = y, x % y\r\n n -= x\r\n help = 1 - help\r\nprint(1 - help)", "def gcd(a, b):\r\n while a != 0 and b != 0:\r\n if a > b: \r\n a = a % b\r\n else:\r\n b = b % a\r\n return a+b\r\n\r\na, b, n = [int(elem) for elem in input().split()]\r\nturn = 0\r\nwhile n >= 0:\r\n turn += 1\r\n if turn % 2 == 1:\r\n n-=gcd(a, n)\r\n else:\r\n n-=gcd(b, n)\r\nif turn % 2 == 1:\r\n print(1)\r\nelse:\r\n print(0)", "def gcd(a,b):\n\tif b>a:a,b=b,a\n\tif b==0:return a\n\treturn gcd(b,a%b)\n\nimport math\n#for _ in range(int(input())):\nx,y,z=map(int,input().split())\n#n=int(input())\n#l=list(map(int,input().split()))\ntrn=1\nwhile True:\n\tif trn:\n\t\ta=gcd(x,z)\n\t\tif a<=z:z-=a;trn=0\n\t\telse:print(1);break\n\telse:\n\t\tb=gcd(y,z)\n\t\tif b<=z:z-=b;trn=1\n\t\telse:print(0);break\n\t", "a,b,n=map(int,input().split())\r\nm=0\r\no=0\r\nwhile n!=0:\r\n for i in range(1,n+1):\r\n if a%i==0 and n%i==0:\r\n m=i\r\n n=n-m\r\n if n==0:\r\n print('0')\r\n break\r\n for j in range (1,n+1):\r\n if b%j==0 and n%j==0:\r\n o=j\r\n n=n-o\r\n if n==0:\r\n print('1')\r\n break \r\n \r\n", "a,b,n = map(int,input().split())\r\ndef gcd(a,b):\r\n i = min(a,b)\r\n while(i>0):\r\n if a%i==0 and b%i==0:\r\n return i\r\n i-=1\r\n return max(a,b)\r\nfor i in range(100):\r\n n-=gcd(a,n)\r\n if n==0:\r\n print(\"0\")\r\n break\r\n n-=gcd(b,n)\r\n if n==0:\r\n print(\"1\")\r\n break", "import math\r\n\r\na, b, c = map(int, input().split())\r\n\r\ns = 0\r\nwhile c >= 0:\r\n if s % 2 == 0:\r\n c -= math.gcd(a, c)\r\n else:\r\n c -= math.gcd(b, c)\r\n s += 1\r\nif s % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "a,b,c=map(int,input().split())\r\nimport math\r\nn=0\r\nwhile c>0:\r\n c=c-math.gcd(a,c)\r\n a,b=b,a\r\n n+=1\r\nif n%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "from math import gcd\r\nnn=input()\r\nnn=nn.split()\r\na=int(nn[0])\r\nb=int(nn[1])\r\nn=int(nn[2])\r\nm=0\r\ns=0\r\nwhile True:\r\n if m==0:\r\n k=gcd(a,n)\r\n if k>n or n==0:\r\n print(1)\r\n s=1\r\n break\r\n else:\r\n n=n-k\r\n m=1\r\n elif m==1:\r\n k=gcd(b,n)\r\n if k>n or n==0:\r\n print(0)\r\n s=1\r\n break\r\n else:\r\n n=n-k\r\n m=0\r\n elif s==1:\r\n break", "import math\r\ng=0\r\na,b,x=map(int,input().split())\r\nfor i in range(1,x+5):\r\n if i%2==1:\r\n g=math.gcd(a,x)\r\n if g>x:\r\n print('1')\r\n exit()\r\n else:\r\n g=math.gcd(b,x)\r\n if g>x:\r\n print('0')\r\n exit()\r\n x-=g", "def gcd(a,b):\r\n while b:a,b=b,a%b\r\n return a\r\na=list(map(int,input().split()))\r\nb=0\r\nwhile a[2]>=0:\r\n a[2]-=gcd(a[b],a[2])\r\n b=1-b\r\nprint(b)\r\n", "a,b,n=map(int,input().split())\ns=0\nfrom math import gcd\nwhile n>=0:\n x=gcd(a,n)\n n-=x\n\n if n>=0:\n s+=1\n a,b=b,a\nif s%2==0:\n print(1)\nelse:\n print(0)\n\n \n", "import math\r\n\r\na, b, n = map(int, input().split())\r\nans = 0\r\nwhile True:\r\n if ans % 2 == 0:\r\n t = math.gcd(a, n)\r\n ans = ans + 1\r\n n = n - t\r\n else:\r\n t = math.gcd(b, n)\r\n ans = ans + 1\r\n n = n - t\r\n if n==0:\r\n break\r\n '''print(n)\r\n print(ans)'''\r\nif ans%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "*fixed_number, n = map(int, input().split())\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ni = 0\r\nwhile n:\r\n n -= gcd(fixed_number[i % 2], n)\r\n i += 1\r\n\r\nprint(0 if i % 2 else 1)\r\n", "a,b,n = map(int,input().split())\r\ndef gcd(a,b):\r\n while (a!=b):\r\n if (a > b):\r\n a -= b\r\n else:\r\n b -= a\r\n return a\r\ni = 0\r\nans = \"\"\r\nwhile (n > 0):\r\n if (i % 2 == 0):\r\n n -= gcd(a,n)\r\n if (n == 0):\r\n ans = \"0\"\r\n break\r\n else:\r\n n -= gcd(b,n)\r\n if (n == 0):\r\n ans = \"1\"\r\n break\r\n i += 1\r\nprint(ans)", "# Function to find the GCD of given two integers:\r\ndef GCD(n, m) : \r\n for i in range(min(n, m), 0, -1) :\r\n if m % i == 0 and n % i == 0 :\r\n return i\r\n\r\na, b, n = map(int, input().split())\r\n\r\n\r\nwhile True :\r\n \r\n n -= GCD(a, n)\r\n if n == 0 : # Antisimon can't take any more stones from heap so Simon wins.\r\n print('0')\r\n break\r\n\r\n n -= GCD(b, n)\r\n if n == 0 : # Simon can't take any more stones from heap so Antisimon wins.\r\n print('1')\r\n break\r\n", "import math\r\ninput = input()\r\ninput = input.split(\" \")\r\n\r\nsimon = int(input[0])\r\nantisimon = int(input[1])\r\nheap = int(input[2])\r\n\r\nwhile heap>=0:\r\n simon_stones = math.gcd(simon,heap)\r\n heap = heap-simon_stones\r\n if heap<0:\r\n print(1)\r\n else:\r\n antisimon_stones = math.gcd(antisimon,heap)\r\n heap = heap-antisimon_stones\r\n if heap<0:\r\n print(0)\r\n", "def GCD(x, y):\r\n z = x % y\r\n while z != 0:\r\n x = y\r\n y = z\r\n z = x % y\r\n return y\r\nwhile True:\r\n try:\r\n a, b, n = map(int, input().split())\r\n cnt = 0\r\n while n != 0:\r\n if cnt % 2 == 0:\r\n n -= GCD(max(a, n), min(a, n))\r\n cnt += 1\r\n else:\r\n n -= GCD(max(b, n), min(b, n))\r\n cnt += 1\r\n if cnt % 2 != 0:\r\n print(0)\r\n else:\r\n print(1)\r\n except:\r\n break", "import math\r\na,b,n=map(int,input().split())\r\nc=1\r\nwhile 1:\r\n if c%2!=0:\r\n p=math.gcd(a,n)\r\n if p<=n:\r\n n=n-p\r\n c=c+1\r\n else:\r\n break\r\n else:\r\n p=math.gcd(b,n)\r\n if p<=n:\r\n n=n-p\r\n c=c+1\r\n else:\r\n break\r\nif c%2==0:\r\n print(0)\r\nelse:\r\n print(1)", "a,b,n=[int(x) for x in input().split()]\ndef maxdevisior(x,y):\n while x!=y:\n x,y=abs(x-y),min(x,y)\n return x\nd=1\nwhile n>0:\n if d%2!=0:\n n-=maxdevisior(n,a)\n d+=1\n else:\n n-=maxdevisior(n,b)\n d+=1\nif d%2==0:\n print(0)\nif d%2!=0:\n print(1)", "from math import gcd\r\na,b,n = map(int,input().split())\r\n\r\nwhile True:\r\n if n == 0:\r\n print(1)\r\n break\r\n else:\r\n n -= gcd(a,n)\r\n if n ==0:\r\n print(0)\r\n break\r\n else:\r\n n -= gcd(b,n)\r\n", "import math\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile True:\r\n if i%2==0:\r\n d=math.gcd(a,n)\r\n n=n-d\r\n if n==0:\r\n print(\"0\")\r\n break\r\n else:\r\n d=math.gcd(b,n)\r\n n=n-d\r\n if n==0:\r\n print(\"1\")\r\n break\r\n i=i+1\r\n \r\n \r\n ", "isDebug = False\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n\r\n return gcd(b, a % b)\r\n\r\na, b, n = [int(x) for x in input().split()]\r\n\r\n#-------------------------\r\n\r\nsimon = False\r\n\r\nwhile n > 0:\r\n print(f'-------------------------') if isDebug else ''\r\n simon = not simon\r\n r = gcd(a if simon else b, n)\r\n n = n - r\r\n print(f'simon={simon}, r={r}, n={n}') if isDebug else ''\r\n\r\nprint(f'{0 if simon else 1}')\r\n", "import math\n\nif __name__ == \"__main__\":\n a, b, n = tuple(map(int, input().split()))\n turn = 0\n\n while n >= 0:\n if turn == 0:\n n -= math.gcd(a, n)\n turn = 1\n else:\n n -= math.gcd(b, n)\n turn = 0\n\n print(turn)\n", "from math import *\r\na,b,n=map(int,input().split())\r\nt=[]\r\nh=[]\r\nfor i in range(n):\r\n if n>0:\r\n t+=[n]\r\n n-=gcd(a,n)\r\n t+=[n]\r\n n-=gcd(b,n)\r\n t+=[n]\r\nfor l in set(t):\r\n if l<0:\r\n break\r\n else:\r\n h+=[l]\r\nif len(h)%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "from os import stat\r\nimport sys\r\n\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 gcd(a: int, b: int) -> int:\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef solve() -> None:\r\n *d, n = map(int, input().split())\r\n state = 0\r\n g = 0\r\n while g <= n:\r\n n -= g\r\n g = gcd(d[state], n)\r\n state = (state + 1) % 2\r\n print(state)\r\n\r\ndef main() -> None:\r\n # t = int(input())\r\n # for _ in range(t):\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a1 = input().split()\r\na = [int(a1[i]) for i in range(len(a1))]\r\nn = a[0]\r\ndef gcd(a, b):\r\n for i in range(1, 99999999999999999999999999):\r\n if a > b:\r\n a -= b\r\n elif a < b:\r\n b -= a\r\n else:\r\n return a\r\nfor i in range(1, 999999999999999999999999999, 1):\r\n a[2] -= gcd(a[0], a[2])\r\n if a[2] <= 0:\r\n x = 0\r\n break\r\n a[2] -= gcd(a[1], a[2])\r\n if a[2] <= 0:\r\n x = 1\r\n break\r\nprint(x)", "import math \r\na, b, n = map(int, input().split())\r\nok = 0\r\nwhile n > 0:\r\n if ok == 0:\r\n n -= min(n, math.gcd(a, n))\r\n ok = 1\r\n \r\n else:\r\n ok = 0\r\n n -= min(n, math.gcd(b, n))\r\n\r\n\r\nprint([0,1][ok == 0])", "a,b,n=map(int,input().split())\r\nwhile True:\r\n s=min(a,n)\r\n for i in range(s,0,-1):\r\n if a%i==0 and n%i==0:\r\n n-=i\r\n break\r\n if n==0:\r\n print('0')\r\n break\r\n p=min(b,n)\r\n for j in range(p,0,-1):\r\n if b%j==0 and n%j==0:\r\n n-=j\r\n break\r\n if n==0:\r\n print('1')\r\n break", "a,b,n=[int(x) for x in input().split()]\r\ndef gcd(a,b):\r\n if a==0 or b==0:\r\n return(max(a,b))\r\n else:\r\n for i in range(1,min(a,b)+1):\r\n if a%i==0 and b%i==0:\r\n c=i\r\n return c\r\nc=gcd(a,n)\r\ni=0\r\nt=a\r\nif c>n:\r\n print('1')\r\nelse:\r\n while c<=n:\r\n n=n-c\r\n t=a+b-t\r\n c=gcd(t,n)\r\n i=i+1\r\n print((i+1)%2)\r\n", "from math import *\r\nl=list(map(int,input().split()))\r\nn=l[2]\r\ni=0\r\nwhile(n>=0):\r\n n=n-(gcd(l[i%2],n))\r\n i=1-i\r\nprint(i)", "def gcd(a,n):\r\n if(n>0):\r\n while(a%n!=0):\r\n o_a=a\r\n o_n=n\r\n a=o_n\r\n n=o_a%a\r\n return n\r\n\r\n\r\na,b,n = map(int, input().split())\r\ni=1\r\nwhile(n!=0):\r\n if i%2!=0:\r\n n=n-gcd(a,n)\r\n #print(n)\r\n if(n<gcd(b,n) or n==0):\r\n print('0')\r\n break\r\n if i%2==0:\r\n n=n-gcd(b,n)\r\n #print(n)\r\n if(n<gcd(a,n) or n==0):\r\n print('1')\r\n break\r\n i=i+1", "a,b,n = map (int, input ().split ())\r\n\r\nscore_semen = 0 #a\r\nscore_antisemen = 0 #b\r\n\r\nstep = 1\r\n\r\nwhile n > 0:\r\n if step % 2 == 1:\r\n x,y = a,n\r\n while y > 0:\r\n z = x % y\r\n x = y\r\n y = z\r\n # в X будет НОД\r\n if n - x >= 0:\r\n score_semen += 1\r\n n -= x\r\n else:\r\n n -= x\r\n if step % 2 == 0:\r\n x,y = b,n\r\n while y > 0:\r\n z = x % y\r\n x = y\r\n y = z\r\n # в Х будет НОД\r\n if n - x >= 0:\r\n score_antisemen += 1\r\n n -= x\r\n else:\r\n n -= x\r\n step += 1\r\n\r\nif score_semen > score_antisemen:\r\n print (0)\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\r\n\r\n\r\n\r\n\r\n", "import math\r\nwhile True:\r\n try:\r\n a, b, n = map(int, input().split(' '))\r\n s = True\r\n while n > 0:\r\n if s:\r\n n -= math.gcd(a, n)\r\n s = not s\r\n else:\r\n n -= math.gcd(b, n)\r\n s = not s\r\n if s:\r\n print(1)\r\n else:\r\n print(0)\r\n except:\r\n break", "def gcd(a,b):\r\n\twhile(a!=0 and b!=0):\r\n\t\ta,b=b,a%b\r\n\treturn(a)\r\n\r\na,b,n=map(int,input().split())\r\ni=1\r\nwhile(n!=0):\r\n\ti+=1\r\n\tif(i%2==0):\r\n\t\tx=gcd(a,n)\r\n\t\tn=n-x\r\n\telse:\r\n\t\tx=gcd(b,n)\r\n\t\tn-=x\t\t\r\nif(i%2==0):\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "def gcd(p, m):\r\n i = 0\r\n k = []\r\n k.append(p)\r\n k.append(m)\r\n k.sort()\r\n while i < k[1]:\r\n if k[1]%(k[1]-i) == 0 and k[0]%(k[1]-i) == 0:\r\n break\r\n elif k[1] - 1 < 0:\r\n break\r\n i += 1\r\n return (k[1] - i)\r\n\r\n\r\n\r\n\r\na, b, n = input().split()\r\na = int(a)\r\nb = int(b)\r\nn = int(n)\r\nl = []\r\nv = 1\r\nwhile n > gcd(a, n) and n != 0 or n > gcd(b, n) and n != 0:\r\n if v%2 == 0:\r\n n = n - gcd(b, n)\r\n elif v%2 != 0:\r\n n = n - gcd(a, n)\r\n\r\n l.append(n)\r\n\r\n v += 1\r\nif l.count(0) >= 1:\r\n l.remove(0)\r\n\r\nif (len(l)+1)%2 == 0:\r\n print(1)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n", "import math\r\nsimon,anitisimon,n = map(int, input().split(' '))\r\nx = True\r\ni = 0\r\nwhile x:\r\n if i % 2 == 0:\r\n if n >= math.gcd(simon, n):\r\n n -= math.gcd(simon,n)\r\n else:\r\n print(1)\r\n exit()\r\n else:\r\n if n >= math.gcd(anitisimon, n):\r\n n -= math.gcd(anitisimon, n)\r\n else:\r\n print(0)\r\n exit()\r\n i += 1", "a,b,n=map(int,input().split())\r\nstones=n\r\ndef hcf (a,b):\r\n while b>0:\r\n r=a%b\r\n a,b=b,r\r\n return a\r\nsimon=True\r\nwhile stones>=0:\r\n if simon:\r\n simon_hcf=hcf(a,stones)\r\n if simon_hcf>0:\r\n stones-=simon_hcf\r\n if stones<simon_hcf:\r\n print(0)\r\n break\r\n else:\r\n antisimon_hcf=hcf(b,stones)\r\n if antisimon_hcf>0:\r\n stones-=antisimon_hcf\r\n if stones<antisimon_hcf:\r\n print(1)\r\n break\r\n simon= not simon\r\n \r\n\r\n\r\n", "import math\r\na,b,n=map(int,input().split())\r\nans=-1\r\nwhile(True):\r\n if(math.gcd(a,n)<=n): n-=math.gcd(a,n)\r\n else:\r\n ans=1\r\n break\r\n if(math.gcd(b,n)<=n): n-=math.gcd(b,n)\r\n else:\r\n ans=0\r\n break\r\nprint(ans)", "\r\ndef gcd(a,b):\r\n while a!=0 and b!=0:\r\n if a>b:\r\n a=a%b\r\n else:\r\n b=b%a\r\n return a+b\r\n\r\n\r\na,b,n=input().split()\r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\ns=1\r\nwhile n>0:\r\n if s==1:\r\n l=gcd(a,n)\r\n n=n-l\r\n s=s-1\r\n elif s==0:\r\n l=gcd(b,n)\r\n n=n-l\r\n s=s+1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\nwhile n>=0:\r\n d = gcd(a, n)\r\n if d < n:\r\n n -= d\r\n else:\r\n print(0)\r\n break\r\n f = gcd(b, n)\r\n if f < n:\r\n n -= f\r\n else:\r\n print(1)\r\n break", "import math as m\r\n\r\na, b, n=map(int,input().split(\" \"))\r\ni=0\r\nwhile 0<n:\r\n n = n-m.gcd(a,n)\r\n if n==0:\r\n print(0)\r\n n = n-m.gcd(b,n)\r\n if n==0:\r\n print(1)", "m = [int(i) for i in input().rstrip().split()]\r\na, b, n = m[0], m[1], m[2]\r\n\r\ndef gcd(a,b):\r\n if min(a,b)==0: return 0\r\n else:\r\n if (max(a,b) % min(a,b) == 0): return min(a,b)\r\n else: return 1\r\n\r\n\r\ndef epicg(a,b,n):\r\n while n>0:\r\n n-=gcd(a,n)\r\n r=0\r\n if n==0: break\r\n n-=gcd(b,n)\r\n r=1\r\n if n==0: break\r\n \r\n return(r)\r\n\r\n\r\nprint(epicg(a,b,n))", "import math\r\na,b,heap=map(int,input().split())\r\nflag=1\r\nwhile 1:\r\n k=math.gcd(a,heap)\r\n if k>heap:\r\n print(\"1\")\r\n break\r\n else:\r\n heap=heap-k\r\n k=math.gcd(b,heap)\r\n if k>heap:\r\n print(\"0\")\r\n break\r\n else:\r\n heap=heap-k", "a, b, c= map(int, input().split())\r\n# c = int(input())\r\ncount = 0\r\nwhile c != 0:\r\n for i in range(1, min(a, c) + 1):\r\n if (a % i == 0 and c % i == 0):\r\n gcd = i\r\n\r\n c -= gcd\r\n if (c == 0):\r\n print(count)\r\n else:\r\n for i in range(1, min(b, c) + 1):\r\n if (b % i == 0 and c % i == 0):\r\n gcd = i\r\n c -= gcd\r\n if (c == 0):\r\n print(count + 1)\r\n break\r\n", "a, b, n = map(int, input().split())\r\ndef hcf(x, y):\r\n if x == 0 or y == 0:\r\n return max(x, y)\r\n if x == y:\r\n return x\r\n if x > y :\r\n return hcf(y, x-y)\r\n return hcf(x, y-x)\r\nwhile n >= 0:\r\n n -= hcf(a, n)\r\n if n >= 0:\r\n n -= hcf(b, n)\r\n else:\r\n print(1)\r\n break\r\nelse:\r\n print(0)", "from math import gcd\r\n\r\ni=list(map(int,input().split()))\r\n\r\na=i[0]\r\nb=i[1]\r\nn=i[2]\r\ns=0\r\n\r\nwhile n>=0:\r\n if s%2==0:\r\n n-=gcd(n,a)\r\n else:\r\n n-=gcd(n,b)\r\n s+=1\r\nif s%2==0:\r\n print(0)\r\nelse:\r\n print(1)", "from sys import stdin,stdout \r\ninput = stdin.readline\r\nfrom math import gcd\r\n# for _ in range(int(input())):\r\n# a,b = map(int,input().split()) \r\n# if a== b:\r\n# print(0)\r\n# elif b>a:\r\n# if (a-b)%2 == 0:\r\n# print(2)\r\n# else:\r\n# print(1)\r\n# else:\r\n# if (b-a)%2 == 0:\r\n# print(1)\r\n# else:\r\n# print(2) \r\n \r\na,b,n = map(int,input().split())\r\nans = 0\r\nwhile n>= 0:\r\n if ans%2 == 0:\r\n if n == 0:\r\n k = a\r\n else:\r\n k = gcd(a,n)\r\n n -= k\r\n else:\r\n if n == 0:\r\n k = b\r\n else:\r\n k = gcd(b,n)\r\n n-= k\r\n ans += 1\r\n \r\nif ans %2 ==0:\r\n print(0)\r\nelse:\r\n print(1) ", "a,b,n = tuple(map(int,input().split()))\r\n\r\ndef gcd(a,b) :\r\n while(b) :\r\n a,b = b,a%b\r\n return a\r\n\r\nchance = 0\r\nnumberToGet = 0\r\nwinner = 0\r\n\r\nwhile True:\r\n if chance == 0:\r\n chance = 1\r\n numberToGet = gcd(a,n)\r\n if n < numberToGet:\r\n winner = 1\r\n break\r\n else :\r\n n -= numberToGet\r\n else :\r\n chance = 0\r\n numberToGet = gcd(b,n)\r\n if n < numberToGet:\r\n winner = 0\r\n break\r\n else:\r\n n -= numberToGet\r\nprint(winner)", "import math\r\na,b,n=map(int,input().split())\r\nca=\"1\"\r\nwhile n>=0:\r\n if ca==\"1\":\r\n n-=math.gcd(a,n)\r\n if n<0:\r\n print(ca)\r\n break\r\n ca=\"0\"\r\n else:\r\n n-=math.gcd(b,n)\r\n if n<0:\r\n print(ca)\r\n break\r\n ca=\"1\"\r\n \r\n", "from math import gcd\r\na,b,c=map(int,input().split())\r\nx=a\r\ny=c\r\nz=b\r\ng=c\r\ne=0\r\nwhile g>0:\r\n if y<x:\r\n x,y=y,x\r\n gcd(x,y)\r\n if g-gcd(x,y)==0:\r\n print(0)\r\n break\r\n else:\r\n e=g=g-gcd(x,y)\r\n #print(gcd(x, y))\r\n x=a\r\n #print(a,g,\"a\")\r\n while z>0:\r\n if z<e:\r\n e,z=z,e\r\n gcd(e,z)\r\n if g-gcd(e,z)==0:\r\n g=0\r\n print(1)\r\n break\r\n else:\r\n #print(gcd(e, z))\r\n y=g=g-gcd(e,z)\r\n z=b\r\n #print(b,g,\"b\")\r\n break", "def gcd(a,b):\r\n maxi = max(a,b)\r\n mini = a+b-maxi\r\n while maxi%mini!=0:\r\n maxi,mini = mini,maxi%mini\r\n return mini\r\na,b,n = map(int,input().split())\r\ni = 0\r\nwhile n!=0:\r\n if i==0:\r\n n -= gcd(a,n)\r\n i = 1\r\n else:\r\n n -= gcd(b,n)\r\n i = 0\r\nif i==0:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "from math import gcd as g\r\na,b,n=[int(x) for x in input().split()]\r\ni=0\r\nwhile True:\r\n i+=1\r\n if i&1:\r\n lal = g(a,n)\r\n if lal>n:\r\n print(1)\r\n break\r\n n-=lal\r\n else:\r\n lal = g(b,n)\r\n if lal>n:\r\n print(0)\r\n break\r\n n-=lal", "import math\r\na, b, n = [int(i) for i in input().split()]\r\ni = 1\r\nwhile n >= 0:\r\n if i % 2 != 0:\r\n if n - math.gcd(a, n) >= 0:\r\n n -= math.gcd(a, n)\r\n else:\r\n print(\"1\")\r\n break\r\n else:\r\n if n - math.gcd(b, n) >= 0:\r\n n -= math.gcd(b, n)\r\n else:\r\n print(\"0\")\r\n break\r\n i += 1", "import math\n\na,b,n=map(int,input().split())\n\ni=0\nwhile n>0:\n if i%2==0:\n x=math.gcd(a,n)\n else:\n x=math.gcd(b,n)\n n-=x\n i+=1\n# print(i)\nif i%2==1:\n print(0)\nelse:\n print(1)\n \n\n\n# a,b,n=map(int,input().split())\n# if a > n or a + b>n:\n# print(1)\n# else:\n# if n%(a+b)==0:\n# print(1)\n# else:\n# print(0)", "def gcd(x,y):\n while y:\n x, y = y, x%y\n return abs(x)\n\na,b,n = map(int,input().split())\nturn = True\nwhile True:\n if turn:\n g = gcd(a, n)\n n -= g\n else:\n g = gcd(b, n)\n n -= g\n if n<0:\n break\n turn = not turn\n\nprint(int(turn))", "import math\r\na,b,n = map(int,input().split())\r\n\r\ns = 0\r\nwhile n>=0:\r\n if s % 2 == 0:\r\n n -= math.gcd(a,n)\r\n else:\r\n n -= math.gcd(b,n)\r\n s += 1\r\n\r\nif s % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "\r\ndef gcd(a,b):\r\n\r\n\tif(a==0):\r\n\t\treturn b\r\n\r\n\tif(b==0):\r\n\t\treturn a\r\n\r\n\tif(a>b):\r\n\t\treturn gcd(a-b,b)\r\n\r\n\treturn gcd(a,b-a)\r\n\r\nc = 0\r\n\r\na,b,n = map(int,input().split(\" \"))\r\n\r\nwhile(n>0):\r\n\t\r\n\tif(c==0 or c%2==0):\r\n\t\tn -= gcd(a,n)\r\n\r\n\telse:\r\n\t\tn -= gcd(b,n)\r\n\r\n\tc += 1\r\n\r\n\r\nprint(\"0\" if c%2!=0 else \"1\")\r\n\r\n", "a, b, n = map(int, input().split())\n\n\ndef gcd(a, b):\n \"\"\"\n non recursive\n while b:\n a, b = b, a % b\n return a\n \"\"\"\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\nm = n + 1\nfor i in range(m):\n if i % 2 == 0:\n take = gcd(a, n)\n if take > n:\n print(1)\n exit(0)\n else:\n n -= take\n else:\n take = gcd(b, n)\n if take > n:\n print(0)\n exit(0)\n else:\n n -= take", "# Pradnyesh Choudhari\r\n# Sat Jul 18 22:41:03 2020\r\n\r\nfrom math import gcd\r\nf=lambda a,b,n:1-f(b,a,n-gcd(n,a)) if n else 1\r\nprint(f(*map(int,input().split())))\r\n\r\n\r\n\r\n", "a, b, n = map(int, input().split())\nx = n\nfor i in range(n):\n for j in range(a):\n if a%(a-j)==0 and x%(a-j)==0:\n x -= (a-j)\n break\n if x ==0:\n print('0')\n break\n for j in range(b):\n if b%(b-j)==0 and x%(b-j)==0:\n x -=(b-j)\n break\n if x==0:\n print('1')\n break\n", "\r\na, b, n = map(int, input().split())\r\nwhile n > 0:\r\n a1 = a\r\n b1 = b\r\n n1 = n2 = n\r\n if n > 0 and n % a == 0:\r\n n = n - a\r\n if n == 0:\r\n print('0')\r\n elif n > 0 and n % a != 0:\r\n n1 = n\r\n while n1 > 0:\r\n a1, n1 = n1, (a1 % n1)\r\n n = n - a1\r\n if n == 0:\r\n print('0')\r\n if n > 0 and n % b == 0:\r\n n = n - b\r\n if n == 0:\r\n print('1')\r\n elif n > 0 and n % b != 0:\r\n n2 = n\r\n while n2 > 0:\r\n b1, n2 = n2, (b1 % n2)\r\n n = n - b1\r\n if n == 0:\r\n print('1')", "a,b,n=map(int,input().split())\r\ndef gcd(a,b):\r\n if a==0 or b==0:\r\n return max(a,b)\r\n else:\r\n lis=[]\r\n k=min(a,b)\r\n for i in range(1,k+1):\r\n if a%i==0 and b%i==0:\r\n lis.append(i)\r\n return max(lis)\r\ncheck=0\r\nwhile 1:\r\n if check==0:\r\n if n>=gcd(a,n):\r\n n-=gcd(a,n)\r\n check=1\r\n else:\r\n print(1)\r\n break\r\n if check==1:\r\n if n>=gcd(b,n):\r\n n-=gcd(b,n)\r\n check=0\r\n else:\r\n print(0)\r\n break", "import math\r\n\r\na, b, n = list(map(int, input().split()))\r\nres = 1\r\nwhile True:\r\n if res == 1:\r\n n -= math.gcd(n, a)\r\n else:\r\n n -= math.gcd(n, b)\r\n res = 1 - res\r\n if n == 0:\r\n break\r\nprint(res)", "a, b, n = map(int, input().split())\r\ntemp_a = a\r\ntemp_b = b\r\ntemp_n = n\r\nwhile n >= 0:\r\n while temp_n > 0:\r\n temp_a, temp_n = temp_n, temp_a % temp_n\r\n nod_a = temp_a\r\n n -= nod_a\r\n if n < 0:\r\n print('1')\r\n else:\r\n temp_a = a\r\n temp_n = n\r\n while temp_n > 0:\r\n temp_b, temp_n = temp_n, temp_b % temp_n\r\n nod_b = temp_b\r\n n -= nod_b\r\n if n < 0:\r\n print('0')\r\n temp_b = b\r\n temp_n = n", "def gcd(x,y):\r\n while y:\r\n x,y=y,x%y\r\n return x\r\n\r\na,b,n=map(int,input().strip().split(' '))\r\nwhile 1:\r\n n-=gcd(a,n)\r\n if n<0:\r\n print(1)\r\n break\r\n n-=gcd(b,n)\r\n if n<0:\r\n print(0)\r\n break\r\n", "import math\r\na,b,n = map(int,input().split())\r\ncount = 0\r\nwhile True:\r\n if count%2==0:\r\n x = math.gcd(a,n)\r\n if n<x:\r\n print(1)\r\n break\r\n else:\r\n n = n-x\r\n count += 1\r\n else:\r\n x = math.gcd(b,n)\r\n if n<x:\r\n print(0)\r\n break\r\n else:\r\n n = n-x\r\n count += 1\r\n ", "import math\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n n=n-math.gcd(a,n)\r\n if n==0:\r\n print(0)\r\n break\r\n n=n-math.gcd(b,n)\r\n if n==0:\r\n print(1)\r\n break\r\n ", "a,b,n=map(int,input().split())\nk=a #камней у семена 3\nf=b #камней у антисемена 5\ng=n #камней в куче 9\nwhile g>0: #9,5,3\n while n>0: #9,5,3\n a,n=n,a%n #нод=a=3 n=0,a=1,n=0,a=3\n if a>=g:\n print('0')\n break\n n=g #n=9,5\n n=n-a #=6,4\n g=n #6,4\n a=k #3\n while n>0: #6>0,4\n b,n=n,b%n #нод=b=1 n=0, b=1\n if b>=g:\n print('1')\n break\n n=g #6,4\n n=n-b #5,3\n g=n #5,3\n b=f #5\n", "from fractions import gcd \r\na,b,c=list(map(int,input().split()))\r\ni=1\r\nd=1\r\nwhile c>0:\r\n d=d^1\r\n if(d==0):\r\n c=c-gcd(a,c)\r\n else:\r\n c=c-gcd(b,c)\r\nprint(d) \r\n \r\n \r\n ", "def blyaxa(a,b):\n if a==0: return b\n return blyaxa(b%a,a)\n\nabn = list(map(int, input().split(\" \")))\na = abn[0]\nb = abn[1]\nn = abn[2]\nwinner = 1\n\nwhile n>0:\n winner=(winner+1)%2\n if winner==0:\n n-=blyaxa(n,a)\n else:\n n-=blyaxa(n,b)\nprint(winner)\n", "def gcd(a, b):\r\n maxn = max(a,b)\r\n minn = min(a,b)\r\n if minn == 0:\r\n return maxn\r\n if maxn % minn == 0:\r\n return minn\r\n else:\r\n return gcd(minn,maxn % minn)\r\n\r\ndef main():\r\n a,b,n = [int(i) for i in input().split()]\r\n turn = 0\r\n gc = gcd(a,n)\r\n while n-gc >= 0:\r\n n-=gc\r\n if turn == 0:\r\n gc = gcd(b,n)\r\n turn = 1\r\n else:\r\n gc = gcd(a,n)\r\n turn = 0\r\n if turn == 0:\r\n turn =1\r\n else:\r\n turn = 0\r\n print(str(turn))\r\n\r\nmain()\r\n", "import math\r\na,b,n=list(map(int,input().strip().split()))\r\nfor i in range(max(a,b,n)):\r\n t=math.gcd(a,n)\r\n n=n-t\r\n if n<0:\r\n print(\"1\")\r\n break\r\n p=math.gcd(b,n)\r\n n=n-p\r\n if n<0:\r\n print(\"0\")\r\n break\r\n", "from math import gcd\n\n\ndef solve(a, b, n):\n st = True\n while True:\n if st:\n x = gcd(a, n)\n if n >= x:\n n -= x\n st ^= True\n else:\n return 1\n else:\n y = gcd(b, n)\n if n >= y:\n n -= y\n st ^= True\n else:\n return 0\n\n\ndef main():\n a, b, n = list(map(int, input().split()))\n print(solve(a, b, n))\n\n\nmain()\n", "from math import gcd\r\na,b,n=map(int,input().split())\r\ncnt=1\r\nwhile n>0:\r\n if cnt%2 : n-=gcd(a,n)\r\n else : n-=gcd(b,n)\r\n cnt+=1\r\nprint(cnt%2)", "from math import gcd\r\na,b,n=map(int,input().split())\r\nk=False\r\nwhile n>0:\r\n n-=gcd(a,n)\r\n if n<=0:\r\n k=True\r\n \r\n n-=gcd(b,n)\r\nif k:\r\n print(0)\r\nelse:\r\n print(1)", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\n\r\naTall = 0\r\nbTall = 0\r\n\r\nwhile n > 0:\r\n if n > 0:\r\n n -= gcd(a, n)\r\n aTall += 1\r\n if n > 0:\r\n n -= gcd(b, n)\r\n bTall += 1\r\n\r\nprint(0 if aTall > bTall else 1)\r\n", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\nk = 1\r\n\r\nwhile True:\r\n if n == 0:\r\n print(k&1)\r\n break\r\n if k&1:\r\n g = gcd(a, n)\r\n n -= g\r\n else:\r\n g = gcd(b, n)\r\n n -= g\r\n k += 1\r\n", "import math\r\nvvod=input()\r\na=int(vvod.split()[0])\r\nb=int(vvod.split()[1])\r\nn=int(vvod.split()[2])\r\nwhile True:\r\n n=n-math.gcd(a,n)\r\n if n<math.gcd(b,n):\r\n print(0)\r\n break\r\n n=n-math.gcd(b,n)\r\n if n<math.gcd(a,n):\r\n print(1)\r\n break\r\n", "a, b, n = map ( int, input ().split () )\r\na1 = a * 1\r\nb1 = b * 1\r\nn1 = n * 1\r\nf = 0\r\nwhile n != 0 :\r\n\twhile a1 > 0 and n != 0 :\r\n\t\tn1, a1 = a1, n1 % a1 \r\n\tn = n - n1\r\n\tif n == 0 and f != 1 :\r\n\t\tf = 1\r\n\t\tprint ( 0 )\t\r\n\ta1 = a * 1\r\n\tn1 = n * 1\r\n\twhile b1 > 0 and n != 0 :\r\n\t\tn1, b1 = b1, n1 % b1 \r\n\tn = n - n1\r\n\tif n == 0 and f != 1 :\r\n\t\tf = 1\r\n\t\tprint ( 1 )\r\n\tb1 = b * 1\r\n\tn1 = n * 1", "from fractions import gcd\r\na, b, n = map(int, input().split())\r\nwhile n :\r\n if n > gcd(a, n) :\r\n n -= gcd(a, n)\r\n if n > gcd(b, n) :\r\n n -= gcd(b, n)\r\n elif n == gcd(b, n) :\r\n print(1)\r\n break\r\n else :\r\n print(0)\r\n break\r\n elif n == gcd(a, n) :\r\n print(0)\r\n break\r\n else :\r\n print(1)\r\n break\r\n\r\n", "a,b,n=map(int,input().split())\r\na1,b1,n1=a,b,n\r\n\r\nwhile n1>=0: \r\n \r\n while n>0:\r\n a,n=n,a%n\r\n if n1-a<0:\r\n print('1')\r\n break\r\n n1=n1-a\r\n n=n1\r\n a=a1\r\n\r\n\r\n while n>0:\r\n b,n=n,b%n\r\n if n1-b<0:\r\n print('0')\r\n break\r\n n1=n1-b\r\n n=n1\r\n b=b1\r\n", "import sys\r\nimport math\r\na, b, c = map(int, sys.stdin.readline().split())\r\nsimon = True\r\nwhile (c >= 0):\r\n if (simon):\r\n c -= math.gcd(a, c)\r\n else:\r\n c -= math.gcd(b, c)\r\n simon = not simon\r\nif (simon):\r\n print(0)\r\nelse:\r\n print(1)\r\n", "a,b,n=map(int,input().split())\r\n\r\n\r\ndef nod(x,y):\r\n while y>0:\r\n x,y=y,x%y\r\n return(x)\r\n\r\n\r\nwhile n>=0:\r\n n=n-nod(a,n)\r\n if n<0:\r\n print('1')\r\n break\r\n else:\r\n n=n-nod(b,n)\r\n if n<0:\r\n print('0')\r\n break", "a,b,n=map(int,input().split());t=0\r\nimport math\r\nwhile n>=0:\r\n n-=math.gcd([a,b][t%2],n)\r\n t=1-t\r\nprint(t)\r\n#两个正整数a,b\r\n#n块石头，每次拿走gcd(a,b)块\r\n\r\n", "from math import gcd\n\na, b, n = map(int, input().split())\n\nremaining_stones = n\nsimons_turn = True\nfor i in range(n):\n if simons_turn:\n stones_to_remove = gcd(a, remaining_stones)\n else:\n stones_to_remove = gcd(b, remaining_stones)\n\n if stones_to_remove > remaining_stones:\n break\n\n # print('Simons turn: {}, Remaining stones: {}, Num stones to remove: {}'\n # .format(simons_turn, remaining_stones, stones_to_remove))\n remaining_stones -= stones_to_remove\n simons_turn = not simons_turn\n\nprint(1 if simons_turn else 0)\n", "def find_gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\na,b,n = [int(i) for i in input().split()]\r\n\r\ng = 0\r\n\r\nwhile n > 0:\r\n n = n - find_gcd(a,n)\r\n if n == 0:\r\n print(\"0\")\r\n n = n - find_gcd(b,n)\r\n if n == 0:\r\n print(\"1\")\r\n\r\n\r\n", "a,b,n=map(int,(input().split()))\r\n\r\ndef comp(x,y):\r\n temp1 = x\r\n temp2 = y\r\n x = max(temp1, temp2)\r\n y = min(temp1, temp2)\r\n return x,y\r\ndef nod(x,y):\r\n x1,y1=comp(x,y)\r\n while (x1%y1!=0):\r\n x1,y1=comp(x1%y1,y1)\r\n return y1\r\nwhile 1:\r\n if n==0:\r\n print(1)\r\n break\r\n n=n-nod(a,n)\r\n if n==0:\r\n print(0)\r\n break\r\n n=n-nod(b,n)\r\n# x,y=comp(12,8)\r\n# print(x,y)\r\n# print(nod(x,y))\r\n\r\n", "a,b,n=map(int,input().split())\r\nc=0\r\nimport math\r\nwhile n>0:\r\n\tif c==0:\r\n\t\ty=math.gcd(a,n)\r\n\t\tn=n-y\r\n\t\tc=1\r\n\telif c==1:\r\n\t\ty=math.gcd(b,n)\r\n\t\tn-=y\r\n\t\tc=0\r\nif c==1:\r\n\tprint(0)\r\nelif c==0:\r\n\tprint(1)", "# Recursive function to return gcd of a and b\r\ndef gcd(a,b):\r\n \r\n \r\n if (b == 0):\r\n return a\r\n return gcd(b, a%b)\r\n\r\na, b ,n = [int(x) for x in input().split()]\r\n\r\nwhile True:\r\n p = gcd(a,n)\r\n n = n-p\r\n if n == 0:\r\n print(0)\r\n exit()\r\n q = gcd(b,n)\r\n n = n-q\r\n if n == 0:\r\n print(1)\r\n exit()", "from fractions import gcd\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i&1==0:\r\n n-=gcd(n,a)\r\n if n<0:\r\n print(\"1\")\r\n elif n==0:\r\n print(\"0\")\r\n else:\r\n n-=gcd(n,b)\r\n if n<0:\r\n print(\"0\")\r\n elif n==0:\r\n print(\"1\")\r\n i+=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", "import sys\nimport math\ninput = sys.stdin.readline\n\ndef int_array():\n\treturn list(map(int, input().split()))\n\ndef str_array():\n\treturn list(map(str, input().split()))\n\ndef gcd(a, b): \n if a == 0 : \n return b \n \n return gcd(b%a, a) \n\na,b,s = int_array()\ncount = 0\n\nwhile True:\n\tif count % 2 == 0 and s-gcd(a,s) > 0:\n\t\ts -= gcd(a,s)\n\telif count % 2 != 0 and s-gcd(b,s) > 0:\n\t\ts -= gcd(b,s)\n\telse:\n\t\tbreak\n\tcount += 1\n\nprint(count%2)", "a, b, c = map(int, input().split())\r\nrun = True\r\nwhile run:\r\n a0, c0 = a, c\r\n while c0 > 0:\r\n a0, c0 = c0, a0 % c0\r\n c = c - a0\r\n if c < 0:\r\n print(1)\r\n run = False\r\n else:\r\n b1, c1 = b, c\r\n while c1 > 0:\r\n b1, c1 = c1, b1 % c1\r\n c = c - b1\r\n if c < 0:\r\n print(0)\r\n run = False\r\n\r\n", "def gcd(a, b):\r\n small = a if a < b else b\r\n for i in range(small, 0, -1):\r\n if a % i == 0 and b % i == 0:\r\n return i\r\n\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n i = 0\r\n while n > 0:\r\n if i % 2 == 0:\r\n var1 = gcd(a, n)\r\n n -= var1\r\n else:\r\n var2 = gcd(b, n)\r\n n -= var2\r\n i = (i + 1) % 2\r\n\r\n print([1, 0][i])\r\n\r\n\r\nmain()\r\n", "def turn(a, n):\r\n m = 1\r\n for i in range(1, n + 1):\r\n for j in range(1, a + 1):\r\n if n % i == 0 and a % i == 0:\r\n m = i\r\n return n - m\r\n\r\n\r\nsem, anti, n = map(int, input().split())\r\nt = 0\r\nwhile True:\r\n if t % 2 == 0:\r\n n = turn(sem, n)\r\n if n < 0:\r\n print(1)\r\n break\r\n else:\r\n n = turn(anti, n)\r\n if n < 0:\r\n print(0)\r\n break\r\n t += 1\r\n", "def get_gcd(a, b) :\r\n if(a == 0 or b == 0) :\r\n return 0\r\n l = []\r\n for i in range(1, b+1) :\r\n if(a%i == 0 and b%i == 0) :\r\n l.append(i)\r\n r = max(l)\r\n return r\r\ndef get_decision(a, b, n) :\r\n while(n != 0) :\r\n l = get_gcd(a, n) \r\n if(l <= n) :\r\n n = n-l\r\n if(n == 0) :\r\n return 0\r\n else :\r\n return 1\r\n t = get_gcd(b, n)\r\n if(t <= n) :\r\n n = n - t\r\n if(n == 0) : \r\n return 1\r\n else :\r\n return 0\r\na, b, n = map(int, input().split(\" \"))\r\nprint(get_decision(a, b, n))", "a,b,n=input().split(\" \")\r\nimport math \r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\nturn=0\r\ngame=True\r\nwhile game==True:\r\n \r\n if turn==0:\r\n \r\n if n>=math.gcd(a,n):\r\n n=n-math.gcd(a,n)\r\n turn=1-turn\r\n else:\r\n print(1-turn)\r\n game=False\r\n \r\n else:\r\n if n>=math.gcd(b,n):\r\n n=n-math.gcd(b,n)\r\n turn=1-turn\r\n else:\r\n print(1-turn)\r\n game=False\r\n ", "import math\r\n*a,n=map(int,input().split())\r\ni=0\r\nwhile(n>=0):\r\n n=n-math.gcd(a[i%2],n)\r\n i=1-i\r\nprint(i)\r\n\r\n \r\n", "\r\nimport math\r\n\r\na ,b , n = map(int,input().split())\r\nk = 0\r\n\r\nwhile n > 0 :\r\n\r\n if k % 2 == 0 :\r\n\r\n n -= math.gcd(a , n)\r\n\r\n else:\r\n\r\n n -= math.gcd(b , n)\r\n\r\n k +=1\r\n\r\n\r\n#print(k)\r\nif k % 2 == 0 :\r\n print('1')\r\n\r\nelse:\r\n print('0')", "a, b, n = map(int, input().split())\r\nc, d, n1 = a, b, n\r\nwhile True: # poka kamnei >\r\n while n>0:\r\n a, n = n, a%n\r\n n1 = n1 - a\r\n n = n1\r\n a = c\r\n if n <=0:\r\n print('0')\r\n break\r\n while n>0:\r\n b, n = n, b%n\r\n n1 = n1 - b\r\n b = d\r\n n = n1\r\n\r\n if n<=0:\r\n print('1')\r\n break\r\n", "def gcd(a,b):\r\n while a != 0 and b != 0:\r\n if a > b: a %= b\r\n else: b %= a\r\n return (a+b)\r\na,b,n = map(int,input().split())\r\ni = 0\r\nwhile n >= 0:\r\n n = n - gcd(n, [a,b][i])\r\n i = 1 - i\r\nprint(i)", "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 solve(a,b,n):\r\n turn=0\r\n while True:\r\n if turn%2==0:\r\n toPick=gcd(a,n)\r\n if n>=toPick:\r\n n-=toPick\r\n else:\r\n return 1 \r\n else:\r\n toPick=gcd(b,n)\r\n if n>=toPick:\r\n n-=toPick\r\n else:\r\n return 0 \r\n turn+=1\r\n\r\n\r\na,b,n=map(int,input().split())\r\nprint(solve(a,b,n))", "a,b,n=map (int, input().split())\r\nchk=2\r\ndef gcd(v1,v2):\r\n while v1>0 and v2>0:\r\n if v1 % v2 == 0 and v1>v2:gcdx = v2;\r\n elif v2 % v1 == 0:gcdx = v1;\r\n else:gcdx = 1;\r\n return gcdx\r\n return 0\r\nwhile n>0:\r\n for i in range(1):\r\n x1=gcd(a,n)\r\n n-=x1\r\n if n<a:\r\n chk=0\r\n for j in range(1):\r\n if n>0:\r\n x2 = gcd(b, n)\r\n n -= x2\r\n if n < b:\r\n chk = 1\r\nprint(chk)", "i = list(map(int,input().split()))\r\n\r\nR=i[2]\r\n\r\n\r\n\r\ndef gc(n1,n2):\r\n r=1\r\n c=1\r\n while 1:\r\n r=n2%n1\r\n if r!=0:\r\n c=r\r\n n2,n1=n1,r\r\n else:\r\n c=n1\r\n break\r\n \r\n return(c)\r\n \r\n\r\nwhile R!=0:\r\n if R!=0:\r\n s=gc(i[0],R)\r\n R=R-s\r\n n='0'\r\n\r\n \r\n if R!=0:\r\n s=gc(i[1],R)\r\n R=R-s\r\n n='1'\r\n\r\n \r\n \r\nprint(n)", "import math\r\nlist_input = list(str(input()).split(' '))\r\na = int(list_input[0])\r\nb = int(list_input[1])\r\nn = int(list_input[2])\r\nc = 0\r\ncondition = True\r\nwhile condition == True:\r\n if c == 0 and n >= math.gcd(n, a):\r\n n -= math.gcd(n, a)\r\n c = 1\r\n elif c == 1 and n >= math.gcd(n, b):\r\n n -= math.gcd(n, b)\r\n c = 0\r\n else: break\r\nprint({True: 0, False: 1}[c == 1])", "a, b, n = map(int, input().split())\r\nc = 0\r\ndef compute_hcf(x, y):\r\n hcf = 1\r\n for i in range(1, min(x,y)+1):\r\n if((x % i == 0) and (y % i == 0)):\r\n hcf = i\r\n return hcf\r\n\r\nwhile(True):\r\n if(c%2==0):\r\n gcd = compute_hcf(a,n)\r\n if(n<gcd):\r\n print(1)\r\n break\r\n n-=gcd\r\n else:\r\n gcd = compute_hcf(b,n)\r\n if(n<gcd):\r\n print(0)\r\n break\r\n n-=gcd\r\n c+=1\r\n\r\n\r\n", "from math import gcd\r\ndef solN():\r\n a,b,n=map(int,input().split())\r\n i=0\r\n while True:\r\n if i%2==0:\r\n if n==0:k=a\r\n elif abs(n-a)==1:k=1\r\n elif n==a:k=n\r\n else:k=gcd(a,n)\r\n if k>n:print(1);return\r\n else:n-=k;i+=1\r\n else:\r\n if n==0:k=b\r\n elif abs(n-b)==1:k=1\r\n elif n==b:k=n\r\n else:k=gcd(b,n)\r\n if k>n:print(0);return\r\n else:n-=k;i+=1\r\ndef main():\r\n solN()\r\nif __name__ == '__main__':\r\n main()", "from math import gcd\r\ndef solve():\r\n a = list(map(int,input().split()))\r\n w = 1\r\n while a[2]:\r\n a[2] -= gcd(a[1-w],a[2])\r\n w = 1 - w\r\n return w\r\nprint(solve())", "import math\r\n*a,n=map(int,input().split())\r\nf=0\r\nwhile(n>=0):\r\n\tn-=math.gcd(a[f],n)\r\n\tf=1-f\r\nprint(f)\r\n", "from math import gcd\r\na,b,n = [int(x) for x in input().split()]\r\n\r\nwhile True:\r\n n = n-(gcd(a,n))\r\n if n<0:\r\n print(1)\r\n break\r\n n = n -(gcd(b,n))\r\n if n<0:\r\n print(0)\r\n break", "import math\r\ndef main():\r\n a,b,n = list(map(int,input().split()))\r\n\r\n current = 1\r\n next = 0\r\n value = {1:a,0:b}\r\n while n > 0:\r\n # print(n)\r\n n -= math.gcd(value[current],n) \r\n current,next = next, current\r\n\r\n print(current)\r\n \r\nmain()", "def func1(x, y):\r\n o = []\r\n p = []\r\n c = []\r\n for i in range(x):\r\n if x % (i+1) == 0:\r\n o.append(i+1)\r\n for i in range(y):\r\n if y % (i+1) == 0:\r\n p.append(i+1)\r\n for i in o:\r\n if i in p:\r\n c.append(i)\r\n return max(c)\r\n\r\n\r\na, b, n = map(int, input().split())\r\nwhile n > 0:\r\n n = n - func1(a, n)\r\n if n <= 0:\r\n print('0')\r\n break\r\n n = n - func1(b, n)\r\n if n <= 0:\r\n print('1')\r\n break", "import math\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\na = list1[0]\r\nb = list1[1]\r\nn = list1[-1]\r\nb1 = False\r\nwhile b1==False:\r\n gcd1 = math.gcd(a,n)\r\n if n==0:\r\n print(1)\r\n break\r\n else:\r\n n = n - gcd1\r\n gcd2 = math.gcd(b,n)\r\n if n ==0:\r\n print(0)\r\n break\r\n else:\r\n n = n -gcd2\r\n ", "def get_NOD(a,b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a + b\r\n\r\ndef main() -> None:\r\n a,b,c = map(int,input().split())\r\n s = 0\r\n while True:\r\n if s == 0:\r\n g = a\r\n s = 1\r\n else:\r\n g = b\r\n s = 0\r\n f = get_NOD(g,c)\r\n if f <= c:\r\n c -= f\r\n else:\r\n print(s)\r\n # if s == 0:\r\n # print(1)\r\n # else:\r\n # print(0)\r\n break\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def factor(num):\r\n l1 = []\r\n for i in range(1, num+1):\r\n if num % i == 0:\r\n l1.append(i)\r\n return l1\r\n\r\n\r\ndef GCD(p, q):\r\n l1 = factor(p)\r\n l2 = factor(q)\r\n gcd = -1000\r\n for i in l1:\r\n for j in l2:\r\n if i == j:\r\n gcd = i\r\n return gcd\r\n\r\n\r\na, b, n = map(int, input().split())\r\nwhile(n != 1000):\r\n if(n == GCD(a, n)):\r\n print('0')\r\n break\r\n else:\r\n\r\n n -= GCD(a, n)\r\n if(n == GCD(b, n)):\r\n print('1')\r\n break\r\n else:\r\n\r\n n -= GCD(b, n)", "def gcd(first_number, second_number):\n range_counter = first_number if first_number < second_number and 0 else second_number\n if first_number == 0 or second_number == 0:\n return abs(first_number + second_number)\n for i in range(range_counter, 0, -1):\n if first_number % i == 0 == second_number % i:\n return i\n\n\nif __name__ == \"__main__\":\n simons_number, antisimons_number, total_stones = list(map(int, input().strip().split()))[:3]\n i = 1\n while True:\n if i % 2 == 1:\n stones_taken = gcd(simons_number, total_stones)\n if total_stones >= stones_taken:\n total_stones -= stones_taken\n else:\n print(1)\n break\n else:\n stones_taken = gcd(antisimons_number, total_stones)\n if total_stones >= stones_taken:\n total_stones -= stones_taken\n else:\n print(0)\n break\n i += 1\n\n\n\n \t \t\t\t\t\t \t\t \t\t\t \t \t\t\t \t\t\t", "def anton(a,b,n):\r\n import math\r\n c=0\r\n while(n!=0):\r\n if c%2==0:\r\n n-=math.gcd(a,n)\r\n if n<0:\r\n return 1\r\n else:\r\n n-=math.gcd(b,n)\r\n if n<0:\r\n return 0\r\n c+=1\r\n return (c-1)%2\r\n\r\n\r\na,b,n=map(int,input().split())\r\nimport math\r\nprint(anton(a,b,n))", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n \r\n return gcd(b % a, a)\r\n\r\na, b,n = map(int,input().split(\" \"))\r\n\r\nwhile True:\r\n n -= gcd(a, n)\r\n if n < 0:\r\n print(\"1\")\r\n break\r\n \r\n n -= gcd(b,n)\r\n if n < 0:\r\n print(\"0\")\r\n break", "from math import gcd\r\na, b, n=map(int, input().split())\r\nl=[a, b]\r\nwinner=0\r\nwhile n>gcd(l[winner], n):\r\n\tn-=gcd(l[winner], n)\r\n\twinner=(winner+1)%2\r\nif winner==0:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "import math\n\na,b,n = [int(i) for i in input().split()]\n\nchance = 0\n\nwhile n>=0:\n\n if chance == 1:\n\n n -= math.gcd(n,b)\n chance = 0\n\n else:\n\n n -= math.gcd(n,a)\n chance = 1\n\n #print (chance)\n\nprint (chance)\n", "def euc(x, y):\r\n\tif y == 0: return x\r\n\treturn euc(y, x%y)\r\n\r\nA, B, N = map(int, input().split())\r\nnumbers = [A, B]\r\nindex = 0\r\nwhile True:\r\n\tN -= euc(N, numbers[index%2])\r\n\tif N < 0:\r\n\t\tprint((index+1)%2)\r\n\t\tbreak\r\n\tindex += 1", "from math import gcd\r\nb,c,a = map(int,input().split())\r\ni = 0\r\nwhile True:\r\n if i % 2 == 0:\r\n d = gcd(b, a)\r\n if d > a:\r\n print(\"1\")\r\n break\r\n else:a -= d\r\n else:\r\n d = gcd(c, a)\r\n if d > a:\r\n print(\"0\")\r\n break\r\n else:a -= d\r\n i+=1", "from math import gcd\r\na,b,n=map(int,input().split())\r\ns=0\r\nan=0\r\nflag=0\r\nwhile n>0:\r\n if flag==0:\r\n n=n-gcd(a,n)\r\n s=s+1\r\n flag=1\r\n else:\r\n n=n-gcd(b,n)\r\n an+=1\r\n flag=0\r\n#print(s,an)\r\nif s>an:\r\n print(0)\r\nelse:\r\n print(1)", "def gcd(a,b):\r\n if a<b:\r\n a,b=b,a\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\na,b,n=map(int,input().split())\r\nwhile 1:\r\n n=n-gcd(a,n)\r\n if n<1:\r\n print(0)\r\n break\r\n n=n-gcd(b,n)\r\n if n<1:\r\n print(1)\r\n break", "def bigdelitel(num1, num2):\r\n for i in range(min(num1, num2, ), -1, -1):\r\n if i == 0:\r\n return max(num1, num2)\r\n if num2 % i == 0 and num1 % i == 0:\r\n return i\r\n\r\n\r\ndef main():\r\n a, b, n = list(map(int, input().split()))\r\n step = 0\r\n while n > 0:\r\n if step == 0:\r\n n -= bigdelitel(a, n)\r\n else:\r\n n -= bigdelitel(b, n)\r\n if step == 0:\r\n step = 1\r\n else:\r\n step = 0\r\n if step == 0:\r\n print(1)\r\n else:\r\n print(0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def nOd(x, y):\n while y > 0:\n x, y = y, x % y\n return x\n\n\na, b, n = map(int, input().split())\nwhile n > 0:\n if nOd(a, n)==n:\n print('0')\n break\n n=n-nOd(a, n)\n if nOd(b,n)==n:\n print('1')\n break\n n=n-nOd(b,n)\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\nwhile True:\r\n A = gcd(a, n)\r\n if n >= A:\r\n n -= A\r\n else:\r\n print(1)\r\n break\r\n B = gcd(b, n)\r\n if n >= B:\r\n n -= B\r\n else:\r\n print(0)\r\n break", "from fractions import gcd\r\na, b, n = map(int, input().split())\r\ni = 0\r\nwhile n >= 0:\r\n n -= gcd(n, (a, b)[i])\r\n i = 1-i\r\nprint(i)", "def euclid(a, b):\r\n if a > b:\r\n return euclid(b, a)\r\n elif a == 0:\r\n return b\r\n else:\r\n return euclid(b % a, a)\r\n\r\n\r\na, b, n = [int(s) for s in input().split(' ')]\r\nstones = [a, b]\r\ni = 0\r\nwhile n > 0:\r\n e = euclid(stones[i], n)\r\n n -= e\r\n i = (i + 1) % 2\r\nprint((i + 1) % 2)\r\n", "import math\r\na,b,n = map(int, input().split())\r\nturn = 0\r\nwhile True:\r\n if (turn == 0):\r\n n-=math.gcd(a, n)\r\n else:\r\n n-=math.gcd(b, n)\r\n \r\n if n == 0:\r\n print(turn)\r\n break\r\n turn = 1-turn", "# 119A - Epic Game\r\nimport math\r\n[a, b, n], c = list(map(int, input().split())), 0\r\nwhile n >= 0:\r\n if c % 2 == 0:\r\n n -= math.gcd(a, n)\r\n else:\r\n n -= math.gcd(b, n)\r\n c += 1\r\nprint(c % 2)\r\n", "import math\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n turn = 0\r\n while True:\r\n if turn == 0:\r\n stones = math.gcd(a, n)\r\n if stones > n:\r\n print(1)\r\n break\r\n n -= stones\r\n turn = 1\r\n else:\r\n stones = math.gcd(b, n)\r\n if stones > n:\r\n print(0)\r\n break\r\n n -= stones\r\n turn = 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\na,b,n=list(map(int,input().split()))\r\nfor i in range(1,1000):\r\n if i%2!=0:\r\n n-=math.gcd(a,n)\r\n if n==0:\r\n print('0')\r\n break\r\n elif n<0:\r\n print('1')\r\n break\r\n elif i%2==0:\r\n n-=math.gcd(b,n)\r\n if n==0:\r\n print('1')\r\n break\r\n elif n<0:\r\n print('0')\r\n break\r\n\r\n", "import math\r\na,b,n=map(int,input().split())\r\nk=0\r\nwhile (n >= 0):\r\n k+=1\r\n n-=math.gcd(a if k&1 else b,n)\r\nif (k&1):\r\n print(1)\r\nelse:\r\n print(0)", "\"\"\"\r\nSolution to Codeforces Problem 119A : https://codeforces.com/problemset/problem/119/A\r\n\"\"\"\r\nimport math\r\n\r\n\r\ndef solve(a, b, n):\r\n while True:\r\n for ix, value in enumerate([a, b]):\r\n gdc = math.gcd(value, n)\r\n if gdc <= n and n != 0:\r\n n -= gdc\r\n else:\r\n print(1 if ix == 0 else 0)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve(*list(map(int, input().split(' '))))\r\n", "sem,ansem,kuch=map(int,input().split())\r\na,b,c=sem,ansem,kuch\r\ncount=1\r\nwhile c>0:\r\n if count%2>0:\r\n while sem>0:\r\n d=kuch%sem\r\n kuch=sem\r\n sem=d\r\n c=c-kuch\r\n sem=a\r\n kuch=c\r\n else:\r\n while ansem>0:\r\n e=kuch%ansem\r\n kuch=ansem\r\n ansem=e\r\n c=c-kuch\r\n ansem=b\r\n kuch=c\r\n count+=1\r\nif count%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n \r\n \r\n", "from math import gcd\r\na,b,n=[int(x) for x in input().split()]\r\nj=0\r\nwhile n>0:\r\n if j%2==0:\r\n n-=gcd(a,n)\r\n \r\n else:\r\n n-=gcd(b,n)\r\n \r\n j+=1\r\nif j%2==0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\") \r\n\r\n ", "import math\na,b,n=map(int,input().split())\nwhile True:\n if n-math.gcd(a,n)>0:\n n=n-math.gcd(a,n)\n else:\n print('0')\n break\n if n-math.gcd(b,n)>0:\n n=n-math.gcd(b,n)\n else:\n print('1')\n break\n", "def gcd(a,b):\r\n\tif a < b:\r\n\t\ta,b = b,a \r\n\twhile b != 0:\r\n\t\ta,b = b, a%b\r\n\treturn a\r\n\r\na,b,n = list(map(int, input().split()))\r\ni = 0\r\ncand = [a,b]\r\nwhile n > 0:\r\n\tn -= gcd(cand[i%2],n)\r\n\tif n >= 0:\r\n\t\ti += 1\r\nprint(int(not i%2))", "import math\n*a, n = map(int, input().split())\ni = 0\nwhile n > 0:\n n -= math.gcd(a[i], n)\n i = 1 - i\nprint([1, 0][i])\n", "from math import gcd\r\na,b,n = map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n d=gcd(a,n)\r\n n=n-d\r\n else:\r\n d=gcd(b,n)\r\n n=n-d\r\n i+=1\r\nif i%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\ndef gcd(a,b):\n n1,n2=max(a,b),min(a,b)\n if n2==0:\n return n1\n while n2:\n n1,n2=n2,n1%n2\n return n1\na,b,n=map(int,input().split())\nc=1\nwhile n:\n if c%2==1:\n n=n-gcd(a,n)\n c+=1\n else:\n n-=gcd(b,n)\n c+=1\nif c%2==1:\n print(1)\nelse:\n print(0)\n \n\n ", "import math\r\ns = input()\r\ns = s.split()\r\na = int(s[0])\r\nb = int(s[1])\r\nc = int(s[2])\r\nl=0\r\nf=-1\r\nwhile c>=0:\r\n if l%2 ==0:\r\n val = math.gcd(c, a)\r\n f=1\r\n c = c - val\r\n else:\r\n val = math.gcd(c, b)\r\n f=0\r\n c = c - val\r\n l+=1\r\n #print(c)\r\nprint(f)", "from math import gcd\r\n\r\na, b, n = [int(i) for i in input().split()]\r\nresult = 0\r\nwhile n:\r\n n -= gcd(n, a)\r\n if n == 0:\r\n result = 0\r\n else:\r\n n -= gcd(b, n)\r\n result = 1\r\nprint(result)\r\n\r\n", "#t=int(input())\r\n#for z in range(t):\r\nfrom math import gcd\r\nn,m,k=map(int,input().split())\r\n # a=list(map(int,input().split()))\r\ni=0\r\nwhile(1):\r\n if(i%2==0):\r\n c=gcd(n,k)\r\n if(k<c):\r\n print(\"1\")\r\n break\r\n k=k-c \r\n else:\r\n c=gcd(m,k)\r\n if(k<c):\r\n print(\"0\")\r\n break\r\n k=k-c\r\n i+=1 \r\n", "a, b, n = map(int, input().split())\r\nhod = 0\r\n\r\nwhile n > 0:\r\n\r\n N, k = n, a\r\n while N > 0:\r\n k, N = N , k % N\r\n if k <= n:\r\n hod += 1\r\n n -= k\r\n\r\n N, k = n, b\r\n while N > 0:\r\n k, N = N , k % N\r\n if k <= n:\r\n hod += 1\r\n n -= k\r\n\r\nif hod % 2 == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "def gcd(x,y):\r\n \r\n m = min(x,y)\r\n hcf = 0\r\n \r\n if x == 0 or y == 0:\r\n if x != 0:\r\n return x\r\n else:\r\n return y\r\n else:\r\n for i in range(1,m+1):\r\n if x%i == 0 and y%i == 0:\r\n hcf = i\r\n \r\n return hcf\r\n \r\na,b,n = map(int,input().split())\r\nactive = True\r\nchance = 0\r\nwhile active:\r\n t_s = gcd(a,n)\r\n n = n - t_s\r\n chance += 1\r\n \r\n if n <= 0:\r\n break\r\n \r\n t_as = gcd(b,n)\r\n n = n - t_as\r\n chance += 1\r\n \r\n if n <= 0:\r\n break\r\n \r\nprint(0 if chance%2 != 0 else 1)", "from math import gcd\r\na, b, n = map(int, input().split())\r\ncount = 0\r\nwhile n >= 0:\r\n n -= gcd(n, (a, b)[count])\r\n count = 1 - count\r\nprint(count)\r\n", "a,b,n=[int(x) for x in input().split()]\r\nm=0\r\nimport math\r\nwhile n>=0:\r\n m+=1\r\n if m%2==0:\r\n d = math.gcd(b,n)\r\n n-=d\r\n else:\r\n d = math.gcd(a,n)\r\n n-=d\r\nif m%2==0:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "a,b,n=map(int,input().split())\r\nx=0\r\nwhile n>0:\r\n if x%2==0:\r\n for i in range(1,min(a,n)+1):\r\n if a%i==0 and n%i==0:\r\n nod=i\r\n else:\r\n for i in range(1,min(b,n)+1):\r\n if b%i==0 and n%i==0:\r\n nod=i\r\n n=n-nod\r\n x=x+1\r\n\r\nprint(1-x%2)", "import math\n\ns = input()\n\nl = [int(num) for num in s.split(' ')]\n\ncnt = 0\nwhile l[2]>0:\n k = math.gcd(l[0], l[2])\n l[2] = l[2] - k\n #print(l[2])\n if l[2] >0:\n cnt += 1\n t = math.gcd(l[1],l[2])\n l[2] = l[2] - t\n #print(l[2])\n if l[2] > 0:\n cnt += 1\n\nif cnt %2 !=0:\n print(1)\nelse:\n print(0)", "def q(x, y):\r\n while x * y > 0:\r\n x = x % y\r\n if x != 0:\r\n y = y % x\r\n return x + y\r\n\r\n\r\na, b, d = map(int, input().split())\r\nflag = 0\r\nwhile d > 0:\r\n if flag == 0:\r\n d -= q(a, d)\r\n flag = 1\r\n else:\r\n d -= q(b, d)\r\n flag = 0\r\nprint(1 - flag)", "import math\r\na,b,n=list(map(int,input().split()))\r\nf=0\r\nwhile(True):\r\n if(f==0):\r\n d1=math.gcd(a,n)\r\n n-=d1\r\n if(n<0):\r\n print(1)\r\n break\r\n else:\r\n d2=math.gcd(b,n)\r\n n-=d2\r\n if(n<0):\r\n print(0)\r\n break\r\n f^=1 \r\n", "\"\"\"\r\nNghiện code love Chu Gia Linh <3\r\n\"\"\"\r\n\r\nfrom math import gcd\r\n\r\nplayer = [0, 1] # 0: Simon, 1: Antisimon\r\na, b, n = map(int, input().split())\r\nidx = 0\r\nwhile n >= 0:\r\n # Simon's turn\r\n if idx % 2 == 0:\r\n n -= gcd(a, n)\r\n # Antisimon's turn\r\n else:\r\n n -= gcd(b, n)\r\n idx += 1\r\n\r\nprint(player[idx%2])", "from math import gcd\r\na,b,n=map(int,input().split())\r\nwhile n:\r\n p=gcd(a,n)\r\n if p>n:\r\n print(1)\r\n break\r\n n-=p\r\n q=gcd(b,n)\r\n if q>n:\r\n print(0)\r\n break\r\n n-=q\r\nelse:\r\n print(1)\r\n\r\n", "def hcf (a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return hcf (b, a % b)\r\n\r\na, b, n = tuple (map (int, input ().split (' ')))\r\nswitch = True\r\nwhile True:\r\n if switch:\r\n n -= hcf (a, n)\r\n else:\r\n n -= hcf (b, n)\r\n switch = not switch\r\n if n < 0:\r\n print (int (not switch))\r\n break\r\n", "import math\r\na,b,n=map(int,input().split())\r\n\r\nwhile n!=0:\r\n x=math.gcd(a,n)\r\n n=n-x\r\n if n==0:\r\n print(0)\r\n break\r\n y=math.gcd(b,n)\r\n n=n-y\r\n if n==0:\r\n print(1)\r\n break", "import math\r\ncase=input()\r\ncaseLst=list(map(int,case.split()))\r\na=caseLst[0]\r\nb=caseLst[1]\r\nn=caseLst[2]\r\nwhile(True):\r\n\tsimon=math.gcd(a,n)\r\n\tif simon<=n:\r\n\t\tn-=simon\r\n\telse:\r\n\t\tprint(\"1\")\r\n\t\tbreak\r\n\tantisimon=math.gcd(b,n)\r\n\tif antisimon<=n:\r\n\t\tn-=antisimon\r\n\telse:\r\n\t\tprint(\"0\")\r\n\t\tbreak", "from math import gcd\r\na,b,c=map(int,input().split())\r\nfor i in range(1,c+2):\r\n\tif i%2!=0:\r\n\t\td=gcd(a,c)\r\n\t\tif c==0:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\t\telse:\t\r\n\t\t\tc-=d\r\n\telse:\r\n\t\td=gcd(b,c)\r\n\t\tif c==0:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\t\telse:\t\r\n\t\t\tc-=d", "import math\r\nn=list(map(int,input().split()))\r\ni=0\r\nwhile n[2]>=0:\r\n\tn[2]=n[2]-math.gcd(n[i],n[2])\r\n\ti=1-i\r\nprint(i)", "import math\r\na, b, n = map(int, input().split())\r\nk = 0\r\nwhile n >= 0:\r\n k += 1\r\n if k % 2 != 0:\r\n n -= math.gcd(a, n)\r\n else:\r\n n -= math.gcd(b, n)\r\nif k % 2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "# your code goes here\r\ndef gcd(a,b):\r\n\twhile(b):\r\n\t\ta,b=b,a%b\r\n\treturn abs(a)\r\n\r\na,b,n=map(int,input().split())\r\nwhile(True):\r\n\tn-=gcd(a,n)\r\n\tif n<=0:\r\n\t\tprint(0)\r\n\t\tbreak\r\n\tn-=gcd(b,n)\r\n\tif n<=0:\r\n\t\tprint(1)\r\n\t\tbreak\r\n", "def gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else :\r\n l=[]\r\n q=[]\r\n w=[]\r\n for i in range(1,a):\r\n if a%i==0:\r\n l.append(i)\r\n for j in range(1,b):\r\n if b%j==0:\r\n q.append(j)\r\n for element in l:\r\n if element in q:\r\n w.append(element)\r\n return w[-1]\r\n\r\np=input()\r\np=p.split()\r\ne=int(p[0])\r\nr=int(p[1])\r\nn=int(p[2])\r\nc=0\r\nd=gcd(max(e,n),min(e,n))\r\nwhile n>=d:\r\n c+=1\r\n n=n-d\r\n if n==0:\r\n break\r\n if c%2==0:\r\n t=e\r\n else:\r\n t=r\r\n d=gcd(max(t,n),min(t,n))\r\nif c%2!=0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "from math import gcd\r\na, b, n=[int(k) for k in input().split()]\r\nwhile True:\r\n n-=gcd(a, n)\r\n if n==0:\r\n print(\"0\")\r\n break\r\n n-=gcd(n, b)\r\n if n==0:\r\n print(\"1\")\r\n break", "def gcd(a,b):\r\n if a ==0 :return b\r\n return gcd(b%a,a)\r\n\r\nx,y,z = map(int,input().split())\r\nflag = False\r\nwhile z != 0:\r\n out = gcd(x,z)\r\n z-= out\r\n flag = True\r\n if z == 0:break\r\n \r\n out = gcd(y,z)\r\n z -= out\r\n flag = False\r\n\r\nprint(\"0\" if flag ==True else \"1\")", "from math import gcd\r\nx, y, n = map(int, input().split())\r\ni = 0\r\nwhile n > 0:\r\n if i % 2 == 0:\r\n f = gcd(x, n)\r\n else:\r\n f = gcd(y, n)\r\n n -= f\r\n i += 1\r\nif i % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)\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\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n n -= gcd(a,n)\r\n if n<0:\r\n print(1)\r\n break\r\n \r\n \r\n n -= gcd(b,n)\r\n if n<0:\r\n print(0)\r\n break", "from math import gcd\r\na,b,n = map(int, input().split())\r\ni = 1\r\nwhile n!=0:\r\n if i%2: \r\n d = gcd(a,n)\r\n else:\r\n d = gcd(b,n)\r\n n -= d\r\n i += 1\r\nprint(1 if i%2 else 0)", "def gcd(a,b):\r\n if a==0: return b\r\n elif b==0: return a\r\n while a!=0 and b!=0:\r\n c=max(a,b)\r\n d=min(a,b)\r\n a=d\r\n b=c-d\r\n if a==0: return b\r\n elif b==0: return a\r\n\r\nx=input()\r\na=int(x.split()[0])\r\nb=int(x.split()[1])\r\nn=int(x.split()[2])\r\nwhile n>0:\r\n n=n-gcd(a,n)\r\n turn=0\r\n if n<=0: break\r\n n=n-gcd(b,n)\r\n turn=1\r\n if n<=0: break\r\nprint(turn)\r\n \r\n \r\n \r\n", "import math\r\n\r\n\r\ndef solve(a, b, c):\r\n\r\n count = c\r\n\r\n while True:\r\n if count - math.gcd(a, count) <= 0:\r\n return 0\r\n else:\r\n count -= math.gcd(a, count)\r\n\r\n if count - math.gcd(b, count) <= 0:\r\n return 1\r\n else:\r\n count -= math.gcd(b, count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c = map(int, input().split())\r\n print(solve(a, b, c))", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef game_winner(a, b, n):\r\n while n > 0:\r\n stones_taken = gcd(a, n)\r\n if stones_taken > n:\r\n return 1\r\n n -= stones_taken\r\n stones_taken = gcd(b, n)\r\n if stones_taken > n:\r\n return 0 # Simon wins\r\n n -= stones_taken\r\n\r\n return 1\r\n\r\na, b, n = map(int, input().split())\r\nwinner = game_winner(a, b, n)\r\nprint(winner)", "a,b,n=map(int,input().split())\r\nwhile(1):\r\n i = 1\r\n while(i<=a and i<=n):\r\n if a%i==0 and n%i==0:\r\n gcd=i\r\n i+=1\r\n n=n-gcd\r\n if n<=0:\r\n print(0)\r\n break\r\n j=1\r\n while(j<=b and j<=n):\r\n if b%j==0 and n%j==0:\r\n gcd=j\r\n j+=1\r\n n=n-gcd\r\n if n<=0:\r\n print(1)\r\n break", "from math import gcd\r\na,b,n=map(int,input().split())\r\nf=s=0\r\nwhile True:\r\n\tga=gcd(a,n)\r\n\tif ga>n:\r\n\t\tbreak\r\n\telse:\r\n\t\tn-=ga\r\n\t\tf+=1\r\n\tgb=gcd(b,n)\r\n\tif gb>n:\r\n\t\tbreak\r\n\telse:\r\n\t\tn-=gb\r\n\t\ts+=1\r\nif f>s:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "import math\r\n\r\n\r\ndef semen(a, b, c):\r\n s = 0\r\n while c >= 0:\r\n if s == 0:\r\n c -= math.gcd(a, c)\r\n s = 1\r\n\r\n else:\r\n c -= math.gcd(b, c)\r\n s = 0\r\n return s\r\n\r\n\r\na, b, c = map(int, input().split())\r\nprint(semen(a, b, c))", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nfrom math import gcd\n\na, b, n = map(int, input().split())\n\ndef sim(a, b, n, simon=True):\n if simon:\n if gcd(a, n) > n:\n return \"1\"\n else:\n return sim(a, b, n-gcd(a, n), not simon)\n else:\n if gcd(b, n) > n:\n return \"0\"\n else:\n return sim(a, b, n-gcd(b, n), not simon)\n\nprint(sim(a, b, n))", "from math import gcd\r\nnums = input().split()\r\nfor i in range(0, len(nums)):\r\n nums[i] = int(nums[i])\r\nctr = 0\r\nwhile nums[-1] >= 0:\r\n for i in nums[:2]:\r\n x = gcd(i, nums[-1])\r\n nums[-1] = nums[-1] - x\r\n if nums[-1] < 0: break\r\n ctr = ctr + 1\r\nif ctr % 2 != 0: print('0')\r\nelse: print('1')", "# LUOGU_RID: 101457297\nfrom math import gcd\r\na, b, n = map(int, input().split())\r\nf = 1\r\nwhile n:\r\n n -= gcd(n, a if f else b)\r\n f ^= 1\r\nprint(f)", "def gcd(a,b):\n if a==0:\n return b\n return gcd(b%a,a)\n\na,b,n = map(int,input().split())\n\nwhile n:\n n -= gcd(a,n)\n if n==0:\n print(0)\n break\n n -= gcd(b,n)\n if n==0:\n print(1)\n break\n", "import math\r\na,b,n = [int(i) for i in input().split()]\r\nwhile True:\r\n n -= math.gcd(n,a)\r\n if n<0:\r\n print('1')\r\n break\r\n n -= math.gcd(n,b)\r\n if n<0:\r\n print('0')\r\n break\r\n", "import math\r\na, b, n = map(int, input().split())\r\nturn = [a, b]\r\ni = 0\r\nwhile math.gcd(turn[i], n) <= n or n != 0:\r\n n -= math.gcd(turn[i], n)\r\n if n != 0:\r\n i = (i + 1) % 2\r\n \r\nprint(i)", "def get_gcd(a, b):\r\n while a != b:\r\n if a == 0 or b == 0:\r\n return 0\r\n elif a > b:\r\n a -= b\r\n else:\r\n b -= a\r\n return a\r\n\r\na, b, n = map(int, input().split())\r\nwhile True:\r\n gcd = get_gcd(a, n)\r\n if gcd <= n and n != 0:\r\n n -= gcd\r\n else:\r\n print(1)\r\n break\r\n gcd2 = get_gcd(b, n)\r\n if gcd2 <= n and n != 0:\r\n n -= gcd2\r\n else:\r\n print(0)\r\n break", "a, b, nn = map(int, input().split())\r\ns = 0\r\nwhile nn > 0:\r\n if s % 2 == 0:\r\n aa = a\r\n n = nn\r\n while n % aa != 0:\r\n n, aa = aa, n % aa\r\n nn -= aa\r\n else:\r\n aa = b\r\n n = nn\r\n while n % aa != 0:\r\n n, aa = aa, n % aa\r\n nn -= aa\r\n s += 1\r\nif n == 0:\r\n print(s % 2)\r\nelse:\r\n print(1 - s % 2)\r\n\r\n", "import math\r\na,b,n = map(int,input().split())\r\nwhile(True):\r\n n -= math.gcd(a,n)\r\n if(n==0):\r\n print(0)\r\n break\r\n n-=math.gcd(b,n)\r\n if(n==0):\r\n print(1)\r\n break", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef game_winner(a, b, n):\r\n simon_turn = True\r\n while n >= 0:\r\n if simon_turn:\r\n stones_taken = gcd(a, n)\r\n else:\r\n stones_taken = gcd(b, n)\r\n if stones_taken > n:\r\n return \"1\" if simon_turn else \"0\"\r\n n -= stones_taken\r\n simon_turn = not simon_turn\r\n return \"1\"\r\n\r\na, b, n = map(int, input().split())\r\n\r\nprint(game_winner(a, b, n))\r\n", "def gcd(x,y):\r\n if y==0:\r\n return x\r\n return gcd(y,x%y)\r\na,b,n=map(int,input().split())\r\nc=0\r\nwhile True:\r\n t=gcd(a,n)\r\n n=n-t\r\n if n>0:\r\n c=c+1\r\n else:\r\n break\r\n t=gcd(b,n)\r\n n=n-t\r\n if n>0:\r\n c=c+1\r\n else:\r\n break\r\nif c%2==0:\r\n print(0)\r\nelse:\r\n print(1)", "import math\r\n\r\nsim,ant,num=map(int,input().split())\r\ncheckcon=True\r\nwhile(checkcon):\r\n num = num - math.gcd(sim,num)\r\n if(num==0):\r\n print('0')\r\n checkcon=False\r\n num = num- math.gcd(ant,num)\r\n if(num==0):\r\n print('1')\r\n checkcon=False", "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\na,b,h=map(int,input().split())\r\nsig=1\r\nwhile(True):\r\n if(sig==1):\r\n d=gcd(a,h)\r\n else:\r\n d=gcd(b,h)\r\n if(h<d):\r\n break\r\n else:\r\n h-=d\r\n sig=(sig+1)%2\r\nprint(sig)", "import math\r\na,b,c=map(int,input().split())\r\nwhile(1):\r\n x=math.gcd(a,c)\r\n c=c-x\r\n if(c==0):\r\n print(0)\r\n break\r\n x=math.gcd(b,c)\r\n c=c-x\r\n if(c==0):\r\n print(1)\r\n break\r\n", "from fractions import gcd\r\na,b,n=map(int,input().split())\r\nw,v=0,a\r\nwhile n>=0:\r\n n -= gcd(v,n)\r\n w^=1\r\n v=(a,b)[w]\r\n\r\nprint(w)", "import math\r\nt = list(map(int,input().split(\" \")))\r\na = t[0]\r\nb = t[1]\r\nn = t[2]\r\nwhile(n > 0):\r\n n -= math.gcd(a,n)\r\n if(n == 0):\r\n print(0)\r\n n -= math.gcd(b,n)\r\n if(n == 0):\r\n print(1)\r\n \r\n \r\n \r\n", "from fractions import gcd\r\na,b,n = map(int, input().split())\r\nsimonsTurn = False\r\nwhile n>0:\r\n\tsimonsTurn = not simonsTurn\r\n\tif simonsTurn:\r\n\t\tn -= gcd(a,n)\r\n\telse:\r\n\t\tn -= gcd(b,n)\r\n\tif(n<0):\r\n\t\tbreak\r\n\r\nif(simonsTurn):\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(\"1\")", "import math\r\na,b,n=map(int,input().split())\r\nflag=0\r\nwhile(n>0):\r\n if(flag==0):\r\n n=n-(math.gcd(a,n))\r\n flag=1 \r\n else:\r\n n=n-(math.gcd(b,n))\r\n flag=0\r\nif(flag==0):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "a, b, c=[int(i) for i in input().split()];k=0\r\nwhile c!=0:\r\n k+=1\r\n if k%2==0:\r\n if max(b,c)%min(b,c)==0:\r\n c-=min(b,c)\r\n else:\r\n c-=1\r\n else:\r\n if max(a,c)%min(a,c)==0:\r\n c-=min(a,c)\r\n else:\r\n c-=1\r\nprint(\"0\" if k%2!=0 else \"1\")", "from math import gcd\r\na, b, n=[int(x) for x in input().split()]\r\nc=0\r\n\r\nwhile(True):\r\n if c==0:\r\n a1=gcd(a,n)\r\n if a1>n:\r\n print('1')\r\n break\r\n else:\r\n n-=a1\r\n c=1\r\n elif c==1:\r\n b1=gcd(b,n)\r\n if b1>n:\r\n print('0')\r\n break\r\n else:\r\n n-=b1\r\n c=0", "a, b, n = map(int, input().split())\r\nanswer = -1\r\nloose_flag = 0\r\n\r\n\r\ndef nod(x, y):\r\n max_number = max(x, y)\r\n min_number = min(x, y)\r\n temp = 0\r\n while max_number % min_number != 0:\r\n if max_number > min_number:\r\n temp = min_number\r\n min_number = max_number % min_number\r\n max_number = temp\r\n return min_number\r\n\r\n\r\nwhile loose_flag == 0:\r\n if n == 0:\r\n loose_flag = 1\r\n print(1)\r\n break\r\n if nod(a, n) <= n:\r\n n -= nod(a, n)\r\n else:\r\n loose_flag = 1\r\n print(1)\r\n break\r\n\r\n if n == 0:\r\n loose_flag = 2\r\n print(0)\r\n break\r\n if nod(b, n) <= n:\r\n n -= nod(b, n)\r\n else:\r\n loose_flag = 2\r\n print(0)\r\n break\r\n", "from math import gcd\r\na, b, n = map(int, input().split())\r\nr = 0\r\nwhile True:\r\n t = gcd(n, [a,b][r])\r\n if n < t: \r\n break\r\n else:\r\n n -= t\r\n r = 1 - r\r\nprint(1-r)", "def gcd(i,j):\r\n for k in range(i,0,-1):\r\n if i%k==0 and j%k==0:\r\n return k\r\n\r\na,b,n=map(int,input().split())\r\nx=0\r\nwhile n>0:\r\n if x==0:\r\n z=gcd(min(a,n),max(a,n))\r\n n-=z\r\n x=1\r\n else:\r\n z=gcd(min(b,n),max(b,n))\r\n n-=z\r\n x=0\r\nif x==1:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "def epicgame(a,b,n):\r\n # winsimon=False\r\n # winantisimon=False\r\n n_taken=0\r\n c=1\r\n while True:\r\n if c%2!=0:\r\n n_taken=gcd(a,n)\r\n if n_taken>n:\r\n # winantisimon=True\r\n return('antisimon')\r\n else:\r\n n=n-n_taken\r\n else:\r\n n_taken=gcd(b,n)\r\n if n_taken>n:\r\n # winsimon=True\r\n return('simon')\r\n else:\r\n n=n-n_taken\r\n c+=1\r\n\r\ndef gcd(n1,n2):\r\n if n1==0:\r\n return n2\r\n if n2==0:\r\n return n1\r\n if n1==n2:\r\n return n1\r\n if (n1>n2):\r\n return gcd(n1-n2,n2)\r\n return gcd(n1,n2-n1) \r\n \r\na,b,n=map(int,input().split())\r\nif epicgame(a,b,n)=='simon':\r\n print('0')\r\nif epicgame(a,b,n)=='antisimon':\r\n print('1')\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\na,b,n=map(int,input().split())\r\nwhile True:\r\n n-=gcd(a,n)\r\n if n==0 and gcd(a,n)==a:\r\n print(\"0\")\r\n break\r\n n-=gcd(b,n)\r\n if n==0 and gcd(b,n)==b:\r\n print(\"1\")\r\n break", "# №1.1 НОД\r\n# a, b = map(int, input().split())\r\n# while a != b:\r\n# if a < b:\r\n# b = b - a\r\n# else:\r\n# a = a - b\r\n# print(a)\r\n\r\n# №1.2 НОД\r\n# a, b = map(int, input().split())\r\n# while b > 0:\r\n# a, b = b, a % b\r\n# print(a)\r\n\r\n# №1.1 НОК\r\n# a, b = map(int, input().split())\r\n# ai = a\r\n# bi = b\r\n# while b > 0:\r\n# a, b = b, a % b\r\n# NOK = (ai * bi)/a\r\n# print(int(NOK))\r\n#\r\n# a, b = map(int,input().split())\r\n# v = a * b\r\n# while b > 0:\r\n# c = a % b\r\n# a = b\r\n# b = c\r\n# s = v / a\r\n# print(int(s))\r\n\r\n# def nod(a, b):\r\n# while b > 0:\r\n# a, b = b, a % b\r\n# return a\r\n#\r\n#\r\n# a, b = map(int, input().split())\r\n# print(a * b // nod(a, b))\r\n\r\n# №1.3 Апельсины и гости\r\n# def nod(a, b):\r\n# while b > 0:\r\n# a, b = b, a % b\r\n# return a\r\n#\r\n#\r\n# a, b = map(int, input().split())\r\n# print(int((a * b // nod(a, b)) / a))\r\n\r\n# №1.4 A. Эпическая игра (119A)\r\na, b, n = map(int, input().split())\r\ndef nod(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\ncount = 1\r\nwhile n >= nod(a, n) and n>= nod(b, n):\r\n if count % 2 != 0:\r\n n = n - nod(a, n)\r\n else:\r\n n -= nod(b, n)\r\n count +=1\r\nprint(str(count % 2))\r\n", "import math\r\na,b,n = [int(x) for x in input().split()]\r\ni = 0\r\nwhile n>0:\r\n if i%2 == 0:\r\n n=n-math.gcd(a,n)\r\n i+=1\r\n else:\r\n n=n-math.gcd(b,n)\r\n i+=1\r\nif i%2 == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\ndef stones(a,b,n):\r\n while True:\r\n n=n-gcd(a,n)\r\n if n<0:\r\n return '1' \r\n n=n-gcd(b,n)\r\n if n<0:\r\n return '0'\r\na,b,n=map(int,input().split())\r\nprint(stones(a,b,n))", "def gsd(a, b):\r\n if a == 0:\r\n return b\r\n return gsd(b%a, a)\r\n\r\n\r\na, b, n = [int(i) for i in input().split()]\r\nh = 1\r\nwhile n != 0:\r\n if h == 1:\r\n n -= gsd(a, n)\r\n else:\r\n n -= gsd(b, n)\r\n h -= 1\r\n h = abs(h)\r\nprint(h)", "#a= [int(x) for x in input().split()]\r\ndef computeGCD(x, y):\r\n \r\n while(y):\r\n x, y = y, x % y\r\n return abs(x)\r\ndef asd():\r\n a= [int(z) for z in input().split()]\r\n n=a[2]\r\n i=0\r\n while(1): \r\n if(i%2==0):\r\n gcd=computeGCD(a[0],n)\r\n \r\n else:\r\n gcd=computeGCD(a[1],n)\r\n \r\n if(gcd>n):\r\n if(i%2==0):\r\n print('1')\r\n else:\r\n print('0')\r\n break\r\n \r\n n=n-gcd\r\n i+=1\r\n\r\n\r\nasd()\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 3 07:48:11 2019\r\n \r\n@author: avina\r\n\"\"\"\r\nfrom math import gcd\r\na,b,n = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n if i %2 ==0:\r\n n -= gcd(a,n)\r\n else:\r\n n-= gcd(b,n)\r\n if n <1:\r\n break\r\n i+=1\r\nif i%2 == 0:\r\n print(0)\r\nelse:\r\n print(1)", "import math\r\na,b,n= map(int, input().split())\r\nplayerA = True\r\ngcdNum = 0\r\n \r\nwhile(True):\r\n if(playerA):\r\n gcdNum = math.gcd(a,n)\r\n if(gcdNum <= n):\r\n n -= gcdNum\r\n playerA = False\r\n else:\r\n print(1)\r\n break\r\n else:\r\n gcdNum = math.gcd(b,n)\r\n if(gcdNum <= n):\r\n n -= gcdNum\r\n playerA = True\r\n else:\r\n print(0)\r\n break\r\n", "from fractions import gcd\r\n\r\na,b,n = map(int, input().split())\r\n\r\ncheck = 0\r\ni = 0\r\n\r\nwhile n>0:\r\n if i%2==0:\r\n check = gcd(a,n)\r\n n -= check\r\n else:\r\n check = gcd(b,n)\r\n n -= check\r\n i += 1\r\n\r\nif i%2==0:\r\n print(1)\r\nelse:\r\n print(0)\r\n \r\n \r\n ", "from math import gcd\r\n\r\ndef solve(a,b,n):\r\n\twhile True:\r\n\t\tif (n-gcd(a,n)<0):\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn -= gcd(a,n)\r\n\t\t\r\n\t\tif (n-gcd(b,n)<0):\r\n\t\t\tprint(0)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn -= gcd(b,n)\r\n\r\n\r\na, b, n = list(map(int, input().split()))\r\nsolve(a,b,n)", "a,b,n = (int(x) for x in input().split())\r\ndef zdgys(m,z):\r\n\tk = z\r\n\tj = m\r\n\tm = max([m,z])\r\n\tz = min([k,j])\r\n\twhile m%z != 0 :\r\n\t\tm,z = z,(m%z)\r\n\telse:\r\n\t\treturn z\r\nwhile n != 0:\r\n\tn -= zdgys(a,n)\r\n\tif n != 0:\r\n\t\tn -= zdgys(b,n)\r\n\telse:\r\n\t\tprint('0')\r\n\t\tbreak\r\nelse:\r\n\tprint('1')\r\n\r\n\r\n\t\t\r\n", "# URL: https://codeforces.com/problemset/problem/119/A\n\nimport io\nimport os\nimport sys\nimport math\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\na, b, n = map(int, inp().split())\nd = 0\nwhile n:\n if d == 0:\n g = math.gcd(n, a)\n else:\n g = math.gcd(n, b)\n n -= g\n d = 1 - d\nout(f\"{1 - d}\")\n", "a, b, n = map(int, input().split())\r\n\r\ndef gcd(a, b):\r\n if (b == 0):\r\n return abs(a)\r\n else:\r\n return gcd(b, a % b)\r\n\r\ncount = 0\r\ncount1 = 0\r\n\r\nwhile n > 0:\r\n x = gcd(a, n)\r\n count = count + 1\r\n n = n - x\r\n\r\n if n <= 0:\r\n break\r\n\r\n y = gcd(b, n)\r\n count1 = count1 + 1\r\n n = n - y\r\n\r\nif count > count1:\r\n print(\"0\") \r\nelse:\r\n print(\"1\")\r\n", "aN,bN,nN=map(int,input().split())\r\nneed=0\r\na,b,n=aN,bN,nN\r\ncn1,cn2=0,0\r\nwhile need<=n:\r\n while nN:\r\n aN,nN=nN,aN%nN\r\n if n>0: \r\n need=aN\r\n n-=need\r\n nN=n\r\n cn1+=1\r\n while nN:\r\n bN,nN=nN,bN%nN\r\n if n>0:\r\n need=bN\r\n n-=need\r\n nN,aN,bN=n,a,b\r\n cn2+=1\r\nif cn1>cn2:\r\n print(0)\r\nelse:\r\n print(1)", "def fun(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return fun(b,a%b)\r\n\r\na,b,n=map(int,input().split())\r\ncount=0\r\nwhile True:\r\n if count%2==0:\r\n x=fun(max(a,n),min(a,n))\r\n else:\r\n x=fun(max(b,n),min(b,n))\r\n if x<=n:\r\n n-=x\r\n count+=1\r\n else:\r\n break\r\n\r\nprint((count+1)%2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from math import gcd\r\n*a,n=map(int,input().split())\r\np=1\r\nwhile n:\r\n p^=1\r\n n-=gcd(a[p],n)\r\nprint('01'[p])\r\n", "masuk=input().split()\r\n\r\nsim=int(masuk[0])\r\nasim=int(masuk[1])\r\nstone=int(masuk[2])\r\nwinner=0\r\nbenar=True\r\nwhile benar:\r\n if stone==0:\r\n winner=1\r\n break\r\n div=min(stone,sim)\r\n while True:\r\n if stone%div!=0 or sim%div!=0:\r\n div-=1\r\n else:\r\n stone-=div\r\n if stone==0:\r\n benar=False\r\n elif stone<0:\r\n benar=False\r\n winner=1\r\n break\r\n if not benar:\r\n break\r\n div=min(stone,asim)\r\n while True:\r\n if stone%div!=0 or asim%div!=0:\r\n div-=1\r\n else:\r\n stone-=div\r\n if stone<0:\r\n benar=False\r\n winner=0\r\n break\r\nprint(winner)\r\n\r\n", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\treturn gcd(b,a%b)\r\na,b,n=map(int,input().split())\r\nfor i in range(200):\r\n\t#rint(n)\r\n\tgcdan=gcd(a,n);gcdbn=gcd(b,n)\r\n\tif i%2==0 and n>=gcdan:\r\n\t\tn-=gcdan\r\n\telif i%2==1 and n>=gcdbn:\r\n\t\tn-=gcdbn\r\n\telse:\r\n\t\tx=n>=gcdan;y=n>=gcdbn\r\n\t\tbreak\r\nprint(0 if i%2==1 else 1)\r\n#print(x,y)", "def gcd(a, b):\r\n while b:\r\n b, a = a % b, b\r\n return a\r\n\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n if n - gcd(a, n) >= 0:\r\n n -= gcd(a, n)\r\n if n - gcd(b, n) >= 0:\r\n n -= gcd(b, n)\r\n else:\r\n print(0)\r\n break\r\n else:\r\n print(1)\r\n break\r\n", "def hcf(x, y): \r\n if x > y: \r\n smaller = y \r\n else: \r\n smaller = x \r\n for i in range(1,smaller + 1): \r\n if((x % i == 0) and (y % i == 0)): \r\n hcf = i \r\n return hcf \r\n\r\na,b,n=map(int,input().split())\r\nwinner=1\r\nwhile n>0:\r\n if winner%2!=0:\r\n n=n-hcf(n,a)\r\n else:\r\n n=n-hcf(n,b)\r\n winner=winner+1\r\n\r\nif winner%2!=0:\r\n print(1)\r\nelse:\r\n print(0) ", "import math\r\ndef epic_game(simon, antisimon, n):\r\n while True:\r\n for j, value in enumerate([simon, antisimon]):\r\n gcd = math.gcd(value, n)\r\n if (n >= gcd) and (n!=0):\r\n n -= gcd\r\n else:\r\n print(1 if j == 0 else 0)\r\n return\r\nsimon, antisimon, n = [int(x) for x in input().split()]\r\nepic_game(simon, antisimon, n)", "def gcd(a, b):\n a, b = sorted([a, b])\n while b != 0:\n a, b = b, a % b\n return a\n\n\n*arr, n = map(int, input().split())\ni = 0\nwhile n != 0:\n n -= gcd(arr[i % 2], n)\n i += 1\n\nprint(1 - i % 2)\n", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef gcd(x, n):\r\n while n > 0:\r\n c = x % n\r\n x, n = n, c\r\n return x\r\n\r\n\r\nh = 1 #7 не смог\r\nwhile n >= 0:\r\n if h % 2 != 0:\r\n x = a\r\n n = n - gcd(x, n)\r\n else:\r\n x = b\r\n n = n - gcd(x, n)\r\n h += 1\r\n\r\nif h % 2 != 0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "a,b,n=map(int,input().split())\r\ndef gcd(a,b):\r\n if a*b==0:return max(a,b)\r\n a,b=max(a,b),min(a,b)\r\n if a%b==0:return b\r\n return gcd(a%b,b)\r\nturn=0\r\nwhile True:\r\n if turn==0:\r\n temp=gcd(a,n)\r\n if temp>n:\r\n print(1)\r\n break\r\n n-=temp\r\n turn=1\r\n else:\r\n temp=gcd(b,n)\r\n if temp>n:\r\n print(0)\r\n break\r\n n-=temp\r\n turn=0\r\n", "import math\r\n\r\ndef nod(x,n):\r\n return math.gcd(x,n)\r\n\r\ndef gameOver(x,n):\r\n return n > abs(n-nod(x,n))\r\n\r\na, b, n = map(int, input().split())\r\n\r\nwhile n >= 0:\r\n if gameOver(a, n):\r\n n -= nod(a, n)\r\n else:\r\n print(1)\r\n break\r\n if gameOver(b, n):\r\n n -= nod(b, n)\r\n else:\r\n print(0)\r\n break\r\n\r\n\r\n\r\n", "def gcd(a,b):\r\n\twhile b:\r\n\t\ta,b=b,a%b\r\n\treturn a\r\n\r\na,b,n=map(int,input().split())\r\na1,b1=0,0\r\ni=1\r\nwhile n>0 :\r\n\t#print(n)\r\n\tif gcd(n,a)<=n and i%2!=0 :\r\n\t\ta1 += 1\r\n\t\tn -= gcd(n,a)\r\n\telif gcd(n,b)<=n and i%2==0 :\r\n\t\tb1 += 1\r\n\t\tn -= gcd(n,b)\r\n\ti += 1\r\nprint(0) if a1>b1 else print(1)", "def gcd(x,y):\r\n p=min(x,y)\r\n q=max(x,y)\r\n ans=1\r\n for j in range(1,p+1):\r\n if (((p%j)==0) and ((q%j)==0)):\r\n ans=j\r\n return ans\r\n\r\na,b,n=map(int,input().split(' '))\r\ni=0\r\nwhile True:\r\n if i%2==0:\r\n g=gcd(a,n)\r\n if g>n:\r\n break\r\n n-=g\r\n i+=1\r\n else:\r\n g=gcd(b,n)\r\n if g>n:\r\n break\r\n n-=g\r\n i+=1\r\nprint((i+1)%2)\r\n\r\n\r\n\r\n", "import math\r\n*arr,t=map(int,input().split())\r\ni=0\r\nwhile t>=0:\r\n\tt-=math.gcd(arr[i],t)\r\n\ti=1-i\r\nprint(i)", "[a, b, n] = list(map(int, input().split()))\r\n\r\ndef gcd(a, b):\r\n if a < b:\r\n iterator = a\r\n else:\r\n iterator = b\r\n\r\n while True:\r\n if a % iterator == 0 and b % iterator == 0:\r\n return iterator\r\n\r\n else:\r\n iterator -= 1\r\n\r\naturn = True\r\n\r\nwhile n:\r\n if aturn:\r\n n -= gcd(a, n)\r\n \r\n else:\r\n n -= gcd(b, n)\r\n \r\n aturn = not aturn\r\n\r\nif aturn:\r\n print('1')\r\nelse:\r\n print('0')", "ps = [0] * 2\r\nps[0], ps[1], n = [int(x) for x in input().split()]\r\n\r\ndef gcd(a, b):\r\n\ta, b = min(a, b), max(a, b)\r\n\tif a == 0:\r\n\t\treturn b\r\n\r\n\tif b % a == 0:\r\n\t\treturn a\r\n\r\n\tq = int(b / a)\r\n\tr = b - q * a\r\n\treturn gcd(a, r)\r\n\r\ni = 0\r\nwhile n >= 0:\r\n\tn -= gcd(ps[i], n)\r\n\ti = (i + 1) % 2\r\n\r\nprint(i)", "import math\r\na,b,n = map(int,input().split())\r\nflag = 0\r\nfor i in range(n):\r\n if(True):\r\n n = n - math.gcd(a,n)\r\n if(n == 0):\r\n flag = 0\r\n break\r\n if(True):\r\n n = n - math.gcd(b,n) \r\n if(n == 0):\r\n flag = 1\r\n break\r\nif(flag):\r\n print(1)\r\nelse:\r\n print(0) \r\n", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n a, b, n = multi_input()\r\n turn = 0\r\n ans = 0\r\n while n > 0:\r\n turn += 1\r\n if turn & 1:\r\n n -= math.gcd(n, a)\r\n ans = 0\r\n else:\r\n n -= math.gcd(n, b)\r\n ans = 1\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b,c=map(int,input().split())\r\ndef gcd(x,y):\r\n l1=list()\r\n for i in range(1,x+1):\r\n if x%i==0 and y%i==0:\r\n l1.append(i)\r\n m=max(l1)\r\n return(m) \r\nwhile c>0:\r\n hcf1=gcd(a,c)\r\n if hcf1>c:\r\n print(\"1\")\r\n break\r\n else:\r\n c=c-hcf1\r\n if c==0:\r\n print(\"0\")\r\n break\r\n else:\r\n hcf2=gcd(b,c)\r\n if hcf2 >c:\r\n print(\"0\")\r\n break\r\n else:\r\n c=c-hcf2\r\n if c==0:\r\n print(\"1\")\r\n break\r\n else:\r\n pass", "a,b,n = map(int,input().split())\r\n\r\n\r\ndef igra(player1, player2, pile):\r\n import math\r\n while pile > 0:\r\n pile -= math.gcd(player1, pile)\r\n if pile == 0:\r\n return 0\r\n pile -= math.gcd(player2, pile)\r\n if pile == 0:\r\n return 1\r\n\r\n\r\nprint(igra(a, b, n))\r\n", "import math\r\na, b, n = map(int, input().split())\r\nt = 0\r\ncount = 0\r\nwhile True:\r\n t += 1\r\n if t % 2 != 0:\r\n gcd = math.gcd(a, n)\r\n n -= gcd\r\n if gcd > n:\r\n count = 0\r\n break\r\n else:\r\n gcd = math.gcd(b, n)\r\n n -= gcd\r\n if gcd > n:\r\n count = 1\r\n break\r\nif count == 0:\r\n print(0)\r\nelse:\r\n print(1)", "a,b,s=map(int,input( ).split())\r\nwinner=2\r\nwhile s>0:\r\n i=1\r\n while i <= 1 :\r\n if a % s==0:\r\n g1 = s\r\n elif s % a==0:\r\n g1 = a\r\n else:\r\n g1 = 1\r\n s = s - g1\r\n if s==0:\r\n winner=0\r\n i += 1\r\n j = 1\r\n while j <= 1 and s>0:\r\n if b % s==0:\r\n g2 = s\r\n elif s % b==0:\r\n g2 = b\r\n else:\r\n g2 = 1\r\n s = s - g2\r\n if s==0:\r\n winner=1\r\n j += 1\r\nprint(winner)", "def gcd(n,stones):\r\n for i in range(n,0,-1):\r\n if stones%i==0 and n%i==0:\r\n return i\r\n return 0 \r\n\r\n\r\na,b,stones=map(int,input().split())\r\nwhile True:\r\n stones-=gcd(a,stones)\r\n if (stones == 0):\r\n print(0)\r\n break\r\n stones-=gcd(b,stones)\r\n if (stones == 0):\r\n print(1)\r\n break", "import math\r\na,b,n = map(int,input().split())\r\ncount = 1\r\nwhile n > 0:\r\n if count % 2 != 0:\r\n n = n - math.gcd(a,n)\r\n count += 1\r\n else:\r\n n = n - math.gcd(b,n)\r\n count += 1\r\nprint((count % 2))", "def 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 elif(a==1):\r\n return 1\r\n else:\r\n return gcd(b%a,a)\r\n\r\na,b,n=list(map(int,input().split()))\r\nturn=1\r\nsimon=0\r\nan=0\r\nwhile(n>0):\r\n if(turn%2!=0 and n>=gcd(a,n)):\r\n n=n-gcd(a,n)\r\n simon+=1\r\n turn+=1\r\n if(turn%2==0 and n>=gcd(b,n)):\r\n n=n-gcd(b,n)\r\n turn+=1\r\n an+=1\r\n\r\nif(simon>an):\r\n print(0)\r\nelse:\r\n print(1)\r\n\r\n \r\n\r\n\r\n\r\n", "a, b, n = map(int, input().split())\r\na1, b1, n1 = a, b, n\r\nwhile n1 >= 0:\r\n while n > 0:\r\n a, n = n, a % n\r\n if n1 - a < 0:\r\n print(1)\r\n break\r\n n1 = n1 - a\r\n n = n1\r\n a = a1\r\n while n > 0:\r\n b, n = n, b % n\r\n if n1 - b < 0:\r\n print(0)\r\n break\r\n n1 = n1 - b\r\n n = n1\r\n b = b1", "def gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b, a%b)\n\na,b,n = list(map(int,input().split()))\n\nturn = [a,b]\ni = 0\n\nwhile True:\n case = turn[i%2]\n if gcd(case, n) > n:\n print('0' if i%2 == 1 else '1')\n break\n else:\n n = n - gcd(case, n)\n i += 1", "import math\r\ndef f():\r\n a , b, n = map(int,input().split())\r\n i = 1\r\n while True:\r\n n = n - (math.gcd(a, n))\r\n if n <=0:\r\n print(\"0\");break\r\n n = n - (math.gcd(b,n))\r\n if n <=0:\r\n print(\"1\");break\r\nf()", "def gcd(x,y):\r\n if (x==y):\r\n return x\r\n if (x>y):\r\n return gcd(x-y,y)\r\n else:\r\n return gcd(x,y-x)\r\n\r\nif __name__==\"__main__\":\r\n l=[int(i) for i in input().split()]\r\n f=0\r\n a=l[0]\r\n b=l[1]\r\n n=l[2]\r\n while n!=0:\r\n n-=gcd(a,n)\r\n if n==0:\r\n f=1\r\n print(0)\r\n break\r\n n-=gcd(b,n)\r\n if f==0:\r\n print(1)", "import math\r\nx = str(input())\r\nlis = x.split()\r\nfor j in range(0, 3):\r\n lis[j] = int(lis[j])\r\n\r\nsimon = True\r\n\r\n\r\nwhile(lis[2] >= 0):\r\n if(simon):\r\n if(lis[2] - math.gcd(lis[0], lis[2]) < 0):\r\n print(1)\r\n break\r\n else:\r\n lis[2] -= math.gcd(lis[0], lis[2])\r\n simon = False\r\n else:\r\n if(lis[2] - math.gcd(lis[1], lis[2]) < 0):\r\n print(0)\r\n break\r\n else:\r\n lis[2] -= math.gcd(lis[1], lis[2])\r\n simon = True\r\n", "def gcd(a, b):\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef epicGame():\n a, b, n = map(int, input().strip().split())\n while True:\n #simon goes first\n if a > n:\n g = gcd(a, n)\n else:\n g = gcd(n, a)\n if n - g < 0:\n return \"1\"\n else:\n n -= g\n #antisimon goes next\n if b > n:\n g = gcd(b, n)\n else:\n g = gcd(n, b)\n if n - g < 0:\n return \"0\"\n else:\n n -= g\n\nprint (epicGame())", "def divisor(a, b):\r\n i = min(a, b)\r\n while a%i != 0 or b%i != 0:\r\n i = i-1\r\n return i\r\n\r\na, b, n = map(int, input().split())\r\nplayer = 0\r\nwhile True:\r\n if n == 0:\r\n player = (player == 0)\r\n break\r\n elif n < divisor((a, b)[player], n):\r\n player = (player == 0)\r\n break\r\n else:\r\n n = n-divisor((a, b)[player], n)\r\n player = (player == 0)\r\n\r\nprint(int(player))", "import sys\nimport math\n\na, b, n = map(int, input().split())\nc = 0\nwhile n != 0:\n if c % 2 == 0:\n n -= math.gcd(a, n)\n else:\n n -= math.gcd(b, n)\n c += 1\nprint(*[0 if c % 2 != 0 else 1]) # Ak je pocet tahov parny, vyhrava 1, inak 0\n\n", "a,b,n=map(int,input().split())\r\nN=n\r\nA=a\r\nB=b\r\nx=0\r\nwhile 0<n:\r\n while 0<n:\r\n C=a%n\r\n a=n\r\n n=C\r\n n=N-a\r\n N=n\r\n \r\n a=A\r\n x=x+1\r\n while 0<n:\r\n C=b%n\r\n b=n\r\n n=C\r\n n=N-b\r\n N=n\r\n \\\r\n b=B\r\n x=x+1\r\nif x%2==1 or n==0:\r\n print(1)\r\nelse:\r\n print(0)\r\n \r\n \r\n", "import math\r\na,b,c = map(int, input().split())\r\nd=0\r\nwhile(c!=0):\r\n d += 1\r\n if d%2 == 1:\r\n c -= math.gcd(a, c)\r\n elif d%2 == 0:\r\n c -= math.gcd(b, c)\r\nif d%2 == 1:\r\n print(\"0\")\r\nelif d%2 == 0 :\r\n print(\"1\")\r\n \r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[10]:\n\n\na,b,n=map(int,input().split())\n\ndef gcd(x,y):\n while y>0:\n x,y=y,x%y\n return x\ni=0\ntemp=0\nwhile n>temp:\n n=n-temp\n if i==0:\n temp=gcd(a,n)\n i=1\n else:\n temp=gcd(b,n)\n i=0\nif i==1:\n print(0)\nelse:\n print(1)\n\n\n# In[ ]:\n\n\n\n\n", "import math\r\na,b,n = map(int, input().split())\r\nst = True\r\nwhile n>0:\r\n if st:\r\n gcd = math.gcd(a,n)\r\n else:\r\n gcd = math.gcd(b,n)\r\n if gcd > n:\r\n break\r\n n -= gcd\r\n st = not st\r\nif st:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "from math import gcd\n\na,b,n = tuple(map(int, input().split(' ')))\n\ns = True\np = 0\nwhile n >= p:\n if s:\n p = gcd(a,n)\n else:\n p = gcd(b,n)\n \n n = n - p\n s = not s\n\nif s:\n print(1)\nelse:\n print(0)\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\na, b, n = map(int, input().split())\r\nans = 0\r\nwhile n:\r\n k = 0\r\n if ans == 0:\r\n k = _gcd_(n, a)\r\n else:\r\n k = _gcd_(n, b)\r\n n = max(0, n-k)\r\n if n:\r\n ans = not ans\r\n else:\r\n break\r\n\r\nprint(1 if ans else 0)\r\n", "def nod(a, b):\r\n while a!=0 and b!=0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a + b\r\n\r\na, b, n = list(map(int, input().split()))\r\nwhile(n >= 0):\r\n n = n - nod(a, n)\r\n if n == 0:\r\n print(0)\r\n quit()\r\n n = n - nod(b, n)\r\n if(n == 0):\r\n print(1)\r\n quit()", "import math\r\na,b,n=input().split()\r\na=int(a)\r\nb=int(b)\r\nn=int(n)\r\ni=1\r\nwhile(n>0):\r\n m=0\r\n if i%2!=0:\r\n m=math.gcd(a,n)\r\n n=n-m\r\n elif i%2==0:\r\n m=math.gcd(b,n)\r\n n=n-m\r\n\r\n i+=1\r\n\r\nif i%2==0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "import math\nx = (input().split())\na = int(x[0])\nb = int(x[1])\nc = int(x[2])\nfor i in range(100000000):\n if i%2==0:\n c-=math.gcd(c,a)\n else:\n c-=math.gcd(c,b)\n if c==0:\n print(i%2)\n break", "a,b,n = map(int,input().split())\r\ndef nod(x,y):\r\n while y!=0:\r\n x,y = y, x%y\r\n return x\r\n\r\nfor i in range(n):\r\n if i%2==0:\r\n n = n - nod(a,n)\r\n elif i%2 !=0:\r\n n = n - nod(b,n)\r\n if n==0 and i%2==0:\r\n count = 1\r\n elif n==0 and i%2!=0:\r\n count = 2\r\nif count==1:\r\n print(0)\r\nelif count==2:\r\n print(1)", "from math import gcd\r\na, b, n = map(int, input().split())\r\nans = 1\r\nwhile n > 0:\r\n ans = (ans + 1) % 2\r\n if ans:\r\n n -= gcd(n, b)\r\n else:\r\n n -= gcd(n, a)\r\nprint(ans)", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n elif b == 0:\r\n return a \r\n m = max(a, b)\r\n n = min(a, b)\r\n r = m % n\r\n while r > 0:\r\n m = n\r\n n = r\r\n r = m % n\r\n return n\r\n\r\n\r\nwhile True:\r\n x = gcd(a, n)\r\n if n < x:\r\n print(1)\r\n break\r\n n -= x\r\n y = gcd(b, n)\r\n if n < y:\r\n print(0)\r\n break\r\n n -= y\r\n", "\n[a,b,n] = [int(x) for x in input().split()]\n\ndef gcd(x, y):\n \"\"\"该函数返回两个数的最大公约数\"\"\"\n \n # 获取最小值\n a = min(x,y)\n b = max(x,y)\n for i in range(1,a+1):\n if((a % i == 0) and (b % i == 0)):\n gcd = i\n \n return gcd\n\nstep = 0\nwhile n > 0:\n step += 1\n n -= gcd(a,n)\n if n == 0:\n break\n else:\n step += 1\n n -= gcd(b,n)\n\nif step % 2==0:\n print('1')\nelse:\n print('0')\n", "def gcd(a, b):\r\n for i in range(min(a, b), 0, -1):\r\n if a % i == 0 and b % i == 0:\r\n return i\r\n return max(a, b)\r\n\r\na, b, n = map(int, input().split())\r\nturn = 0\r\nwhile True:\r\n if not turn:\r\n a_gcd = gcd(a, n)\r\n if a_gcd > n:\r\n break\r\n n -= a_gcd\r\n else:\r\n b_gcd = gcd(b, n)\r\n if b_gcd > n:\r\n break\r\n n -= b_gcd\r\n turn = not turn\r\nprint('1' if not turn else '0')", "import math\r\na, b, c =map(int, input().split())\r\nwin=0\r\nwhile True:\r\n if win:\r\n if math.gcd(c,b)<=c:\r\n c-=math.gcd(c,b)\r\n win=1-win\r\n else:\r\n break\r\n else:\r\n if math.gcd(c,a)<=c:\r\n c-=math.gcd(c,a)\r\n win=1-win\r\n else:\r\n break\r\nprint(1-win)", "a,b,n = map(int,input().split())\r\nflag = True\r\nwhile flag:\r\n for x in range(1,a+1)[::-1]:\r\n if a%x==0 and n%x==0 and (n-x)>=0:\r\n n-=x\r\n break\r\n else:\r\n print(1)\r\n flag = False\r\n break\r\n for y in range(1,b+1)[::-1]:\r\n if b%y==0 and n%y==0 and (n-x)>=0:\r\n n-=y\r\n break\r\n else:\r\n print(0)\r\n flag = False\r\n break", "from math import gcd\r\n\r\n*a, n = map(int, input().split())\r\ncounter = 0\r\nwhile n >= 0:\r\n n -= gcd(a[counter % 2], n)\r\n counter = 1 - counter\r\nprint(counter)", "def gcd(x, y): \r\n while(y):x, y = y, x % y \r\n return x\r\na, b, c = map(int, input().split())\r\nwhile 1:\r\n if gcd(a, c) > c:\r\n print(1)\r\n break\r\n c -= gcd(a, c)\r\n if gcd(b, c) > c:\r\n print(0)\r\n break\r\n c -= gcd(b, c)", "\"\"\"\r\nSolution to Codeforces Problem 119A : https://codeforces.com/problemset/problem/119/A\r\n\"\"\"\r\nimport math\r\n\r\n\r\ndef solve(a, b, n):\r\n while 0 < n:\r\n for ix, value in enumerate([a, b]):\r\n n -= math.gcd(value, n)\r\n if n == 0:\r\n print(ix)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve(*list(map(int, input().split(' '))))\r\n", "import math\r\nt = input().split(\" \")\r\na, b, n, c = int(t[0]), int(t[1]), int(t[2]), 0\r\nwhile n >= 0:\r\n n -= math.gcd(int(t[c % 2]), n)\r\n c = 1-c\r\nif c == 0:print(0)\r\nelse:print(1)", "import math\n\na,b,n = input().split()\na= int(a)\nb= int(b)\nn= int(n)\n\nflag = 0\ncheck =0\nwhile(flag==0):\n\tif check == 0:\n\t\tn = n - math.gcd(a,n)\n\t\tif n < 0:\n\t\t\tprint(1)\n\t\t\tflag = 1\n\t\tcheck = 1\n\telse:\n\t\tn = n - math.gcd(b,n)\n\t\tif n<0 :\n\t\t\tflag = 1\n\t\t\tprint(0)\n\t\tcheck = 0\n\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nimport math\r\n\r\na, b, n = list(map(int, input().split()))\r\nab = [a, b]\r\nturn = 0\r\nwhile True:\r\n g = math.gcd(ab[turn], n)\r\n if g <= n:\r\n n -= g\r\n else:\r\n print(1 - turn)\r\n break\r\n turn = 1 - turn\r\n", "from math import gcd\r\nj=0\r\na,b,c=map(int,input().split())\r\nwhile c!=0:\r\n c-=gcd(a,c)\r\n j+=1\r\n if c!=0:\r\n c-=gcd(b,c)\r\n j+=1\r\nif j%2==0:\r\n print(1)\r\nelse:\r\n print(0)", "def nod(x, y):\n if x < y:\n x, y = y, x\n while y != 0:\n d = y\n y = x % y\n x = d\n return x\n\n\na, b, n = map(int, input().split())\nwhile n != 0:\n n = n - nod(a, n)\n if n == 0:\n r = '0'\n print(r)\n break\n n -= nod(b, n)\n if n == 0:\n r = '1'\n print(r)\n break\n", "import math\r\n\r\n# n = int(input())\r\na,b,n = map(int,input().split())\r\nlost = False\r\nlose = -1\r\nwhile not lost:\r\n n -= math.gcd(a,n)\r\n if n < 0:\r\n lose = 0\r\n lost = True\r\n break\r\n n -= math.gcd(b,n)\r\n if n < 0:\r\n lose = 1\r\n lost = True\r\n\r\nprint( 1 - lose)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\na,b,n=map(int,input().split())\r\n\r\nflag=-1\r\nwhile True:\r\n if n>0:\r\n #print(\"an-=,an\",math.gcd(n,a),n)\r\n n=n-math.gcd(n,a)\r\n else:\r\n flag=1\r\n break\r\n if n>0:\r\n #print(\"bn-=,bn\",math.gcd(n,b),n)\r\n n=n-math.gcd(n,b)\r\n else:\r\n flag=0\r\n break\r\nprint(flag)", "import math\r\na,b,n = map(int,input().split())\r\ncount = 1\r\nwhile n >= 0:\r\n if count % 2 != 0:\r\n d = math.gcd(a,n)\r\n if n >= d:\r\n n -= d\r\n count += 1\r\n else:\r\n print(1)\r\n break\r\n if count % 2 == 0:\r\n d = math.gcd(b,n)\r\n if n >= d:\r\n n -= d\r\n count +=1\r\n else:\r\n print(0)\r\n break\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\na,b,n = get_int_list()\r\n\r\nturn = 0\r\nwhile True:\r\n if turn == 0:\r\n m = math.gcd(n,a)\r\n if n >= m:\r\n n -= m\r\n turn = 1\r\n else:\r\n print(1)\r\n break\r\n else:\r\n m = math.gcd(n,b)\r\n if n >= m:\r\n n -= m\r\n turn = 0\r\n else:\r\n print(0)\r\n break", "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(a,b,n)=map(int,input().split())\r\nf=0\r\nwhile n>0:\r\n n-=gcd(a,n)\r\n if(n<=0):\r\n f=0\r\n break\r\n n-=gcd(b,n)\r\n if(n<=0):\r\n f=1\r\n break\r\nprint(f)", "def gsd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gsd(b, a % b)\r\n\r\n\r\nlist1 = [int(x) for x in input().split(' ')]\r\nstone = 1e12\r\nwhile 1:\r\n #print(list1[0], list1[1], list1[2])\r\n if list1[2] - gsd(list1[0], list1[2]) >= 0:\r\n list1[2] -= gsd(list1[0], list1[2])\r\n else:\r\n print(1)\r\n break\r\n #print(list1[0], list1[1], list1[2])\r\n if list1[2] >= gsd(list1[1], list1[2]):\r\n list1[2] -= gsd(list1[1], list1[2])\r\n else:\r\n print(0)\r\n break\r\n", "import math\r\na,b,c=map(int,input().split());cnt=int(0);\r\nwhile True:\r\n if cnt==0:\r\n cnt=1;\r\n if math.gcd(a,c)<=c:\r\n c-=math.gcd(a,c)\r\n else:\r\n print(1)\r\n exit(0)\r\n else:\r\n cnt=0\r\n if(math.gcd(b,c)<=c):\r\n c-=math.gcd(b,c)\r\n else:\r\n print(0)\r\n exit(0)", "def gcd(a, b):\r\n while a!= 0 and b != 0:\r\n if a >b:\r\n a %= b\r\n else:\r\n b %= a\r\n return a + b\r\n\r\nnums = list(map(int, input().split()))\r\n\r\na = nums[0]\r\nb = nums[1]\r\nn = nums[2]\r\nturn = 1\r\n\r\nwhile n > 0:\r\n turn = 1 - turn\r\n\r\n if turn == 0:\r\n n -= gcd(n, a)\r\n else:\r\n n -= gcd(n, b)\r\n\r\n\r\nprint(turn)", "import math\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile math.gcd(a,n)<=n or math.gcd(b,n)<=n:\r\n if i%2==0:\r\n g=math.gcd(a,n)\r\n n=n-g\r\n else:\r\n g=math.gcd(b,n)\r\n n=n-g\r\n i=i+1\r\nif i%2==1:\r\n print(0)\r\nelse:\r\n print(1)", "a1=0\r\na,b,n=map(int,input().split())\r\ni=1\r\nc=n\r\nwhile i<=c:\r\n if a%n==0:\r\n g1=n\r\n elif n%a==0:\r\n g1=a\r\n else:\r\n g1=1\r\n if b%n==0:\r\n g2=n\r\n elif n%b==0:\r\n g2=b\r\n else:\r\n g2=1\r\n if i%2!=0:\r\n n=n-g1\r\n else:\r\n n=n-g2\r\n if n==0:\r\n a1=i\r\n i=i+99999\r\n i=i+1\r\nif a1%2==0:\r\n print('1')\r\nelse:\r\n print('0')", "a, b, n = map(int, input().split())\r\ncount = 0\r\nwhile n > 0:\r\n if count%2 == 0:\r\n m2, n2 = a, n\r\n else:\r\n m2, n2 = b, n\r\n while m2:\r\n n2, m2 = m2, n2%m2\r\n n -= n2\r\n count += 1\r\nif count%2 != 0:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "a, b, n = map(int, input().split())\r\n\r\ndef gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b, a%b)\r\n\r\ntemp2 = True\r\n\r\nwhile n>0:\r\n\tn -= gcd(a, n)\r\n\tif n <= 0:\r\n\t\ttemp2 = False\r\n\t\tbreak\r\n\tn -= gcd(b, n)\r\n\t\r\n\r\nif temp2 != True:\r\n print(0)\r\nelse: \r\n\tprint(1)\r\n\t\r\n\r\n", "from math import gcd\na,b,n = input().split(\" \")\na,b,n = int(a), int(b), int(n)\n\ncond = True\nturn = 0\nwhile cond:\n if turn == 0:\n if n > gcd(a, n):\n n -= gcd(a,n)\n turn = 1\n continue\n else:\n cond = False\n print(\"0\")\n else:\n if n > gcd(b, n):\n n -= gcd(b,n)\n turn = 0\n else:\n cond = False\n print(\"1\")", "from math import gcd\r\ninfo = input().split()\r\nnum1 = int(info[0])\r\nnum2 = int(info[1])\r\nnum3 = int(info[2])\r\n\r\ndef check(a, b, c, turn):\r\n if c - gcd(a, c) < 0 or c - gcd(b, c) < 0:\r\n if turn == 0:\r\n print(\"0\")\r\n if turn == 1:\r\n print(\"1\")\r\n quit()\r\n\r\nturn = 0\r\nwhile True:\r\n check(num1, num2, num3, turn)\r\n num3 -= gcd(num1, num3)\r\n turn = 0\r\n check(num1, num2, num3, turn)\r\n num3 -= gcd(num2, num3)\r\n turn = 1\r\n check(num1, num2, num3, turn)\r\n", "from math import gcd\r\na,b,n = map(int,input().split())\r\nwhile(True):\r\n\tr1 = gcd(a,n)\r\n\tif r1>n:\r\n\t\tprint(1)\r\n\t\tbreak\r\n\telse:\r\n\t\tn-=r1\r\n\tr2 = gcd(b,n)\r\n\tif r2>n:\r\n\t\tprint(0)\r\n\t\tbreak\r\n\telse:\r\n\t\tn-=r2\r\n", "def gcd(a,b):\r\n\twhile b != 0:\r\n\t\ta,b = b, a % b\r\n\treturn a\r\n\r\ndef solve():\r\n\ta,b,n = [int(x) for x in input().split()]\r\n\tk = 0\r\n\twhile n >= 0:\r\n\t\tk += 1\r\n\t\tif k & 1:\r\n\t\t\tn-= gcd(a,n)\r\n\t\telse:\r\n\t\t\tn -= gcd(b,n)\r\n\tif k & 1:\r\n\t\tprint (1)\r\n\telse:\r\n\t\tprint (0)\r\n\r\nsolve()", "import sys\r\nimport math\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\na, b, n= get_ints ()\r\nfor i in range (100):\r\n if i %2 == 0:\r\n n = n - (math.gcd (a, n))\r\n if n==0:\r\n print (0)\r\n break\r\n else:\r\n n = n - (math.gcd (b, n))\r\n if n == 0:\r\n print (1)\r\n break\r\n", "def gcda(a,n):\r\n\tif n == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcda(n,a%n)\r\ndef gcdb(b,n):\r\n\tif n == 0:\r\n\t\treturn b\r\n\telse:\r\n\t\treturn gcdb(n,b%n)\t\r\n\r\n\r\na,b,n = map(int,input().split())\r\nc = 0\r\nfor i in range(n):\r\n\tif i % 2 == 0:\r\n\t\tans = gcda(a,n)\r\n\t\tif n < ans:\r\n\t\t\tbreak\r\n\t\tc+=1\r\n\t\tn = n - ans\r\n\telse:\r\n\t\tans = gcdb(b,n)\r\n\t\tif n < ans:\r\n\t\t\tbreak\r\n\t\tc+=1\r\n\t\tn = n - ans\r\nif c % 2 == 0:\r\n\tprint(\"1\")\r\nelse:\r\n\tprint(\"0\")\r\n", "from math import *\r\na,b,n=map(int,input().split())\r\ns=0\r\nwhile (1):\r\n r=gcd(a,n)\r\n n-=r\r\n if(n==0):\r\n s=1\r\n break\r\n p=gcd(b,n)\r\n n-=p\r\n if (n==0):\r\n s=2\r\n break\r\nif s==1:\r\n print(\"0\")\r\nelif s==2:\r\n print(\"1\")", "import math\r\na,b,n=map(int,input().split())\r\ntemp=a\r\ncount=0\r\nwhile(1):\r\n\tif n>=(math.gcd(temp,n)):\r\n\t\tn=n-math.gcd(temp,n)\r\n\t\tcount=count+1\r\n\t\tif count%2==0:\r\n\t\t\ttemp=a\r\n\t\telse:\r\n\t\t\ttemp=b\r\n\telse:\r\n\t\tbreak\r\nif count%2==0:\r\n\tprint('1')\r\nelse:\r\n\tprint('0')", "import math\r\na,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nplayer=1\r\ngameend=0\r\nwhile gameend==0:\r\n if player==1:\r\n c-=math.gcd(c,a)\r\n if c<0:\r\n gameend=1\r\n player=2\r\n else:\r\n c-=math.gcd(c,b)\r\n if c<0:\r\n gameend=1\r\n player=1\r\nif player==1:\r\n print(0)\r\nelse:\r\n print(1)", "def nod(x, y):\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\n\r\na, b, n = map(int, input().split())\r\nmove = 0\r\nwhile n != 0:\r\n move += 1\r\n if move % 2 == 1:\r\n n -= nod(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n else:\r\n n -= nod(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\n", "def GCD(a,b):\n if b==0:\n return a\n return GCD(b,a%b)\n\na,b,c = [int(i) for i in input().split()]\ncheck = 0\ny = a\nwhile(c>0):\n x = GCD(y,c)\n if c-x>=0:\n c -= x\n if check==0:\n y=b\n check =1\n else:\n y=a\n check = 0\n\nif check:\n print('0')\nelse:\n print('1')", "def gcd(p,q):\r\n while p!= q:\r\n if p > q:\r\n p -=q\r\n else:\r\n q -= p\r\n return q\r\n\r\n\r\na,b,n = [int(x) for x in input().split()]\r\ncheck = 0\r\nwhile n > 0:\r\n if check % 2 == 0:\r\n n -= gcd(a,n)\r\n else:\r\n n -= gcd(b,n)\r\n check += 1\r\nif check % 2 == 0:\r\n print('1')\r\nelse:\r\n print('0')\r\n\r\n", "import math\r\n\r\na,b,n = list( map(int,input().split()) )\r\nt=1\r\nwhile True:\r\n if t==1:\r\n tmp = math.gcd(a,n)\r\n if tmp<=n:\r\n n-=tmp\r\n t=0\r\n else:\r\n break\r\n else:\r\n tmp = math.gcd(b,n)\r\n if tmp<=n:\r\n n-=tmp\r\n t=1\r\n else:\r\n break\r\nprint(t)", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef gcd(num1, num2):\r\n for i in range(min(num1, num2), 0, -1):\r\n if not num1 % i and not num2 % i:\r\n return i\r\n else:\r\n return 1\r\n\r\n\r\nwhile True:\r\n for turn in range(2):\r\n if not turn:\r\n current = a\r\n else:\r\n current = b\r\n if n < gcd(current, n):\r\n if not turn:\r\n print(1)\r\n else:\r\n print(0)\r\n exit()\r\n else:\r\n n -= gcd(current, n)\r\n", "# import sys\r\n\r\n\r\n\r\n# n, k = map(int, input().split())\r\n\r\n# if k>n:\r\n# print(\"No\")\r\n# sys.exit()\r\n\r\n\r\n\r\n# if k == 0:\r\n# if n == 0:\r\n# print(\"Yes\")\r\n# else:\r\n# print(\"No\")\r\n# sys.exit()\r\n\r\n# '''Print Numbers'''\r\n# if n % 2 == 0:\r\n# print(\"Yes\")\r\n\r\n\r\n\r\n# elif (n-1) % 2 == 0:\r\n# if k==1:\r\n# print(\"No\")\r\n# sys.exit()\r\n# print(\"Yes\")\r\n\r\n\r\n\r\n# else:\r\n# print(\"No\")\r\n\r\nfrom math import*\r\n\r\n\r\na,b,n=map(int, input().split())\r\n\r\n\r\nwhile True:\r\n if gcd(a,n)>n:\r\n print(1)\r\n break\r\n n=n-gcd(a,n)\r\n if gcd(b,n)>n:\r\n print(0)\r\n break\r\n n=n-gcd(b,n)\r\n", "def gcd(a,b):\r\n if b%a==0:\r\n return a\r\n return gcd(b%a,a)\r\na,b,n=map(int,input().split())\r\nwhile n:\r\n n-=gcd(a,n)\r\n if n:\r\n n-=gcd(b,n)\r\n if not n:\r\n print(1)\r\n break\r\n else:\r\n print(0)\r\n break\r\n", "import math\r\na,b,n=map(int,input().split())\r\nwhile True:\r\n x=math.gcd(a,n)\r\n n=n-x\r\n if(n==0):\r\n print(\"0\")\r\n break\r\n y=math.gcd(b,n)\r\n n=n-y\r\n if(n==0):\r\n print(\"1\")\r\n break", "import math\r\n\r\nab = [0, 0]\r\nab[0], ab[1], n = map(int, input().split())\r\npos = 0\r\nwhile True:\r\n m = math.gcd(ab[pos], n)\r\n pos = 1 - pos\r\n if m > n:\r\n print(pos)\r\n break\r\n n -= m\r\n", "a, b, n = map(int, input().split())\n\n\ndef maxCommonDivider(x, y):\n if y % x == 0:\n return x\n else:\n while y % x != 0:\n x, y = y % x, x\n return x\n\n\ndef logicGame(n, x, y):\n count = 0\n while n >= (maxCommonDivider(x, n)):\n n = n - (maxCommonDivider(x, n))\n count += 1\n x, y = y, x\n return count\n\n\ndef wins():\n if logicGame(n, a, b) % 2 != 0:\n print(0)\n else:\n print(1)\n\n\nwins()\n", "import math\r\na,b,n=map(int,input().split())\r\ncnt=0\r\nfor i in range(n):\r\n if math.gcd(a,n)<=n:\r\n cnt+=1\r\n n-=math.gcd(a,n)\r\n if math.gcd(b,n)<=n:\r\n cnt+=1\r\n n-=math.gcd(b,n)\r\nif cnt%2==0:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "x,y,z = input(\"\").split()\r\nx,y,z = int(x),int(y),int(z)\r\n\r\ndef mdc(a,b):\r\n while True:\r\n r = b % a\r\n b = a\r\n a = r\r\n if r == 0:\r\n break\r\n return b\r\n\r\nwhile True:\r\n b = mdc(x,z)\r\n z = z - b\r\n if z < 0:\r\n print(\"1\")\r\n break\r\n b = mdc(y,z)\r\n z = z - b\r\n if z < 0:\r\n print(\"0\")\r\n break\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\na,b,n = map(int,input().split())\r\nit = 0\r\nwhile n!=0:\r\n if it==0:\r\n n-=gcd(a,n)\r\n it=1\r\n else:\r\n n-=gcd(b,n)\r\n it = 0\r\n\r\nif it == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "import math\r\n*a,n=map(int,input().split())\r\ni=0\r\nwhile n>=0:\r\n\tn-=math.gcd(a[i],n)\r\n\ti=1-i\r\nprint(i)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-28 22:31:48\nLastEditTime: 2021-11-28 22:38:14\nDescription: Epic Game\nFilePath: CF119A.py\n'''\n\n\nfrom math import gcd\n\n\ndef func():\n a, b, n = map(int, input().strip().split())\n while n >= gcd(a, n):\n n = n - gcd(a, n)\n if n >= gcd(b, n):\n n = n - gcd(b, n)\n else:\n return 0\n else:\n return 1\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "import fractions as f\r\n*a,n=map(int,input().split());t=0\r\nwhile n>=0:\r\n n-=f.gcd(a[t%2],n)\r\n t=1-t\r\nprint(t)", "def dl(x,y):\r\n mn=min(x,y)\r\n mx=max(x,y)\r\n if mx%mn==0:\r\n return(mn)\r\n else:\r\n maxd0=int(mn**0.5)\r\n for i in reversed(range(1,maxd0+1)):\r\n if mn%i==0 and mx%i==0:\r\n return(i)\r\na,b,n=map(int, input().split())\r\n\r\nwhile n>0:\r\n och = 0\r\n n-=dl(a,n)\r\n if n>0:\r\n n-=dl(b,n)\r\n och=1\r\nprint(och)", "def gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a%b\r\n\treturn a\r\n\r\na, b, n = map(int, input().split())\r\n\r\nt = 0\r\nwhile True:\r\n\tt = 1-t\r\n\t\r\n\tif t:\r\n\t\tg = gcd(n, a)\r\n\t\tif n < g: break\r\n\t\tn -= g\r\n\t\r\n\telse:\r\n\t\tg = gcd(n, b)\r\n\t\tif n < g: break\r\n\t\tn -= g\r\nprint(t)", "import math\r\narr=list(map(int,input().strip().split()))\r\nx=arr[0]\r\ny=arr[1]\r\nn=arr[2]\r\nwhile n:\r\n a=math.gcd(x,n)\r\n\r\n if n-a>0:\r\n n=n-a\r\n b = math.gcd(y, n)\r\n if n-b>0:\r\n n=n-b\r\n elif n-b==0:\r\n print(1)\r\n break\r\n else:\r\n print(0)\r\n break\r\n elif n-a==0:\r\n print(0)\r\n break\r\n else:\r\n print(1)\r\n break", "import math\r\nSimon,AntiSimon,Heap=map(int,input().split())\r\nTurn = True\r\nwhile True:\r\n\tif Turn:\r\n\t\tif math.gcd(Simon,Heap) <= Heap:\r\n\t\t\tHeap-=math.gcd(Simon,Heap)\r\n\t\t\tTurn = False\r\n\t\telse:\r\n\t\t\tprint(\"1\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif math.gcd(AntiSimon,Heap) <= Heap:\r\n\t\t\tHeap-=math.gcd(AntiSimon,Heap)\r\n\t\t\tTurn = True\r\n\t\telse:\r\n\t\t\tprint(\"0\")\r\n\t\t\tbreak\r\n\t\t\r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n\r\n return gcd(b, a%b)\r\n\r\n\r\n\r\nc=0\r\ninp=input().split()\r\na=int(inp[0])\r\nb=int(inp[1])\r\nn=int(inp[2])\r\n\r\n\r\nwhile True:\r\n\r\n if c%2==0:\r\n r=gcd(n,a)\r\n if n-r>=0:\r\n n=n-r\r\n c=c+1\r\n else:\r\n break\r\n\r\n else:\r\n r=gcd(n,b)\r\n if n-r>=0:\r\n n=n-r\r\n c=c+1\r\n else:\r\n break\r\n\r\nif c%2==0:\r\n print(1)\r\nelse:\r\n print(0)\r\n\r\n", "import math\r\na,b,n=[int(x) for x in input().split()]\r\nwhile n!=0:\r\n a1=math.gcd(a,n)\r\n n=n-a1\r\n s='A'\r\n if n!=0:\r\n b1=math.gcd(b,n)\r\n n=n-b1\r\n s='B'\r\nif s=='A':\r\n print(0)\r\nelse:\r\n print(1)\r\n ", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\n\r\nsimon = 0\r\nanti = 0\r\ni = 1\r\nwinner = 1\r\nwhile n > 0:\r\n if i == 1:\r\n stone = gcd(n, a)\r\n n -= stone\r\n i = 2\r\n winner = 1\r\n else:\r\n stone = gcd(n, b)\r\n n -= stone\r\n i = 1\r\n winner = 0\r\n\r\nif winner == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "def gcd(a,b):\r\n if not a: return b\r\n if not b: return a\r\n return gcd(b, a%b)\r\na,b,n=map(int,input().split())\r\n\r\ncur = 1\r\nwhile True:\r\n if cur % 2 == 1:\r\n take = gcd(a, n)\r\n if n < take:\r\n print(1)\r\n break\r\n else: \r\n n -= take\r\n else:\r\n take = gcd(b,n)\r\n if n < take:\r\n print(0)\r\n break\r\n else:\r\n n -= take\r\n cur+=1\r\n \r\n \r\n ", "import math\r\na,b,c = list(map(int,input().split()))\r\ncount = 0\r\nflag = 0\r\nwhile c != 0:\r\n count += 1\r\n if count % 2 == 1:\r\n c = c - math.gcd(a,c)\r\n flag = 0\r\n else :\r\n c = c - math.gcd(b,c)\r\n flag = 1\r\nprint(flag)", "from math import gcd\n\na, b, n = map(int, input().split() )\nr = 0\nwhile n:\n r += 1\n n -= gcd(a, n) if r % 2 else gcd(b, n)\nprint(1 - r % 2)\n", "a,b,n=[int(x) for x in input().split()]\r\nmove=0\r\ndef fun2(a,b):\r\n while a != b:\r\n if a > b:\r\n a = a - b\r\n else:\r\n b = b - a\r\n return b\r\nwhile n!=0:\r\n if move%2==0:\r\n n-=fun2(a,n)\r\n move+=1\r\n else:\r\n n-=fun2(b,n)\r\n move+=1\r\nif move%2!=0:\r\n print(0)\r\nelse:\r\n print(1)", "def gcd(x,y):\r\n if y%x==0:\r\n return x;\r\n else:\r\n for i in range(1,x+1):\r\n if x%i==0 and y%i ==0:\r\n dv=i\r\n return dv\r\n\r\n\r\na,b,n=map(int,input().split())\r\ncnt=0\r\nwhile n:\r\n cnt+=1\r\n if cnt%2!=0:\r\n dv=gcd(a,n)\r\n n-=dv\r\n else:\r\n dv=gcd(b,n)\r\n n-=dv\r\nif cnt%2==0:\r\n print('1')\r\nelse:print('0')\r\n", "def gcd (x,y):\r\n m=[]\r\n if x!=0 and y!=0:\r\n for i in range(1, min(x, y) + 1):\r\n if x % i == 0 and y % i == 0:\r\n m.append(i)\r\n return max(m)\r\n else:\r\n return max(abs(x),abs(y))\r\na,b,n=map(int,input().split())\r\nt=n\r\ns=0\r\nfor i in range (0,t):\r\n n=n-gcd(a,n)\r\n if n<0:\r\n print(1)\r\n break\r\n\r\n n=n-gcd(b,n)\r\n if n<0:\r\n print(0)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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, n = map(int,input().split())\r\nA = a\r\nB = b\r\nN = n\r\nx = 0\r\nwhile n>0:\r\n while n>0:\r\n C=a%n\r\n a=n\r\n n=C\r\n n=N-a\r\n N=n\r\n a=A\r\n x+=1\r\n while n>0:\r\n C=b%n\r\n b=n\r\n n=C\r\n n=N-b\r\n N=n\r\n b=B\r\n x+=1\r\nif x%2==1 or n==0:\r\n print(1)\r\nelse:\r\n print(0)", "a, b, n = map(int, input().split())\r\nt1 = 0\r\nwhile n > 0:\r\n c1 = 0\r\n if t1 == 0:\r\n m = min(a, n)\r\n c = a\r\n t1 = 1\r\n else:\r\n m = min(b, n)\r\n c = b\r\n t1 = 0\r\n for i in range(1, m + 1):\r\n if c % i == 0 and n % i == 0:\r\n c1 = i\r\n n -= c1\r\nif t1 == 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "import sys\r\ndef gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n while b != 0:\r\n temp = a % b\r\n a = b\r\n b = temp\r\n return a\r\ninputs = sys.stdin.readline().split()\r\na = int(inputs[0])\r\nb = int(inputs[1])\r\nn = int(inputs[2])\r\nturn = 1 \r\nwhile True:\r\n if n == 0:\r\n print (turn)\r\n break\r\n if turn == 1:\r\n l = gcd(a, n)\r\n n -= l\r\n turn = 0\r\n else:\r\n l = gcd(b, n)\r\n n -= l\r\n turn = 1", "x,y,z=map(int, input().split())\r\nwhile True:\r\n for j in range(1,x+1):\r\n if x%j==0 and z%j==0:\r\n hcf=j\r\n if z<=0:\r\n \r\n print('1')\r\n break\r\n else:\r\n z=z-hcf\r\n for k in range(1,y+1):\r\n if y%k==0 and z%k==0:\r\n hcf2=k\r\n if z<=0:\r\n print('0')\r\n break\r\n \r\n else:\r\n z=z-hcf2", "a,b,n=map(int, input().split())\r\ndef nok(n,x):\r\n while n>0:\r\n n,x=x%n,n\r\n return x\r\nwhile True:\r\n n-=nok(n,a)\r\n if n<0:\r\n print(1)\r\n break\r\n n-=nok(n,b)\r\n if n<0:\r\n print(0)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from fractions import gcd\r\nv = list(map(int, input().split()))\r\nx = 0\r\nwhile v[2] != 0:\r\n v[2] -= gcd(v[2], v[x])\r\n x = 1 - x\r\nprint(1 - x)", "from math import gcd\r\n\r\na, b, n = map(int, input().split())\r\nt = 0\r\nwhile True:\r\n if t == 0:\r\n n -= gcd(a, n)\r\n t = 1\r\n else:\r\n n -= gcd(b, n)\r\n t = 0\r\n if n <= 0:\r\n break\r\nif t == 0:\r\n print(1)\r\nelse:\r\n print(0)", "import math\r\na,b,n=map(int,input().split())\r\nc=0\r\nwhile n>0:\r\n x=math.gcd(a,n)\r\n n-=x\r\n if n<=0:\r\n break\r\n x=math.gcd(b,n)\r\n n-=x\r\n if n<=0:\r\n c=1\r\n break\r\nprint(c)", "def gcd(m,n):\r\n\tif(m==0):\r\n\t\treturn n\r\n\telif(n==0):\r\n\t\treturn m\r\n\telse:\r\n\t\treturn(gcd(min(m,n),max(m,n)%min(m,n)))\r\n\r\na,b,n=map(int,input().strip().split())\r\nf=0\r\nwhile(n):\r\n\tif(f==0):\r\n\t\tn-=gcd(n,a)\r\n\t\tf=1\r\n\telif(f==1):\r\n\t\tn-=gcd(n,b)\r\n\t\tf=0\r\nif(f==0):\r\n\tprint(\"1\")\r\nelse:\r\n\tprint(\"0\")\r\n\r\n\r\n\r\n\r\n", "# coding: utf-8\r\n\r\ndef gcd (x, y):\r\n while y:\r\n x, y = y, x % y\r\n \r\n return x\r\n\r\na, b, n = map(int, input().split())\r\nturn = 0\r\n\r\nwhile True:\r\n if turn == 0:\r\n stones = gcd(a, n)\r\n \r\n else:\r\n stones = gcd(b, n)\r\n \r\n if stones > n:\r\n print(turn ^ 1)\r\n exit()\r\n \r\n else:\r\n n -= stones\r\n turn ^= 1", "def gcd(a,b):\r\n if(b==0): return a\r\n else: return gcd(b,a%b)\r\na,b,n=[int(_) for _ in input().split()]\r\nsimon=True\r\nwhile n>0:\r\n if simon:\r\n if gcd(a,n)==0: n-=1\r\n else: n-=gcd(a,n)\r\n simon=False\r\n else:\r\n if gcd(b,n)==0: n-=1\r\n else: n-=gcd(b,n)\r\n simon=True\r\nprint([0,1][simon])", "a, b, n=map(int, input().split())\r\ndef hcf1(x, y):\r\n global hcf\r\n m=min(x,y)\r\n for i in range(1,m+1):\r\n if x%i==0 and y%i==0:\r\n hcf=i\r\n return hcf\r\nwhile n>0:\r\n k=hcf1(a, n)\r\n n=n-k\r\n if n==0:\r\n print(\"0\")\r\n else :\r\n pass\r\n p=hcf1(b, n)\r\n n=n-p\r\n if n==0:\r\n print('1')\r\n else :\r\n pass\r\n continue", "a,b,n=map(int,input().split())\r\nwhile True:\r\n cd=[]\r\n for i in range(1,min(a,n)+1):\r\n if a%i==0 and n%i==0:\r\n cd.append(i)\r\n gcd=max(cd)\r\n if gcd <= n:\r\n n=n-gcd\r\n else:\r\n print(1)\r\n break\r\n if n==0:\r\n print(0)\r\n break\r\n cd=[]\r\n for i in range(1,min(b,n)+1):\r\n if b%i==0 and n%i==0:\r\n cd.append(i)\r\n gcd=max(cd)\r\n if gcd <= n:\r\n n=n-gcd\r\n else:\r\n print(0)\r\n break\r\n if n==0:\r\n print(1)\r\n break\r\n \r\n", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\ndef Simon(a, b, n):\r\n res = 0\r\n i = 0\r\n while gcd(a, n) <= n or gcd(b, n) <= n:\r\n #print(i)\r\n if i % 2 == 0:\r\n if gcd(a, n) <= n:\r\n n = n - gcd(a, n)\r\n else:\r\n break\r\n if i % 2 == 1:\r\n if gcd(b, n) <= n:\r\n n = n - gcd(b, n)\r\n else:\r\n break\r\n i = i + 1\r\n # print(n)\r\n if (i - 1) % 2 == 1:\r\n return 1\r\n else:\r\n return 0\r\na, b, n = input().split()\r\nprint(Simon(int(a), int(b), int(n)))", "from math import gcd\r\na,b,n=map(int,input().split())\r\ni=1\r\nwhile n>0:\r\n\tif i%2!=0:\r\n\t\tx=gcd(a,n)\r\n\t\tn-=x\r\n\telse:\r\n\t\tx=gcd(b,n)\r\n\t\tn-=x\r\n\ti+=1\r\nif i%2==0:\r\n\tprint(0)\r\nelse:\r\n\tprint(1)", "#code\r\na,b,k = map(int,input().split())\r\nans = 0\r\nwhile k >= 0:\r\n import math\r\n q = math.gcd(a,k)\r\n if q > k:\r\n print(1)\r\n break\r\n else:\r\n k = k - q\r\n q = math.gcd(b,k)\r\n if q > k:\r\n print(0)\r\n break\r\n else:\r\n k = k - q", "# Epic Game\nimport math\ndef simon(a, b, heap):\n flag = True\n while True:\n if (flag == True):\n val = math.gcd(a, heap)\n if (val <= heap):\n heap -= val\n else:\n return \"1\"\n flag = False\n elif(flag == False):\n val = math.gcd(b, heap)\n if (val <= heap):\n heap -= val\n else:\n return \"0\"\n flag = True\n\n\n\n\nx = list(map(int, input().rstrip().split()))\nprint(simon(x[0], x[1], x[2]))", "def nwd(a,b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\na, b, n = map(int, input().split())\r\nczy_a = True\r\nwhile True:\r\n if czy_a:\r\n wez = nwd(a, n)\r\n else:\r\n wez = nwd(b, n)\r\n czy_a = not czy_a\r\n if wez > n:\r\n break\r\n else:\r\n n -= wez\r\nif czy_a:\r\n print(0)\r\nelse:\r\n print(1)", "import math\r\na, b, n = map(int, input().split())\r\nok = True\r\nwhile n != 0:\r\n if ok:\r\n n -= math.gcd(a, n)\r\n else:\r\n n -= math.gcd(b, n)\r\n ok = not ok\r\nprint(1 if ok else 0)\r\n", "a, b, n=map(int, input().split())\r\nfor i in range(102):\r\n m=0\r\n if i%2==0:\r\n for j in range(1, min(a, n)+1):\r\n if a%j==0 and n%j==0:\r\n m=j\r\n else:\r\n for j in range(1, min(b, n)+1):\r\n if b%j==0 and n%j==0:\r\n m=j\r\n n=n-m\r\n if n==0:\r\n if i%2==0:\r\n print(0)\r\n else:\r\n print(1)\r\n break", "import math\r\na, b, n = map(int, input().split())\r\n\r\nwhile True:\r\n n -= math.gcd(a, n)\r\n if n < 0:\r\n print(\"1\")\r\n break\r\n n -= math.gcd(b, n)\r\n if n < 0:\r\n print(\"0\")\r\n break", "def gcd(x, y):\n if x == 0:\n return y\n elif y == 0:\n return x\n if x % y == 0:\n return y\n return gcd(y, x % y)\n\n\na, b, n = map(int, input().split())\n\nwhile True:\n _simon = gcd(a, n)\n if _simon > n:\n print(1)\n break\n\n n -= _simon\n \n _antisimon = gcd(b, n)\n if _antisimon > n:\n print(0)\n break\n n -= _antisimon\n", "#119A\r\n[a,b,n] = list(map(int,input().split()))\r\ndef gcd(x,y):\r\n p = max(x,y)\r\n q = min(x,y)\r\n r = p%q\r\n while r > 0:\r\n p = q\r\n q = r\r\n r = p%q\r\n return q\r\ni = -1\r\ncurn = n\r\nplayers = [a,b]\r\nwhile curn > 0:\r\n i+=1\r\n curp = players[i%2]\r\n curn -= gcd(curp,curn)\r\nprint(i%2)", "\r\ndef gcd(a, b):\r\n if(b == 0):\r\n return abs(a)\r\n else:\r\n return gcd(b, a % b)\r\na,b,n=map(int,input().split())\r\ni=0\r\nwhile n>0:\r\n if i%2==0:\r\n n-=gcd(a,n)\r\n else :\r\n n-=gcd(b,n)\r\n i+=1\r\nif i%2==0:\r\n print(1)\r\nelse :\r\n print(0)", "m = list(map(int,input().split(\" \")))\r\nheap = m[2]\r\n\r\ndef gcd(pa,heap):\r\n\tlool = True\r\n\th2 = heap \t\r\n\tnum_primos = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\r\n\tdiv = 1\r\n\twhile(lool):\t\r\n\t\tfor a in num_primos:\r\n\t\t\tif(pa // a == pa / a and heap //a == heap / a):\r\n\t\t\t\tpa/=a\r\n\t\t\t\tdiv*=a\r\n\t\t\t\theap/=a \r\n\t\t\t\tbreak\r\n\t\t\tif(a == 97):\r\n\t\t\t\tlool = False\r\n\treturn h2-div\t\t\r\nGameEnd = False\r\nc= 0 \r\nwhile(not GameEnd):\r\n\theap = gcd(m[c%2], heap)\r\n\t\r\n\tif(heap == 0):\r\n\t\tprint(c%2)\r\n\t\tGameEnd = True\r\n\tc+=1", "from math import gcd\r\na,b,c=map(int,input().split())\r\nm=0\r\nwhile c>0:\r\n k=gcd(a,c)\r\n c=c-k\r\n m+=1\r\n if c>0:\r\n j=gcd(b,c)\r\n c=c-j\r\n m+=1\r\nif m%2==0:\r\n print('1')\r\nelse:\r\n print('0')\r\n", "import collections\r\nfrom math import gcd\r\nfrom collections import *\r\nfrom itertools import permutations\r\nmod = 1000000007\r\ndef main():\r\n a,b,n = map(int, input().split())\r\n c = 0\r\n while n > 0:\r\n if c%2==0:\r\n n -= gcd(a,n)\r\n c += 1\r\n else:\r\n n -= gcd(b,n)\r\n c += 1\r\n print((c+1)%2)\r\n\r\n # test = int(input())\r\n # for _ in range(test):\r\n # n = int(input())\r\n # print(2, n-1)\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\ns, a, n = map(int, input().split())\r\nz = 1\r\nx = s\r\ny = 0\r\nwhile n >= math.gcd(x, n):\r\n if z == 1:\r\n x = s\r\n y = 0\r\n else:\r\n x = a\r\n y = 1\r\n n -= math.gcd(x, n)\r\n z=z*-1\r\n \r\nprint(y)", "def gcd(num1, num2):\r\n while num2 != 0:\r\n num1, num2 = num2, num1 % num2\r\n return num1\r\n\r\n\r\ndef epic_game(n_s, n_as, ston):\r\n while ston != 0:\r\n ston = ston - gcd(ston, n_s)\r\n if ston == 0:\r\n return 0\r\n ston = ston - gcd(ston, n_as)\r\n if ston == 0:\r\n return 1\r\n\r\n\r\n[num_s, num_as, stons] = map(int, input().split(' '))\r\nprint(epic_game(num_s, num_as, stons))", "import math\r\nx = [int(x) for x in input().split()]\r\ncount = 0\r\nwhile(x[-1] > 0):\r\n x[-1] = x[-1] - math.gcd(x[0] , x[-1])\r\n count = count + 1\r\n if x[-1] != 0:\r\n x[-1] = x[-1] - math.gcd(x[1] , x[-1])\r\n count = count + 1\r\n \r\n \r\nif count % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)\r\n \r\n", "s, a, kamni = map(int, input().split())\r\nhod = 1\r\n\r\n\r\ndef nod(x, y):\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\nwhile kamni != 0:\r\n if hod % 2 != 0:\r\n kamni -= nod(s, kamni)\r\n hod += 1\r\n else:\r\n kamni -= nod(a, kamni)\r\n hod += 1\r\n\r\nif hod % 2 == 0:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "def gcd(m, n):\r\n while n:\r\n m, n = n, m % n\r\n return m\r\n\r\na, b, n = map(int, input().split())\r\nwhile True:\r\n n -= gcd(a, n)\r\n if n == 0:\r\n print(0)\r\n break\r\n n -= gcd(b, n)\r\n if n == 0:\r\n print(1)\r\n break\r\n", "import math\n\na, b, n = map(int, input().split())\n\ndiv = [a, b]\ncnt = 0\nwhile True:\n gcd = math.gcd(div[cnt % 2], n)\n if n < gcd:\n print((cnt + 1) % 2)\n break\n else:\n n -= gcd\n cnt += 1\n", "def gcd(n,m):\r\n\tx= min(n,m)\r\n\tif x==0:\r\n\t\treturn max(n,m)\r\n\tfor i in range(x,0,-1):\r\n\t\tif n%i ==0 and m%i == 0:\r\n\t\t\treturn i\r\n\r\na,b,c = map(int,input().split())\r\ni = 1\r\nwhile i:\r\n\tif i%2 == 1:\r\n\t\tx= gcd(a,c)\r\n\t\tif x<=c:\r\n\t\t\tc-=x\r\n\t\telse:\r\n\t\t\tprint (\"1\")\r\n\t\t\tbreak\r\n\t\ti+=1\r\n\telse:\r\n\t\tx = gcd(b,c)\r\n\t\tif x<=c:\r\n\t\t\tc-=x\r\n\t\telse:\r\n\t\t\tprint (\"0\")\r\n\t\t\tbreak\r\n\t\ti+=1", "import math\r\n\r\narr = input().split()\r\na = int(arr[0])\r\nb = int(arr[1])\r\nn = int(arr[2])\r\nans = 1\r\nwhile n > 0:\r\n n -= math.gcd(a, n)\r\n if n == 0:\r\n ans = 0\r\n else:\r\n n -= math.gcd(b, n)\r\nprint(ans)", "k=input().split(\" \")\r\na=int(k[0])\r\nb=int(k[1])\r\nn=int(k[2])\r\ndef gcd(x,y):\r\n for i in range(1,max(x,y)+1):\r\n if (x%i==0) and (y%i==0):\r\n greatest=i\r\n return greatest\r\nwhile(n>=0):\r\n f=gcd(a,n)\r\n n=n-f\r\n if n<0:\r\n print(1)\r\n exit()\r\n f=gcd(b,n)\r\n n=n-f\r\n if n<0:\r\n print(0)\r\n exit()\r\n\r\n", "a,b,n=map(int,input().split())\r\ndef f(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn f(b,a%b)\r\nx,y=0,0\r\nwhile n>=0:\r\n\t\r\n\tx=f(a,n)\r\n\ty=0\r\n\tn-=x\r\n\tif n==0:\r\n\t\tprint(y)\r\n\t\tbreak\r\n\tx=f(b,n)\r\n\ty=1\r\n\tn-=x\r\n\tif n==0:\r\n\t\tprint(y)\r\n\t\tbreak", "a, b, n = map(int, input().split())\r\n\r\n# Функция для нахождения наибольшего общего делителя двух чисел\r\ndef gcd(x, y):\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y, x % y)\r\n\r\n# Игровой процесс\r\nwhile n > 0:\r\n if gcd(a, n) <= n:\r\n n -= gcd(a, n)\r\n else:\r\n print(1)\r\n break\r\n \r\n if gcd(b, n) <= n:\r\n n -= gcd(b, n)\r\n else:\r\n print(0)\r\n break\r\nelse:\r\n print(1)\r\n", "a,b,n = map(int,input().split())\r\ni=1\r\nval=0\r\nimport math\r\nwhile(n>=0):\r\n if(i%2==1):\r\n p=math.gcd(a,n)\r\n val=1\r\n else:\r\n p=math.gcd(b,n)\r\n val=0\r\n i+=1\r\n if(p>n):\r\n print(val)\r\n break\r\n else:\r\n n=n-p", "# A. Epic Game\r\nimport math\r\n\r\nlista = [int(x) for x in input().split(' ')]\r\na = lista[0]\r\nb = lista[1]\r\nn = lista[2]\r\ni = 1\r\nwhile (True):\r\n if n == 0:\r\n if i % 2 == 0:\r\n print(0)\r\n else:\r\n print(1)\r\n break\r\n if i % 2 != 0:\r\n x = math.gcd(a, n)\r\n n -= x\r\n else:\r\n x = math.gcd(b, n)\r\n n -= x\r\n i += 1\r\n\r\n", "a,b,c=map(int,input().split())\r\ndef gcd(a,b):\r\n if a<b:\r\n a,b=b,a\r\n while b!=0:\r\n temp=a\r\n a=b\r\n b=temp%b\r\n return a\r\nwhile c!=0:\r\n k=gcd(a,c)\r\n c=c-k\r\n p=0\r\n if c>0:\r\n k1=gcd(b,c)\r\n c=c-k1\r\n p=1\r\nprint(p)", "import math\r\n\r\n\r\ndef driver(x, y, z):\r\n i = 2\r\n while z > 0:\r\n if i % 2 == 0:\r\n if math.gcd(x, z) < z:\r\n z -= math.gcd(x, z)\r\n else:\r\n print(\"0\")\r\n return\r\n else:\r\n if math.gcd(y, z) < z:\r\n z -= math.gcd(y, z)\r\n else:\r\n print(\"1\")\r\n return\r\n i += 1\r\n\r\n\r\ndef main():\r\n p = [int(x) for x in input().split()]\r\n driver(p[0], p[1], p[2])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def gcd(x, y):\r\n while y != 0:\r\n (x, y) = (y, x % y)\r\n return x\r\na,b,n = [int(i) for i in input().split()]\r\nturn = 1\r\nwhile n:\r\n n -= gcd(n, a)\r\n a,b = b,a\r\n turn = not turn\r\nprint(int(turn))", "a,b,n=map(int,input().split())\r\na1=a #В цикле переменная меняет значения, использовал a=a1(b=b1, n=n1)для возврата исх. значения.\r\nb1=b \r\nn1=n \r\nwhile n1>=0: \r\n \r\n while n>0:\r\n a,n=n,a%n\r\n if n1-a<0:\r\n print(1)\r\n break\r\n n1=n1-a\r\n n=n1\r\n a=a1\r\n while n>0:\r\n b,n=n,b%n\r\n if n1-b<0:\r\n print(0)\r\n break\r\n n1=n1-b\r\n n=n1\r\n b=b1\r\n", "def gcd(a,b):\r\n if(b == 0):\r\n\t return a\r\n return gcd(b, a%b)\r\ndef solve(a,b,n):\r\n turn = 0\r\n while(True):\r\n if(turn%2==0):\r\n toPick = gcd(a,n)\r\n if(n>=toPick):\r\n n-=toPick\r\n else:\r\n return 1 \r\n else:\r\n toPick = gcd(b,n)\r\n if(n>=toPick):\r\n n-=toPick\r\n else:\r\n return 0 \r\n turn+=1\r\n \r\ninputs = input()\r\na = int(inputs.split(\" \")[0])\r\nb = int(inputs.split(\" \")[1])\r\nn = int(inputs.split(\" \")[2])\r\nprint(solve(a,b,n))", "def gcd(x,y):\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y,x % y)\r\n\r\nif __name__ == \"__main__\":\r\n a,b,n = map(int, input().split())\r\n\r\n i = 0\r\n while(n >= 0):\r\n if i % 2 == 0:\r\n n -= gcd(max(a, n),min(a, n))\r\n else:\r\n n -= gcd(max(b,n), min(b, n))\r\n i += 1\r\n \r\n print(i % 2)", "from collections import Counter\r\n\r\ndef gcd(a,b):\r\n if a==0:\r\n return b\r\n if b==0:\r\n return a\r\n if a==b:\r\n return a\r\n if a>b:\r\n return gcd(b,a-b)\r\n\r\n return gcd(a,b-a)\r\n\r\ndef solve():\r\n a,b,n=list(map(int,input().split()))\r\n i=0\r\n\r\n while(1):\r\n if i%2==0:\r\n need=gcd(a,n)\r\n if need<=n:\r\n n-=need\r\n else:\r\n return 1\r\n else:\r\n need=gcd(b,n)\r\n if need<=n:\r\n n-=need\r\n else:\r\n return 0\r\n i+=1\r\n\r\nprint(solve())", "def gcd(x,y):\r\n if x>y:\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\n else:\r\n if x == 0:\r\n return y\r\n else:\r\n return gcd(x,y%x)\r\n\r\narr = list(map(int,input().strip().split()))[:3]\r\na = arr[0]\r\nb = arr[1]\r\nn = arr[2]\r\ntemp = n\r\ni = 0\r\nwhile True:\r\n if i%2 == 0:\r\n take = gcd(a,temp)\r\n if take > temp:\r\n print(1)\r\n break\r\n temp -= take\r\n else:\r\n take = gcd(b,temp)\r\n if take > temp:\r\n print(0)\r\n break\r\n temp -= take\r\n i += 1", "from math import gcd\r\na,b,n=map(int,input().split())\r\nans=1\r\nwhile 1:\r\n if ans%2:\r\n g=gcd(a,n)\r\n if g>n:break\r\n n-=g\r\n else:\r\n g=gcd(b,n)\r\n if g>n:break\r\n n-=g\r\n ans+=1\r\nprint(ans%2)", "from math import gcd\r\n\r\nclass Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ta, b, n = map(int, input().split())\r\n\t\tturn = 0\r\n\t\t\t\r\n\t\twhile n > 0:\r\n\t\t\tif turn % 2 == 0:\r\n\t\t\t\tn -= gcd(a, n)\r\n\t\t\telse:\r\n\t\t\t\tn -= gcd(b, n)\r\n\r\n\t\t\tif n == 0:\r\n\t\t\t\tprint(turn % 2)\r\n\t\t\t\treturn\r\n\r\n\t\t\tturn += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n" ]

[ "def get_pos(curr, strength_left, arrow):\n l = curr\n h = n - 1\n\n while (l < h):\n m = (l + h) // 2\n strength_req = strength[m] - strength[curr] + strength_left\n if strength_req > arrow:\n h = m\n elif strength_req == arrow:\n return m\n else:\n if m == n - 1:\n return m\n l = m + 1\n\n return l\n\n\nn, minutes = map(int, input().split())\nstrength = [int(x) for x in input().split()]\narrows = [int(x) for x in input().split()]\nres = [0] * minutes\n\nfor i in range(1, n):\n strength[i] = strength[i] + strength[i - 1]\n\ncurr = 0\nstrength_left = strength[0]\n\nfor i in range(minutes):\n arrow = arrows[i]\n new_pos = get_pos(curr, strength_left, arrow)\n\n temp = strength[new_pos] - strength[curr] + strength_left\n\n if temp > arrow:\n curr = new_pos\n strength_left = temp - arrow\n res[i] = n - curr\n else:\n curr = (new_pos + 1) % n\n if curr:\n strength_left = strength[curr] - strength[curr - 1]\n else:\n strength_left = strength[curr]\n res[i] = n - curr\n\nprint(*res, sep='\\n')\n\t\t \t\t \t\t\t\t \t\t \t\t \t\t \t \t\t\t", "from bisect import bisect_right\r\ndef bs(s,x):\r\n return bisect_right(s,x)\r\n\r\nn,q=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\ns=[0]\r\nfor i in range(n):\r\n s.append(s[i]+l[i])\r\n\r\np=0\r\nfor i in range(q):\r\n x=bs(s,(k[i]+p))\r\n p=p+k[i]\r\n if x==n+1:\r\n print(n)\r\n p=0\r\n else:\r\n print(n-x+1)", "from bisect import bisect_right\n\nn,q = map(int, input().split())\na = list(map(int, input().split()))\nzzz = 1\nk = list(map(int, input().split()))\n \nfor i in range(1,n):\n a[i] = a[i] + a[i-1]\n \ncc=0\n\nfor i in k:\n cc += i\n t = bisect_right(a, cc)\n \n if n!=t:\n print(n-t)\n else:\n print(n)\n cc=0\n\n\t \t\t \t \t\t\t\t \t\t\t\t\t\t\t\t\t \t\t\t \t\t", "import bisect\r\nimport math\r\n# libraries\r\n\r\nn, m = map(int, input().split())\r\nalpha = list(map(int, input().split()))\r\nfor i in range(1, len(alpha)):\r\n alpha[i] += alpha[i - 1]\r\nk = list(map(int, input().split()))\r\n \r\nksum = 0\r\nfor ki in k:\r\n ksum += ki\r\n i = bisect.bisect_left(alpha, ksum)\r\n if i < n and alpha[i] == ksum:\r\n i += 1\r\n if n == i:\r\n ksum = 0\r\n print(n)\r\n else:\r\n print(n - i)", "import bisect\r\nn,q = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nsurplus = 0\r\nfor i in range(q):\r\n pos = bisect.bisect_right(a,b[i]+surplus)\r\n if pos>=n:\r\n pos = 0\r\n surplus = 0\r\n else:\r\n surplus+= b[i]\r\n print(n-pos)\r\n", "def bsfg(n, arr, hi=None, lo=0):\n if hi is None:\n hi = len(arr)\n if not arr:\n return None\n mid = (hi + lo) // 2\n if arr[mid] > n >= arr[mid - 1]:\n return mid\n if mid == lo or hi == mid:\n return None\n if arr[mid] > n:\n return bsfg(n, arr, mid, lo)\n return bsfg(n, arr, hi, mid)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n sarr = list(map(int, input().split()))\n harr = list(map(int, input().split()))\n\n for i in range(1, n):\n sarr[i] += sarr[i - 1]\n\n for i in range(1, q):\n tmp = harr[i] + harr[i - 1]\n harr[i] = tmp if harr[i - 1] < sarr[-1] else harr[i]\n\n for h in harr:\n rez = bsfg(h, sarr)\n print(n -rez if rez else n)", "import bisect\r\nn,q=map(int,input().split())\r\nstrength=list(map(int,input().split()))\r\narrows=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n strength[i]+=strength[i-1]\r\nNo_arrows=0\r\nn-=1\r\nfor i in range(q):\r\n No_arrows+=arrows[i]\r\n if(No_arrows>=strength[-1]):\r\n No_arrows=0\r\n print(n+1)\r\n else:\r\n it=bisect.bisect_left(strength,No_arrows)\r\n if(strength[it]==No_arrows):\r\n print(n-it)\r\n else:\r\n print(n-it+1)\r\n", "import bisect\r\nfrom itertools import accumulate\r\nn,q=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\na=list(accumulate(a))\r\ns=0\r\nb = [int(x) for x in input().split()]\r\nfor x in b:\r\n s+=x\r\n if s>=a[-1]:\r\n print (n)\r\n s=0\r\n else:\r\n print (n-bisect.bisect(a,s))", "def next(A,n, x):\r\n l = 0\r\n r = n-1\r\n p = -1\r\n while l <= r:\r\n m = (l+r)//2\r\n\r\n\r\n if A[m] <= x:\r\n l = m+1\r\n else:\r\n p = m\r\n r = m-1\r\n return p\r\n\r\n\r\nN, Q = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nP = []\r\nP.append(A[0])\r\n\r\nfor i in range(1, N):\r\n P.append(P[i-1] + A[i])\r\n\r\nsoldiers = P[-1]\r\narrows = 0\r\n\r\n\r\nfor q in range(Q):\r\n\r\n arrows += B[q]\r\n if arrows >= soldiers:\r\n arrows = 0\r\n print(N)\r\n else:\r\n ind = next(P, N, arrows)\r\n print(N- ind)\r\n\r\n\r\n\r\n", "from math import *\r\nfrom bisect import *\r\nfrom collections import Counter,defaultdict,deque\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\nfor _ in range(1):\r\n n,q=M()\r\n a=LI()\r\n b=LI()\r\n c=0;d=[]\r\n for i in range(n):\r\n c+=a[i]\r\n d+=[c]\r\n c=d[-1];e=0\r\n for i in range(q):\r\n e+=b[i]\r\n if e>=c:print(n);e=0\r\n else:print(n-bisect_right(d,e))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 bisect import bisect as bs\nfrom itertools import accumulate as ac\nrd = lambda: map(int, input().split())\nn, q = rd()\nA, k = rd(), rd()\na = list(ac(A))\nd = 0\nfor i in range(q):\n d += next(k)\n j = bs(a, d)\n if j == n:\n d = 0\n j = 0\n print(n - j)\n", "from bisect import bisect_right\nn,q=map(int,input().split())\na=list(map(int,input().split()))\nk=list(map(int,input().split()))\nfor i in range(1, n):\n a[i]+=a[i-1]\nc=0\nfor i in k:\n\tc+=i\n\tt=bisect_right(a,c)\n\tif n!=t: print(n-t)\n\telse:\n\t\tprint(n)\n\t\tc=0\n\t \t\t \t\t\t\t \t\t\t\t\t \t\t\t\t\t\t\t\t\t\t \t", "n,q=map(int,input().split())\r\na=tuple(map(int,input().split()))\r\nk=tuple(map(int,input().split()))\r\nfrom bisect import *\r\nfrom itertools import accumulate as ac\r\nac_a=tuple(ac(a))\r\nallkill=0\r\nt=[]\r\nap=t.append\r\nfor i in ac(k):\r\n killed=bisect(ac_a,i-allkill)\r\n if killed==n:\r\n allkill=i\r\n ap(n)\r\n else:\r\n ap(n-killed)\r\nprint('\\n'.join(map(str,t)))", "n, q = map(int, input().split())\nA = list(map(int, input().split()))\nK = list(map(int, input().split()))\nfrom itertools import accumulate\nC = [0]+A\nC = list(accumulate(C))\ntotal = 0\nans = [0]*q\nimport bisect\nfor i, k in enumerate(K):\n total += k\n j = bisect.bisect_right(C, total)\n if j != n+1:\n ans[i] = n-(j-1)\n else:\n ans[i] = n\n total = 0\nprint(*ans, sep='\\n')\n", "import bisect\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\np=[0]*n\r\nfor i in range(len(l)):\r\n p[i]=p[i-1]+l[i]\r\nc=0\r\nf=0\r\nfor i in range(len(k)):\r\n x=k[i]+c+f\r\n a=bisect.bisect(p,x)\r\n #print(k[i],x,a,c,f)\r\n if(a<=len(l)-1):\r\n c=p[a-1]\r\n f=x-p[a-1]\r\n print(len(l)-a)\r\n else:\r\n f=0\r\n c=0\r\n print(len(l))\r\n ", "from itertools import accumulate\nfrom bisect import bisect_right\nimport sys\n\nn, q = map(int, sys.stdin.readline().split())\na = list(map(int, sys.stdin.readline().split()))\nk = list(map(int, sys.stdin.readline().split()))\n\ns = list(accumulate(a))\n\nsofar = 0\nfor x in k:\n sofar += x\n if sofar >= s[-1]:\n sofar = 0\n sys.stdout.write(str(n - bisect_right(s, sofar)) + '\\n')\n", "from bisect import bisect_left\r\n\r\nn, q = list(map(int, input().split(' ')))\r\n\r\np = list(map(int, input().split(' ')))\r\nk = list(map(int, input().split(' ')))\r\n\r\nx = [0] * (n+1)\r\ny = [0] * (n+1)\r\nsum = 0\r\nfor i in range(n):\r\n\tx[i] = sum\r\n\ty[i] = n - i\r\n\tsum += p[i]\r\nx[n] = sum\r\ny[n] = 0\r\n\r\natt = 0\r\nfor i in range(q):\r\n\tatt += k[i]\r\n\t\r\n\tid = bisect_left(x, att+0.01)-1\r\n\t\r\n\tif y[id] == 0:\r\n\t\tatt = 0\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(y[id])\r\n\t\r\n\t\r\n\t\r\n\t", "from bisect import bisect\nn,q=map(int,input().split())\na=list(map(int,input().split()))\na.reverse()\ns=sum(a)\nfor i in range(1,n):\n\ta[i]+=a[i-1]\nk=list(map(int,input().split()))\ntmp=0\nfor i in range(q):\n\ttmp+=k[i]\n\tif tmp>=s: tmp=0\n\tprint(bisect(a,s-tmp-1)+1)\n\t\t\t\t\t\t\t\t \t \t\t \t\t \t\t\t \t\t\t \t\t", "from bisect import bisect\r\n\r\nn, q = map(int, input().split(\" \"))\r\nstrengths = [int(i) for i in input().split(\" \")]\r\narrows = [int(i) for i in input().split(\" \")]\r\n\r\nsums = [strengths[0]]\r\nfor strength in strengths[1:]:\r\n sums.append(sums[-1] + strength)\r\n\r\ncurrent = 0\r\nfor arrow in arrows:\r\n current += arrow\r\n if current >= sums[-1]:\r\n current = 0\r\n print(n - bisect(sums, current))", "import bisect\n\nn, q = map(int, input().split())\n\nstrength = list(map(int, input().split()))\narrows = [int(x) for x in input().split()]\ncum = [0] * (n+1)\n\nfor i in range(1, n+1):\n cum[i] = cum[i-1] + strength[i-1]\n\nlast = 0\nfor x in arrows:\n x += last\n \n ind = bisect.bisect_right(cum, x)\n if ind > n:\n last = 0\n print(n)\n continue\n \n alive = n - ind + 1\n last = x\n print(alive)\n\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t \t", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef binsearch(strlist, health):\n #print('binhealth',health)\n l = 0\n r = len(strlist) - 1\n ans = None\n while l <= r:\n m = (l + r) // 2\n if strlist[m][0] <= health:\n ans = m\n l = m + 1\n else:\n r = m - 1\n\n\n return strlist[ans][1]\n\n\ndef solve(n, q, strengths, orders):\n\n totalstrength = sum(strengths)\n curs = totalstrength\n strlist = [(totalstrength - strengths[0] + 1, len(strengths))]\n for i in range(1, len(strengths)):\n strlist.append((strlist[-1][0] - strengths[i], strlist[-1][1] - 1))\n\n strlist.sort()\n #print(strlist)\n health = totalstrength\n for q in orders:\n health -= q\n #print('health', health)\n if health <= 0:\n health = totalstrength\n print(n)\n else:\n print(binsearch(strlist, health))\n\n #print(strlist)\n\n\ndef readinput():\n n, q = getInts()\n strengths = list(getInts())\n orders = list(getInts())\n solve(n, q, strengths, orders)\n\n\nreadinput()\n", "import bisect\r\nn,q=map(int, input().split())\r\nstrenght=[i for i in map(int, input().split())]\r\narrows=[i for i in map(int, input().split())]\r\ncumul=[]\r\ns=0\r\nfor i in strenght:\r\n s+=i\r\n cumul.append(s)\r\ndamage=0\r\n\r\nfor j in arrows:\r\n damage+=j\r\n if damage>=cumul[n-1]:\r\n damage=0\r\n print(n,end='\\n')\r\n else:\r\n i=bisect.bisect(cumul,damage)\r\n print(n-i,end=\"\\n\")", "import bisect\r\nif __name__ == '__main__':\r\n\tn,q = map(int, input().split())\r\n\tl = list(map(int, input().split()))\r\n\tk = list(map(int, input().split()))\r\n\tp = [0]\r\n\tfor i in l:\r\n\t\tp.append(p[-1]+i)\r\n\tc = 0\r\n\tfor i in k:\r\n\t\tc+=i\r\n\t\tif c>=p[-1]:\r\n\t\t\tc = 0\r\n\t\t\tprint(n)\r\n\t\telse:\r\n\t\t\tj = bisect.bisect(p,c)\r\n\t\t\tprint(n-j+1)", "from bisect import bisect # Bisect is so funny\n\nnum_warriors, num_orders = map(int, input().split())\nwarriors_strengths = list(map(int, input().split()))\nwarriors_strengths.reverse()\n\n# Calculate the total strength of all warriors.\ntotal_strength = sum(warriors_strengths)\n\n# Calculate the total strength of warriors up to each position\nfor i in range(1, num_warriors):\n warriors_strengths[i] += warriors_strengths[i - 1]\n\n\nlagthera_orders = list(map(int, input().split()))\n\nanswer = 0\n\nfor i in range(num_orders):\n # Add the order to the current strength\n answer += lagthera_orders[i] \n\n # If the order causes the total strength to be exceeded, reset the current strength to 0\n if answer >= total_strength:\n answer = 0\n\n # Use bisect to find the position where the current strength would fit in the total strengths of warriors\n # Add 1 to the result because bisect returns the index\n print(bisect(warriors_strengths, total_strength - answer - 1) + 1)\n\n\t \t \t \t \t \t\t \t \t \t", "from bisect import bisect_right\r\nfrom itertools import accumulate\r\n\r\nn, q = map(int, input().split())\r\narr = list(accumulate(map(int, input().split())))\r\norders = list(map(int, input().split()))\r\n\r\nfired = 0\r\n\r\nfor v in orders:\r\n fired += v\r\n idx = bisect_right(arr, fired)\r\n if idx == n:\r\n print(n)\r\n fired = 0\r\n else:\r\n print(n - idx)\r\n", "from bisect import *\r\nn,q=map(int,input().split())\r\nwar=[*map(int,input().split())]\r\natk=[*map(int,input().split())]\r\nwarmap={war[0]:1}\r\nwararr=[war[0]]\r\nfor i in range(1,n):\r\n wararr.append(wararr[-1]+war[i])\r\n warmap[wararr[-1]]=i+1\r\nnu=0\r\nfor i in atk:\r\n nu+=i\r\n if nu>=wararr[-1]:\r\n nu=0\r\n print(n)\r\n continue\r\n x=bisect_right(wararr,nu)-1\r\n if x==-1: print(n)\r\n else: print(n-warmap[wararr[x]])", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\nimport bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, q = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n k = list(map(int, input().split()))\r\n s = [0] * (n+1)\r\n for i in range(n):\r\n s[i+1] = s[i] + a[i]\r\n x = 0\r\n for i in range(q):\r\n x += k[i]\r\n ind = bisect.bisect_right(s, x)\r\n if (n+1-ind > 0):\r\n print(n+1-ind)\r\n else:\r\n print(n)\r\n x = 0", " ###### ### ####### ####### ## # ##### ### ##### \n # # # # # # # # # # # # # ### \n # # # # # # # # # # # # # ### \n ###### ######### # # # # # # ######### # \n ###### ######### # # # # # # ######### # \n # # # # # # # # # # #### # # # \n # # # # # # # ## # # # # # \n ###### # # ####### ####### # # ##### # # # # \n\nfrom __future__ import print_function # for PyPy2\nfrom collections import Counter, OrderedDict\nfrom itertools import permutations as perm\nfrom fractions import Fraction\nfrom collections import deque\nfrom sys import stdin\nfrom bisect import *\nfrom heapq import *\nimport math\n \ng = lambda : stdin.readline().strip()\ngl = lambda : g().split()\ngil = lambda : [int(var) for var in gl()]\ngfl = lambda : [float(var) for var in gl()]\ngcl = lambda : list(g())\ngbs = lambda : [int(var) for var in g()]\nmod = int(1e9)+7\ninf = float(\"inf\")\n\nn, q = gil()\na = gil()\nq = gil()\n\nans, p = [], a[:]\n\nfor i in range(1, n):\n\tp[i] += p[i-1]\n\ntotal, consumed, i = sum(a), 0, 0\n\nfor c in q:\n\tif consumed+c >= total:\n\t\tconsumed = i = 0\n\t\tans.append(str(n))\n\t\tcontinue\n\t# consumed + c < total\n\n\tl, r = i, n-1\n\twhile l <= r:\n\t\tmid = (l+r)//2\n\t\tif p[mid] - consumed >= c:\n\t\t\ti = mid\n\t\t\tr = mid - 1\n\t\telse:\n\t\t\tl = mid + 1\n\n\tconsumed += c\n\tif p[i]-consumed == 0:\n\t\ti += 1\n\t\ti %= n\n\n\tans.append(str(n-i))\n\nprint(\"\\n\".join(ans))", "n,q = map(int,input().split())\n \nl = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\npsum = [l[0]]\n \nfor i in range(1,n):\n psum.append(psum[-1]+l[i])\n \ndef bs(l,r,psum,target):\n result = -1\n while l<=r:\n mid = l+(r-l)//2\n \n if psum[mid] <= target:\n result = mid\n l = mid + 1\n else:\n r = mid - 1\n \n return result\n \n \npre = 0\ntotal = sum(l)\n# print(l)\n# print(psum)\n# print(a)\n \nfor i in range(q):\n cur = pre + a[i]\n \n if cur>=total:\n print(len(l))\n pre = 0\n else:\n place = bs(0,n-1,psum,cur)\n # print(a[i],n-place-1,place,cur,\"look\")\n result = n-place-1 \n print(result)\n pre+=a[i]\n\n\n \t\t\t \t \t \t \t\t\t \t\t \t\t", "n, m = list(map(int, input().split()))\r\nstregth = list(map(int, input().split()))\r\narrows = list(map(int, input().split()))\r\nfrom bisect import bisect_left\r\npre = [stregth[0]]\r\nfor i in range(1, len(stregth)):\r\n pre.append(pre[-1] + stregth[i])\r\ncur = 0\r\nfor arr in arrows:\r\n cur += arr\r\n l = bisect_left(pre, cur)\r\n if l == n:\r\n cur = 0\r\n print(n)\r\n elif pre[l] == cur:\r\n if n - l - 1:\r\n print(n - l - 1)\r\n else:\r\n cur = 0\r\n print(n)\r\n else:\r\n print(n - l)\r\n \r\n ", "import sys\n\ndef upper_bound(x,cum):\n low, high=0, len(cum)\n\n while low<high:\n mid=(low+high)//2\n if x>=cum[mid]:\n low=mid+1\n else:\n high=mid\n return low\ndef main():\n n,q=map(int,sys.stdin.readline().split())\n strength=list(map(int,sys.stdin.readline().split()))\n arrows=list(map(int,sys.stdin.readline().split()))\n cumulative_strength=[0]*(n+1)\n for i in range(1, n+1):\n cumulative_strength[i]=cumulative_strength[i-1]+strength[i-1]\n last=0\n for x in arrows:\n x+=last\n index=upper_bound(x,cumulative_strength)\n if index>n:\n last=0\n print(n)\n continue\n alive_count=n-index+1\n last=x\n print(alive_count)\nif __name__==\"__main__\":\n main()\n\n\t\t \t\t \t \t\t\t\t\t \t \t \t \t \t\t", "from bisect import bisect as bs\r\nfrom itertools import accumulate as ac\r\nrd = lambda: map(int, input().split())\r\nn, q = rd()\r\nA, k = rd(), rd()\r\na = list(ac(A))\r\nd = 0\r\nfor i in range(q):\r\n d += next(k)\r\n j = bs(a, d)\r\n if j == n:\r\n d = 0\r\n j = 0\r\n print(n - j)", "from bisect import bisect_right\r\n\r\nn,q=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\n\r\np=[l[0]]\r\nfor i in range(1,len(l)):\r\n p.append(p[-1]+l[i])\r\n\r\na=0\r\nfor i in range(len(q)):\r\n a+=q[i]\r\n x=bisect_right(p,a)\r\n if x==n:\r\n print(n)\r\n a=0\r\n else:\r\n print(n-x)", "import bisect\r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\nnumArrows = 0\r\nfor val in k:\r\n numArrows += val\r\n if numArrows >= a[n-1]:\r\n print(n)\r\n numArrows = 0\r\n else:\r\n print(n - bisect.bisect(a, numArrows))\r\n", "def solve(nums, mins):\r\n def binsearch(i):\r\n left = 0\r\n right = len(nums) - 1 \r\n \r\n while left <= right:\r\n mid= (left + right)//2\r\n if prefnums[mid] > i:\r\n right = mid -1\r\n elif prefnums[mid] <= i:\r\n \r\n left = mid + 1 \r\n else:\r\n return mid\r\n return left\r\n prefnums = [nums[0]]\r\n for i in range(1,len(nums)):\r\n prefnums.append(prefnums[-1] + nums[i])\r\n\r\n prefmins = [mins[0]]\r\n\r\n for i in range(1,len(mins)):\r\n if prefmins[-1] < prefnums[-1]:\r\n prefmins.append(prefmins[-1] + mins[i])\r\n else:\r\n prefmins.append( mins[i])\r\n \r\n for i in prefmins:\r\n n = len(nums) - binsearch(i) if len(nums) - binsearch(i) else len(nums)\r\n print(n)\r\n \r\nlens = [int(i) for i in input().split()]\r\nnums = [int(i) for i in input().split()]\r\nmins = [int(i) for i in input().split()]\r\nsolve(nums, mins)", "from itertools import accumulate\r\nfrom bisect import bisect_right\r\nn, q = map(int, input().split())\r\nl = [*map(int, input().split())]\r\npre = [*accumulate(l)]\r\ncur = 0\r\nres = []\r\nfor q in map(int, input().split()):\r\n cur += q\r\n i = bisect_right(pre, cur)\r\n if i == n: cur = i = 0\r\n res.append(n - i)\r\nprint(*res, sep='\\n')", "from bisect import bisect as bs\r\nn,t=map(int,input().split())\r\nv=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n v[i]+=v[i-1]\r\np=0\r\nfor i in range(t):\r\n p += arr[i]\r\n if p>=v[-1]:\r\n print(n)\r\n p=0\r\n else:\r\n temp=n-bs(v,p)\r\n print(temp)", "from itertools import accumulate\r\nfrom bisect import bisect\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = map(int, input().split())\r\nl = list(accumulate(a))\r\nd = 0\r\nfor i in range(q):\r\n d += next(k)\r\n ind = bisect(l, d)\r\n if ind == n:\r\n d = 0\r\n ind = 0\r\n print(n-ind)\r\n", "def low(arr,N,X):\r\n r=N;l=-1;mid=0\r\n while(l<r):\r\n mid=(r+l)//2\r\n if(arr[mid]>X):\r\n r=mid\r\n else:\r\n l=mid\r\n if(l==r-1):\r\n break\r\n return l+1\r\n\r\nn,q = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]+[0]\r\nb = [int(i) for i in input().split()]+[0]\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nsum=0\r\nfor i in range(q):\r\n sum+=b[i]\r\n x=low(a,n,sum)\r\n if x!=n :\r\n print(n-x)\r\n else:\r\n print(n)\r\n sum=0", "n, q = list(map(int, input().split()))\nsoldiers = list(map(int, input().split()))\narrows = list(map(int, input().split()))\n\nsoldier_sum = [0]\nfor soldier in soldiers:\n soldier_sum.append(soldier_sum[-1] + soldier)\nsoldier_sum.append(10**16)\n\n# 0 1 3 4 6 7\ncurrent_pos = 1\ndamage_carried_over = 0\nfor arrow in arrows:\n # print(current_pos, arrow, damage_carried_over)\n arrow += damage_carried_over\n l, r = current_pos, len(soldier_sum) - 1\n res = None\n while l <= r:\n mid = (l + r) // 2\n if soldier_sum[mid] - soldier_sum[current_pos - 1] > arrow:\n res = mid\n r = mid - 1\n else:\n l = mid + 1\n damage_carried_over = arrow - (soldier_sum[res - 1] - soldier_sum[current_pos - 1])\n current_pos = res\n if current_pos == len(soldier_sum) - 1:\n current_pos = 1\n damage_carried_over = 0\n # print('reset')\n print(len(soldiers) + 1 - current_pos)\n", "def binary(li,target,n):\r\n low=0\r\n high=n-1\r\n while low<high:\r\n mid=low+(high-low)//2\r\n if li[mid]<=target:\r\n low=mid+1\r\n else:\r\n high=mid\r\n return low\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,q=map(int,input().split())\r\npower=list(map(int,input().split()))\r\narrow=list(map(int,input().split()))\r\np_prefix=[0]*n\r\na_prefix=[0]*q\r\np_prefix[0]=power[0]\r\na_prefix[0]=arrow[0]\r\nlast=0\r\nfor i in range(1,n):\r\n p_prefix[i]=p_prefix[i-1]+power[i]\r\nfor i in range(1,q):\r\n a_prefix[i]=a_prefix[i-1]+arrow[i]\r\n\r\nfor i in range(q):\r\n if a_prefix[i]-last>=p_prefix[-1]:\r\n print(n)\r\n last=a_prefix[i]\r\n else:\r\n target=a_prefix[i]-last\r\n \r\n val=binary(p_prefix,target,n)\r\n print(n-val)\r\n\r\n\r\n \r\n\r\n\r\n\r\n", "from bisect import*\r\n\r\ndef stvori(x,n):\r\n y=[x[0]]\r\n for i in range(1,n):\r\n y.append(y[i-1]+x[i])\r\n return y\r\n\r\n\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\n\r\na1=stvori(a,n)\r\n\r\n\r\nval=0\r\n\r\nfor i in k:\r\n val+=i\r\n ind=bisect_right(a1,val)\r\n\r\n if ind==n:\r\n val=0\r\n print(n)\r\n \r\n else:\r\n print(n-ind)\r\n \r\n", "def search(arr,low,high,val):\r\n while(low<=high):\r\n mid=low+(high-low)//2\r\n if(arr[mid]>=val):\r\n high=mid-1\r\n else:\r\n low=mid+1\r\n return low\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\nfor i in range(1,len(l)):\r\n l[i]+=l[i-1]\r\nval=0\r\nk=l[-1]\r\na,b=min(l),max(l)\r\nfor i in q:\r\n val+=i\r\n if(val>=l[-1]):\r\n print(n)\r\n val=0\r\n else:\r\n pos=search(l,0,len(l)-1,val)\r\n if(l[pos]==val):\r\n print((n-pos-1))\r\n else:\r\n print(n-pos)", "def Solution(N, Q, wariors_strength, arrows):\r\n # Solution\r\n prefix_sum = [0]\r\n for strength in wariors_strength:\r\n prefix_sum.append(prefix_sum[-1]+strength)\r\n prefix_sum.pop(0)\r\n arrow_so_far = 0\r\n for arrow in arrows:\r\n arrow_so_far += arrow\r\n if arrow_so_far >= prefix_sum[-1]:\r\n print(N)\r\n arrow_so_far = 0\r\n else:\r\n idx = binarySearch_LowerBound(prefix_sum, arrow_so_far)\r\n print(N-idx)\r\n\r\n\r\ndef binarySearch_LowerBound(arr, key):\r\n l = 0\r\n r = len(arr)-1\r\n\r\n while l <= r:\r\n mid = (l+r)//2\r\n if arr[mid] == key:\r\n return mid+1\r\n elif arr[mid] > key:\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n return r+1\r\n\r\n\r\nN, Q = map(int, input().split())\r\nwariors_strength = list(map(int, input().split()))\r\narrows = list(map(int, input().split()))\r\n# strArr = [input() for _ in range(N)]\r\n\r\nSolution(N, Q, wariors_strength, arrows)\r\n", "from bisect import bisect_right\r\n\r\nn,q=map(int,input().split())\r\na=[int(X) for X in input().split()]\r\nk=[int(x) for x in input().split()]\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nan=0\r\nfor j in k:\r\n j+=an\r\n x=bisect_right(a,j)\r\n if x==n:\r\n print(n)\r\n an=0\r\n else:\r\n\r\n print(n-x)\r\n an=j\r\n\r\n", "from bisect import bisect\r\ndef solve():\r\n n, q = map(int, input().split())\r\n warrior = list(map(int, input().split()))\r\n arrow = list(map(int, input().split()))\r\n for i in range(1, n):\r\n warrior[i] += warrior[i-1]\r\n curr = 0\r\n for i in range(q):\r\n curr += arrow[i]\r\n if curr >= warrior[-1]:\r\n print(n)\r\n curr = 0\r\n else:\r\n temp = n - bisect(warrior, curr)\r\n print(temp)\r\n\r\nt = 1\r\nwhile t !=0:\r\n solve()\r\n t -= 1\r\n", "from bisect import bisect_right\r\n\r\nN, Q = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nK = list(map(int, input().split()))\r\n\r\nfor i in range(1, N):\r\n A[i] += A[i-1]\r\n\r\nans = []\r\nplus = 0\r\nfor q in range(Q):\r\n idx = bisect_right(A, K[q]+plus)\r\n if idx == N:\r\n ans.append(N)\r\n plus = 0\r\n else:\r\n ans.append(N-idx)\r\n plus += K[q]\r\n\r\nfor q in range(Q):\r\n print(ans[q])", "from bisect import bisect_right\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nn,q = map(int, input().rstrip().split())\r\na = [int(i) for i in input().rstrip().split()]\r\nb = [int(i) for i in input().rstrip().split()]\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\nc = 0\r\nfor i in b:\r\n c += i\r\n t = bisect_right(a, c)\r\n if n != t:\r\n print(f\"{n-t}\\n\")\r\n else:\r\n print(f\"{n}\\n\")\r\n c =0\r\n", "import bisect\n\nn, q = map(int, input().split())\na, k, curA, curK = [], [], 0, 0\n\nfor s in input().split():\n curA += int(s)\n a.append(curA)\n\nfor s in input().split():\n curK += int(s)\n index = bisect.bisect(a, curK)\n\n if index == n:\n print(n)\n curK = 0\n else:\n print(n - index)\n \t\t\t \t \t\t\t\t\t \t\t \t\t\t\t \t", "def binarySearchCount(arr, n, key): \r\n left = 0\r\n right = n \r\n mid = 0\r\n while (left < right): \r\n mid = (right + left)//2\r\n if (arr[mid] == key): \r\n \r\n # If duplicates are \r\n # present it returns \r\n # the position of last element \r\n while (mid + 1<n and arr[mid + 1] == key): \r\n mid+= 1\r\n break\r\n \r\n \r\n # If key is smaller, \r\n # ignore right half \r\n elif (arr[mid] > key): \r\n right = mid \r\n \r\n # If key is greater, \r\n # ignore left half \r\n else: \r\n left = mid + 1\r\n \r\n \r\n # If key is not found in \r\n # array then it will be \r\n # before mid \r\n while (mid > -1 and arr[mid] > key): \r\n mid-= 1\r\n \r\n # Return mid + 1 because \r\n # of 0-based indexing \r\n # of array \r\n return mid + 1\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n#print(a)\r\nres=0\r\nfor i in range(k):\r\n res+=b[i]\r\n if a[n-1]<=res:\r\n res=0\r\n print(n)\r\n else:\r\n \r\n count=binarySearchCount(a,n,res)\r\n print(n-count)\r\n \r\n", "from bisect import bisect\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.reverse()\r\ns=sum(a)\r\nfor i in range(1,n):\r\n\ta[i]+=a[i-1]\r\nk=list(map(int,input().split()))\r\ntmp=0\r\nfor i in range(q):\r\n\ttmp+=k[i]\r\n\tif tmp>=s: tmp=0\r\n\tprint(bisect(a,s-tmp-1)+1)", "import bisect\r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(1, len(a)):\r\n a[i] += a[i - 1]\r\nk = list(map(int, input().split()))\r\n\r\nksum = 0\r\nfor ki in k:\r\n ksum += ki\r\n i = bisect.bisect_left(a, ksum)\r\n if i < n and a[i] == ksum:\r\n i += 1\r\n if n == i:\r\n ksum = 0\r\n print(n)\r\n else:\r\n print(n - i)\r\n", "from bisect import *\n\ndef solve(x,n):\n y=[x[0]]\n for i in range(1,n):\n y.append(y[i-1]+x[i])\n return y\n\nn,p=map(int, input().split())\na=list(map(int, input().split())) \nk=list(map(int, input().split())) \n\nb1=solve(a,n)\ncount=0\nfor i in k:\n count+=i\n ind=bisect_right(b1,count)\n\n if ind==n:\n count=0\n print(n)\n else:\n print(n-ind)\n \t\t\t \t \t\t\t\t \t \t\t \t \t \t\t \t", "from bisect import *\r\n\r\ndef solve(x,n):\r\n y = [x[0]]\r\n for i in range(1,n):\r\n y.append(y[i-1] + x[i])\r\n return y\r\n\r\nn,q = map(int, input().split()) \r\nz = list(map(int, input().split())) \r\nh = list(map(int, input().split())) \r\n\r\nval = 0\r\na1 = solve(z, n)\r\n\r\nfor i in h:\r\n val += i\r\n ind = bisect_right(a1, val)\r\n\r\n if ind == n:\r\n val = 0\r\n print(n)\r\n else:\r\n print(n - ind)", "def find(num):\n l=0\n r=f-1\n while(l<r):\n mid=l+r>>1\n if(a[mid]>num):r=mid\n else:l=mid+1\n return l\nf,tes=map(int,input().split())\na=list(map(int,input().split()))\nc=list(map(int,a))\nb=list(map(int,input().split()))\nfor i in range(1,f):a[i]+=a[i-1]\nnow=0\nfor i in b:\n if(i+now>=a[f-1]):\n print(f)\n now=0\n continue\n now+=i\n print(f-find(now))\n\t \t\t \t \t\t \t\t\t\t \t\t\t\t\t \t\t \t", "n, q = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nK = [int(i) for i in input().split()]\n\nA = a[:]\nfor i in range(1, n):\n A[i] += A[i-1]\n\ndef bs(A, key):\n lo, hi = 0, len(A)-1\n while lo <= hi:\n mid = (lo+hi) // 2\n if A[mid] == key:\n # print(A)\n # print(f'Found key = {key} *exactly* at mid = {mid}')\n return mid\n elif key < A[mid]:\n hi = mid-1\n elif A[mid] < key:\n lo = mid+1\n # print(A)\n # print(f'hi={hi} > lo={lo}. Returning hi')\n return hi\n\nD = 0\nfor i in range(q):\n D += K[i]\n # print(f'Accumulated damage = {D}')\n j = bs(A, D)\n if j == n-1:\n # print('Resetting damage')\n D = 0\n j = -1\n print(n-(j+1))\n", "import bisect\r\n\r\nn,q = map(int, input().split())\r\nwarrior = list(map(int, input().split()))\r\nattacker = list(map(int, input().split()))\r\nwarriors_new = []\r\nsm = 0\r\nfor i in warrior:\r\n sm+=i\r\n warriors_new.append(sm)\r\nquery = 0\r\nans = 0\r\nfor i in attacker:\r\n query+=i\r\n if query>=warriors_new[n-1]:\r\n query = 0\r\n ans = 0\r\n else:\r\n ans = bisect.bisect_right(warriors_new,query,ans)\r\n print(n-ans)\r\n", "import bisect\n\ndef warriors_standing(warriors, arrows):\n cumulative_arrows = [0] * len(warriors)\n cumulative_arrows[0] = warriors[0]\n\n for i in range(1, len(warriors)):\n cumulative_arrows[i] = cumulative_arrows[i - 1] + warriors[i]\n\n remaining_arrows = 0\n\n for arrows_shot in arrows:\n remaining_arrows += arrows_shot\n\n if remaining_arrows >= cumulative_arrows[-1]:\n remaining_arrows = 0\n\n index = bisect.bisect_left(cumulative_arrows, remaining_arrows)\n\n if index == len(cumulative_arrows) or cumulative_arrows[index] != remaining_arrows:\n print(len(cumulative_arrows) - index)\n else:\n print(len(cumulative_arrows) - index - 1)\n\nif __name__ == \"__main__\":\n n, q = map(int, input().split())\n warriors = list(map(int, input().split()))\n arrows = list(map(int, input().split()))\n\n warriors_standing(warriors, arrows)\n\n\t \t \t\t\t \t\t\t \t \t \t \t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import accumulate\r\nimport bisect\r\n\r\nn, q = map(int, input().split())\r\nw = list(accumulate(map(int, input().split())))\r\ns = 0\r\nfor i in map(int, input().split()):\r\n s += i\r\n a = bisect.bisect_right(w, s)\r\n print(n-a if n != a else n)\r\n if a == n:\r\n s = 0", "import bisect\r\n\r\nn, q = [int(v) for v in input().split()]\r\nva = [int(v) for v in input().split()]\r\nvk = [int(v) for v in input().split()]\r\n\r\nfor i in range(1, n):\r\n va[i] += va[i - 1]\r\n\r\nans = []\r\ncurr = 0\r\nfor k in vk:\r\n curr += k\r\n it = bisect.bisect_right(va, curr)\r\n if it == n:\r\n ans.append(n)\r\n curr = 0\r\n else:\r\n ans.append(n - it)\r\n\r\nprint('\\n'.join(str(v) for v in ans))\r\n", "import bisect,sys\r\nn,q=map(int,input().split())\r\na=list(map(int,sys.stdin.readline().split()))\r\nt=list(map(int,sys.stdin.readline().split()))\r\nfor j in range(1,n):\r\n a[j]=a[j-1]+a[j]\r\nx=0\r\nfor v in t:\r\n x=x+v\r\n if x<a[0]:\r\n print(n)\r\n elif x>=a[-1]:\r\n print(n)\r\n x=0\r\n else:\r\n m=bisect.bisect(a,x)\r\n print(n-m)", "import bisect as bis\r\n\r\nn,q=map(int,input().split())\r\n\r\na=[int (e) for e in input().split()]\r\n\r\nk=[int (e) for e in input().split()]\r\n\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n\r\ni=1\r\nwhile i<q:\r\n while i<q and k[i-1]>=a[n-1]:\r\n i+=1\r\n if not i<q:\r\n break\r\n k[i]+=k[i-1]\r\n i+=1\r\n \r\nfor x in range(q):\r\n num=bis.bisect(a,k[x])\r\n if num==n:\r\n print(n)\r\n else:\r\n print(n-num)", "def main():\r\n n, q = map(int, fin().split())\r\n *a, = [0, *map(int, fin().split())]\r\n *k, = map(int, fin().split())\r\n\r\n for i in range(1, n+1): a[i] += a[i-1]\r\n\r\n sm = 0\r\n for i in k:\r\n sm += i\r\n if sm>=a[-1]: sm = 0; fout(n); continue\r\n\r\n l = 1; r = n; mid = 0\r\n while l<=r:\r\n mid = (l+r)//2\r\n if sm<a[mid]: r = mid-1\r\n elif sm>a[mid]: l = mid+1\r\n else: break\r\n if sm<a[mid]: fout(n-mid+1)\r\n else: fout(n-mid)\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\n# input = open(\"task.in\", \"r\")\r\n# def fin(): return input.readline().strip(\"\\r\\n\")\r\n# output = open(\"task.out\", \"w\")\r\n# def fout(s): return output.write(str(s)+\"\\n\")\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "n,q = map(int,input().split())\r\nstrength = [0]\r\nfor x in map(int,input().split()):\r\n strength.append(strength[-1] + x)\r\narrows = list(map(int,input().split()))\r\nfallen = 0\r\nstanding = n\r\nfor i in range(q):\r\n ans = -1\r\n l = 1\r\n r = n\r\n while l <= r:\r\n mid = l + (r-l)//2\r\n if strength[mid]-fallen-arrows[i]>0:\r\n ans = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n if ans == -1:\r\n fallen = 0\r\n print(n)\r\n else:\r\n fallen += arrows[i]\r\n print(n-ans+1)", "import bisect\n\ndef warriors_standing(a, b):\n c = [0] * len(a)\n c[0] = a[0]\n for i in range(1, len(a)):\n c[i] = c[i - 1] + a[i]\n\n d = 0\n\n for arrows in b:\n d += arrows\n if d >= c[-1]:\n d = 0\n\n index = bisect.bisect_left(c, d)\n if index == len(c) or c[index] != d:\n print(len(c) - index)\n else:\n print(len(c) - index - 1)\n\nif __name__ == \"__main__\":\n n, q = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n\n warriors_standing(a, b)\n\n \t\t\t \t\t\t \t\t\t\t \t \t\t\t \t", "import math \r\nfrom collections import Counter, defaultdict\r\nimport sys\r\nimport bisect\r\n# resource.setrlimit(resource.RLIMIT_STACK, (2**29,-1))\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\"\"\"\r\n# Template Designed By: Shivshanker Singh\r\n# Note: If you find this template useful and want to use it then please don't just copy paste it \r\n you can take ideas from this and make your own.\r\n because if you copy paste as it is then there are high chances that both of us will be plagiarized\r\n (because most of code will be same for small problems).\r\n So to avoid this please dont copy paste.\r\n\"\"\"\r\n\r\nmod = 10**9 + 7\r\ninput = sys.stdin.readline\r\nreadInt = lambda : int(input().strip())\r\nreadfloat = lambda : float(input().strip())\r\nreadStr = lambda : input().strip()\r\nintList = lambda : list(map(int, input().strip().split()))\r\nintMap = lambda : map(int, input().strip().split())\r\nfloatList = lambda : list(map(float, input().strip().split()))\r\nfloatMap = lambda : map(float, input().strip().split())\r\nstrList = lambda : list(input().strip().split())\r\n\r\n\r\ndef print(*args, end='\\n', sep=' '):\r\n for i in args:\r\n sys.stdout.write(str(i))\r\n sys.stdout.write(sep)\r\n sys.stdout.write(end)\r\n\r\n\r\ndef solve():\r\n pass\r\n \r\nif __name__ == '__main__':\r\n# for _ in range(readInt()):\r\n n, q = intMap()\r\n arr = intList()\r\n krr = intList()\r\n \r\n power = [0]*n\r\n power[0] = arr[0]\r\n for i in range(1, n):\r\n power[i] = power[i-1] + arr[i]\r\n\r\n lo = 0\r\n prev = 0\r\n for i in krr:\r\n i += prev\r\n\r\n idx = bisect.bisect(power, i)\r\n if idx == n or (idx == n-1 and power[idx] == i):\r\n print(n)\r\n prev = 0\r\n else:\r\n if power[idx] == i:\r\n print(n-idx-1)\r\n else:\r\n print(n-idx)\r\n prev = i", "from typing import List\r\nimport bisect\r\n\r\ndef warriors_standing(a: List[int], b: List[int]) -> None:\r\n c = [0] * len(a)\r\n c[0] = a[0]\r\n for i in range(1, len(a)):\r\n c[i] = c[i-1] + a[i]\r\n \r\n d = 0\r\n for arrows in b:\r\n d += arrows\r\n if d >= c[-1]:\r\n d = 0\r\n \r\n idx = bisect.bisect_left(c, d)\r\n print(len(c) - idx-1) if idx < len(c) and c[idx] == d else print(len(c) - idx )\r\n\r\nif __name__ == '__main__':\r\n n, q = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n warriors_standing(a, b)", "import bisect\r\n\r\ndef solve(w, k):\r\n p_arr = [w[0]]\r\n for i in range(1, len(w)):\r\n p_arr.append(p_arr[-1] + w[i])\r\n\r\n damage = 0\r\n answers = []\r\n for m in k:\r\n damage += m\r\n killed = bisect.bisect_right(p_arr, damage)\r\n if killed == len(w):\r\n damage = 0\r\n killed = 0\r\n answers.append(len(w) - killed)\r\n\r\n return answers\r\n\r\n\r\nn, q = [int(i) for i in input().strip().split()]\r\nw = [int(i) for i in input().strip().split()]\r\nk = [int(i) for i in input().strip().split()]\r\nres = solve(w, k)\r\nfor i in res:\r\n print(i)", "n, q = list(map(int, input().split(' ')))\na = list(map(int, input().split(' ')))\nk = list(map(int, input().split(' ')))\n\ns = [0]\nfor i in range(0, n):\n\ts.append(s[-1] + a[i])\n\nindex = 0\ndamage = 0\nfor i in range(q):\n\tif s[n] - s[index] - damage <= k[i]:\n\t\tprint(n)\n\t\tindex, damage = 0, 0\n\t\tcontinue\n\tlo, hi = index, n\n\twhile hi - lo > 1:\n\t\tmid = (lo + hi) // 2\n\t\tif s[mid] - s[index] - damage > k[i]:\n\t\t\thi = mid\n\t\telse:\n\t\t\tlo = mid\n\tdamage = k[i] - (s[hi - 1] - s[index] - damage)\n\tindex = hi - 1\n\tprint(n - index)\n", "from bisect import bisect_right\r\n\r\n\r\nn,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprefix=[0 for i in range(n)]\r\nprefix[0]=arr[0]\r\nfor i in range(1,n):\r\n prefix[i]=arr[i]+prefix[i-1]\r\nquery=list(map(int,input().split()))\r\nval=0\r\nfor q in query:\r\n val+=q\r\n temp=bisect_right(prefix,val)\r\n if temp==n:\r\n val=0\r\n print(n)\r\n else:\r\n print(n-temp)", "I=lambda:map(int,input().split())\r\nfrom bisect import bisect_left as bl \r\nn,q=I()\r\na=list(I())\r\nb=list(I())\r\nc=[];m=0\r\nfor i in a:\r\n m+=i;c.append(m)\r\nm=0\r\nfor i in range(q):\r\n k=bl(c,b[i]+m)\r\n if k==len(c) or b[i]+m==c[-1]:\r\n print(n)\r\n m=0\r\n continue\r\n elif c[k]==b[i]+m:\r\n m+=b[i]\r\n print(n-k-1)\r\n else:\r\n m+=b[i]\r\n print(n-k)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Apr 27 00:39:17 2018\n\n@author: shubham\n\"\"\"\ndef Low(a, l, r, x):\n while l<r:\n mid = (l+r)//2\n if a[mid] >= x:\n r = mid\n else:\n l = mid+1\n if a[l]<=x:\n return l\n else:\n return l-1\n\n\nn, q = map(int, input().split())\na = list(map(int, input().split()))\nk = list(map(int, input().split()))\np = [0]*n\np[0] = a[0]\nfor i in range(1, n):\n p[i]=p[i-1]+a[i]\nt = 0\nfor i in range(q):\n t+=k[i]\n ans = Low(p, 0, n-1, t)\n if ans == -1 or ans == n-1:\n print(n)\n else:\n print(n-ans-1)\n if ans == n-1:\n t = 0\n \n ", "I=lambda:map(int,input().split())\r\nfrom bisect import bisect_left as bl \r\nn,q=I()\r\na=list(I())\r\nb=list(I())\r\nc=[];m=0\r\nfor i in a:\r\n m+=i;c.append(m)\r\nm=0\r\nfor i in range(q):\r\n k=bl(c,b[i]+m)\r\n if k==len(c) or b[i]+m==c[-1]:print(n);m=0;continue\r\n elif c[k]==b[i]+m:m+=b[i];print(n-k-1);\r\n else:m+=b[i];print(n-k)", "from bisect import bisect_right\n\nn,q = map(int, input().split())\nipt = list(map(int, input().split()))\nzzz = 1\nk = list(map(int, input().split()))\n \nfor i in range(1,n):\n ipt[i] = ipt[i] + ipt[i-1]\n \ncos=0\n\nfor i in k:\n cos += i\n tem = bisect_right(ipt, cos)\n \n if n!=tem:\n print(n-tem)\n else:\n print(n)\n cos=0\n\n \t\t \t\t \t \t\t\t \t \t \t \t \t\t", "from bisect import bisect_left\r\n\r\nwarriors, minutes = map(int, input().split())\r\nstrength = list(map(int, input().split()))\r\narrows = list(map(int, input().split()))\r\nprefix_sum = [0] * warriors\r\nprefix_sum[0] = strength[0]\r\n\r\nfor i in range(1, warriors):\r\n prefix_sum[i] = prefix_sum[i - 1] + strength[i]\r\n\r\narrows_fired = 0\r\nremaining_warriors = warriors \r\n\r\nfor i in range(minutes):\r\n arrows_fired += arrows[i]\r\n \r\n if arrows_fired >= prefix_sum[-1]:\r\n arrows_fired = 0\r\n remaining_warriors = warriors\r\n print(remaining_warriors)\r\n else:\r\n index = bisect_left(prefix_sum, arrows_fired+1)\r\n \r\n remaining_warriors = warriors - index\r\n print(remaining_warriors)\r\n", "\"\"\"\r\n#KADANES ALGO FOR SINGLE DIMENSION ARRAY RANGE UPADATION\r\ndef kadanesAlgo(array):\r\n\t\r\n\t#retruns he upper index , lower index and the maximum sum that can be possible in #an 1D array \r\n\t\r\n\tcurrSum= 0\r\n\tmaxSum = 0\r\n\tupperIndex= 0 \r\n\t_upperIndex = 0 \r\n\tlowerIndex = -1\r\n\tfor index , x in enumerate(array):\r\n\t\tcurrSum += x \r\n\t\tif currSum > maxSum:\r\n\t\t\tmaxSum = currSum\r\n\t\t\tupperIndex = _upperIndex\r\n\t\t\tlowerIndex = index\r\n\t\tif currSum < 0 :\r\n\t\t\t_upperIndex = index+1\r\n\t\t\tcurrSum = 0\r\n\treturn upperIndex , lowerIndex , maxSum\r\n\r\n######################################\r\nsizeOfArray = int(input())\r\narray=[int(i) for i in input().split()]\r\nnumOfQueries=int(input())\r\nqueries= []\r\nfor _ in range(numOfQueries):\r\n\tqueries.append([int(i) for i in input().split()])\r\n\t\r\ndifernceArray=[0]*(sizeOfArray+1)\r\ndifernceArray[0] = array[0]\r\nfor i in range(1,sizeOfArray):\r\n\tdifernceArray[i] = array[i] - array[i-1]\r\nfor query in queries:\r\n\t\tl , r , x = query\r\n\t\tdifernceArray[l]+=x\r\n\t\t\r\n\t\tdifernceArray[r+1]-=x\r\narray[0] = difernceArray[0]\r\nfor i in range(1,sizeOfArray):\r\n\tarray[i]=difernceArray[i] + array[i-1]\r\nprint(array)\r\n\r\n#KADANES ALGO FOR MAXIMUM SUM IN A 2D ARRAY \r\nml,mr,ll,lr,sum = 0 ,0,0,0,-999999999999\r\nmultiArray = [[-10,5,-50],[26,-1,10],[0,6,45]]\r\n\r\nr , c = len(multiArray), len(multiArray[0])\r\nsubarray=[0]*r\r\nfor i in range(c):\r\n\tsubarray=[0]*r\r\n\tfor j in range(i,c):\r\n\t\tfor k in range(r):\r\n\t\t\tsubarray[k]+=multiArray[k][j]\r\n\t\tupIn, lowIn , curSum = kadanesAlgo(subarray)\r\n\t\tif curSum > sum :\r\n\t\t\tsum = curSum\r\n\t\t\tll , lr , ml ,mr = upIn , lowIn , i ,j \r\n\t\t\t\r\nprint(ll,lr,ml,mr,sum)\r\n\r\n#ANOTHER IMPLEMENTATION OF KADANSES ALGO USING PERFIX SUM \r\nmultiArray = [[2,1,-3,-4,5],[0,6,3,4,1],[2,-2,-1,4,-5],[-3,3,1,0,3]]\r\nmaxSum= -999999999999\r\nr , c = len(multiArray), len(multiArray[0])\r\narray= multiArray\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif i > 0 :\r\n\t\t\tarray[i][j] += array[i-1][j]\r\n\t\tif j > 0 :\r\n\t\t\tarray[i][j] += array[i][j-1]\r\n\t\tif i > 0 and j > 0:\r\n\t\t\tarray[i][j] -= array[i-1][j-1]\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tfor k in range(i, r):\r\n\t\t\tfor l in range(j,c):\r\n\t\t\t\tsubrect= array[k][l]\r\n\t\t\t\tif i > 0:\r\n\t\t\t\t\tsubrect -= array[i-1][l]\r\n\t\t\t\tif j > 0:\r\n\t\t\t\t\tsubrect -= array[k][j-1]\r\n\t\t\t\tif i > 0 and j > 0:\r\n\t\t\t\t\tsubrect += array[i-1][j-1]\r\n\t\t\t\tmaxSum = max(maxSum , subrect)\r\nprint(maxSum)\t\t\r\n\t\t\t\r\n#PREFIXSUM FOR POMGAL BUNK SOLUTION\r\n\r\n\r\nn = int(input())\r\nqueryNum =int(input())\r\narray =[0]*(n+1)\r\nprefixArray= [0]*(n+1)\r\nfor _ in range(queryNum):\r\n\tl , r = [int(i) for i in input().split()]\r\n\tarray[l]+=1\r\n\tif r+1 <= n:\r\n\t\tarray[r+1]-=1\r\n\t\tprefixArray[r+1] = prefixArray[r+1] - (r-l+1)\r\nm = int(input())\r\nprintQuery=[]\r\nfor _ in range(m):\r\n\tprintQuery.append(int(input()))\r\nfor i in range(2,n+1):\r\n\t\tarray[i]+=array[i-1]\r\n\r\nprefixArray[1] = array[1]\t\t\r\nfor i in range(2,n+1):\r\n\tprefixArray[i]=prefixArray[i]+prefixArray[i-1]+array[i]\r\nfor x in printQuery:\r\n\tprint(prefixArray[x])\r\n\r\nt = int(input())\r\nans=-99999\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\tif n == 1:\r\n\t\tans = int(input())\r\n\telse:\r\n\t\trangeQ=[]\r\n\t\tfor _ in range(n):\r\n\t\t\trangeQ.append([int(i) for i in input().split()])\r\n\t\td1,d2= [[0]*n]*n , [[0]*n]*n\r\n\t\tfor i in range(n):\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tsum = rangeQ[i][j]\r\n\t\t\t\tans = max(sum , ans)\r\n\t\t\t\tk = 1\r\n\t\t\t\twhile i + k < n and j + k < n and i - k >= 0 and j - k >= 0 :\t\r\n\t\t\t\t\tsum += rangeQ[i][j - k];\r\n\t\t\t\t\tsum += rangeQ[i][j + k];\r\n\t\t\t\t\tsum += rangeQ[i - k][j];\r\n\t\t\t\t\tsum += rangeQ[i + k][j];\t\r\n\t\t\t\t\tfor l in range(1,k):\r\n\t\t\t\t\t\tsum += rangeQ[i - l][j - k + l];\r\n\t\t\t\t\t\tsum += rangeQ[i + l][j - k + l];\r\n\t\t\t\t\t\tsum += rangeQ[i - l][j + k - l];\r\n\t\t\t\t\t\tsum += rangeQ[i + l][j + k - l];\r\n\t\t\t\t\t\r\n\t\t\t\t\tans = max (sum , ans)\r\n\t\t\t\t\tk+=1\r\n\t\t\t\t\r\n\tprint(ans)\r\n\r\n#SLIDING WINDOW ALGORITHM FOR FINDING LARGEST SUBSTRING CONTAINING NO DUPLICATE CHARS\r\nstring = input()\r\nleftPointer = 0 \r\nrightPointer =0\r\ncountMap={}\r\nleft , right = 0,0\r\nmaxLenght=-99999\r\nwhile rightPointer < len(string):\r\n\tif string[rightPointer] not in countMap.keys():\r\n\t\tcountMap[string[rightPointer]] = 0 \r\n\tcountMap[string[rightPointer]]+=1\r\n\r\n\tif countMap[string[rightPointer]] > 1:\r\n\t\twhile countMap[string[rightPointer]] > 1:\r\n\t\t\tcountMap[string[leftPointer]]-=1\r\n\t\t\r\n\t\t\tleftPointer+=1\r\n\tif maxLenght < (rightPointer - leftPointer) +1:\r\n\t\tleft = leftPointer\r\n\t\tright = rightPointer\r\n\t\tmaxLenght= (rightPointer - leftPointer) +1\r\n\t\r\n\trightPointer+=1\r\nprint((maxLenght,left,right))\r\n\r\narray = [int(i) for i in input().split()]\r\narray2=[0]*len(array)\r\ns= list()\r\nfor i in range(len(array)-1 , -1 , -1):\r\n\twhile len(s) > 0 and s[-1] <= array[i]:\r\n\t\ts.pop()\r\n\tif len(s) > 0 :\r\n\t\tarray2[i] = s[-1]\r\n\telse:\r\n\t\tarray2[i] =-1\r\n\ts.append(array[i])\r\nprint(array2)\r\n\r\n#########################################################\r\ndef riddle(arr):\r\n\ts=list()\r\n\tn = len(arr)\r\n\tleft = [-1]*(n+1)\r\n\tright = [n]*(n+1)\r\n\tfor i in range(n):\r\n\t\twhile s and arr[s[-1]] >= arr[i]:\r\n\t\t\ts.pop()\r\n\t\tif s:\r\n\t\t\tleft[i] = arr[s[-1]]\r\n\t\t\t\r\n\t\ts.append(i)\r\n\t\r\n\tfor _ in range(len(s)):\r\n\t\ts.pop()\r\n\t\r\n\tfor i in range(n-1 , -1 , -1):\r\n\t\twhile s and arr[s[-1]] >= arr[i]:\r\n\t\t\ts.pop()\r\n\t\tif s:\r\n\t\t\tright[i] = arr[s[-1]]\r\n\t\t\t\r\n\t\ts.append(i)\r\n\tans = [0]*(n+1)\r\n\tfor i in range(n):\r\n\t\tlenx = right[i] - left[i] - 1\r\n\t\tans[lenx] = max(ans[lenx] , arr[i])\r\n\tfor i in range(n-1,0 , -1):\r\n\t\tans[i] = max(ans[i] , ans[i+1])\r\n\treturn ans[1:]\r\ndef plankHeight(arr , k ):\r\n\tstart = 0\r\n\tend = 0\r\n\tminVal= 99999999999999999\r\n\tsum= 0\r\n\tk=k-1\r\n\tindex=0\r\n\twhile end < len(arr):\r\n\t\tif end > k:\r\n\t\t\t\r\n\t\t\tsum-=arr[start]\r\n\t\t\tsum+=arr[end]\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tif minVal > sum:\r\n\t\t\t\tminVal = sum\r\n\t\t\t\tindex = start+1\r\n\t\t\t\r\n\t\t\tstart+=1\r\n\t\t\tend+=1\t\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tsum+=arr[end]\r\n\t\t\tminVal=sum\r\n\t\t\tend+=1\r\n\tprint(index+1)\r\n########################################\r\ntc = int(input())\r\nfor _ in range(tc):\r\n\tn ,b ,a = [int(i) for i in input().split()]\r\n\tarr = [int(i) for i in input().split()]\r\n\tprefixArray =[0]*n\r\n\tprefixArray[0]= arr[0]\r\n\tminVal =-99999999\r\n\tfor i in range(a,b+1):\r\n\t\tk = i-1\r\n\t\tstart =0 \r\n\t\tend = k\r\n\t\t\r\n\t\twhile end < n:\r\n\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\tsstrart = 0 if start == 0 else prefixArray[start-1]\r\n\t\t\t\t\r\n\t\t\t\tminVal = max(minVal , (prefixArray[end] - sstrart) / ((end - start)+1))\r\n\t\t\t\t\r\n\t\t\t\tstart+=1\r\n\t\t\t\tend+=1\t\r\n\t\t\t\r\n\tprint(minVal)\t\r\n\t\r\n######################\r\ntc = int(input())\r\nfor _ in range(tc):\r\n\ts = input()\r\n\tcount=0\r\n\tstrLen= len(s)\r\n\tprefixOnes=[0]*strLen\r\n\tprefixOnes[0] = 1 if s[0] == \"1\" else 0\r\n\t\r\n\tfor i in range(1, strLen):\t\r\n\t\tif s[i] == \"1\":\r\n\t\t\tprefixOnes[i] += prefixOnes[i-1] +1\r\n\t\telse:\r\n\t\t\tprefixOnes[i] += prefixOnes[i-1]\r\n\t\r\n\tfor i in range(strLen):\r\n\t\t\r\n\t\tlena= i*i+i*i\r\n\t\tif lena > strLen:\r\n\t\t\tbreak\r\n\t\trangeTerm = strLen-lena\r\n\t\tfor j in range(rangeTerm):\r\n\t\t\t\r\n\t\t\r\n\t\t\t\r\n\t\t\r\n\t\t\r\n\t\t\t\r\n\t\t\tval = prefixOnes[i-1] if i !=0 else 0\r\n\t\t\tcnt1= prefixOnes[j] - val\r\n\t\t\t\r\n\t\t\tcnt0=lena -cnt1\r\n\t\t\tif cnt0 == cnt1*cnt1:\r\n\t\t\t\tcount+=1\r\n\tprint(count)\r\n\r\nfor _ in range(int(input())):\r\n\tn , k =[int(i) for i in input().split()]\r\n\tarray = [int(i) for i in input().split()]\r\n\tstart = 0\r\n\tend =0\r\n\tk=k-1\r\n\trangex= (n +k )-1\r\n\tsumx = 0 \r\n\tmaxSum=-999999\r\n\twhile end < n + k:\r\n\t\tindex = end%n\r\n\t\tif end > k:\r\n\t\t\tsumx-=array[start]\r\n\t\t\tsumx+=array[index]\r\n\t\t\tmaxSum=max(maxSum , sumx)\r\n\t\t\tstart+=1\r\n\t\t\tend+=1\r\n\t\telse:\r\n\t\t\tsumx+=array[index]\r\n\t\t\tmaxSum = max(maxSum,sumx)\r\n\t\t\tend+=1\r\n\tprint(maxSum)\t\r\n\r\n#Check to make it more easire less checks should be used \r\nfor _ in range(int(input())):\r\n\tn, k = [int(i) for i in input().split()]\r\n\tk =k-1\r\n\tarray = [int(i) for i in input().split()]\r\n\tmaxCount= 0\r\n\tindex = -1\r\n\tparts = 0 \r\n\tstart =0 \r\n\tend = 0\r\n\tcount=0\r\n\tflag=True\r\n\twhile start != n-2 :\r\n\t\tif end > k:\r\n\t\t\t\r\n\t\t\tif array[end] < array[end-1] and array[end-1] > array[end-2] and flag:\r\n\t\t\t\t\r\n\t\t\t\tif end == n-1:\r\n\t\t\t\t\tflag=False\r\n\t\t\t\tcount+=1\r\n\t\t\t\t\r\n\t\t\tif start < n-2:\r\n\t\t\t\t\r\n\t\t\t\tstart+=1\t\t\r\n\t\t\t\tif array[start] > array[start-1] and array[start] > array[start+1]:\r\n\t\t\t\t\tcount-=1\r\n\t\t\t\r\n\t\t\tif maxCount < count:\r\n\t\t\t\tmaxCount = count\r\n\t\t\t\tparts = count+1\r\n\t\t\t\tindex = start +1 \r\n\t\t\tif end < n -1 :\r\n\t\t\t\tend+=1\r\n\t\telse:\r\n\t\t\tif end == k:\r\n\t\t\t\tfor x in range(1,len(array[start:end+1])-1):\r\n\t\t\t\t\tif array[x] > array[x-1] and array[x] > array[x+1]:\r\n\t\t\t\t\t\r\n\t\t\t\t\t\tcount+=1\r\n\t\t\t\t\t\tmaxCount = count\r\n\t\t\t\t\t\tparts = count+1\r\n\t\t\t\t\t\tindex = start +1\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\tend+=1\r\n\t\t\tif end == n:\r\n\t\t\t\tbreak\r\n\t\t\r\n\tparts = parts if index != -1 else 1 \t\r\n\tindex = index if index != -1 else 1 \r\n\t\r\n\tprint(f\"{parts} {index}\")\r\n\t \r\n\t\t\t\t\r\n\r\n###########################################\r\nfor _ in range(int(input())):\r\n\tn , k = [int(i) for i in input().split()]\r\n\ts = input()\r\n\tstart = 0 \r\n\tend = 0\r\n\tval=0\r\n\tstring=\"\"\r\n\tdiff =[0]*n\r\n\tfor i in range(1,n):\r\n\t\tif s[i] !=s[i-1]:\r\n\t\t\tdiff[i]=1\r\n\t\telse:\r\n\t\t\tdiff[i] = 0\r\n\t\t\t\r\n\tfor i in range(1,n):\r\n\t\tdiff[i]+=diff[i-1]\r\n\tans =0 \r\n\tfor i in range(k):\r\n\t\tans+=diff[i+(n-k)] - diff[i]\r\n\tprint( ans )\r\n7\r\n1\r\n2\r\n3\r\n4\r\n5\r\n6\r\n7\r\n3\r\n3\r\n10\r\n2\r\n##########################################\r\n\r\nn = int(input())\t\r\narray = []\r\nfor _ in range(n):\r\n\tarray.append(int(input()))\r\nsortedArray = sorted(array)\r\nprefixSum = sortedArray.copy()\r\n\r\nfor i in range(1, n):\t\r\n\tprefixSum[i]+=prefixSum[i-1]\r\nfor _ in range(int(input())):\r\n\tsumx=0\r\n\tcount= 0\r\n\tval = int(input())\r\n\ttry:\r\n\t\tindex = sortedArray[::-1].index(val)\r\n\t\tindex = n - 1- index\r\n\t\t\r\n\t\tsumx = prefixSum[index]\r\n\t\tcount = index + 1\r\n\t\tprint(f\"{count} {sumx}\")\r\n\texcept:\r\n\t\r\n\t\tsumx = prefixSum[-1]\r\n\t\tcount = n\r\n\t\tprint(f\"{count} {sumx}\")\r\n\r\n\r\n###################################################\r\ntc = int(input())\r\nfor _ in range(tc):\r\n\t\tn, c = [int(i) for i in input().split()]\r\n\t\tarray = [] \r\n\t\tfor _ in range(n):\r\n\t\t\tarray.append(int(input()))\r\n\t\tsortedArray = sorted(array)\r\n\t\tlow , high , best = 0 , sortedArray[-1] , 0\r\n\t\r\n\t\twhile low <= high:\r\n\t\t\tmid = (high + low +1)// 2\r\n\t\t\tcows = 1\r\n\t\t\tleft = 0\r\n\t\t\tindex = 0\r\n\t\t\t\r\n\t\t\twhile cows < c and index < n :\r\n\t\t\t\tif sortedArray[index] - sortedArray[left] >= mid:\r\n\t\t\t\t\t\tleft = index \r\n\t\t\t\t\t\tcows+=1\r\n\t\t\t\tindex+=1\r\n\t\t\tif cows >= c:\r\n\t\t\t\tbest = mid\r\n\t\t\t\tlow = mid +1\r\n\t\t\telse:\r\n\t\t\t\thigh = mid-1\r\n\t\t\t\t\r\n\t\tprint(best)\r\n\t\t\t\r\n#############################################################################\r\ndef paint( A , B ,C ):\r\n\tdef process(time):\r\n\t\ttime2 , count = time , 1 \r\n\t\tfor block in C:\r\n\t\t\tif block * B > time:\r\n\t\t\t\treturn False\r\n\t\t\ttime2-=block*B\r\n\t\t\tif time2 < 0 :\r\n\t\t\t\tcount+=1\r\n\t\t\t\ttime2=time - block*B\r\n\t\treturn count<=A\r\n\r\n\tminTime , maxTime = 0 , sum(C)*B\r\n\twhile minTime < maxTime :\r\n\t\tprint(\"am inn while\")\r\n\t\tprint(f\"mintime--->{minTime} maxtime->{maxTime}\"\r\n\t\tmid = (minTime + maxTime )//2\r\n\t\tif process(mid):\r\n\t\t\tmaxTime = mid\r\n\t\t\t\r\n\t\telse:\r\n\t\t\tminTime = mid + 1\r\n\treturn minTime % 10000003 \r\nprint(paint(int(input()) , int(input()) , [int(i) for i in input().split()]))\r\n\"\"\"\r\nimport bisect\r\ndef lowerBound(a , x ):\r\n\t\r\n\tindex = bisect.bisect_left(a, x)\r\n\tif a[index] == x:\r\n\t\treturn index \r\n\treturn index - 1 \r\nn , q =[int(i) for i in input().split()]\r\nwarrriorStrength = [int(i) for i in input().split()]\r\nLagerthaOrder = [int(i) for i in input().split()]\r\nprefixArray = [0]*n\r\nprefixArray[0] = warrriorStrength[0]\r\nfor i in range(1,n):\r\n\tprefixArray[i]+=prefixArray[i-1]+warrriorStrength[i]\r\npointer = 0\r\n\r\nans = -1\r\nfor arrow in LagerthaOrder:\r\n\tpointer+=arrow\r\n\tindex=-1\r\n\tif pointer > prefixArray[-1]:\r\n\t\tpointer = 0\r\n\t\tprint(n)\r\n\t\tans = n\r\n\telse:\r\n\t\t\r\n\t\t\t\tindex = lowerBound(prefixArray, pointer)\r\n\t\t\t\r\n\t\t\t\tif index == n-1:\r\n\t\t\t\t\tprint(n)\r\n\t\t\t\t\tpointer = 0\r\n\t\t\t\t\tans = n \r\n\t\t\t\telse:\r\n\t\t\t\t\tc = n-1\r\n\t\t\t\t\tprint(c - index)\r\n\t\t\t\t\tans = c -index\r\n\t\t\r\n\t\t\t", "##### \r\nimport sys\r\nfrom bisect import insort, bisect_right, bisect_left\r\ndata = sys.stdin.readlines()\r\nlis = []\r\n\r\nfor line in data:\r\n lis.append(line)\r\n#######\r\nn, q = map(int, lis[0].split())\r\nfighters = list(map(int, lis[1].split()))\r\narrows = list(map(int, lis[2].split()))\r\n#seq = list(map(int, \"10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 1\".split()))\r\n\r\n\r\nfighters_cum = [fighters[0]]\r\nfor i in range(1, len(fighters)): fighters_cum.append(fighters[i]+fighters_cum[i-1])\r\n\r\nl = len(fighters) #=n\r\narw = 0#number of thrown arrows\r\n#print(fighters_cum)\r\n#print(arrows)\r\nfor i in range(q):\r\n arw += arrows[i]\r\n ind = bisect_right(fighters_cum, arw) #find the index of the fighters who die\r\n# print( 'ind=',ind,'arrows=', arw)\r\n if ind == l:\r\n# print(\"I am here\")\r\n arw = 0\r\n print(l)\r\n continue\r\n print(l-ind)", "import bisect;\r\nn, q = map(int, input().split(' '));\r\na=list(map(int, input().split(' ')));\r\nk=list(map(int, input().split(' ')));\r\nstartHelth=sum(a);\r\nrestHelth=startHelth;\r\nhelths=[0]*n;\r\nhelths[0]=a[n-1];\r\nfor i in range(1, n):\r\n helths[i]=helths[i-1]+a[n-i-1];\r\nfor _, arrow in enumerate(k):\r\n damage=min(restHelth, arrow);\r\n restHelth-=damage;\r\n if restHelth==0:\r\n restHelth=startHelth;\r\n print(n);\r\n else:\r\n j=bisect.bisect_left(helths, restHelth)\r\n print(j+1);", "def find(num):\r\n l=0\r\n r=n-1\r\n while(l<r):\r\n mid=l+r>>1\r\n if(a[mid]>num):r=mid\r\n else:l=mid+1\r\n return l\r\nn,tes=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=list(map(int,a))\r\nb=list(map(int,input().split()))\r\nfor i in range(1,n):a[i]+=a[i-1]\r\nnow=0\r\nfor i in b:\r\n if(i+now>=a[n-1]):\r\n print(n)\r\n now=0\r\n continue\r\n now+=i\r\n print(n-find(now))", "#!/usr/bin/env python3\n\nimport bisect\n\n[n, q] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\nkis = list(map(int, input().strip().split()))\n\niais = [0 for _ in range(n + 1)]\nfor i in range(n):\n\tiais[i + 1] = iais[i] + ais[i]\n\n\ns = 0\ntot = iais[-1]\nr = 0\nfor k in kis:\n\ts += k\n\tif s >= tot:\n\t\tprint (n)\n\t\ts = 0\n\t\tr = 0\n\telse:\n\t\tr = bisect.bisect_right(iais, s, r) - 1\n\t\tprint (n - r)\n\n", "from bisect import bisect_right\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nfor i in range(1, n):\r\n a[i]+=a[i-1]\r\nc=0\r\nfor i in k:\r\n\tc+=i\r\n\tt=bisect_right(a,c)\r\n\tif n!=t: print(n-t)\r\n\telse:\r\n\t\tprint(n)\r\n\t\tc=0\r\n#'''H'''\r\n\t\t\t\t\t \t \t \t\t \t \t \t\t \t\t \t\t\t\t\t", "from bisect import bisect\r\nn,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\narr=[]\r\ns=0\r\nb=n\r\nfor i in a:\r\n s+=i\r\n arr.append(s)\r\nar=arr.copy()\r\ns=0\r\nfor i in k:\r\n s+=i\r\n j=bisect(ar,s)\r\n if j==n:\r\n s=0\r\n j=0\r\n print(n-j)\r\n", "from bisect import bisect_right\r\n\r\n\r\nn,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\ntemp=0\r\nindex=0\r\nfor i in range(1,n):\r\n arr[i]+=arr[i-1]\r\nans=[]\r\nfor el in brr:\r\n temp+=el\r\n if temp>=arr[-1]:\r\n ans.append(0)\r\n temp=0\r\n index=0\r\n else :\r\n \r\n ind1=bisect_right(arr,temp)\r\n ans.append(ind1)\r\n index=ind1\r\n print(n-ans[-1])\r\n", "from bisect import bisect_right as br\r\n\r\nn, q = map(int, input().split())\r\nstn = list(map(int, input().split()))\r\narro = list(map(int, input().split()))\r\n\r\ncum = []\r\ns = 0\r\nfor i in range(n):\r\n s += stn[i]\r\n cum.append(s)\r\n\r\ns1 = 0\r\nans = 0\r\nfor i in range(q):\r\n if ans == 0:\r\n s1 = arro[i]\r\n else:\r\n s1 += arro[i]\r\n ind = br(cum, s1)\r\n ans = n - ind\r\n if ans == 0:\r\n print(n)\r\n else:\r\n print(ans)\r\n \r\n", "import math\r\nimport sys\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef get_health(cumsum, l, r):\r\n res = cumsum[r]\r\n if l >= 1 :\r\n res -= cumsum[l-1]\r\n return res\r\n\r\n\r\ndef main():\r\n\r\n n, q = [int(x) for x in input().split(' ')]\r\n warr = [int(x) for x in input().split(' ')]\r\n arrow = [int(x) for x in input().split(' ')]\r\n\r\n\r\n cumsum = [0 for i in range(n)]\r\n cumsum[0] = warr[0]\r\n for i in range(1, n):\r\n cumsum[i] = warr[i] + cumsum[i-1]\r\n\r\n start = 0\r\n minus = 0\r\n\r\n for i in range(q):\r\n cur_arrows = arrow[i]\r\n\r\n if cur_arrows < warr[start] - minus:\r\n print(n - start)\r\n minus += cur_arrows\r\n continue\r\n\r\n pos = start\r\n\r\n for j in range(25, -1, -1):\r\n jump = (1 << j)\r\n\r\n if pos + jump < n and cur_arrows >= get_health(cumsum, start, pos+jump) - minus:\r\n pos += jump\r\n\r\n if pos == n-1:\r\n start = 0\r\n minus = 0\r\n\r\n print(n)\r\n else:\r\n print(n - pos - 1)\r\n left = cur_arrows - (get_health(cumsum, start, pos) - minus)\r\n minus = left\r\n start = pos + 1\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from bisect import bisect_right\nn,q=map(int,input().split())\na=list(map(int,input().split()))\nk=list(map(int,input().split()))\nfor i in range(1, n):\n a[i]+=a[i-1]\nok=0\nfor i in k:\n\tok+=i\n\tt=bisect_right(a,ok)\n\tif n!=t: print(n-t)\n\telse:\n\t\tprint(n)\n\t\tok=0\n \t\t\t \t\t\t\t\t \t\t\t\t\t \t\t\t\t \t \t \t\t", "n,q = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = list(map(int,input().split()))\r\nlst,x = [],0\r\nfor i in range(n):\r\n x+=a[i]\r\n lst.append(x)\r\nres=0\r\nfrom bisect import bisect_left\r\nfor i,x in enumerate(k):\r\n res+=x\r\n if lst[n-1]<=res:print(n);res=0\r\n else:\r\n t = bisect_left(lst,res)\r\n if lst[t]==res:print(n-t-1)\r\n else:print(n-t)", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.insert(0,0)\r\nk=list(map(int,input().split()))\r\nj,g=0,0\r\nfor i in range(1,n+1) :\r\n a[i]=a[i]+a[i-1]\r\nwhile q > 0 :\r\n g=g+k[j]\r\n r,l,h=-1,0,n\r\n while l<=h :\r\n m=(l+h)//2\r\n if g >= a[m] :\r\n res=m\r\n l=m+1\r\n else :\r\n h=m-1\r\n if res==n :\r\n res=0\r\n g=0\r\n print(n-res) \r\n j+=1\r\n q-=1\r\n ", "'''Author- Akshit Monga'''\r\nfrom sys import stdin, stdout\r\nimport bisect\r\ninput = stdin.readline\r\nt = 1\r\nfor _ in range(t):\r\n n,q=map(int,input().split())\r\n a=[int(x) for x in input().split()]\r\n pre=[]\r\n s=0\r\n for i in a:\r\n s+=i\r\n pre.append(s)\r\n lost=0\r\n val_lost=0\r\n ans=[]\r\n qu=[int(x) for x in input().split()]\r\n for i in qu:\r\n val=i+val_lost\r\n b=bisect.bisect_left(pre,val,lost,n)\r\n val_lost=min(val,pre[-1])\r\n if b==n:\r\n lost = 0\r\n val_lost = 0\r\n ans.append(n)\r\n continue\r\n if pre[b]==val:\r\n lost=b+1\r\n else:\r\n lost=b\r\n if lost==n:\r\n lost = 0\r\n val_lost = 0\r\n ans.append(n-lost)\r\n for i in ans:\r\n print(i)", "import bisect\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n dp[i]=dp[i-1]+a[i-1]\r\ns=0\r\nfor i in range(q):\r\n s+=k[i]\r\n if s>=dp[-1]:\r\n print(n)\r\n s=0\r\n else:\r\n f=bisect.bisect(dp,s)-1\r\n print(n-f)\r\n ", "from bisect import bisect_right\n\nn,q=map(int,input().split())\na=list(map(int,input().split()))\nk=list(map(int,input().split()))\n\nfor i in range(1, n):\n a[i]+=a[i-1]\ncnt=0\nfor i in k:\n\tcnt+=i\n\tt=bisect_right(a,cnt)\n\tif n!=t: print(n-t)\n\telse:\n\t\tprint(n)\n\t\tcnt=0\n\t\t\t\t\t\t \t\t\t \t\t\t\t \t\t\t \t \t \t\t\t", "import bisect\n\nN,Q = map(int,input().split())\nws = list(map(int,input().split()))\nqs = list(map(int,input().split()))\n\ncums = [0]\nfor w in ws:\n cums.append(cums[-1] + w)\n\ndamage = 0\nfor q in qs:\n damage += q\n if damage >= cums[-1]:\n damage = 0\n print(N)\n else:\n i = bisect.bisect(cums,damage)\n print(N-i+1)\n", "n, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\n\r\ndef binary_search(curr):\r\n l, r = 0, n-1\r\n while l <= r:\r\n mid = l + r >> 1\r\n if a[mid] >= curr:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\nres = ''\r\ncurr = 0\r\nfor i in k:\r\n curr += i\r\n if curr >= a[n-1]:\r\n res += str(n)+'\\n'\r\n curr = 0\r\n else:\r\n it = binary_search(curr)\r\n res += str(n - it - (a[it] == curr))+'\\n'\r\nprint(res)\r\n", "import bisect\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\npre=[a[0]]\r\nfor i in range(1,n):\r\n pre.append(a[i]+pre[-1])\r\nvl=0\r\nfor i in range(len(k)):\r\n vl+=k[i]\r\n f=bisect.bisect_right(pre,vl)-1\r\n if f==n-1:\r\n print(n)\r\n vl=0\r\n else:\r\n print(n-1-f)", "import bisect\r\n\r\nn, q = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\npref = [0] * n\r\npref[0] = l1[0]\r\nfor x in range(1, n):\r\n pref[x] += l1[x] + pref[x-1]\r\n\r\narrow = 0\r\nfor x in range(q):\r\n arrow += l2[x]\r\n if arrow >= pref[-1]:\r\n arrow = 0\r\n print(n)\r\n else:\r\n c = bisect.bisect_right(pref, arrow)\r\n print(n-c)\r\n", "import sys\r\nfrom bisect import bisect_right\r\ninput = sys.stdin.readline \r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i - 1] \r\n\r\ns = 0 \r\nfor i in range(q): \r\n j = bisect_right(a, k[i] + s)\r\n if(j >= n):\r\n s = 0 \r\n j = 0 \r\n else:\r\n s += k[i]\r\n print(n - j)\r\n \r\n \r\n ", "from bisect import bisect as bs\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ntmp = 0\r\nsumA = []\r\nfor i in range(n):\r\n tmp += a[i]\r\n sumA.append(tmp)\r\n# print(sumA)\r\n\r\n\r\ndef bin_search(left, right, v):\r\n if left > right:\r\n return left\r\n mid = (left + right) // 2\r\n if sumA[mid] == v:\r\n return mid\r\n elif sumA[mid] < v:\r\n return bin_search(mid+1, right, v)\r\n else:\r\n return bin_search(left, mid-1, v)\r\n\r\n\r\n\r\nnow = 0\r\n\r\nansList = []\r\n\r\nfor i in range(q):\r\n now += k[i]\r\n ans_id = bs(sumA, now)\r\n if ans_id == n:\r\n now = 0\r\n ans_id = 0\r\n ansList.append(n-ans_id)\r\n\r\nprint(\"\\n\".join(map(str, ansList)))", "def upperbound(x, cum):\n i = 0\n j = len(cum)\n \n while i < j:\n m = (i + j) // 2\n if x >= cum[m]:\n i = m + 1\n else:\n j = m\n \n return i\n\nno, k = map(int, input().split())\nstrength = list(map(int, input().split()))\narrows = [int(x) for x in input().split()]\ncum = [0] * (no + 1)\n\nfor i in range(1, no+1):\n cum[i] = cum[i-1] + strength[i-1]\n\nl = 0\nfor x in arrows:\n x += l\n iup = upperbound(x, cum)\n \n if iup > no:\n l = 0\n print(no)\n continue\n \n alive = no - iup + 1\n l = x\n print(alive)\n\n \t \t\t \t\t\t\t \t\t\t\t \t\t \t\t \t \t", "def binarySearch(arr,l,r,x):\r\n ans=-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n if arr[mid]>x:\r\n r=mid-1\r\n elif arr[mid]==x:\r\n ans=mid\r\n break\r\n else:\r\n ans=mid\r\n l=mid+1\r\n return ans\r\nn,q=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nlis=list(map(int,input().split()))\r\nprefix=[arr[0]]\r\nfor j in range(1,n):\r\n prefix.append(prefix[-1]+arr[j])\r\ntemp=0\r\nans=[]\r\nfor j in range(q):\r\n temp2=lis[j]+temp\r\n temp1=binarySearch(prefix,0,n-1,temp2)\r\n if temp1==n-1:\r\n temp=0\r\n ans.append(n)\r\n else:\r\n temp=arr[temp1]\r\n temp+=(temp2-arr[temp1])\r\n ans.append(n-temp1-1)\r\nfor j in range(q):\r\n print(ans[j])\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, K):\r\n n = len(A)\r\n q = len(K)\r\n A2 = [0]\r\n for i in range(n):\r\n A2.append(A2[-1]+A[i])\r\n curr = 0\r\n for ki in K:\r\n curr+=ki\r\n if curr >= A2[-1]:\r\n curr = 0\r\n sys.stdout.write(f'{n}\\n')\r\n elif curr < A2[0]:\r\n sys.stdout.write(f'{n}\\n')\r\n else:\r\n s = 0\r\n e = n\r\n \"\"\"\r\n Invariant: A2[s] <= curr < A2[e]\r\n \"\"\"\r\n while s+1 < e:\r\n m = (s+e)//2\r\n if A2[m] <= curr:\r\n s, e = m, e\r\n else:\r\n s, e = s, m\r\n sys.stdout.write(f'{n+1-e}\\n')\r\n return \r\n\r\nn, q = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nK = [int(x) for x in input().split()]\r\nprocess(A, K)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,q=(int(i) for i in input().split())\r\na=[int(i) for i in input().split()]\r\nk=[int(i) for i in input().split()]\r\npref=[a[0]]\r\nfor i in range(1,n):\r\n pref.append(pref[i-1]+a[i])\r\ns=0\r\nfor i in range(q):\r\n s+=k[i]\r\n lo=0\r\n hi=n-1\r\n while(lo<hi):\r\n mid=(lo+hi)//2\r\n if(pref[mid]<s):\r\n lo=mid+1\r\n elif(pref[mid]>s):\r\n hi=mid\r\n else:\r\n lo=mid+1\r\n break\r\n if(lo==n-1):\r\n if(pref[lo]<=s):\r\n print(n)\r\n s=0\r\n else:\r\n print(n-lo)\r\n else:\r\n print(n-lo)", "warriors, minutes = map(int, input().split())\r\nstrength = list(map(int, input().split()))\r\narrows = list(map(int, input().split()))\r\nprefix_sum = [0] * warriors\r\nprefix_sum[0] = strength[0]\r\n\r\n# Calculate the prefix sum in a more Pythonic way using a loop\r\nfor i in range(1, warriors):\r\n prefix_sum[i] = prefix_sum[i - 1] + strength[i]\r\n\r\narrows_fired = 0\r\nremaining_warriors = warriors # Initialize with the total number of warriors\r\n\r\nfor i in range(minutes):\r\n arrows_fired += arrows[i]\r\n \r\n if arrows_fired >= prefix_sum[-1]:\r\n arrows_fired = 0\r\n remaining_warriors = warriors\r\n print(remaining_warriors)\r\n else:\r\n # Use bisect_left from the bisect module for binary search\r\n from bisect import bisect_left\r\n \r\n # Find the index where arrows_fired would be inserted in prefix_sum\r\n index = bisect_left(prefix_sum, arrows_fired+1)\r\n \r\n # Calculate remaining_warriors\r\n remaining_warriors = warriors - index\r\n \r\n print(remaining_warriors)\r\n", "n, q = list(map(int, input().split()))\naa = list(map(int, input().split()))\nkk = list(map(int, input().split()))\n\nfor i in range(1, n):\n # Don't do this in c++\n aa[i] += aa[i - 1]\n\ndef bsearch(v):\n top = n\n bottom = 0\n i = (top + bottom) // 2\n while aa[i] != v:\n if top == bottom:\n return 0\n if aa[i] > v:\n if aa[i - 1] < v:\n return i\n top = i\n elif aa[i] < v:\n if i == n - 1 or aa[i + 1] > v:\n return i + 1\n bottom = i\n i = (top + bottom) // 2\n return i + 1\n\narrows = 0\nfor v in kk:\n arrows += v\n if arrows >= aa[n-1]:\n print(n)\n arrows = 0\n else:\n print(n - bsearch(arrows))\n", "from bisect import bisect\n\nn, q = [int(i) for i in input().split()]\ns = [int(i) for i in input().split()]\nr = [int(i) for i in input().split()]+[0]\nu=[0]\nfor i in s:\n u.append(u[-1]+i)\nans = 0\nt = 0\nfor i in range(q):\n ans = bisect(u, r[i]+t)\n t+=r[i]\n if ans == n+1:\n ans = 1\n t = 0\n print(n-ans+1)", "import heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter\r\nfrom collections import OrderedDict\r\nfrom collections import deque\r\nfrom itertools import accumulate, product\r\n\r\nimport math\r\n\r\nR = lambda: map(int, input().split())\r\n\r\nn, q = R()\r\narr, arrows = list(accumulate(R())), list(R())\r\ncnt = 0\r\nfor t in range(q):\r\n cnt += arrows[t]\r\n i = bisect_right(arr, cnt)\r\n if i < n:\r\n print(n - i)\r\n else:\r\n print(n)\r\n cnt = 0", "from bisect import bisect \nn ,t = map(int, input().split())\nv = list(map(int, input().split()))\narr = list(map(int, input().split()))\nfor i in range(1, n):\n v[i] += v[i - 1]\np = 0\nfor i in range(t):\n p += arr[i]\n if p >= v[-1]:\n print(n)\n p = 0\n else:\n temp = n - bisect(v,p)\n print(temp) \n\t\t\t \t\t\t \t\t\t \t \t\t \t \t \t \t\t\t\t \t", "from bisect import bisect_right\n\ndef upperbound(x, cum):\n l, h = 0, len(cum)\n \n while l < h:\n m = (l + h) // 2\n if x >= cum[m]:\n l = m + 1\n else:\n h = m\n \n return l\n\n\nn, q = map(int, input().split())\n\nstrength = list(map(int, input().split()))\narrows = [int(x) for x in input().split()]\ncum = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n cum[i] = cum[i - 1] + strength[i - 1]\n\nlast = 0\nfor x in arrows:\n x += last\n \n ind = upperbound(x, cum)\n if ind > n:\n last = 0\n print(n)\n continue\n \n alive = n - ind + 1\n last = x\n \n print(alive)\n\n \t \t\t \t\t \t \t \t \t\t \t \t \t", "def find(num):\n z=0\n r=n-1\n while(z<r):\n mid=z+r>>1\n if(a[mid]>num):r=mid\n else:z=mid+1\n return z\nn,tes=map(int,input().split())\na=list(map(int,input().split()))\nc=list(map(int,a))\nb=list(map(int,input().split()))\nfor i in range(1,n):a[i]+=a[i-1]\nnow=0\nfor i in b:\n if(i+now>=a[n-1]):\n print(n)\n now=0\n continue\n now+=i\n print(n-find(now))\n\t\t\t \t \t \t\t \t\t\t \t\t\t \t \t\t", "import sys\r\ninput = lambda:sys.stdin.readline()\r\nMOD = 1000000007\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\ndgl = lambda: list(map(int, input()))\r\nf = lambda: list(map(int, input().split()))\r\nil = lambda: list(map(int, input().split()))\r\nls = lambda: list(input())\r\nfrom itertools import accumulate\r\nfrom bisect import bisect_right\r\nn,q=f()\r\nlstg=list(accumulate(il()))\r\narrw=list(accumulate(il()))\r\nsm=0\r\nfor i in range(q):\r\n x=bisect_right(lstg,arrw[i]-sm)\r\n if x==n:\r\n print(n)\r\n sm=arrw[i]\r\n else:\r\n print(n-x)", "\nfrom bisect import bisect\n# bisect(L,x) retourne i minimal tel que L[i]>x (len(L) si un tel i n'existe pas)\n# bisect_left(L,x) retourne i maximal tel que L[i-1]<x (0 si un tel i n'existe pas)\n\ndef solve(n, q, a, k):\n A = [0]\n for x in a:\n A.append(A[-1]+x)\n tot = 0\n for x in k:\n tot += x\n ndead = bisect(A, tot)-1\n if ndead>=n:\n ndead = 0\n tot = 0\n print(n-ndead)\n\nn, q = [int(_) for _ in input().split()]\na = [int(_) for _ in input().split()]\nk = [int(_) for _ in input().split()] \nsolve(n, q, a, k)\n \n", "from sys import stdin, stdout\r\nimport bisect\r\nn,q = [int(x) for x in stdin.readline().split()]\r\na = [int(x) for x in stdin.readline().split()]\r\nk = [int(x) for x in stdin.readline().split()]\r\nacc = 0\r\ndef lw(acc):\r\n global a, n\r\n pos = bisect.bisect_left(a,acc)\r\n if pos == n:\r\n return 0\r\n if a[pos] == acc:\r\n if pos + 1 == n:\r\n return 0\r\n return pos + 1\r\n return pos\r\n \r\nfor i in range(1,n):\r\n a[i] += a[i - 1]\r\n\r\nfor i in range(0,q):\r\n acc += k[i]\r\n stdout.write(str(n - lw(acc)) + '\\n')\r\n if acc >= a[-1]:\r\n acc = 0\r\n \r\n", "import sys\nimport math\nimport bisect\nimport itertools\n\nn,q = list(map(int,sys.stdin.readline().strip().split(' ')))\na = list(map(int,sys.stdin.readline().strip().split(' ')))\nprefix_sum = list(itertools.accumulate(a))\nk = list(map(int,sys.stdin.readline().strip().split(' ')))\n\nk_sum = 0\nfor q0 in range(q):\n\tk_sum += k[q0]\n\tidx = bisect.bisect_left(prefix_sum, k_sum)\n\tif idx < n and prefix_sum[idx] == k_sum:\n\t\tidx += 1\n\tif idx == n:\n\t\tprint(n)\n\t\tk_sum = 0\n\telse:\n\t\tprint(n-idx)\n", "from bisect import bisect_right\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nfor i in range(1,len(a)):\r\n a[i]+=a[i-1]\r\n# print(a)\r\nfill=0\r\nfor i in range(len(k)):\r\n fill+=k[i]\r\n # print(\"FILL->\",fill)\r\n idx=bisect_right(a,fill)\r\n # print(\"idx->\",idx)\r\n if idx==len(a):\r\n print(len(a))\r\n fill=0\r\n else:\r\n print(len(a)-idx)", "import math\nfrom bisect import bisect_right\nnumWarriors,numMinutes = map(int,input().split(\" \"))\nwarriorsStrength = list(map(int,input().split(\" \")))\narrowCount = list(map(int,input().split(\" \")))\n\nwarriorsSumStrength = [0]*(numWarriors)\nwarriorsSumStrength[0] = warriorsStrength[0]\n\ndef find_gt(a,x,lo,hi):\n\t#Find leftmost value grater than x\n\ti = bisect_right(a,x,lo,hi)\n\tif i != len(a):\n\t\treturn i\n\traise ValueError\n\n\nfor i in range(1,numWarriors):\n\twarriorsSumStrength[i] = warriorsSumStrength[i-1] + warriorsStrength[i]\n\t\ncurrWarrior = 0\ncurrWarriorStrength = warriorsStrength[currWarrior]\n\nfor numArrows in arrowCount:\n\t#print(\"currWarrior: \",currWarrior)\n\t#print(\"currWarriorStrength: \",currWarriorStrength)\n\tif currWarriorStrength >= numArrows:\n\t\tcurrWarriorStrength -= numArrows\n\t\tif currWarriorStrength == 0:\n\t\t\tcurrWarrior += 1\n\t\t\tif currWarrior == numWarriors:\n\t\t\t\tcurrWarrior = 0\n\t\t\tcurrWarriorStrength = warriorsStrength[currWarrior]\n\t\tprint(numWarriors-currWarrior)\n\t\tcontinue\n\tnumArrows -= currWarriorStrength\n\tif warriorsSumStrength[numWarriors-1] - warriorsSumStrength[currWarrior] <= numArrows:\n\t\tcurrWarrior = 0\n\t\tcurrWarriorStrength = warriorsStrength[currWarrior]\n\t\tprint(numWarriors-currWarrior)\n\t\tcontinue\n\t#print(\"numArrows: \",numArrows)\n\tnewWarrior = find_gt(warriorsSumStrength,numArrows+warriorsSumStrength[currWarrior],currWarrior+1,numWarriors)\n\t#print(\"newWarrior: \",newWarrior)\n\t#print(\"currWarrior: \",currWarrior)\n\tcurrWarriorStrength = warriorsSumStrength[newWarrior]-warriorsSumStrength[currWarrior]-numArrows\n\t#print(\"newWarriorStrength: \",currWarriorStrength)\n\tcurrWarrior = newWarrior\n\tprint(numWarriors-currWarrior)\n\n\n", "# Link: https://codeforces.com/problemset/problem/975/C\n\ndef binarySearch(power, arr):\n low, high = 0, len(arr) - 1\n ans = -1\n while low <= high:\n mid = (low + high) // 2\n if arr[mid] <= power:\n ans = mid\n low = mid + 1\n else:\n high = mid - 1\n return ans\n\n\nn, q = map(int, input().split())\narr = list(map(int, input().split()))\nk = list(map(int, input().split()))\n\n# prefix array\nfor i in range(1, n):\n arr[i] += arr[i-1]\n\npower = 0\nfor i in range(q):\n power += k[i]\n index = binarySearch(power, arr)\n\n # If end index is returned that means all warriors have died\n # So according to question we have to get their previous strengths back and fight again.\n if index == n - 1:\n print(n)\n power = 0\n # -1 means that the arrows of lagertha's warriors are not enough to kill the warriors of IVAR THE BONELESS.\n elif index == -1:\n print(n)\n\n # Just print the remaining warriors\n else:\n print(n-index-1)\n", "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ns = [0]\r\nfor i in a:\r\n s.append(s[-1] + i)\r\nans = []\r\nu = 0\r\nfor i in k:\r\n u += i\r\n x = bisect.bisect_right(s, u)\r\n ans0 = n - x + 1\r\n if not ans0:\r\n ans0, u = n, 0\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "n, q = list(map(int, input().strip().split()))\na = list(map(int, input().strip().split()))\nk = list(map(int, input().strip().split()))\nsumm = []\ncur = 0\nfor item in a:\n cur += item\n summ.append(cur)\n\n\ndef find_loc(l, val, r, nums, target):\n l0 = l\n while l < r:\n mid = (l + r) // 2\n cur_add = nums[mid] - nums[l0] + val\n if cur_add <= target:\n l = mid + 1\n else:\n r = mid\n if nums[l] - nums[l0] + val > target:\n return l, nums[l] - nums[l0] + val - target\n else:\n return l + 1, nums[0]\n\n\nst = 0\ncur = summ[0]\nfor item in k:\n loc, cur = find_loc(st, cur, n-1, summ, item)\n if loc == n:\n print(n)\n st = 0\n else:\n print(n-loc)\n st = loc\n \t\t\t\t \t \t \t \t \t \t \t\t \t \t\t\t", "from bisect import bisect, bisect_left, bisect_right\nimport sys\nimport threading\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ninp = sys.stdin.readline\ndef input(): return inp().strip()\ndef ii(): return int(input())\ndef mi(): return map(int, input().split())\ndef li(): return list(map(int, input().split()))\n\n\ndef solve():\n n, t = mi()\n w = li()\n a = li()\n\n pre = [0]\n for i in w:\n pre.append(i+pre[-1])\n pre.pop(0)\n gpre = pre.copy()\n last = 0\n # ans = [0]*t\n for k, v in enumerate(a):\n curr = bisect_right(pre, v+last)\n last += v\n x = n - curr-1\n if curr < n:\n print(x+1)\n else:\n print(n)\n pre = gpre\n last = 0\n\n\ndef main():\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "import bisect\r\n\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=[0,]\r\nfor i in a:\r\n s.append(s[-1]+i)\r\n\r\nk=list(map(int,input().split()))\r\ntb=0\r\nfor i in range(q):\r\n tb+=k[i]\r\n if tb>=s[-1]:\r\n tb=0\r\n print(n)\r\n else:\r\n ans=bisect.bisect_right(s,tb)\r\n print(n-ans+1)\r\n", "from bisect import bisect_right\r\nn,q=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nc = []\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += a[i]\r\n c.append(cnt)\r\nb = a\r\nnow = 0\r\ni = 0\r\n\r\nfor k0 in k:\r\n now += k0\r\n if now >= c[-1]:\r\n now=0\r\n print(n)\r\n else:\r\n ind = bisect_right(c,now)\r\n print(n-ind)", "import sys\r\nimport os.path\r\nif(os.path.exists('input_file.txt')):\r\n sys.stdin = open(\"input_file.txt\", \"r\")\r\n sys.stdout = open(\"output_file.txt\", \"w\")\r\n\r\ndef u_bound(j,n,pre):\r\n l=0\r\n r=n-1\r\n while r>=l:\r\n mid=(l+r)//2\r\n if pre[mid]==j:return n-mid-1\r\n elif pre[mid]<j:l=mid+1\r\n else :r=mid-1\r\n return n-r-1\r\n\r\ndef main():\r\n n,q=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n s=sum(a)\r\n c=0#sum os far\r\n pre=[a[0]]\r\n for i in a[1:]:\r\n pre.append(pre[-1]+i)\r\n for j in b:\r\n c+=j\r\n if c>=pre[-1]:\r\n print(n)\r\n c=0\r\n else:\r\n print(u_bound(c,n,pre))\r\n\r\n\r\nmain()", "import bisect as bi\r\nn,q = map(int,input().split())\r\na = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nsom = sum(a)\r\ne = 0\r\np = []\r\nfor i in a:\r\n e += i\r\n p.append(e)\r\n\r\ne = 0\r\ns = set(p)\r\nfor i in l:\r\n e += i\r\n if e >= som:\r\n e = 0\r\n\r\n x = bi.bisect(p,e)\r\n print(n-x)\r\n", "from bisect import bisect_left \r\n\r\ndef bi(a, x): \r\n i = bisect_left(a, x) \r\n return i\r\n\r\nn,q=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nb=[]\r\ns=0\r\nfor i in range(n):\r\n s=s+a[i]\r\n b.append(s)\r\ns=0\r\n\r\nfor i in range(q):\r\n s=s+k[i]\r\n c=bi(b,s)\r\n if c==n:\r\n s=0\r\n print(n)\r\n elif c==n-1 and b[c]==s:\r\n s=0\r\n print(n)\r\n elif s==b[c]:\r\n print(n-c-1)\r\n else:\r\n print(n-c)", "import bisect\nfrom itertools import accumulate\na,q=[int(x) for x in input().split()]\nt=[int(x) for x in input().split()]\nt=list(accumulate(t))\ns=0\nb = [int(x) for x in input().split()]\nfor x in b:\n s+=x\n if s>=t[-1]:\n print (a)\n s=0\n else:\n print (a-bisect.bisect(t,s))\n \t \t\t \t\t \t \t\t\t\t\t \t \t\t\t\t\t \t\t\t", "import bisect\r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\nsurplus = 0\r\nfor i in range(q):\r\n pos = bisect.bisect_right(a, b[i] + surplus)\r\n if pos >= n:\r\n pos = 0\r\n surplus = 0\r\n else:\r\n surplus += b[i]\r\n print(n - pos)\r\n", "import bisect\r\nn, q = map(int,input().split())\r\n\r\nhealth = list(map(int,input().split()))\r\narrows = list(map(int,input().split()))\r\n\r\ncuHealth = []\r\nsu = 0\r\nfor i in health:\r\n su+=i\r\n cuHealth.append(su)\r\ntotal = sum(health)\r\nprev = 0\r\nfor arr in arrows:\r\n if arr + prev>=total:\r\n prev = 0\r\n print(n)\r\n continue\r\n index = bisect.bisect(cuHealth, prev + arr)\r\n prev += arr\r\n print(n - index)\r\n", "import os\r\nfrom string import *\r\nfrom math import *\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom re import *\r\nfrom sys import *\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nstdin, stdout = IOWrapper(stdin), IOWrapper(stdout)\r\ninput = lambda: stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n#--> ACM-ICPC -\"NEVER LOSE YOUR HOPE\"\r\ndef binary_search(p,i):\r\n if z[-1]-p<=i:print(a);return 0\r\n lo,hi,ans=0,a,0\r\n while lo<=hi:\r\n mid=(lo+hi)//2\r\n if z[mid]-p<i:lo=mid+1\r\n elif z[mid]-p>i:hi=mid-1;ans=mid-1\r\n elif z[mid]-p==i:ans=mid;break\r\n else:break\r\n p+=i\r\n print(a-ans)\r\n return p\r\na,b=map(int,input().split())\r\nz=[0];p=0\r\nfor i in map(int,input().split()):z+=[z[-1]+i]\r\nfor i in map(int,input().split()):p=binary_search(p,i)\r\n", "def lb(arr, val):\n\tle = 0\n\tri = len(arr)\n\twhile le < ri:\n\t\tmid = (le+ri)//2\n\t\tif arr[mid] >= val:\n\t\t\tri = mid\n\t\telse:\n\t\t\tle = mid+1\n\treturn le\n\nn, q = map(int, input().split(\" \"))\nwar = list(map(int, input().split(\" \")))\narr = list(map(int, input().split(\" \")))\npre = [war[0]]\nfor i in range(1, len(war)):\n\tpre.append(pre[i-1]+war[i])\ntotalHeal = pre[-1]\ncurArrw = 0\nfor i in range(q):\n\tcurArrw += arr[i]\n\tif curArrw >= totalHeal:\n\t\tprint(n)\n\t\tcurArrw = 0\n\telse:\n\t\tidx = lb(pre, curArrw)\n\t\tif (pre[idx]-curArrw > 0):\n\t\t\tidx-=1\n\t\tidx += 1\n\t\tprint(n - idx)\n", "from bisect import bisect_right\r\nn, x = map(int, input().split())\r\narrows = list(map(int, input().split()))\r\nkill = list(map(int, input().split()))\r\n\r\nfor i in range(1,n):\r\n arrows[i] += arrows[i-1]\r\n\r\ntemp = 0\r\nfor i in kill:\r\n temp += i\r\n temp1 = bisect_right(arrows, temp)\r\n if n != temp1: print(n - temp1)\r\n else:\r\n print(n)\r\n temp = 0" ]

[ "n, k = map(int, input().split())\r\np = [0 for i in range(n+1)]\r\nd = p.copy()\r\nfor i in range(k):\r\n a = list(map(int, input().split()))\r\n l = len(a)\r\n for j in range(1, l - 1):\r\n p[a[j]] = a[j+1]\r\n d[a[j+1]] = 1\r\nc = 1\r\nwhile p[c] == c + 1:\r\n c = p[c]\r\nans = 0\r\nfor i in range(c+1,n+1):\r\n ans += 1 + d[i]\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\r\nres = 2 * n - m + 1\r\nfor i in range(m):\r\n arr = list(map(int, input().split()))\r\n for j in range(1, len(arr)):\r\n if arr[j] == j:\r\n res -= 2\r\nprint(res)\r\n", "def main():\n n, k = map(int, input().split())\n res = 0\n for _ in range(k):\n tmp = list(map(int, input().split()))\n if tmp[1] == 1:\n tmp[0] = 0\n for i, x in enumerate(tmp):\n if i != x:\n res += (len(tmp) - i) * 2\n break\n else:\n res += len(tmp) * 2 - 3\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\nfor _ in range(k):\r\n a = list(map(int, input().split()))[1:] + [0]\r\n if a[0] != 1: continue\r\n i = 0\r\n while a[i + 1] == i + 2:\r\n i += 1\r\nprint(2 * n - k - 1 - 2 * i)", "n, k = map(int, input().split())\r\nm = [list(map(int, input().split())) for _ in range(k)]\r\n\r\nfor row in m:\r\n if row[1] == 1:\r\n for idx in range(1, row[0] + 1):\r\n if row[idx] != idx:\r\n idx -= 1\r\n break\r\n break\r\nans = (n-1) + (n-k) - 2*(idx-1)\r\nprint(ans)", "n, k = map(int, input().split())\r\nm = [0]*k; f = 0;\r\nfor y in range(k):\r\n m = list(map(int, input().split()))[1:]\r\n i = 0\r\n while i < len(m):\r\n if m[i] == 1:\r\n if i > 0:\r\n f += 1\r\n j = i+1\r\n while j < len(m):\r\n if m[j] - m[j-1] != 1:\r\n f += 1\r\n break\r\n j += 1\r\n i = j\r\n elif i > 0:\r\n f += 1\r\n i += 1\r\nprint(2*f+k-1)\r\n", "def func(mas, n, m):\r\n flag1=0\r\n flag2=n-1\r\n i=0\r\n j=1\r\n while(i<m):\r\n if(mas[i][1]==1):\r\n tmp = mas[i][0]-1\r\n while(j<mas[i][0]):\r\n if(mas[i][j]==mas[i][j+1]-1):\r\n flag2-=1\r\n tmp-=1\r\n else:\r\n break\r\n j+=1\r\n flag1+=tmp\r\n else:\r\n flag1=flag1+mas[i][0]-1\r\n i+=1\r\n return flag1+flag2\r\nn,m = map(int, input().split())\r\nmas=[[]for i in range(m)]\r\nh=0\r\nfor i in mas:\r\n s = input()\r\n p = s.split()\r\n while h<len(p):\r\n i.append(int(p[h]))\r\n h+=1\r\n h=0\r\nprint(func(mas,n,m))", "n,k=map(int,input().split())\r\nl=0\r\ng=k\r\nfor i in range(k):\r\n\ts,*x=map(int,input().split())\r\n\tif x[0]==1:\r\n\t\tfor i in range(s):\r\n\t\t\tif x[i]!=i+1:\r\n\t\t\t\ti-=1\r\n\t\t\t\tbreak\r\n\t\ti+=1\r\n\t\tbreak\r\nans=(n-1)+(n-k)-2*(i-1)\r\nprint(ans)", "n,k=[int(x) for x in input().split()]\r\nctr=0\r\nnum=0\r\nfor _ in range(k):\r\n tmp=list(map(int,input().split()))\r\n if tmp[0]==1:num+=1; continue\r\n i=1\r\n while i<len(tmp):\r\n if tmp[i]==1:\r\n num+=1\r\n while i+1<len(tmp) and tmp[i+1]==tmp[i]+1:i+=1\r\n ctr+=1\r\n i+=1\r\n else:num+=1; i+=1; ctr+=1\r\n ctr-=1\r\n#print(ctr)\r\n#print(num)\r\nprint(num-1+ctr)", "def main():\n n, k = map(int, input().split())\n for i in range(k):\n tmp = input().split()\n if tmp[1] == '1':\n tmp.append('0')\n tmp[0] = '0'\n for i, m in enumerate(map(int, tmp)):\n if i != m:\n print((n - i) * 2 - k + 3)\n return\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\n\r\na = 2 * n - k + 1\r\n\r\nfor _ in range(k):\r\n x = list(map(int, input().split()))[1:]\r\n for i in range(len(x)):\r\n if i + 1 == x[i]:\r\n a -= 2\r\n \r\nprint(a)", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nr=k-1\r\ny=0\r\nfor _ in range(k):\r\n t=list(I())\r\n for i in range(1,t[0]):\r\n if t[i]==y+1:\r\n y+=1\r\n if t[i+1]!=t[i]+1:r+=2\r\n else:\r\n if y:y=-1\r\n r+=2\r\nprint(r)", "n,m=(int(x) for x in input().split())\n\nans=2*n-m-1\n\nfor i in range(m):\n\n a=[int(x) for x in input().split()]\n\n for j in range(1,a[0]):\n\n if a[j+1]==j+1 and a[j]==j:ans-=2\n\n else:break\n\nprint(ans)\n\n\n\n# Made By Mostafa_Khaled", "n,k=m=map(int,input().split())\r\nans=0\r\nfor _ in range(k):\r\n l=list(map(int,input().split()))\r\n ans+=l[0]-1\r\n p=-20\r\n for x in l[1:]:\r\n if x==1:p=0\r\n elif p!=-20:\r\n if p+2==x: p+=1\r\n else: ans-=p;p=-20\r\n if p!=-20: ans-=p\r\n\r\nans*=2\r\nans+=k-1\r\nprint(ans)\r\n\r\n#https://codeforces.com/problemset/problem/555/A", "n, k = (int(x) for x in input().split())\nl = [None for _ in range(k)]\nfor i in range(k):\n\tl[i] = [int(x) for x in input().split()[1:]]\nfor m in l:\n\tif m[0] == 1:\n\t\ti = 0\n\t\twhile i < len(m) and m[i] == i + 1:\n\t\t\ti += 1\n\t\tprint(n * 2 - i * 2 - k + 1)\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n if a[1] == 1:\r\n cnt, j = 0, 2\r\n while j <= a[0] and a[j] == a[j - 1] + 1:\r\n cnt += 1\r\n j += 1\r\nprint((n - m - cnt) * 2 + (m - 1))", "#!/usr/bin/env python3\nn, k = map(int,input().split())\ny = 0\nfor i in range(k):\n xs = list(map(int,input().split()))\n m, xs = xs[0], xs[1:]\n if xs[0] == 1:\n j = 0\n while j < m and xs[j] == j+1:\n j += 1\n m -= j\n y += m # decompose\n y += m # compose\n else:\n y += m - 1 # decompose\n y += m # compose\nprint(y)\n", "def read_data():\r\n n, k = map(int, input().split())\r\n As = []\r\n m = 0\r\n for i in range(k):\r\n ma = list(map(int, input().split()))\r\n As.append(ma[1:])\r\n m += ma[0] - 1\r\n return n, k, As, m\r\n\r\ndef solve(n, k, As, m):\r\n As.sort()\r\n steps = n + 1 + m\r\n mat1 = As[0]\r\n for i, mi in enumerate(mat1, 1):\r\n if i == mi:\r\n steps -= 2\r\n else:\r\n break\r\n return steps\r\n\r\nn, k, As, m = read_data()\r\nprint(solve(n, k, As, m))", "# 555A\r\n# θ(n) time\r\n# O(n) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n, k = read(3)\r\n c = 0\r\n l = 1\r\n for _ in range(k):\r\n a = read(3)\r\n if a[1] == 1:\r\n j = 1\r\n while j < a[0] and a[j + 1] - a[j] == 1:\r\n j += 1\r\n l += 1\r\n c += a[0] - j\r\n else:\r\n c += a[0] - 1\r\n return c + n - l\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "#!/usr/bin/python3\nn1 = []\nn1 = input(\"\").split(\" \")\nn = int (n1[0])\nk= int(n1[1])\nx= int (0)\ny= int(-1)\nz = int (0)\n\n\nbreakc = int(0)\naddc = int(0)\nx = []\nf =int(0)\nfor i in range(0,k):\n\tx=input(\"\").split(\" \")\n\ty = -1\n\tif f != 1:\n\t\tfor j in range(1,int(x[0])+1):\n\t\t\tz=int(x[j])\n\t\t\tif z==1:\n\t\t\t\ty = 1\n\t\t\t\tfor k in range(j+1, int(x[0])+1):\n\t\t\t\t\tz=int(x[k])\n\t\t\t\t\tif z == (y+1):\n\t\t\t\t\t\taddc +=1\n\t\t\t\t\t\ty =z\n\t\t\t\t\telse:\n\t\t\t\t\t\tf = 1\n\t\t\t\t\tif k == int(x[0]):\n\t\t\t\t\t\tf = 1\n\t\t\t\t\tif f == 1:\n\t\t\t\t\t\tx[0] = int(x[0]) - addc\n\t\t\t\t\t\t\n\t\t\t\t\t\tbreak\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\tbreakc += int(x[0]) - 1\n\n\nprint(breakc + (n - addc) - 1)\n", "#!/usr/bin/env python3\n\ndef solve(n, seq):\n found = 0\n res = 0\n for s in seq:\n if s[1] == 1:\n found = 1\n while len(s) > found and s[found] == found:\n found += 1\n found -= 1\n rest = s[0] - found\n res += rest\n else:\n res += s[0]-1\n return res + n - found\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n seq = [list(map(int, input().split())) for _ in range(k)]\n print(solve(n, seq))\n", "n, k = map(int, input().split())\r\ncnt = 0\r\nans = 0\r\nfor i in range(k):\r\n a = list(map(int, input().split()))\r\n if a[1] == 1:\r\n for j in range(2, len(a)):\r\n if a[j] > a[j - 1] + 1:\r\n ind = j\r\n break\r\n else:\r\n cnt += 1\r\n continue\r\n cnt += 1 + len(a) - ind\r\n ans += len(a) - ind\r\n else:\r\n cnt += len(a) - 1\r\n ans += len(a) - 2\r\n\r\nprint(ans + cnt - 1)\n# Thu Jan 07 2021 13:46:59 GMT+0300 (Москва, стандартное время)\n", "n,k=map(int,input().split())\r\na=0\r\nfor _ in ' '*k:\r\n *l,=map(int,input().split())\r\n for i in range(1,l[0]):\r\n if l[i]==i and l[i+1]==i+1:a+=2\r\nprint(2*n-k-1-a)", "d = input().split()\r\n\r\nn = int(d[0])\r\nm = int(d[1])\r\n\r\nr = 0\r\nq = 0\r\n\r\nfor i in range(m):\r\n s = [int(x) for x in input().split()][1::]\r\n if s[0] != 1:\r\n r += len(s) - 1\r\n q += len(s)\r\n else:\r\n if len(s) <= 1:\r\n q += 1\r\n else:\r\n w = 0\r\n while w+1 < len(s) and s[w] == s[w+1] - 1:\r\n w += 1\r\n q += len(s) - w\r\n r += len(s) - w - 1\r\n\r\nprint(r + q - 1)", "n, k = map(int, input().split())\ntime = 0\n\nntd = 0\n\nfor i in range(k):\n\tmtr = list(map(int, input().split()))[1:]\n\n\tif mtr[0] == 1:\n\t\tln = 0\n\n\t\tdlt = mtr[-1]\n\t\tmtr.reverse()\n\n\n\t\tfor j, val in enumerate(mtr[:-1]):\n\t\t\tif val-mtr[j+1] != 1:\n\t\t\t\t#print('*')\n\t\t\t\ttime += j-ln+1\n\t\t\t\t#print('!', j-ln+1)\n\t\t\t\tln = j + 1\n\t\t\t\tdlt = mtr[j+1]\n\t\t\t\t\n\n\telse:\n\t\t#print('-', i, len(mtr)-1)\n\t\ttime += len(mtr)-1\n\n#print('\\n------------------\\n', time, n, dlt)\nprint(time + n - dlt)\n", "n , k = map(int,input().split())\r\nfor i in range(k):\r\n b = list(map(int,input().split()))[1:]\r\n b.append(0)\r\n if b[0] != 1:\r\n continue\r\n x = 0\r\n while b[x + 1] == x + 2 :\r\n x += 1\r\nprint(2 * n - k - 2 * x - 1)", "(n, k) = list(map(int, input().split(' ')))\n\nr = 2 * n - k + 1\n\nfor kk in range(k):\n a = list(map(int, input().split(' ')))[1:]\n\n index = 1\n for aa in a:\n if(aa == index):\n r -= 2 \n\n index += 1\n\nprint(r)\n \t\t\t\t \t\t \t\t \t \t \t\t", "n, k = map(int, input().split(' '))\r\nfor i in range(k):\r\n x = input().split(' ')\r\n if x[1] == '1':\r\n y = [int(j) for j in x[1:]] + [0]\r\n z = 0\r\n while y[z+1] == z+2:\r\n z += 1\r\nprint(2*n-k-1-2*z)\r\n", "import sys\nfrom math import *\nfrom collections import Counter,defaultdict,deque\ninput=sys.stdin.readline\nmod=10**9+7\ndef get_ints():return map(int,input().split())\ndef get_int():return int(input())\ndef get_array():return list(map(int,input().split()))\ndef input():return sys.stdin.readline().strip()\n\n# for _ in range(int(input())):\nn,k=get_ints()\nans=0\nfor _ in range(k):\n a=get_array()\n ans+=a[0]-1\n if a[1]==1:\n for i in range(2,len(a)):\n if a[i]==a[i-1]+1:\n ans-=2\n else:\n break\nans+=n-1\nprint(ans)", "import sys\n\nn, k = map(int, sys.stdin.readline().split())\nans, pref = 0, 0\nfor i in range(k):\n m, *a = list(map(int, sys.stdin.readline().split()))\n j = 0\n while j < m and a[j] == j + 1:\n j += 1\n if j:\n pref = j\n ans += m - j\n else:\n ans += m - 1\nprint(ans + n - pref)\n", "n,k = map(int, input().split())\n\nactions = 0\nfor chain_idx in ' ' * k:\n chain = [int(x) for x in input().split()[1:]]\n if 1 not in chain:\n actions += len(chain) * 2 - 1\n else:\n pops = len(chain)\n for i,v in enumerate(chain):\n if v == i + 1:\n pops -= 1\n else:\n break\n actions += pops * 2\n\nif k == 1:\n print(0)\nelse:\n print(actions)\n# Fri Jan 08 2021 15:43:25 GMT+0300 (Москва, стандартное время)\n", "n, k = map(int, input().split())\nu = 0\nfor i in range(k):\n a = list(map(int, input().split()))[1:]+[0]\n if a[0] == 1:\n while a[u] == u+1: u += 1\nprint(n+n-u-u-k+1)\n \n", "n, k = [int(c) for c in input().split()]\r\na = []\r\nfor i in range(k):\r\n ak = [int(c) for c in input().split()]\r\n a.append(ak[1:])\r\n\r\ntotal = k - 1\r\n\r\nfor ak in a:\r\n if ak[0] == 1:\r\n j = 1\r\n while j <= len(ak) - 1:\r\n if ak[j] != ak[j-1] + 1:\r\n break\r\n j += 1\r\n total += 2*(len(ak) - j)\r\n else:\r\n total += 2*(len(ak) - 1)\r\n\r\nprint(total)", "n, k = map(int, input().split())\n\nds = []\nc = 0\n\nfor _ in range(k):\n arr = list(map(int, input().split()))\n if 1 in arr[1:]:\n ds = arr[1:]\n else:\n c += arr[0] - 1\n\nl = ds[-1]\nfor i, d in enumerate(ds):\n if i and d > ds[i - 1] + 1:\n c += len(ds) - i\n l = ds[i - 1]\n break\n\nprint(c + n - l)\n", "n, k = list(map(int,input().split(\" \")))\ncost = 0\nfor i in range(k):\n\tinp = list(map(int,input().split(\" \")))\n\tm = inp[0]\n\ta = inp[1:]\n\tif a[0] != 1:\n\t\tcost += m * 2 - 1\n\telse:\n\t\tfor j in range(m):\n\t\t\tif a[j] == j+1:\n\t\t\t\tcontinue\n\t\t\tj -= 1\n\t\t\tbreak\n\t\tcost += (m - j) * 2 - 1\nprint(cost - 1)\n", "n, k = map(int, input().split())\r\nfor _ in range(k):\r\n a=list(map(int, input().split()))[1:]+[0]\r\n if a[0]!=1:\r\n continue\r\n i=0\r\n while a[i+1]==i+2:\r\n i+=1\r\n#print(i)\r\nprint(2*n-k-1-2*i)\r\n" ]

[ "from math import log\r\nfrom sys import exit\r\nn = int(input())\r\na = [i for i in range(n + 1)]\r\n\r\ndef ans(n):\r\n if n <= 0 or n % 2:\r\n return\r\n j, cr = (1 << int(log(n, 2))), 1\r\n while j + cr - 1 <= n:\r\n a[j - cr], a[j + cr - 1] = a[j + cr - 1], a[j - cr]\r\n cr += 1\r\n ans(j - cr)\r\n \r\nif n % 2 == 0:\r\n ans(n)\r\n print(\"YES\")\r\n print(*a[1:])\r\nelse:\r\n print(\"NO\")\r\n\r\nif n <= 5 or (1 << int(log(n, 2))) == n:\r\n print(\"NO\")\r\n exit(0)\r\n \r\nprint(\"YES\")\r\nprint(\"3 6 1 5 4 2\" if n <= 6 else \"3 6 1 5 4 7 2\", end=' ')\r\ncr = 8\r\nv = (1 << int(log(n, 2)))\r\nfor i in range(8, n + 1):\r\n if i >= v:\r\n print(n if i == v else i - 1, end=' ')\r\n continue\r\n if i == cr:\r\n cr *= 2\r\n print(cr - 1, end=' ')\r\n else:\r\n print(i - 1, end=' ')\r\n\r\n \r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v, w):\r\n return (u * m + v) * m + w\r\n\r\nn, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nu = [0] * (n + 1)\r\nfor i in range(n):\r\n x = a[i] if t[i] & 1 else -a[i]\r\n u[i + 1] = u[i] + x\r\ni = 0\r\nd = dict()\r\nv = []\r\nfor j in range(n + 1):\r\n if not u[j] in d:\r\n d[u[j]] = len(v)\r\n v.append(u[j])\r\n u[j] = d[u[j]]\r\nz = len(v)\r\nc1, c2 = [z] * z, [z] * z\r\nfor i in range(z):\r\n if v[i] + k in d:\r\n c1[i] = d[v[i] + k]\r\n if v[i] - k in d:\r\n c2[i] = d[v[i] - k]\r\nq = int(input())\r\nl0, r0 = [0] * q, [0] * q\r\nm1 = 246\r\nm2 = n // m1 + 1\r\nm = max(n, q)\r\nc = [0] * (m2 + 1)\r\nq0 = [0] * q\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n l0[i], r0[i] = l - 1, r\r\n x = (l - 1) // m1\r\n c[x + 1] += 1\r\n r1 = r if not x & 1 else n - r - 1\r\n q0[i] = f(x, r1, i)\r\nfor i in range(1, m2 + 1):\r\n c[i] += c[i - 1]\r\nq0.sort()\r\nl, r = 0, 0\r\ncnt, ans = [0] * (z + 1), [0] * q\r\ncnt[0] = 1\r\nans0 = 0\r\nfor i in range(m2):\r\n for j in range(c[i], c[i + 1]):\r\n k = q0[j] % q\r\n l1, r1 = l0[k], r0[k]\r\n while l1 < l:\r\n l -= 1\r\n ans0 += cnt[c1[u[l]]]\r\n cnt[u[l]] += 1\r\n while r < r1:\r\n r += 1\r\n ans0 += cnt[c2[u[r]]]\r\n cnt[u[r]] += 1\r\n while l < l1:\r\n cnt[u[l]] -= 1\r\n ans0 -= cnt[c1[u[l]]]\r\n l += 1\r\n while r1 < r:\r\n cnt[u[r]] -= 1\r\n ans0 -= cnt[c2[u[r]]]\r\n r -= 1\r\n ans[k] = ans0\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "# ''' # FASTIO BEGINS -------------------->\r\nimport atexit,io,os,sys\r\nss=io.BytesIO()\r\n_write=ss.write\r\nss.write=lambda sett:_write(sett.encode())\r\natexit.register(lambda:os.write(1,ss.getvalue()))\r\ny_in=open(0).read().split(\"\\n\")\r\ndef y_inf():\r\n for y_id in range(len(y_in)):\r\n yield y_id\r\ny_ino=y_inf()\r\ninput=lambda:y_in[next(y_ino)]\r\n# FASTIO ENDS <------------------------ '''\r\n\r\n''' NOTES BEGIN ---------------------------->\r\n\r\nsys.setrecursionlimit(1000)\r\n\r\ndef checkprime(n):\r\n if(n > 1):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if (n % i == 0):\r\n return 0\r\n return 1\r\n else:\r\n return 0\r\n\r\ndef primesieve(n):\r\n array=[1]*n\r\n for i in range(4,n,2):\r\n array[i]=0\r\n for i in range(2,n):\r\n for j in range(i*i,n,i):\r\n array[j]=0\r\n return array\r\n\r\ndef arrayXOR(n): # XOR of range [1, n]\r\n if n % 4 == 0:\r\n return n\r\n elif n % 4 == 1:\r\n return 1\r\n elif n % 4 == 2:\r\n return n + 1\r\n else:\r\n return 0\r\n\r\nbisect.bisect_left(arr, num, lo=0, hi=len(arr)) == std::lower_bound(start_ptr, end_ptr, num)\r\nbisect.bisect_right(arr, num, lo=0, hi=len(arr)) == std::upper_bound(start_ptr, end_ptr, num)\r\n\r\n'''\r\n# <--------------------------------------\r\n\r\n''' // -- Template by A_*_A -- // '''\r\nfrom math import ceil\r\n\r\n\r\ndef prod(a, mod=10 ** 9 + 7):\r\n ans = 1\r\n for each in a:\r\n ans = (ans * each) % mod\r\n return ans\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\n\r\ndef binary(x, length=16):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n\r\n\r\nfor _ in range(int(input()) if not True else 1):\r\n #n = int(input())\r\n n, k = map(int, input().split())\r\n # a, b = map(int, input().split())\r\n # c, d = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n # s = input()\r\n for i in range(n):\r\n # math = eco + k\r\n # math - eco = k\r\n if t[i] == 2:\r\n a[i] *= -1\r\n \r\n count = [0] * (n + 1)\r\n pre = [0]\r\n for i in a:\r\n pre += [pre[-1] + i]\r\n\r\n index = {}\r\n cc = list(set(pre))\r\n for i in range(len(cc)):\r\n index[cc[i]] = i\r\n \r\n minusK = [-1]*(n + 1)\r\n plusK = [-1] * (n + 1)\r\n zero = [-1] * (n + 1)\r\n for i in range(n + 1):\r\n if pre[i] - k in index:\r\n minusK[i] = index[pre[i] - k]\r\n if pre[i] + k in index:\r\n plusK[i] = index[pre[i] + k]\r\n zero[i] = index[pre[i]]\r\n \r\n \r\n BLOCK_SIZE = 320\r\n blocks = [[] for i in range(BLOCK_SIZE)]\r\n q = int(input())\r\n ans = [0]*q\r\n for i in range(q):\r\n l, r = map(int, input().split())\r\n blocks[l // BLOCK_SIZE] += [[l-1, r, i]]\r\n \r\n for i in range(len(blocks)):\r\n if not blocks[i]: continue\r\n blocks[i] = sorted(blocks[i], key=lambda x: x[1])\r\n left = right = BLOCK_SIZE * i\r\n res = 0\r\n count[zero[left]] += 1\r\n for l, r, ind in blocks[i]:\r\n while right < r:\r\n right += 1\r\n if minusK[right] != -1:\r\n res += count[minusK[right]]\r\n count[zero[right]] += 1\r\n while left < l:\r\n count[zero[left]] -= 1\r\n if plusK[left] != -1:\r\n res -= count[plusK[left]]\r\n left += 1\r\n while left > l:\r\n left -= 1\r\n if plusK[left] != -1:\r\n res += count[plusK[left]]\r\n count[zero[left]] += 1\r\n ans[ind] = res\r\n\r\n while left <= right:\r\n count[zero[left]] -= 1\r\n if plusK[left] != -1:\r\n res -= count[plusK[left]]\r\n left += 1\r\n assert res == 0\r\n \r\n for i in ans:\r\n print(i)\r\n''' // -- Template by A_*_A -- // '''\r\n" ]

[ "s=input()\r\nn=int(input())\r\nm=\"z\"\r\nf=0\r\nfor i in range(n):\r\n t=input()\r\n if t.find(s)==0:\r\n f=1\r\n if t<=m:\r\n m=t\r\nif f==0:\r\n print(s)\r\nelse:\r\n print(m)", "x=str(input());ans=\".\";ln = len(x)\r\nfor i in range(int(input())):\r\n\ts=str(input())\r\n\tif(s[:ln]==x and ans>s):ans=s\r\n\tif(s[:ln]==x and ans==\".\"):ans=s\r\nprint(ans) if(ans!=\".\") else print(x)\r\n", "ori = input()\r\nN = int(input())\r\n\r\nans = None\r\nfor i in range(N):\r\n E = input()\r\n if len(E) < len(ori) or E[:len(ori)] != ori: continue\r\n if ans == None: ans = E\r\n else: ans = min(ans, E)\r\n \r\nif ans == None: print(ori)\r\nelse: print(ans)", "import functools\r\n\r\ndef sorter(x, y):\r\n xlen = len(x)\r\n ylen = len(y)\r\n\r\n for i in range(min(xlen, ylen)):\r\n if x[i] < y[i]:\r\n return -1\r\n elif x[i] > y[i]:\r\n return 1\r\n\r\n if xlen < ylen:\r\n return -1\r\n elif xlen > ylen:\r\n return 1\r\n return 0\r\n\r\ndef main():\r\n s = input().strip()\r\n ss = []\r\n n = int(input())\r\n for _ in range(n):\r\n ss.append(input().strip())\r\n\r\n fs = []\r\n for e in ss:\r\n if e.startswith(s):\r\n fs.append(e)\r\n\r\n if len(fs) == 0:\r\n print(s)\r\n else:\r\n fs = sorted(fs, key = functools.cmp_to_key(sorter))\r\n print(fs[0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nn = int(input())\r\nList = []\r\n\r\nfor i in range(0, n):\r\n List.append(input())\r\nList.sort()\r\n\r\nfor i in range(0, n):\r\n if List[i].startswith(s):\r\n flag = True\r\n s = List[i]\r\n break\r\n\r\nprint(s)", "s = input()\nn = int(input())\n\n\nresult = \"z\"*103\nfor i in range(n):\n str = input()\n if str.startswith(s) :\n if str < result:\n result = str\n min_lenght = len(str)\n\nif result == \"z\"*103:\n print(s)\nelse:\n print(result)\n\t \t\t \t\t \t\t \t\t \t\t\t\t\t", "s = input()\r\nn = int(input())\r\na = sorted([input() for _ in range(n)])\r\ntry:\r\n t = next(filter(lambda x: x.startswith(s), a))\r\n print(t)\r\nexcept StopIteration:\r\n print(s)", "s = str(input())\r\nn = int(input())\r\noutput = ''\r\nfor j in range(n):\r\n t = str(input())\r\n if s in t:\r\n if t.index(s) == 0:\r\n if output == '':\r\n output = t\r\n else:\r\n output = sorted([output, t])[0]\r\nif output == '':\r\n print(s)\r\nelse:\r\n print(output)\r\n", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\ndef is_prefix(string, prefix, n, m):\r\n ptr = 0\r\n while ptr < min(n, m) and string[ptr] == prefix[ptr]:\r\n ptr += 1\r\n return ptr == m\r\n\r\nfor t in range(1):\r\n s = input().strip()\r\n n = int(input().strip())\r\n arr = []\r\n \r\n for i in range(n):\r\n arr.append(input().strip())\r\n \r\n arr.sort()\r\n \r\n for i in range(n):\r\n if is_prefix(arr[i], s, len(arr[i]), len(s)):\r\n print(arr[i])\r\n break\r\n else:\r\n print(s)\r\n \r\n \r\n\r\n ", "palavra = input()\r\nqtd = int(input())\r\nhistory = [input() for i in range(qtd)]\r\nhistory.sort()\r\n\r\nnew = []\r\n\r\nfor p in history:\r\n\tif p >= palavra:\r\n\t\tnew.append(p)\r\n\r\nif len(new) == 0:\r\n\tprint(palavra)\r\nelse:\r\n\tfirst = new[0]\r\n\tif first == palavra:\r\n\t\tprint(palavra)\r\n\telse:\r\n\t\tif len(first) >= len(palavra):\r\n\t\t\tif first[:len(palavra)] == palavra:\r\n\t\t\t\tprint(first)\r\n\t\t\telse:\r\n\t\t\t\tprint(palavra)\r\n\t\telse:\r\n\t\t\tprint(palavra)", "s = input()\r\nsl = len(s)\r\nn = int(input())\r\n\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n if x[:sl] == s:\r\n l.append(x)\r\n\r\nfor e in l:\r\n for _e in l:\r\n if e > _e:\r\n break\r\n\r\n else:\r\n print(e)\r\n break\r\n\r\nelse:\r\n print(s)", "s = input()\r\nn = int(input())\r\nlength_orig = len(s)\r\n\r\nans = \"z\"*100\r\nfor _ in range(n):\r\n astring = input()\r\n\r\n if astring[:length_orig] == s and astring < ans:\r\n ans = astring\r\n \r\nprint(s if ans == \"z\"*100 else ans)", "s=input()\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n s1=input()\r\n if len(s1)<len(s):\r\n continue\r\n if s1[:len(s)]==s:\r\n lst.append(s1)\r\nlst.sort()\r\nif len(lst)==0:\r\n print(s)\r\nelse:\r\n print(lst[0])", "ch=input()\r\nn=int(input())\r\nm=False\r\nk=[]\r\nwhile n>0:\r\n try:\r\n z=input()\r\n except:\r\n break\r\n if len(z)<len(ch):\r\n continue\r\n elif ch==z[0:len(ch)]:\r\n m=True\r\n k.append(z)\r\n else:\r\n continue\r\n n-=1\r\nif m:\r\n print(min(k))\r\nelse:\r\n print(ch)", "s = input()\nt = int(input())\narr = []\nwhile t != 0:\n ss = input()\n arr.append(ss)\n t -= 1\narr.sort()\nres = -1\nfor i in arr:\n if i[0:len(s)] == s:\n print(i)\n res = 1\n break\nif res == -1:\n print(s)\n\n\t \t \t\t \t\t\t\t \t\t \t \t \t", "word = input()\r\nwords = sorted(input() for _ in range(int(input())))\r\nfor x in words:\r\n if x.startswith(word):\r\n print(x)\r\n break\r\nelse:\r\n print(word)", "s, v = input(), None\r\nfor i in range(int(input())):\r\n c = input()\r\n if c.startswith(s) and (not v or c < v):\r\n v = c\r\nprint(v if v else s)", "s = input()\r\nn = int(input())\r\nhaystack = sorted([input() for _ in range(n)])\r\n\r\nans = s\r\nfor h in haystack:\r\n if h.startswith(s):\r\n ans = h\r\n break\r\nprint(ans)\r\n", "import sys\r\nimport math\r\n\r\ns = input()\r\nl = len(s)\r\nn = int(input())\r\nv = []\r\nres = \"|\"\r\nfor i in range(n):\r\n st = input()\r\n if(s == st[:l]):\r\n if(st < res):\r\n res = st\r\nif(res == \"|\"):\r\n print(s)\r\nelse:\r\n print(res)\r\n\r\n ", "s=input()\nn=int(input())\nlist=[]\nfor i in range(n):\n a=input()\n list.append(a)\nlist.sort()\nx=len(s)\nc=0\nfor i in list:\n if(i[:x]==s):\n print(i)\n c=1\n break\nif(c==0):\n print(s)\n \t\t\t \t\t\t \t\t\t\t\t\t\t\t \t\t\t \t", "s = input()\r\nn = int(input())\r\nc = []\r\n\r\nfor i in range(n):\r\n d = input()\r\n if d[ : len(s)] == s :\r\n c.append(d)\r\n\r\nif len(c) >0 :\r\n print(min(c))\r\nelse:\r\n print(s)\r\n\r\n\r\n\r\n", "keyWord = input()\r\nn = int(input())\r\ncont = []\r\nfor i in range(n):\r\n line = input()\r\n if line[0:len(keyWord)] == keyWord:\r\n cont.append(line)\r\ncont.sort()\r\n\r\nprint(cont[0]) if len(cont) > 0 else print(keyWord)\r\n", "s = input()\r\nn = int(input())\r\nwords=[]\r\nfor _ in range(n):\r\n word = input()\r\n if word[:len(s)] == s:\r\n words.append(word)\r\nif len(words)!=0:\r\n words.sort()\r\n print(words[0])\r\nelse:\r\n print(s)\r\n\r\n", "s = input()\r\nn = int(input()) \r\nl =[] \r\nfor i in range(n) :\r\n prefix = input() \r\n if prefix[:len(s)] == s : \r\n l.append(prefix)\r\nif len(l) >0 : \r\n print(min(l)) \r\nelse : \r\n print(s)", "s=str(input())\r\nn=int(input())\r\narr=[]\r\nfor i in range(0,n):\r\n a=str(input());\r\n if a.startswith(s):\r\n arr.append(a)\r\narr.sort()\r\nif len(arr)==0:\r\n print(s)\r\nelse:\r\n print(arr[0])", "s=input()\r\nk=len(s)\r\nn=int(input())\r\nar=[ ]\r\na=[ ]\r\nfor i in range(n):\r\n v=input()\r\n ar.append(v)\r\nf=sorted(ar)\r\nfor i in range(n):\r\n u=f[i]\r\n if(u[:k]==s):\r\n a.append(u)\r\nif(len(a)==0):\r\n print(s)\r\nelse:\r\n print(a[0])", "s=input()\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\na.sort()\r\nd=0\r\nfor i in a:\r\n if i[:len(s)]==s:\r\n print(i)\r\n d=1\r\n break\r\nif d==0:\r\n print(s)", "w = input()\r\nfor i in sorted([input() for _ in range(int(input()))]):\r\n if i.startswith(w):\r\n print(i)\r\n break\r\nelse:\r\n print(w)", "s = str(input())\nn = int(input())\nT = [str(input()) for i in range(n)]\n#T = [(len(t), t) for t in T]\n#T.sort(key=lambda x: (x[0], x[1]))\nT.sort()\n\nfor t in T:\n if t.startswith(s):\n print(t)\n exit()\nelse:\n print(s)\n", "s=input()\r\nn=int(input())\r\ny=[]\r\nfor i in range(n):\r\n x=input()\r\n \r\n if x[:(len(s))]==s:\r\n \r\n y.append(x)\r\n\r\n \r\ny=sorted(y)\r\nif len(y)==0:\r\n print(s)\r\nelse: \r\n\r\n print(y[0])", "import sys\r\nstring1=input()\r\nnew=[]\r\nn=int(input())\r\nfor i in range(n):\r\n new.append(input())\r\nanswer=[]\r\nlength=len(string1) \r\nfor i in new:\r\n if string1==i[:length]:\r\n answer.append(i)\r\nif len(answer)==0:\r\n print(string1)\r\nelse:\r\n print(min(answer))", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n data = [input() for i in range(int(input()))]\r\n data = sorted([i for i in data if s == i[:len(s)]])\r\n if len(data) > 0:\r\n print(data[0])\r\n else:\r\n print(s)\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "s=input()\r\nn=int(input())\r\nlist=[]\r\nfor i in range(n):\r\n a=input()\r\n list.append(a)\r\nlist.sort()\r\nx=len(s)\r\nc=0\r\nfor i in list:\r\n if(i[:x]==s):\r\n print(i)\r\n c=1\r\n break\r\nif(c==0):\r\n print(s)", "#***************A. Autocomplete***************#\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom itertools import *\r\n\r\ns = input()\r\nl = len(s)\r\nn = int(input())\r\nvisit = []\r\npart1 = []\r\nfor i in range(n):\r\n v = input()\r\n v1 = v[:l]\r\n visit.append(v)\r\n part1.append(v1)\r\nvisit.sort()\r\nif s in part1:\r\n i = 0\r\n while s not in visit[i]:\r\n i += 1\r\n print(visit[i])\r\nelse:\r\n print(s)\r\n\r\n", "# your code goes here\ns=input()\nl=[]\nfor _ in range(int(input())):\n\tl.append(input())\nl.sort()\nfor i in range(len(l)):\n\ta=l[i][0:len(s)]\n\tif a==s:\n\t\tprint(l[i])\n\t\texit(0)\nprint(s)\n\t \t\t\t \t \t\t\t \t \t \t\t\t \t\t\t \t\t\t\t\t", "palabra = input()\nn = int(input())\nfinal = palabra\nini = \"\"\nfor i in range(n):\n b = 0\n tmp = input()\n if (len(palabra) <= len(tmp)):\n for j in range(len(palabra)):\n if palabra[j] != tmp[j]:\n b=1\n \n if (final > tmp or ini ==\"\") and b==0:\n final = tmp\n ini = \"Ya no es el inicio\"\n \n\nprint(final)\n \n\n\t \t\t\t\t \t\t\t\t \t \t\t \t \t \t\t", "pattern, n = input(), int(input())\r\n_len, arr = len(pattern), []\r\nfor i in range(n):\r\n helper = input()\r\n if pattern == helper[:_len]:\r\n arr.append(helper)\r\n\r\narr.sort()\r\nprint(arr[0] if len(arr) > 0 else pattern)", "s = str(input())\r\nn = int(input())\r\nl = 'z'\r\nc = 0\r\nfor i in range(n):\r\n s1 = str(input())\r\n if(s1 == s):\r\n print(s)\r\n exit()\r\n if(s1[:len(s):] == s):\r\n c+=1\r\n if s1 < l:\r\n l = s1\r\nif(c == 0):\r\n l = s \r\nprint(l) ", "s = input()\r\nn = int(input())\r\nwords = []\r\nfor _ in range(n):\r\n line = input()\r\n if line.startswith(s):\r\n words.append(line)\r\n\r\nif len(words) > 0:\r\n print(min(words))\r\nelse:\r\n print(s)\r\n", "s = input()\r\nn = int(input())\r\nis_part_from_it = []\r\n\r\nfor _ in range(n):\r\n word = input()\r\n if s == word[:len(s)]:\r\n is_part_from_it.append(word)\r\n\r\nprint(min(is_part_from_it) if is_part_from_it else s)\r\n", "def main():\n pal = input()\n n = int(input())\n ele = []\n \n for i in range(n):\n ele.append(input())\n \n ele = sorted(ele)\n\n for temp in ele:\n if pal == temp[:len(pal)]:\n print(temp)\n return\n\n print(pal)\n \nmain()\n\t\t \t \t \t\t\t\t \t\t\t \t\t \t\t\t \t", "arr = []\r\ns = input()\r\nn = int(input())\r\nfor i in range(n):\r\n line = input()\r\n if line.startswith(s):\r\n arr.append(line)\r\narr.sort()\r\nprint(arr[0] if len(arr) > 0 else s)\r\n", "\r\n\r\n\r\n\r\na = input()\r\n\r\nu=[]\r\nfor k in range(int(input())):\r\n b = input()\r\n\r\n if a in b:\r\n if b.index(a)==0:\r\n u.append(b)\r\n\r\nu.sort()\r\n\r\n\r\nif len(u)==0:\r\n print(a)\r\nelse:\r\n print(u[0])\r\n", "s=input()\r\nn=int(input())\r\nlis=[]\r\nans='z'*101\r\nfor x in range(n):\r\n st=input()\r\n if len(st)>=len(s) and st[:len(s)]==s:\r\n ans=min(st,ans)\r\nif ans=='z'*101:\r\n print(s)\r\nelse:\r\n print(ans)", "s = input()\r\nn = int(input())\r\n\r\nauto = [input() for i in range(n)]\r\nauto.sort()\r\n\r\nfor i in auto:\r\n if i[0:len(s)]==s:\r\n print(i)\r\n exit()\r\nprint(s)\r\n", "import sys\r\nimport math\r\nfrom collections import OrderedDict\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\ns=input()\r\nn=iinput()\r\nl=[]\r\nl1=[]\r\nfor i in range(n):\r\n\ta=input()\r\n\tif len(a)>=len(s) and a[:len(s)]==s:\r\n\t\tl.append(a)\r\n\t\tl1.append(a[:len(s)])\r\nl.sort()\r\nif s not in l1:print(s)\r\nelse:print(l[0])", "lst = [w.rstrip() for w in open(0).readlines()]\r\ntarget = lst[0]\r\nlst = [x for x in lst[2:] if x[0:len(target)] == target]\r\nprint(min(lst) if len(lst) else target)", "S, res = input(), ''\r\nfor _ in range(int(input())):\r\n T = input()\r\n if T[0:len(S)] == S:\r\n if res == '': res = T\r\n elif T<res: res = T\r\n else: continue\r\nprint(S if res == '' else res)", "import json\r\n\r\ns = input().strip()\r\ns += '.'\r\nn = int(input().strip())\r\n\r\nd = {}\r\np = d\r\n\r\nfor i in range(n):\r\n i = input().strip()\r\n i += '.'\r\n for c in i:\r\n if p.get(c) == None:\r\n p[c] = {}\r\n p = p[c]\r\n continue\r\n p = p[c]\r\n p = d\r\n\r\np = d\r\nexist = True\r\nanswer = \"\"\r\n# print(d)\r\n\r\nfor c in s:\r\n if c == '.':\r\n break\r\n if p.get(c) == None:\r\n exist = False\r\n break\r\n answer += c\r\n p = p[c]\r\n\r\nif not exist:\r\n print(s.strip('.'))\r\n\r\nelse:\r\n while len(p.keys()) > 0:\r\n c = sorted(p.keys())[0]\r\n answer += c\r\n p = p[c]\r\n\r\n print(answer.strip('.'))\r\n\r\n# print(json.dumps(d, indent=2))\r\n", "s = input()\r\nn = int(input())\r\nposs = []\r\nfor i in range(n):\r\n\tx = input()\r\n\tif x[:len(s)] == s:\r\n\t\tposs.append(x)\r\n\r\nposs.sort()\r\nif poss:\r\n\tprint(poss[0])\r\nelse:\r\n\tprint(s)", "text = input()\r\nN = int( input() )\r\n\r\nbook = [ input() for i in range( N ) ]\r\nbook.append( text )\r\nbook.sort()\r\n\r\nfor i in range( len( book ) ):\r\n if book[ i ] == text:\r\n if i + 1 < len( book ) and len( text ) <= len( book[ i + 1 ] ) and text == book[ i + 1 ][ : len( text ) ]:\r\n exit( print( book[ i + 1 ] ) )\r\n exit( print( text ) )\r\n", "string = input()\r\nn = int(input())\r\na = []\r\nwhile n!= 0:\r\n a.append(input())\r\n n -= 1\r\na.sort()\r\nfor x in a:\r\n if x.find(string) == 0:\r\n print(x)\r\n exit()\r\nprint(string)", "s = input()\nn = int(input())\nl = []\nfor i in range(n):\n address = input()\n if address.find(s) == 0:\n l.append(address)\nif len(l) == 0:\n print(s)\nelse:\n l.sort()\n print(l[0])\n", "# Wadea #\r\n \r\ns = input()\r\nr = \"z\"*100\r\nm = r\r\nfor i in range(int(input())):\r\n st = input()\r\n if s == st[:len(s)] and st < r:\r\n r = st\r\nif m == r:\r\n print(s)\r\nelse:\r\n print(r)", "s=input()\r\nn=int(input())\r\nx=[]\r\nfor i in range(n):\r\n a=input()\r\n if(s==a[:len(s)]):\r\n x.append(a)\r\nif(len(x)==0):\r\n print(s)\r\nelse:\r\n x.sort()\r\n print(x[0])", "def startWith(s1, s):\r\n if len(s1) < len(s):\r\n return False\r\n if s1[:len(s)] == s:\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\nn = int(input())\r\nmyList = []\r\nfor i in range(n):\r\n s1 = input()\r\n if startWith(s1, s):\r\n myList.append(s1)\r\nmyList.sort()\r\nif len(myList) == 0:\r\n print(s)\r\nelse:\r\n print(myList[0])", "s = input()\nt = int(input())\nl = []\nfor i in range(t):\n x = input()\n if x.startswith(s):\n l.append(x)\nl.sort()\nif len(l) is 0:\n print(s)\nelse:\n print(l[0])", "s = input()\nn = int(input())\nl = []\nb = False\nfor i in range(n):\n l.append(input())\n\nl.sort()\nfor i in l:\n if i.startswith(s):\n print(i)\n b = True\n break\nif not b:\n print(s)\n", "a=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nl.sort()\r\nl1=len(a)\r\nc=0\r\nfor i in range(n):\r\n if(a==l[i][:l1]):\r\n c=1\r\n break\r\nif(c==1):\r\n print(l[i])\r\nelse:\r\n print(a)\r\n \r\n ", "# LUOGU_RID: 101451079\ns = input()\r\nn = int(input())\r\na = [input() for _ in range(n)]\r\na = [x for x in a if x.find(s) == 0]\r\nprint(a and min(a) or s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\na = len(s)\r\nc = s + '~'\r\nfor _ in range(int(input())):\r\n x = input()[:-1]\r\n if x[:a] == s and x < c:\r\n c = x\r\nprint(c if c != s+'~' else s)\r\n", "import sys\r\ndef main():\r\n s = sys.stdin.readline().strip()\r\n n = int(sys.stdin.readline().strip())\r\n visited = []\r\n for i in range(n):\r\n visited.append(sys.stdin.readline().strip())\r\n visited.sort()\r\n for i in visited:\r\n if i.startswith(s):\r\n print(i)\r\n return\r\n print(s)\r\n return\r\nif __name__ == '__main__':\r\n main()", "\r\nsalida = ''\r\n\r\ns = input()\r\nn = int(input())\r\nfor _ in range(n):\r\n historial = input() \r\n if len(s) <= len(historial):\r\n i = 0\r\n while i < len(s):\r\n if s[i] != historial[i]:\r\n break\r\n i = i+1\r\n if i == len(s):\r\n if historial < salida or salida == '':\r\n salida = historial\r\nif salida == '':\r\n print(s)\r\nelse:\r\n print(salida)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s = input()\r\n n = int(input())\r\n B = []\r\n for i in range(n):\r\n t = input()\r\n if len(t) >= len(s) and t[:len(s)] == s:\r\n B.append(t)\r\n B.sort()\r\n if len(B) == 0:\r\n print(s)\r\n else:\r\n print(B[0])\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\ns = input().rstrip()\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n t = input().rstrip()\r\n if t[:len(s)] == s:\r\n a.append(t)\r\n\r\na.sort()\r\nif a:\r\n print(a[0])\r\nelse:\r\n print(s)\r\n", "s = input()\nl = len(s)\nn = int(input())\np = []\nfor i in range(n):\n p.append(input())\n for j in range(l):\n if p[len(p)-1][j] != s[j]:\n p.pop()\n break\np.sort()\nif len(p) == 0:\n print(s)\nelse:\n print(p[0])\n", "keyword, n, = input(), int(input())\r\ncont = []\r\n_len = len(keyword)\r\n\r\nfor i in range(n):\r\n line = input()\r\n if line[:_len] == keyword:\r\n cont.append(line)\r\n\r\ncont.sort()\r\nprint(cont[0] if len(cont) > 0 else keyword)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nm = len(s)\r\nans = \"{\"\r\nn = int(input())\r\nfor _ in range(n):\r\n x = list(input().rstrip())\r\n c = 0\r\n for i in range(min(m, len(x))):\r\n if not s[i] == x[i]:\r\n break\r\n c += 1\r\n if not c ^ m:\r\n ans = min(ans, \"\".join(x))\r\nif ans == \"{\":\r\n ans = \"\".join(s)\r\nprint(ans)", "\r\ns = str(input())\r\nt = int(input())\r\na = []\r\n\r\nfor _ in range(t):\r\n st = str(input())\r\n if(st.find(s) == 0):\r\n a.append(st)\r\n else:\r\n continue\r\n\r\nif(len(a)==0):\r\n print(s)\r\nelse:\r\n a = sorted(a)\r\n print(a[0])", "current_input = input()\nnum_history = int(input())\nhistory_arr = [input() for _ in range(num_history)]\nrelevant_arr = [history_element for history_element in history_arr if (history_element[:len(current_input)] == current_input)]\nrelevant_arr.sort()\nprint(relevant_arr[0] if len(relevant_arr) > 0 else current_input)\n\n# NOTE: LIST COMPREHENSIONS. IF YOU WANT TO FILTER STUFF, AND NOT INCLUDE STUFF THAT IS FILTERED OUT, YOU ONLY WANT IF AND NOT ELSE:\n# [x for x in arr if (x satisfies condition)]\n# If you want both if and else, you put it before:\n# [x if (x satisfies condition) else y for x in arr]\n\n# For more see https://stackoverflow.com/questions/4406389/if-else-in-a-list-comprehension", "pref, n = input(), int(input())\r\n\r\nadreses = [input() for i in range(n)]\r\nadreses = [x for x in adreses if x[:len(pref)] == pref]\r\n\r\nprint(min(adreses) if adreses else pref)", "s = input()\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\nk = len(s)\r\nanswer = \"\"\r\nfor a in l:\r\n\tif a[:k]==s:\r\n\t\tif a<answer or answer ==\"\":\r\n\t\t\tanswer=a\r\nif answer:\r\n\tprint(answer)\r\nelse:\r\n\tprint(s)", "# https://codeforces.com/problemset/problem/53/A\r\n\r\ndef func_sol(lines):\r\n for line in sorted(lines[2:]):\r\n if line.startswith(lines[0]):\r\n return line\r\n return lines[0]\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read().split('\\n')[:-1]))\r\n\r\n\r\nmain()\r\n", "import sys\r\nimport math\r\n\r\ns = input()\r\nn = int(input())\r\nv = []\r\nres = \"zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\"\r\nfor i in range(n):\r\n st = input()\r\n k = 0\r\n fl = True\r\n for j in s:\r\n if(j != st[k]):\r\n fl = False\r\n break\r\n k += 1\r\n if(fl):\r\n if(st < res):\r\n res = st\r\nif(res == \"zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\"):\r\n print(s)\r\nelse:\r\n print(res)\r\n\r\n ", "s = input()\r\ni = int(input())\r\nc = []\r\nfor x in range(i):\r\n t = input()\r\n if len(t) < len(s):\r\n pass\r\n else:\r\n if t[:len(s)] == s:\r\n c.append(t)\r\n\r\nif len(c) == 0:\r\n print(s)\r\nelse:\r\n res = min(sub for sub in c if isinstance(sub, str))\r\n print(res)", "import math\r\n\r\ndef ans(l,s,x):\r\n f=l\r\n y=l[0:x]\r\n if(s==y):\r\n return True\r\n else:\r\n return False\r\n \r\ns=str(input())\r\nx=len(s)\r\nt=int(input())\r\nm=100000\r\nf=0\r\nk=''\r\nl=[]\r\nwhile(t>0):\r\n a=str(input())\r\n l.append(a)\r\n t-=1\r\n \r\nl.sort()\r\n\r\nfor i in l:\r\n if(ans(i,s,x)==True):\r\n k=i\r\n break\r\nif(k):\r\n print(k)\r\nelse:\r\n print(s)\r\n \r\n\r\n \r\n", "a=input()\nb=int(input())\nc=[]\nfor i in range(b):\n\td=input()\n\tif d[:len(a)]==a:\n\t\tc.append(d)\nif len(c)>0:\n\tprint(min(c))\nelse:\n\tprint(a)\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nstring = input()\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n x = input()\r\n arr.append(x)\r\narr.sort()\r\nfor i in arr:\r\n if i.startswith(string):\r\n string = i\r\n break\r\nprint(string)\r\n", "def tap():\n word = input()\n l = []\n for x in range(int(input())):\n l.append(input())\n ll = []\n for x in l:\n if x.find(word) == 0:\n ll.append(x)\n if not ll:\n print(word)\n else:\n print(sorted(ll)[0])\ntap()\n \t\t\t \t \t \t \t \t\t\t\t \t\t\t \t", "webs = []\ninp = input()\nn = int(input())\nfor i in range(n):\n webs.append(input())\n\nwebs.sort()\nfor web in webs:\n if (web.startswith(inp)):\n print(web)\n break\nelse:\n print(inp)\n\n\t\t\t\t\t \t\t\t\t\t\t\t\t\t \t \t\t \t \t\t", "s=str(input())\r\na=int(input())\r\nl=[]\r\nfor i in range(a):\r\n d=str(input())\r\n if(d.find(s)==0):\r\n l.append(d)\r\n else:\r\n pass \r\nif(len(l)>0): \r\n min=l[0] \r\n for i in range(1,len(l)):\r\n if(l[i]<min):\r\n min=l[i]\r\n else:\r\n continue\r\n print(min) \r\nelse:\r\n print(s)\r\n\r\n \r\n", "from sys import stdin as inp\n\ns = inp.readline()[:-1]\nn = int(inp.readline())\nlastn = []\n\nfor i in range(n):\n lastn.append(inp.readline()[:-1])\n\nlastn.sort()\n\nl = len(s)\n\nencontrado = False\n\nfor linea in lastn:\n #print(linea[:l])\n if linea[:l] == s:\n encontrado = True\n print(linea)\n break\n \nif not encontrado:\n print(s)", "s=input()\r\nres=\"z\"*1000\r\nn=int(input())\r\nfor i in range(n):\r\n t=input()\r\n if(t[:len(s)]==s):\r\n res=min(res,t)\r\nprint(s if res==\"z\"*1000 else res)\r\n", "inp= input()\r\na=[]\r\n\r\nfor _ in range(int(input())):\r\n a.append(input())\r\n\r\nans=max(a)\r\nc=False\r\nfor i in a:\r\n if i.startswith(inp) and i<=ans:\r\n ans=i\r\n c=True\r\nif(c):\r\n print(ans)\r\nelse:\r\n print(inp)", "v=[]\r\nz=input()\r\nfor i in range(int(input())):\r\n x=input()\r\n if x[0:len(z)]==z:\r\n v.append(x) \r\nif len(v)==0:\r\n print(z) \r\nelse:\r\n print(min(v))", "s = input()\r\nn = int(input())\r\narr = [ input() for _ in range(n)]\r\nans = [i.replace(s , \"\" , 1) for i in arr if i.startswith(s)] \r\nif not ans: ans.append(\"\")\r\nprint(s + min(ans))", "s=input()\r\nr=''\r\nn=int(input())\r\nwhile n:\r\n a=input()\r\n if a[:len(s)]==s:\r\n if r=='' or a<r:\r\n r=a\r\n n-=1\r\nprint(r=='' and s or r)", "s=str(input())\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(str(input()))\r\narr=sorted(arr)\r\nl=len(s)\r\nc=0\r\nfor i in range(n):\r\n if arr[i][:l]==s:\r\n print(arr[i])\r\n c=1\r\n break\r\n else:\r\n continue\r\nif c==0:\r\n print(s)", "s = input();\r\nn = int(input())\r\narray = []\r\nfor i in range(n):\r\n array.append(input())\r\n\r\narray.sort()\r\n\r\nfor i in range(len(array)):\r\n f = True\r\n for j in range(len(s)):\r\n if s[j]!=array[i][j]:\r\n f = False\r\n break\r\n\r\n if f:\r\n print(array[i])\r\n exit(0);\r\n\r\nprint(s)", "s=input()\r\nn=int(input())\r\ng=''\r\nd=len(s)\r\nfor i in range(n):\r\n w=input()\r\n if w[:d]==s:\r\n if g=='':\r\n g=w\r\n elif w<g:\r\n g=w\r\nif g=='':\r\n print(s)\r\nelse:\r\n print(g) ", "line=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n line_site=input()\r\n if line_site.startswith(line):\r\n l+=[line_site] \r\nprint(min(l) if len(l)>0 else line)", "# LUOGU_RID: 113212616\ns=input()\r\nl=len(s)\r\nn=int(input())\r\nmn='zzzzzzzzzzzzzzzz'\r\nfor i in range(n):\r\n a=input()\r\n if len(a)>=l:\r\n if a[:l]==s:\r\n mn=min(mn,a)\r\nif mn=='zzzzzzzzzzzzzzzz':\r\n print(s)\r\nelse:\r\n print(mn)", "a=input()\r\nb=int(input())\r\nc=[]\r\nfor i in range(b):\r\n\td=input()\r\n\tif d[:len(a)]==a:\r\n\t\tc.append(d)\r\nif len(c)>0:\r\n\tprint(min(c))\r\nelse:\r\n\tprint(a)\r\n", "s = input()\nn = int(input())\nused = []\nfor i in range(n):\n word = input()\n used.append(word)\nused = sorted(used)\n\ndef main(s, used):\n length = len(s)\n for used_word in used:\n if used_word[0:length] == s:\n return used_word\n return s\n\nprint(main(s, used))\n \n", "s = input()\r\nn = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n\tx = input().split(s)\r\n\t\r\n\tif x[0] == \"\":\r\n\t\tl.append(x[1])\r\n\t\t\r\nif l == []:\r\n\tprint(s)\r\nelse:\r\n\tprint(s + sorted(l)[0])", "prefix = input()\r\nchoices = int(input())\r\nsites = [input() for _ in range(choices)]\r\nsites = list(filter(lambda x: x.startswith(prefix), sites))\r\nprint(min(sites) if sites else prefix)", "s = input()\r\nsame = []\r\nfor _ in range(int(input())):\r\n t = input()\r\n if t.startswith(s):\r\n same.append(t)\r\nif len(same) > 0:\r\n print(min(same))\r\nelse:\r\n print(s)", "x = input()\r\ny = []\r\nfor _ in range(int(input())):\r\n z = input()\r\n if z.startswith(x):\r\n y.append(z)\r\nif not y:\r\n y.append(x)\r\nprint(sorted(y)[0])", "class Node():\r\n def __init__(self):\r\n self.children = {}\r\n self.is_end = False\r\n\r\n\r\nclass Trie:\r\n def __init__(self):\r\n self.root = Node()\r\n \r\n def add(self, word):\r\n pos = self.root\r\n\r\n for char in word:\r\n if (char not in pos.children):\r\n pos.children[char] = Node()\r\n \r\n pos = pos.children[char]\r\n \r\n pos.is_end = True\r\n \r\n def _traverse(self, pos, curr, res):\r\n if (pos.is_end):\r\n res.append(curr)\r\n \r\n for child in pos.children:\r\n self._traverse(pos.children[child], curr + child, res)\r\n \r\n def get_suggestions(self, prefix):\r\n pos = self.root\r\n\r\n for char in prefix:\r\n if (char not in pos.children):\r\n return []\r\n pos = pos.children[char]\r\n \r\n res = []\r\n self._traverse(pos, prefix, res)\r\n\r\n return res\r\n\r\n\r\ns = input()\r\nn = int(input())\r\ntrie = Trie()\r\nfor _ in range(n):\r\n trie.add(input())\r\nsuggestions = trie.get_suggestions(s)\r\nsuggestions.sort()\r\ntry:\r\n print(suggestions[0])\r\nexcept:\r\n print(s)", "# s = input().strip()\n# n = int(input())\n# visited_pages = [input().strip() for i in range(n)]\n\ns = input()\nn = int(input())\n\nans = \"\"\nfor i in range(n):\n c = input().strip()\n if c.startswith(s):\n if ans == \"\" or c < ans:\n ans = c\n\nif ans == \"\":\n print(s)\nelse:\n print(ans)\n", "s, n = input(), int(input())\r\nout = ''\r\nfor i in range(n):\r\n x = input()\r\n if (x.find(s) == 0):\r\n if (out == ''):\r\n out = x\r\n else:\r\n out = min(out, x)\r\nprint(max(out, s))", "s=input()\r\nn=int(input())\r\nc=[]\r\nfor i in range(n):\r\n c.append(input())\r\nc.sort()\r\nx=0\r\nfor i in range(len(c)):\r\n if c[i].startswith(s):\r\n print(c[i])\r\n x=1\r\n break\r\nif x==0:\r\n print(s)", "keyword, n = input(), int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n if keyword == line[0:len(keyword)]:\r\n cont.append(line)\r\n\r\ncont.sort()\r\n\r\n\r\nprint(cont[0] if len(cont) > 0 else keyword)\r\n\r\n", "s = input()\r\nn = int(input())\r\nl = set()\r\nfor i in range(n):\r\n l.add(input())\r\nl = sorted(l)\r\nfor i in l:\r\n if i.startswith(s):\r\n print(i)\r\n exit(0)\r\nprint(s)\r\n", "s=input()\r\nlens,list=len(s),[]\r\nn=int(input())\r\nfor i in range(n):\r\n p=input()\r\n if(len(p)>=lens and s==p[:lens]):\r\n list.append(p)\r\nlist.sort()\r\nif not list:\r\n print(s)\r\nelse:\r\n print(list[0])", "s = input()\r\nn = int(input())\r\nlis = []\r\nfor i in range(n):\r\n lis.append(input())\r\nflag = 0\r\nans = lis[0]\r\nfor i in lis:\r\n if i.startswith(s):\r\n ans = min(ans,i)\r\n flag = 1\r\nif flag == 0:\r\n print(s)\r\nelse:\r\n print(ans)", "inp= input()\na=[]\n\nfor _ in range(int(input())):\n a.append(input())\n\nans=max(a)\nc=False\nfor i in a:\n if i.startswith(inp) and i<=ans:\n ans=i\n c=True\nif(c):\n print(ans)\nelse:\n print(inp)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-23 23:23:28\nLastEditTime: 2021-11-23 23:27:49\nDescription: Autocomplete\nFilePath: CF53A.py\n'''\n\n\ndef func():\n inputted = input().strip()\n n = int(input())\n lst = []\n for _ in range(n):\n visited = input().strip()\n if visited.startswith(inputted):\n lst.append(visited)\n\n if len(lst) == 0:\n print(inputted)\n else:\n print(sorted(lst)[0])\n\n\nif __name__ == '__main__':\n func()\n", "word = input()\r\nsugg = []\r\n\r\nfor i in range(int(input())): \r\n sug = input()\r\n word == sug[:len(word)] and sugg.append(sug)\r\n\r\nif sugg: \r\n next = sugg[0]\r\n\r\n for s in sugg: \r\n if s < next: \r\n next = s\r\nelse: \r\n next = word\r\n\r\nprint(next)", "s=input()\r\nn=int(input());b=[];m=\"\"\r\nfor i in range(n) :\r\n x=input()\r\n b.append(x)\r\nif n==2 :\r\n print(min(b))\r\nelse :\r\n for i in range(n) :\r\n if b[i][0:len(s)]==s :\r\n m=b[i]\r\n break\r\n if m!=\"\" :\r\n for i in range(1,n) :\r\n if b[i][0:len(s)]==s :\r\n m=min(m,b[i])\r\n print(m)\r\n else :\r\n print(s)\r\n\r\n\r\n", "s = input()\r\nn = int(input())\r\nl = [None] * n\r\nfor i in range(n):\r\n l[i] = input()\r\nl.sort()\r\nb = False\r\nfor i in l:\r\n if i.startswith(s):\r\n print(i)\r\n b = True\r\n break\r\nif b == False:\r\n print(s)", "s,ar = input(),[]\r\nfor i in range(int(input())):\r\n n = input();a,b = len(n) , len(s)\r\n if a >=b:\r\n if n[:b] == s:ar.append(n)\r\nar.sort()\r\nprint(s if not ar else ar[0])", "\r\narr,keyWord,n = [],input(),int(input())\r\nfor i in range (n):\r\n line = input()\r\n if line.startswith(keyWord):\r\n arr.append(line)\r\narr.sort()\r\nprint(arr[0] if len(arr) > 0 else keyWord)", "found_list = []\r\ns = input()\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n new_s = input()\r\n if new_s.startswith(s):\r\n found_list.append(new_s)\r\n\r\nif len(found_list) == 0:\r\n print(s)\r\nelse:\r\n print(min(found_list))\r\n", "s = input()\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n if x.startswith(s):\r\n l.append(x)\r\nl.sort()\r\nif len(l) == 0:\r\n print(s)\r\nelse:\r\n print(l[0])", "def small_lexicographical(s1,s2):\r\n l1,l2=len(s1),len(s2)\r\n for i in range(min(l1,l2)):\r\n if s1[i]>s2[i]:\r\n return s2\r\n elif s1[i]<s2[i]:\r\n return s1\r\n if l1>=l2:\r\n return s2\r\n return s1\r\n\r\ns = input()\r\nl = len(s)\r\nn = int(input())\r\n\r\nli = []\r\n\r\nfor i in range(n):\r\n x = input()\r\n if x[:l]==s:\r\n li.append(x)\r\n\r\nif li:\r\n mn = li[0]\r\n\r\nfor i in range(len(li)-1):\r\n mn = small_lexicographical(small_lexicographical(li[i],li[i+1]),mn)\r\n\r\nprint(mn if li else s)", "'''\r\n\n#\n\r\n# 18.07.2021\n\r\n#\r\n\n'''\r\n\r\n\n\neta = input ()\r\n\nm = len (eta)\n\r\nn = int (input ())\r\n\r\n\n\ninf = 2000000000\r\n\r\n\n\ndef Check (ps) :\n\r\n\tif len (ps) < m :\r\n\n\t\treturn inf\r\n\n\telif eta == ps [0:m] :\r\n\n\t\treturn 1\n\r\n\telse :\r\n\n\t\treturn inf\r\n\r\n\n\ndef Compare (ps, pt) :\r\n\n\tslen = len (ps); tlen = len (pt)\r\n\n\ti = 0\r\n\n\twhile i < slen and i < tlen :\r\n\n\t\tif ord (ps [i]) < ord (pt [i]) :\n\r\n\t\t\treturn -1\r\n\n\t\telif ord (ps [i]) > ord (pt [i]) :\r\n\t\t\treturn 1\n\r\n\t\telse :\r\n\t\t\ti += 1\r\n\r\n\tif i == slen :\r\n\n\t\treturn -1\r\n\telse :\r\n\t\treturn 1\r\n\r\n\n\nres = inf\r\n\nsres = eta\n\r\n\r\n'''\r\n\ns = input ()\r\n\nif s [0:m-1] == eta :\n\r\n print (100)\r\n\n'''\n\r\n\r\nfor i in range (n) :\n\r\n\tsi = input ()\r\n\n\tle = len (si)\r\n\n\tif Check (si) == 1 :\r\n\n\t\tif res < inf and Compare (si, sres) == -1 or res == inf :\r\n\n\t\t\tres = i; sres = si\n\n\r\n\r\nprint (sres)\n\n", "s=input()\r\nls=len(s)\r\nn=int(input())\r\nli=[]\r\nfor i in range(n):\r\n pg=input()\r\n if s==pg[:ls]:\r\n li.append(pg)\r\n#print(li,ans)\r\nif len(li)>0:\r\n ans=li[0]\r\n for i in range(1,len(li)):\r\n if ans>li[i]:\r\n ans=li[i]\r\n print(ans)\r\nelse:\r\n print(s)\r\n", "s=str(input())\r\nt=int(input())\r\nn=len(s)\r\nd=l=[]\r\nfor i in range(0,t,1):\r\n a=str(input())\r\n if s in a[0:n:]:\r\n l.append(a)\r\nl.sort()\r\nif len(l)==0:\r\n print(s)\r\nelse:\r\n print(l[0])\r\n \r\n", "keyword = input()\r\nlength = len(keyword)\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n item = input()\r\n if keyword == item[:length]:\r\n arr.append(item)\r\n\r\narr.sort()\r\n# print(if len(arr) == 0?keyword: arr[0])\r\nif len(arr) > 0:\r\n print(arr[0])\r\nelse:\r\n print(keyword)\r\n", "#import sys\r\n#import itertools\r\n#import math\r\n\r\n#t = int(input())\r\nt = 1\r\n\r\nwhile t > 0:\r\n #print(t)\r\n pref = input()\r\n n = int(input())\r\n words = []\r\n while n>0:\r\n ix = input()\r\n if ix.startswith(pref):\r\n words.append(ix)\r\n n-=1\r\n\r\n print(sorted(words)[0] if len(words)>0 else pref)\r\n\r\n t -= 1", "s = input()\r\nn = len(s)\r\na = []\r\nfor _ in range(int(input())):\r\n s1 = input()\r\n t = min(len(s1), n)\r\n if s1[:t] == s[:t]:\r\n a.append(s1)\r\n a = sorted(a)\r\nif len(a) == 0:\r\n print(s)\r\nelse:\r\n print(a[0])\r\n", "w = input()\r\nn = int(input())\r\n\r\nres = []\r\nfor tc in range(n):\r\n word = input()\r\n if w == word[0:len(w)]:\r\n res.append(word)\r\n \r\n \r\nif (len(res) > 0):\r\n res.sort()\r\n print(res[0])\r\nelse:\r\n print(w)\r\n\r\n\r\n ", "# Taking the input from ther user\r\ns = input();l=[]\r\nfor i in range(int(input())):\r\n l.append(input())\r\n\r\nl = sorted(l)\r\n# If there is a prefect match print(s)\r\nfor i in range(len(l)):\r\n if l[i] == s:\r\n print(s)\r\n exit()\r\n\r\n# Check for the best match if existed\r\nfor i in range(len(l)):\r\n if l[i][:len(s)] == s:\r\n print(l[i])\r\n exit()\r\n\r\n# If there is no match , print the original word \r\nprint(s)\r\n\r\n\r\n", "s = input()\r\nn = int(input())\r\nt = \"z\" * 101\r\nfor i in range(n):\r\n s1 = input()\r\n if s1[:len(s)] == s:\r\n if s1[len(s):] < t: t = s1[len(s):]\r\nif t == \"z\" * 101: print(s)\r\nelse: print(s + t)", "def dopolnenie(s, lst):\r\n count, b = 0, list()\r\n for elem in lst:\r\n if s in elem:\r\n b.append(elem)\r\n count += 1\r\n if count != 0 and b[0].startswith(s):\r\n return b[0]\r\n return s\r\n\r\n\r\nt = input()\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n z = input()\r\n a.append(z)\r\nprint(dopolnenie(t, sorted(a)))\r\n", "n=input()\r\nk=len(n)\r\nta=[]\r\np=int(input())\r\nfor x in range(p):\r\n ol=input()\r\n if ol[0:k]==n:\r\n ta.append(ol[k:])\r\n else:\r\n pass\r\nif ta==list():\r\n print(n)\r\nelse:\r\n ta.sort()\r\n print(n+ta[0])", "n = input()\ns = int(input())\nl = []; bool = True\nfor i in range(s):\n l.append(input())\nfor i in sorted(l):\n if n == i[0:len(n)]:\n print(i)\n bool = False\n break\n \nif bool:\n print(n)\n \n \n \t \t\t \t \t \t\t\t \t \t \t\t \t\t\t\t\t", "inline = input()\r\ninnum = int(input())\r\nlist1 = []\r\nfor i in range(innum):\r\n list1.append(input())\r\nshortlist = []\r\nil = len(inline)\r\nfor i in list1:\r\n if inline == i[:il]:\r\n shortlist.append(i)\r\n else:\r\n pass\r\nif len(shortlist) > 0:\r\n out = shortlist[0]\r\n for i in shortlist:\r\n if i < out:\r\n out = i\r\n else:\r\n pass\r\n print(out)\r\nelse:\r\n print(inline)", "s = input()\nn = int(input())\nli = []\nfor _ in range(n):\n page = input()\n if page[:len(s)] == s:\n li.append(page)\nli.sort()\nif len(li) != 0:\n print(li[0])\nelse:\n print(s)", "s = input()\r\nP = set()\r\n\r\nfor _ in range(int(input())):\r\n p = input()\r\n if p.startswith(s):\r\n P.add(p)\r\n\r\nprint(min(P) if P else s)", "w = input()\r\nn, o = int(input()), []\r\nfor i in range(n):\r\n o.append(input())\r\n\r\no.sort()\r\nfor t in o:\r\n if t.startswith(w):\r\n w = t\r\n break\r\n\r\nprint(w)", "def solve():\r\n s=input().strip()\r\n n=int(input().strip())\r\n addr=[]\r\n for i in range(n):\r\n str=input().strip()\r\n if str.startswith(s):\r\n addr.append(str)\r\n if len(addr)==0:\r\n addr.append(s)\r\n addr.sort()\r\n print(addr[0])\r\nsolve()", "s=input()\r\nk=[]\r\nl=0\r\nfor i in range(int(input())):\r\n a=input()\r\n if a.startswith(s):\r\n k.append(a)\r\n l=1\r\nif l==0:\r\n print(s)\r\n exit()\r\nmin=k[0]\r\nfor i in range(1,len(k)):\r\n if k[i]<min:\r\n min=k[i]\r\nprint(min)\r\n \r\n", "query = input()\r\nquery = query.lower()\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n\tn = input()\r\n\tn = n.lower()\r\n\tif query == n[:len(query)]:\r\n\t\ta.append(n)\r\nif not a:\r\n\tprint(query)\r\nelse:\r\n\ta = sorted(a)\r\n\tprint(a[0])" ]

[ "def main():\r\n cnt1, cnt2, x, y = list(map(int, input().split()))\r\n l, r = -1, 10**18\r\n ans = 10**18\r\n while l+1 < r:\r\n v = (l + r) // 2\r\n if max(cnt1 - v // y + v//(x*y), 0) + max(cnt2 - v // x + v // (x*y), 0)<= v - v//x - v//y + v // (x * y):\r\n ans = min(ans, v)\r\n r = v\r\n else:\r\n l = v\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def spliter():\r\n d = input()\r\n a = d.split()\r\n r = []\r\n for i in a:\r\n k = int(i)\r\n r.append(k)\r\n return r\r\ndef counter(a,b):\r\n i=a//b\r\n j=i\r\n while i>0:\r\n a+=i\r\n i=a//b-j\r\n j+=i\r\n return a\r\n\r\n\r\nlst = spliter()\r\nl1 = lst[0]\r\nl2 = lst[1]\r\nl3 = lst[2]\r\nl4 = lst[3]\r\ncount1=counter(l1,l3)\r\ncount2=counter(l2,l4)\r\ncount3=counter(l1+l2,l3*l4)\r\ncount=max(count1,count2,count3)\r\nprint(count) \r\n", "import math\ndef expr(N,x,y,cnt1,cnt2):\n cnt1 = max(cnt1res - math.floor(N/y)+math.floor(N/(y*x)),0)\n cnt2 = max(cnt2res - math.floor(N/x)+math.floor(N/(y*x)),0)\n b = N-math.floor(N/x)-math.floor(N/y)+math.floor(N/(x*y)) >= cnt1+cnt2\n return b\n \ncnt1,cnt2,x,y = map(int,list(input().split()))\ncnt1res = cnt1\ncnt2res = cnt2\nN = math.ceil((cnt1 + cnt2+1)/(1-1/x-1/y+1/(y*x)))\n\nstart,last = 1,N\nwhile last>start:\n mid = start + (last-start)//2\n if expr(mid, x, y, cnt1, cnt2):\n last = mid\n else:\n start = mid\n if start+1==last:\n break\n \nprint(last)", "c1,c2,x,y=map(int,input().split())\r\ndef fn(val):\r\n f=[val//x,val//y]\r\n both=val//(x*y)\r\n f=[i-both for i in f]\r\n oth=val-f[0]-f[1]-both\r\n cnt=[c1-f[1],c2-f[0]]\r\n if cnt[0]<0:cnt[0]=0\r\n if cnt[1] < 0: cnt[1] = 0\r\n return (sum(cnt)<=oth)\r\nl=0;r=int(1e18)\r\nwhile r-l>1:\r\n m=(r+l)//2\r\n if fn(m):\r\n r=m\r\n else:l=m\r\nprint(r)", "a, b, x, y=[int(k) for k in input().split()]\r\n\r\ndef f(z):\r\n v=z//(x*y)\r\n k=z//x-v\r\n l=z//y-v\r\n eta=z-(v+k+l)\r\n if z-v>=a+b and k+eta>=b and l+eta>=a:\r\n return True\r\n return False\r\n\r\nl, r=0, 10**100\r\nwhile r-l>1:\r\n m=(l+r)//2\r\n if f(m):\r\n r=m\r\n else:\r\n l=m\r\nprint(r)", "cnt1, cnt2, x, y = list(map(int,input().split()))\n\n\n\n\n\n\ndef present(v, x, y, cnt1, cnt2):\n div_x = v // x\n div_y = v // y \n div_xy = v // (x*y)\n \n div_x -= div_xy\n div_y -= div_xy\n\n left = v - (div_x + div_y + div_xy)\n cnt1 -= div_y\n cnt2 -= div_x\n cnt1 = cnt1 if cnt1 > 0 else 0\n cnt2 = cnt2 if cnt2 > 0 else 0\n return left >= (cnt1+cnt2)\n\n\n\n\nl = 0\nr = 1e18\nwhile (r-l)>1:\n mid = l+(r-l)//2\n if present(mid, x, y, cnt1, cnt2):\n r = mid\n else:\n l = mid\nprint(int(r))\n \t\t\t \t \t\t \t \t \t \t", "c1, c2, x, y = map(int, input().split())\r\nxy = x * y \r\nn = 1\r\nwhile n - n // x < c1 or n - n // y < c2 or n - n // xy < c1 + c2:\r\n n = n << 1\r\n\r\nl = 1\r\nr = n\r\nwhile r - l > 1:\r\n m = (r + l) >> 1\r\n if m - m // x < c1 or m - m // y < c2 or m - m // xy < c1 + c2:\r\n l = m\r\n else:\r\n r = m\r\nm = l\r\nif m - m // x < c1 or m - m // y < c2 or m - m // xy < c1 + c2:\r\n print(r)\r\nelse:\r\n print(l)", "def gcd(a, b):\r\n return b if a % b == 0 else gcd(b, a % b)\r\n\r\ncntx, cnty, x, y = map(int, input().split())\r\nd = x * y // gcd(x, y)\r\n\r\nv = cnt = 0\r\nwhile (cntx + cnty > cnt):\r\n dxy = cntx + cnty - cnt\r\n \r\n cx = (v + dxy) // x - v // x\r\n cy = (v + dxy) // y - v // y\r\n cxy = (v + dxy) // d - v // d\r\n\r\n cnt += dxy - cx - cy + cxy\r\n cntx -= min(cy - cxy, cntx)\r\n cnty -= min(cx - cxy, cnty)\r\n \r\n v += dxy\r\n\r\nprint(v)\r\n", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\ndef check(mid,c1,c2,x,y):\r\n a,b,c = mid//x,mid//y,mid//(x*y)\r\n c1 = max(0,c1-b+c)\r\n c2 = max(0,c2-a+c)\r\n if c1+c2 <= mid-a-b+c:\r\n return 1\r\n return 0\r\n\r\ndef main():\r\n c1,c2,x,y = map(int,input().split())\r\n hi,lo,ans = 10**10,0,10**10\r\n while hi >= lo:\r\n mid = (hi+lo)//2\r\n if check(mid,c1,c2,x,y):\r\n ans = mid\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\n print(ans)\r\n\r\n# Fast IO Region\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nif __name__ == \"__main__\":\r\n main()", "#!/usr/bin/python3\r\n\r\nfrom fractions import gcd\r\n\r\ncnt1, cnt2, a, b = tuple(map(int, input().split()))\r\nlcm = a*b // gcd(a, b)\r\n\r\ndef check(v):\r\n c1 = int(v/b) - int(v/lcm)\r\n c2 = int(v/a) - int(v/lcm)\r\n rest = v - c1 - c2 - int(v/lcm)\r\n c1 = min(c1, cnt1)\r\n c2 = min(c2, cnt2)\r\n return rest >= cnt1+cnt2-c1-c2\r\n\r\nleft, right = 1, 10**18\r\nwhile left + 1 < right:\r\n mid = (left+right) // 2\r\n if (check(mid)):\r\n right = mid\r\n else:\r\n left = mid\r\nprint(right)\r\n", "def works(v):\r\n shared = v // (x * y)\r\n cnt_1loc, cnt_2loc = v // x, v // y\r\n split = v - cnt_1loc - cnt_2loc + shared\r\n cnt_1loc, cnt_2loc = cnt_1loc - shared, cnt_2loc - shared\r\n return (max(cnt1 - cnt_2loc, 0) + max(cnt2 - cnt_1loc, 0)) <= split\r\n\r\ncnt1, cnt2, x, y = map(int, input().split())\r\nlow, mid, high = 0, -1, 10 ** 18\r\nwhile high - low > 1:\r\n mid = (high + low) // 2\r\n if works(mid):\r\n high = mid\r\n else:\r\n low = mid\r\nprint(high)\r\n", "s = input()\narrIn = s.split()\nn = int(arrIn[0])\nm = int(arrIn[1])\nx = int(arrIn[2])\ny = int(arrIn[3])\n\n\nl = 1\nr = 2e9\nwhile l < r:\n mid = int((r+l)/2)\n if n <= mid - int(mid/x) and m <= mid - int(mid/y) and m+n <= mid - int(mid/(x*y)):\n r = mid\n else:\n l = mid+1\nelse:\n print(r)\n\n\t \t\t \t \t\t \t\t\t\t \t \t\t \t \t", "from sys import stdin\nlines = list(filter(None, stdin.read().split('\\n')))\n\ndef parseline(line):\n\treturn list(map(int, line.split()))\n\nlines = list(map(parseline, lines))\n\ndef search(f, v, l, r):\n\twhile l + 1 < r:\n\t\tp = l + (r - l) // 2\n\t\tif f(p) <= v:\n\t\t\tl = p\n\t\telse:\n\t\t\tr = p\n\treturn l\n\nc1, c2, x, y = lines[0]\n\ndef check(v, debug=False):\n\tm1 = max(c1 - v // y + v // (x * y), 0) \n\tm2 = max(c2 - v // x + v // (x * y), 0)\n\tf = v - v // x - v // y + v // (x * y)\n\tif debug:\n\t\tprint(v, \":\", m1, m2, f)\n\tif m2 <= f - m1:\n\t\treturn 1\n\telse:\n\t\treturn 0\n#print([check(v, True) for v in range(20)])\nprint(1 + search(check, 0, 1, y * c1 + x * c2 + 1))\n", "import math\nu, v, x, y = map(int, input().split())\nz = x * y // math.gcd(x, y)\ndef check(ans):\n inter = ans - ans // x - ans // y + ans // z\n fx = ans // y - ans // z\n fy = ans // x - ans // z\n if fx + inter < u:\n return False\n if fy + inter < v:\n return False\n if fx + fy + inter < u + v:\n return False\n return True\nans = 0\nfor i in range(31, -1, -1):\n if not check(ans + 2 ** i):\n ans += 2 ** i\nprint(ans + 1)\n\t\t\t\t \t \t\t\t \t \t\t\t\t \t \t\t \t", "a,b,x,y=map(int,input().split());\r\nl=0\r\nr=10000000000000;\r\nres=0;\r\ndef judge(n,a,b,x,y):\r\n return (n - n // (x * y)) >= a + b and (n - n // x >= a) and (n - n // y >= b);\r\nwhile l<=r:\r\n m=(l+r)//2;\r\n if judge(m,a,b,x,y):\r\n r=m-1;\r\n res=m;\r\n else :l=m+1;\r\nprint(res);", "c1,c2,x,y=map(int,input().split())\r\ndef poss(v):\r\n global c1,c2,x,y\r\n divbyx=v//x\r\n divbyy=v//y\r\n divbyxy=v//(x*y)\r\n cc1=c2-divbyx+divbyxy\r\n cc2=c1-divbyy+divbyxy\r\n cc1=max(cc1,0)\r\n cc2=max(cc2,0)\r\n remaining=v-divbyx-divbyy+divbyxy\r\n # print(v,cc1,cc2,divbyx,divbyy,divbyxy,remaining)\r\n if (cc1+cc2<=remaining):\r\n return True\r\n return False\r\nlo,hi=1,int(1e19)\r\nans=int(1e19)\r\nwhile(lo<=hi):\r\n mid=(lo+hi)//2\r\n if(poss(mid)):\r\n ans=min(ans,mid)\r\n hi=mid-1\r\n else:\r\n lo=mid+1\r\nprint(ans)", "cnt1, cnt2, x, y = list(map(int, input().split(' ')))\r\n\r\nlo = 1\r\nhi = 10**10\r\n\r\nwhile lo < hi:\r\n xx = cnt1\r\n yy = cnt2\r\n \r\n mid = (lo + hi) // 2\r\n intx = mid // x\r\n inty = mid // y\r\n intxy = mid // (x*y)\r\n notxy = mid - intx - inty + intxy\r\n notx = mid - intx - notxy\r\n noty = mid - inty - notxy\r\n \r\n xx -= notx\r\n yy -= noty\r\n\r\n \r\n if max(xx,0) + max(yy,0) > notxy:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\nprint(lo)\r\n", "class FriendsPresents():\n def __init__(self, c1, c2, x, y):\n self.c1, self.c2, self.x, self.y = c1, c2, x, y\n\n def check(self, v):\n xval = int(v/self.x)\n yval = int(v/self.y)\n xyval = int(v/(self.x*self.y))\n c1rem = max(0, self.c1 - (yval-xyval))\n c2rem = max(0, self.c2 - (xval-xyval))\n if c1rem+c2rem <= v-xval-yval+xyval:\n return True\n else:\n return False\n\n def min_val(self):\n mn = self.c1+self.c2-1\n mx = self.c1*self.c2\n while not self.check(mx):\n mx = mx*2\n while mx > mn+1:\n md = int((mn+mx)/2)\n if self.check(md):\n mx = md\n else:\n mn = md\n return mx\n\nc1, c2, x, y = list(map(int,input().strip(' ').split(' ')))\nfp = FriendsPresents(c1, c2, x, y)\nprint(fp.min_val())\n", "c1, c2, x, y = map(int, input().split())\r\n\r\ndef valid(m):\r\n a = m - m // x\r\n b = m - m // y - max(0, c1 - m // y + m // x // y)\r\n return a >= c1 and b >= c2 \r\n\r\nl, r = 0, (1<<62)\r\nwhile l+1 < r: \r\n m = l + r >> 1\r\n if valid(m):\r\n r = m\r\n else: \r\n l = m\r\nprint(r)\r\n", "cnt1, cnt2, x, y = map(int, input().split())\r\n\r\nl = 0\r\nr = (cnt1 // (x - 1) + 1) * x + (cnt2 // (y - 1) + 1) * y + 5\r\n\r\nwhile r - l != 1:\r\n m = l + (r - l) // 2\r\n t_cnt1 = m // y - m // (x * y)\r\n t_cnt2 = m // x - m // (x * y)\r\n\r\n if max(0, cnt1 - t_cnt1) + max(0, cnt2 - t_cnt2) <= m - (m // x + m // y - m // (x * y)):\r\n r = m\r\n else:\r\n l = m\r\n\r\nprint(r)\r\n", "cnt1,cnt2,x,y = [int(x) for x in input().split()]\n#binary search for the value of v -- obviously if v is sufficient than so is v+1\nlo,hi = 1,10*(cnt1+cnt2) #10*(cnt1+cnt2) is a very safe upper bound\n#choosing a safe upper bound so that answer is surely in range [lo,hi]\nwhile lo < hi:\n mid = (lo+hi)//2 #no +1, as no (mid-1) below\n div_by_both = mid//(x*y) \n div_by_x_only = mid//x-div_by_both\n div_by_y_only = mid//y-div_by_both\n total_wasted = div_by_both\n total_wasted += div_by_y_only-min(cnt1,div_by_y_only)\n total_wasted += div_by_x_only-min(cnt2,div_by_x_only)\n is_enough = True\n if cnt1+cnt2+total_wasted > mid:\n is_enough = False\n if is_enough:\n hi = mid\n else:\n lo = mid+1\nprint(lo)\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom math import gcd\r\ndef lcm(a,b):\r\n return a*b//gcd(a,b)\r\nc1,c2,x,y=map(int,input().split())\r\nll=lcm(x,y)\r\ngg=gcd(x,y)\r\nl=0;r=10**18\r\nwhile r-l>1:\r\n mid=(l+r)//2\r\n can_use_x=mid//y-mid//ll\r\n can_use_y=mid//x-mid//ll\r\n need_for_x=max(c1-can_use_x,0)\r\n need_for_y=max(c2-can_use_y,0)\r\n if need_for_x+need_for_y<=mid-mid//x-mid//y+mid//ll:\r\n r=mid\r\n else:\r\n l=mid\r\nprint(r)", "c1,c2,x,y=map(int,input().split())\r\nl=c1+c2\r\ntemp=l\r\nh=pow(10,10)\r\nwhile(l<h):\r\n ans=(l+h)//2\r\n if (c1>ans - ans//x) or (c2>ans- ans//y) or (temp>ans - ans//(x*y)):\r\n l=ans+1\r\n else:\r\n h=ans\r\nprint(l)", "def main():\n cnt1, cnt2, x, y = map(int, input().split())\n lo = cnt3 = cnt1 + cnt2\n hi, z = 10 ** 10, x * y\n while lo < hi:\n v = (lo + hi) // 2\n if (v - v // x < cnt1) or (v - v // y < cnt2) or (v - v // z < cnt3):\n lo = v + 1\n else:\n hi = v\n print(lo)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Friends_and_Presents2():\r\n def check_if_present_possible(v,a,b,p1,p2):\r\n numbers_divisible_by_p1 = v//p1 \r\n numbers_divisible_by_p2 = v//p2 \r\n numbers_divisible_by_both = v//(p1*p2)\r\n numbers_divisible_by_only_p1 = numbers_divisible_by_p1 - numbers_divisible_by_both\r\n numbers_divisible_by_only_p2 = numbers_divisible_by_p2 - numbers_divisible_by_both\r\n free_numbers = v - (numbers_divisible_by_only_p1 + numbers_divisible_by_only_p2 + numbers_divisible_by_both)\r\n\r\n remaining_for_F1 = a - numbers_divisible_by_only_p2 \r\n remaining_for_F2 = b - numbers_divisible_by_only_p1\r\n\r\n if remaining_for_F1 <= 0 and remaining_for_F2 <= 0:\r\n return True \r\n elif remaining_for_F1 <=0 and remaining_for_F2 > 0:\r\n if remaining_for_F2 <= free_numbers:\r\n return True \r\n else:\r\n return False \r\n elif remaining_for_F2 <= 0 and remaining_for_F1 > 0:\r\n if remaining_for_F1 <= free_numbers:\r\n return True \r\n else:\r\n return False \r\n else:\r\n remaining_free_numbers = free_numbers - remaining_for_F1\r\n if remaining_free_numbers < remaining_for_F2:\r\n return False \r\n else:\r\n return True\r\n\r\n\r\n a,b,p1,p2 = invr()\r\n\r\n max_number = (a+b)*(max(p1,p2))\r\n left = 1 \r\n right = max_number\r\n\r\n while left <= right:\r\n mid = (left + right)//2\r\n\r\n if check_if_present_possible(mid,a,b,p1,p2):\r\n right = mid -1 \r\n else:\r\n left = mid + 1\r\n \r\n if check_if_present_possible(mid,a,b,p1,p2):\r\n v = mid \r\n else:\r\n v = mid + 1\r\n \r\n print(v)\r\n return\r\n\r\nFriends_and_Presents2()", "cnt1, cnt2, x, y = map(int, input().split())\r\n\r\nupper_limit = (cnt1 + cnt2) * (x*y) // (x*y - x - y + 1)\r\n\r\ndef bin_search(low, high):\r\n if low >= high - 1:\r\n return high\r\n \r\n mid = (low + high) // 2\r\n best_way = max(0, cnt1 - mid//y + mid//(x*y)) + max(0, cnt2 - mid//x + mid//(x*y))\r\n leftovers = mid - mid//x - mid//y + mid//(x*y)\r\n if best_way <= leftovers:\r\n return bin_search(low, mid)\r\n return bin_search(mid, high)\r\n\r\nprint(bin_search(1, upper_limit + 10))", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\ndef check(n) :\r\n nx = n // x\r\n ny = n // y \r\n nxy = n // (x*y)\r\n\r\n cx = max(0, c1 - (ny-nxy))\r\n cy = max(0, c2 - (nx-nxy))\r\n n = n - nx - ny + nxy \r\n if n >= cx+cy : return True\r\n return False\r\n\r\nc1, c2, x, y = minp()\r\nlo, hi, ans = 0, lim, inf\r\nwhile lo <= hi :\r\n mid = (lo+hi) // 2\r\n if check(mid) :\r\n hi = mid - 1\r\n ans = min(mid, ans)\r\n else :\r\n lo = mid + 1\r\nprint(ans)", "c1, c2, x, y = map(int, input().split())\nl, r = 0, 1 << 179\nwhile r - l > 1:\n\tm = (l + r) >> 1\n\tif (m - m // x >= c1) and (m - m // y - max(0, c1 - m // y + m // x // y) >= c2):\n\t\tr = m\n\telse:\n\t\tl = m\nprint(r)\n", "def good(tmp,a,b,c,d):\r\n v=[tmp//c, tmp//d]\r\n e=tmp//(c*d)\r\n cur=tmp-v[0]-v[1]+e\r\n v[0]-=e\r\n v[1]-=e\r\n v2=[a-v[1],b-v[0]]\r\n if v2[0]<0:\r\n v2[0]=0\r\n if v2[1]<0:\r\n v2[1]=0\r\n if v2[0]+v2[1]<=cur:\r\n return 1\r\n else:\r\n return 0\r\n\r\ndef solve(a,b,c,d):\r\n lf=0\r\n rt=10**18\r\n while rt-lf>1:\r\n md=(lf+rt)//2\r\n if good(md,a,b,c,d)==1:\r\n rt=md\r\n else:\r\n lf=md\r\n return rt\r\n\r\na,b,c,d=map(int,input().split())\r\nprint(solve(a,b,c,d))\r\n", "def check(v):\r\n a = v // y - v // (x * y)\r\n b = v // x - v // (x * y)\r\n c = v - (a + b + v // (x * y))\r\n fa = c + a\r\n fb = min(c, fa - cnt1) + b\r\n return (fa >= cnt1) and (fb >= cnt2)\r\n\r\ncnt1, cnt2, x, y = map(int, input().split())\r\nl, r = 0, (cnt1 + cnt2) * 2\r\nwhile l <= r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n ans = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\nprint(ans)\r\n", "\ndef is_enough(n, count_a, count_b, a, b):\n if a == b:\n lost = n // a\n return n - lost >= count_a + count_b\n\n lost = n // (a*b)\n only_a = (n // b) - lost\n only_b = (n // a) - lost\n available = n - lost - only_a - only_b\n return available >= max(count_a - only_a, 0) + max(count_b - only_b, 0)\n\n\ncount_x, count_y, x, y = [ int(i) for i in input().split(\" \") ]\nn_false = count_x + count_y - 1\nn_true = 2*n_false + 10\n\nwhile n_false < n_true - 1:\n n = (n_false + n_true) // 2\n if is_enough(n, count_x, count_y, x, y):\n n_true = n\n else:\n n_false = n\n\nprint(n_true)\n", "def judge(n,m,sum):\n cnt=int(sum/x/y)\n if x==y:\n cnt=int(sum/x)\n #print(cnt)\n n=max(0, n-int(sum/y)+cnt)\n m=max(0, m-int(sum/x)+cnt)\n #print(n,m)\n if(sum-int(sum/x)-int(sum/y)+cnt>=n+m):\n tmp=0\n else:\n tmp=m+n-(sum-int(sum/x)-int(sum/y)+cnt)\n #print(tmp)\n return tmp\nn,m,x,y=map(int,input().split())\nsum=n+m #至少要n+m个数\nwhile True:\n temp=judge(n,m,sum)\n if temp==0:\n break\n sum+=temp\nprint(sum)\n", "c1, c2, x, y = map(int, input().split())\r\ndef get(n):\r\n if (n - n // (x * y)) >= c1 + c2 and (n - n // x >= c1) and (n - n // y >= c2):\r\n return True\r\n else:\r\n return False\r\nl = 0\r\nr = c1 * x + c2 * y\r\nwhile (r - l > 1):\r\n m = (l + r) // 2\r\n if get(m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n" ]

[ "#ROUNIAAUDI\r\nanswerOne=input().lstrip('0')\r\nanswerTwo=input().lstrip('0')\r\n#print(a)\r\nif(len(answerOne)!=len(answerTwo)) :\r\n print(\">\" if len(answerOne)>len(answerTwo) else \"<\")\r\nelse :\r\n print(\">\" if answerOne>answerTwo else \"<\" if answerTwo > answerOne else \"=\")\r\n\r\n", "x = input()\r\ny = input()\r\n\r\nif len(x) > len(y):\r\n tambah = len(x) - len(y)\r\n y = '0'*tambah + y\r\nelse:\r\n tambah = len(y) - len(x)\r\n x = '0'* tambah + x\r\n\r\nif x > y:\r\n print('>')\r\nelif y > x:\r\n print('<')\r\nelse:\r\n print('=')\r\n", "c = input() \r\nd = input() \r\nl1 = max(len(c), len(d))\r\nj = len(c) - l1\r\nk = len(d) - l1\r\nfor i in range(l1):\r\n h = '0'\r\n if j+i>=0:\r\n h = c[j + i]\r\n q = '0'\r\n if k + i >= 0:\r\n q = d[k + i]\r\n if h < q:\r\n print(\"<\")\r\n exit(0)\r\n else:\r\n if h > q:\r\n print(\">\")\r\n exit(0)\r\nprint(\"=\")", "n = input()\r\nm = input()\r\n\r\nl = max(len(n),len(m))\r\ndiff_n = len(n)-l\r\ndiff_m = len(m)-l\r\nfor i in range(l):\r\n vn='0'\r\n if diff_n+i>=0:\r\n vn = n[diff_n+i]\r\n vm='0'\r\n if diff_m+i>=0:\r\n vm = m[diff_m+i]\r\n if vn<vm:\r\n print(\"<\")\r\n exit(0)\r\n else:\r\n if(vn>vm):\r\n print(\">\")\r\n exit(0)\r\nprint(\"=\")\r\n", "import sys\r\nx= sys.stdin.readline().strip()\r\ny= sys.stdin.readline().strip()\r\nind = 0\r\nwhile ind <len(x):\r\n if x[ind]!=\"0\":\r\n break\r\n ind+=1\r\nx = x[ind:]\r\nind = 0\r\nwhile ind <len(y):\r\n if y[ind]!=\"0\":\r\n break\r\n ind+=1\r\ny = y[ind:]\r\nif len(x)>len(y):\r\n sys.stdout.write(\">\\n\")\r\nelif len(y)>len(x):\r\n sys.stdout.write(\"<\\n\")\r\nelse:\r\n f = 0\r\n for i in range(len(x)):\r\n if int(x[i]) > int(y[i]):\r\n sys.stdout.write(\">\\n\")\r\n f = 2\r\n break\r\n elif int(y[i]) > int(x[i]):\r\n sys.stdout.write(\"<\\n\")\r\n f = 2\r\n break\r\n if f == 0:\r\n sys.stdout.write(\"=\\n\")", "a=input().rjust(10**6,\"0\")\r\nb=input().rjust(10**6,\"0\")\r\nif a>b:\r\n print(\">\")\r\nelif a < b:\r\n print(\"<\")\r\nelif a==b:\r\n print(\"=\")", "a=input().rjust(10**6,\"0\")\r\nb=input().rjust(10**6,\"0\")\r\nif a>b:\r\n print(\">\")\r\nelif a<b:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n ", "a = input()\nb = input()\n\na = \"0\" * (10 ** 6 - len(a)) + a\nb = \"0\" * (10 ** 6 - len(b)) + b\n\nif a > b:\n print(\">\")\nelif a == b:\n print(\"=\")\nelse:\n print(\"<\")\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\nleft right each coord\r\n'''\r\n\r\ndef solve():\r\n a = I().strip()\r\n b = I().strip()\r\n\r\n ai = 0\r\n bi = 0\r\n\r\n while ai < len(a) and a[ai] == '0':\r\n ai += 1\r\n \r\n while bi < len(b) and b[bi] == '0':\r\n bi += 1\r\n\r\n a = a[ai:]\r\n b = b[bi:]\r\n\r\n if len(a) < len(b):\r\n print('<')\r\n elif len(a) > len(b):\r\n print('>')\r\n else:\r\n ans = '='\r\n for i in range(len(a)):\r\n if a[i] < b[i]:\r\n ans = '<'\r\n break\r\n elif a[i] > b[i]:\r\n ans = '>'\r\n break\r\n print(ans)\r\n\r\nsolve()", "def f(a,b):\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]>b[i]:\r\n\t\t\treturn \">\"\r\n\t\telif a[i]<b[i]:\r\n\t\t\treturn \"<\"\r\n\treturn \"=\"\r\na=input().lstrip(\"0\")\r\nb=input().lstrip(\"0\")\r\nif a==\"\":\r\n\ta=\"0\"\r\nif b==\"\":\r\n\tb=\"0\"\r\nif len(a)>len(b):\r\n\tprint(\">\")\r\nelif len(a)<len(b):\r\n\tprint(\"<\")\r\nelse:\r\n\tprint(f(a,b))", "a = list(input())\r\nb = list(input())\r\na = a[::-1]\r\nb = b[::-1]\r\nwhile len(a)<len(b):\r\n a.append('0')\r\nwhile len(b)<len(a):\r\n b.append('0')\r\nfor x, y in zip(a[::-1], b[::-1]):\r\n if ord(x) != ord(y):\r\n if ord(x) < ord(y):\r\n print('<')\r\n elif ord(x) > ord(y):\r\n print('>')\r\n break\r\nelse:\r\n print('=')\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-18 23:26:43\nLastEditTime: 2021-11-18 23:33:09\nDescription: Comparing Two Long Integers\nFilePath: CF616A.py\n'''\n\n\ndef func():\n a, b = input().strip().lstrip(\"0\"), input().strip().lstrip(\"0\")\n if len(a) > len(b):\n print(\">\")\n elif len(a) < len(b):\n print(\"<\")\n else:\n if a == b:\n print(\"=\")\n else:\n for i in range(len(a)):\n if int(a[i]) > int(b[i]):\n print(\">\")\n break\n elif int(a[i]) < int(b[i]):\n print(\"<\")\n break\n else:\n print(\"=\")\n\n\nif __name__ == '__main__':\n func()\n", "a=input().lstrip('0')\r\nb=input().lstrip('0')\r\nif len(a) > len(b):\r\n print(\">\")\r\n quit()\r\nelif len(b) > len(a):\r\n print(\"<\")\r\n quit()\r\nfor c1,c2 in zip(a,b):\r\n if ord(c1) > ord(c2):\r\n print(\">\")\r\n quit()\r\n elif ord(c2) > ord(c1):\r\n print(\"<\")\r\n quit()\r\nprint(\"=\")", "def task():\r\n a = input()\r\n b = input()\r\n ai = -1\r\n bi = -1\r\n for i in range(len(a)):\r\n if a[i] != '0':\r\n ai = i\r\n break\r\n a = a[ai:]\r\n \r\n for i in range(len(b)):\r\n if b[i] != '0':\r\n bi = i\r\n break\r\n b = b[bi:]\r\n\r\n if len(a) > len(b):\r\n print(\">\")\r\n return\r\n elif len(a) < len(b):\r\n print(\"<\")\r\n return\r\n else:\r\n for i in range(len(a)):\r\n if a[i] > b[i]:\r\n print(\">\")\r\n return\r\n elif a[i] < b[i]:\r\n print(\"<\")\r\n return \r\n print(\"=\")\r\n return\r\n\r\ntask()\r\n", "a=input().lstrip('0')\r\nb=input().lstrip('0')\r\nif(len(a)>len(b)):\r\n print('>')\r\nelif(len(a)<len(b)):\r\n print('<')\r\nelse:\r\n if(a>b):\r\n print('>')\r\n elif(a<b):\r\n print('<')\r\n else:\r\n print('=')", "a = input().strip()\r\nb = input().strip()\r\n\r\n# Remove leading zeros\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\n\r\n# Compare the lengths of a and b\r\nif len(a) < len(b):\r\n print(\"<\")\r\nelif len(a) > len(b):\r\n print(\">\")\r\nelse:\r\n # If a and b have the same length, compare them character by character\r\n for i in range(len(a)):\r\n if a[i] < b[i]:\r\n print(\"<\")\r\n break\r\n elif a[i] > b[i]:\r\n print(\">\")\r\n break\r\n else:\r\n print(\"=\")\r\n", "def cleanUp(x:str):\r\n y = x.lstrip(\"0\")\r\n if y == \"\": return \"0\"\r\n return y\r\n\r\na = cleanUp(input())\r\nb = cleanUp(input())\r\nif a == b: print(\"=\")\r\nelif len(a) < len(b): print(\"<\")\r\nelif len(a) > len(b): print(\">\")\r\nelif a < b: print(\"<\")\r\nelse: print(\">\")", "import io,os\r\ninst=lambda: io.BytesIO(os.read(0,os.fstat(0).st_size)).readline().decode().rstrip('\\n\\r')\r\ninin=lambda: int(io.BytesIO(os.read(0,os.fstat(0).st_size)).readline())\r\ninar=lambda: list(map(int,io.BytesIO(os.read(0,os.fstat(0).st_size)).readline().split()))\r\na=input().lstrip('0')\r\nb=input().lstrip('0')\r\nif len(a)<len(b):\r\n print('<')\r\nelif len(a)>len(b):\r\n print('>')\r\nelse:\r\n if a<b:\r\n print('<')\r\n elif a>b:\r\n print('>')\r\n else:\r\n print('=')", "a = input()\r\nb = input()\r\n\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\n\r\nl = max(len(a) , len(b))\r\na = a.rjust(l , \"0\")\r\nb = b.rjust(l , \"0\")\r\n\r\n# print(a , b)\r\nif a == b:\r\n print(\"=\")\r\nelif a>b:\r\n print('>')\r\nelse:\r\n print('<')\r\n\r\n", "\r\ndef main():\r\n\tfrom sys import stdin, stdout\r\n\r\n\ta = stdin.readline()\r\n\tb = stdin.readline()\r\n\r\n\tmaxLen = max(len(a), len(b))\r\n\r\n\ta = a.zfill(maxLen)\r\n\tb = b.zfill(maxLen)\r\n\t\r\n\tstdout.write(('=\\n', '>\\n', '<\\n')[(a > b) - (a < b)])\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "def lid(n):\r\n for i in range(len(n)):\r\n if n[i]!='0':\r\n break\r\n return n[i:]\r\n\r\nn=lid(input())\r\nm=lid(input())\r\nif len(n)>len(m):\r\n print('>')\r\n\r\nelif len(n)<len(m):\r\n print('<')\r\n\r\nelif n>m:\r\n print('>')\r\n\r\nelif n<m:\r\n print('<')\r\n\r\nelse:\r\n print('=')\r\n", "def read():\r\n return map(int, input().split())\r\n\r\na, b = input(), input()\r\nsa, sb = 0, 0\r\nwhile sa < len(a) and a[sa] == \"0\":\r\n sa += 1\r\nwhile sb < len(b) and b[sb] == \"0\":\r\n sb += 1\r\na, b = a[sa:], b[sb:]\r\nif len(a) > len(b):\r\n print(\">\")\r\nelif len(a) < len(b):\r\n print(\"<\")\r\nelse:\r\n for x, y in zip(a, b):\r\n if x < y:\r\n print(\"<\")\r\n break\r\n elif x > y:\r\n print(\">\")\r\n break\r\n else:\r\n print(\"=\")\r\n\r\n", "exec('a,b='+2*'input().rjust(10**6,\"0\"),')\r\nprint('<>='[(a==b)+(a>=b)])", "a = input()\nb = input()\nl1, l2 = len(a), len(b)\n\nif l1 < l2:\n\ta = (l2 - l1) * '0' + a\nelif l1 > l2:\n\tb = (l1 - l2) * '0' + b\n\nfor i in range(len(a)):\n\tif a[i] != b[i]:\n\t\tif int(a[i]) < int(b[i]):\n\t\t\tprint(\"<\")\n\t\telse:\n\t\t\tprint(\">\")\n\t\tbreak\nelse:\n\tprint(\"=\")\n \t \t \t\t\t \t \t \t \t\t\t \t\t\t\t", "def solve():\r\n s1 = input()\r\n s2 = input()\r\n size = max(len(s1), len(s2))\r\n flag1 = flag2 = True\r\n \r\n if len(s1) != size:\r\n s1 = '0' * (size - len(s1)) + s1\r\n if len(s2) != size:\r\n s2 = '0' * (size - len(s2)) + s2\r\n \r\n for i in range(size):\r\n if int(s1[i]) > int(s2[i]):\r\n flag2 = False\r\n break\r\n elif int(s2[i]) > int(s1[i]):\r\n flag1 = False\r\n break\r\n \r\n if flag1 and flag2:\r\n print('=')\r\n elif flag1:\r\n print('>')\r\n else:\r\n print('<')\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\na=[int(i) for i in input()]\r\nb=[int(i) for i in input()]\r\na=a[::-1]\r\nwhile a and a[-1]==0:\r\n a.pop()\r\na=a[::-1]\r\nb=b[::-1]\r\nwhile b and b[-1]==0:\r\n b.pop()\r\nb=b[::-1]\r\nif len(a)>len(b):\r\n print('>')\r\n exit()\r\nif len(a)<len(b):\r\n print('<')\r\n exit()\r\nm=len(a)\r\nfor i in range(m):\r\n if a[i]>b[i]:\r\n print('>')\r\n exit()\r\n if a[i]<b[i]:\r\n print('<')\r\n exit()\r\nprint('=')", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve(): \r\n s1=input().rstrip()\r\n s2=input().rstrip()\r\n idx1=-1\r\n for i in range(len(s1)):\r\n if s1[i]!='0': break\r\n idx1=i\r\n idx2=-1\r\n for i in range(len(s2)):\r\n if s2[i]!='0': break\r\n idx2=i\r\n s1=s1[idx1+1:]\r\n s2=s2[idx2+1:]\r\n if len(s1)>len(s2): print(\">\")\r\n elif len(s1)<len(s2): print(\"<\")\r\n else:\r\n if s1>s2: print(\">\")\r\n elif s1<s2: print(\"<\")\r\n else: print(\"=\")\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "from sys import stdin, stdout\r\ntk, pf = stdin.readline, stdout.write\r\n\r\n\r\na = tk().strip()\r\nb = tk().strip()\r\na = a.lstrip(\"0\")\r\nb = b.lstrip(\"0\")\r\nif not a:\r\n a = \"0\"\r\nif not b:\r\n b = \"0\"\r\n\r\nif len(a)<len(b):\r\n\tpf('<')\r\nelif len(a)>len(b):\r\n\tpf('>')\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]!=b[i]:\r\n\t\t\tif a[i]<b[i]:\r\n\t\t\t\tpf('<')\r\n\t\t\t\texit(0)\r\n\t\t\telse:\r\n\t\t\t\tpf('>')\r\n\t\t\t\texit(0)\r\n\tpf('=')", "'''import sys\r\ninput=sys.stdin.buffer.readline'''\r\nimport sys,io,atexit\r\nsys.stdin = io.StringIO(sys.stdin.read())\r\nsys.stdout = io.StringIO()\r\natexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\ninst=lambda: input().rstrip('\\n\\r')\r\ninin=lambda: int(input())\r\ninar=lambda: list(map(int,input().split()))\r\na=inst().lstrip('0')\r\nb=inst().lstrip('0')\r\nif len(a)<len(b):\r\n print('<')\r\nelif len(a)>len(b):\r\n print('>')\r\nelse:\r\n if a<b:\r\n print('<')\r\n elif a>b:\r\n print('>')\r\n else:\r\n print('=')", "a,b=input(),input()\r\nm=max(len(a),len(b))\r\na,b=a.zfill(m),b.zfill(m)\r\nprint('>' if a>b else ('<' if a<b else '='))", "'''import sys\r\ninput=sys.stdin.buffer.readline\r\nfrom collections import deque as que, defaultdict as vector, Counter\r\nfrom bisect import bisect as bsearch\r\nfrom heapq import*\r\ninin = lambda: int(input())\r\ninar = lambda: list(map(int,input().split()))\r\ninst= lambda: input().decode().rstrip('\\n\\r')\r\nINF=float('inf')'''\r\n'''from types import GeneratorType\r\ndef recursive(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc'''\r\n'''\r\n\r\n_T_=inin()\r\nfor _t_ in range(_T_):\r\n n,m=inar()\r\n belt=[]\r\n for i in range(n):\r\n belt.append(inst())\r\n cnt=0\r\n for i in range(n-1):\r\n if belt[i][m-1]=='R':\r\n cnt+=1\r\n for j in range(m-1):\r\n if belt[n-1][j]=='D':\r\n cnt+=1\r\n print(cnt)'''\r\n\r\nimport sys\r\ninput=sys.stdin.buffer.readline\r\ninst=lambda: input().decode().rstrip('\\n\\r')\r\ninin=lambda: int(input())\r\ninar=lambda: list(map(int,input().split()))\r\na=inst().lstrip('0')\r\nb=inst().lstrip('0')\r\nif len(a)<len(b):\r\n print('<')\r\nelif len(a)>len(b):\r\n print('>')\r\nelse:\r\n if a<b:\r\n print('<')\r\n elif a>b:\r\n print('>')\r\n else:\r\n print('=')\r\n", "s=input().rjust(10**6,\"0\")\r\ns1=input().rjust(10**6,\"0\")\r\nprint(\">\" if s>s1 else \"<\"if s1>s else \"=\" )", "a = input()\r\nb = input()\r\n\r\nstart_1 = 0\r\nwhile a[start_1] == '0' and start_1 < len(a)-1:\r\n start_1 = start_1 + 1\r\n \r\nstart_2 = 0\r\nwhile b[start_2] == '0' and start_2 < len(b)-1:\r\n start_2 = start_2 + 1\r\n \r\n\r\nlen_a = len(a) - start_1 # Фактическая длина числа меньше\r\nlen_b = len(b) - start_2 # Фактическая длина числа меньше\r\n\r\nif len_a < len_b:\r\n print('<')\r\nelif len_a > len_b:\r\n print('>')\r\nelse:\r\n i = 0\r\n while i < len_a:\r\n if a[start_1 + i] < b[start_2 + i]:\r\n print('<')\r\n break #Останавливаем цикл\r\n if a[start_1 + i] > b[start_2 + i]:\r\n print('>')\r\n break #Останавливаем цикл\r\n i = i + 1\r\n if i == len_a:\r\n # Мы прошли весь цикл, ни разу его не остановив. Значит, числа равны\r\n print('=')\r\n ", "a, b = input().lstrip(\"0\"), input().lstrip(\"0\")\ndiff = len(a) - len(b)\nres = \"=\"\nif diff != 0:\n res = \">\" if diff > 0 else \"<\"\nelse:\n for a, b, in zip(a, b):\n diff = ord(a) - ord(b)\n if diff != 0:\n res = \">\" if diff > 0 else \"<\"\n break\nprint(res)\n", "'''import sys\r\ninput=sys.stdin.buffer.readline\r\nfrom collections import deque as que, defaultdict as vector, Counter\r\nfrom bisect import bisect as bsearch\r\nfrom heapq import*\r\ninin = lambda: int(input())\r\ninar = lambda: list(map(int,input().split()))\r\ninst= lambda: input().decode().rstrip('\\n\\r')\r\nINF=float('inf')'''\r\n'''from types import GeneratorType\r\ndef recursive(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc'''\r\n'''\r\n\r\n_T_=inin()\r\nfor _t_ in range(_T_):\r\n n,m=inar()\r\n belt=[]\r\n for i in range(n):\r\n belt.append(inst())\r\n cnt=0\r\n for i in range(n-1):\r\n if belt[i][m-1]=='R':\r\n cnt+=1\r\n for j in range(m-1):\r\n if belt[n-1][j]=='D':\r\n cnt+=1\r\n print(cnt)'''\r\n\r\nimport sys\r\ninst=lambda: sys.stdin.buffer.readline().decode().rstrip('\\n\\r')\r\ninin=lambda: int(sys.stdin.buffer.readline())\r\ninar=lambda: list(map(int,sys.stdin.buffer.readline().split()))\r\na='0'+inst()\r\nb='0'+inst()\r\nna=''\r\nnb=''\r\nflag=False\r\nfor i in a:\r\n if flag: na+=i\r\n elif i!='0':\r\n flag=True;na+=i\r\nflag=False\r\nfor i in b:\r\n if flag:\r\n nb+=i\r\n elif i!='0':\r\n flag=True;nb+=i\r\nif len(na)<len(nb):\r\n print('<')\r\nelif len(na)>len(nb):\r\n print('>')\r\nelse:\r\n ans='='\r\n for i in range(len(na)):\r\n if int(na[i])<int(nb[i]):\r\n ans='<'\r\n break\r\n elif int(na[i])>int(nb[i]):\r\n ans='>'\r\n break\r\n else:\r\n pass\r\n print(ans)", "import sys\r\na = sys.stdin.readline().strip()\r\nb = sys.stdin.readline().strip()\r\na = a.lstrip(\"0\")\r\nb = b.lstrip(\"0\")\r\nif len(a) > len(b):\r\n print(\">\")\r\nelif len(a) < len(b):\r\n print(\"<\")\r\nelse:\r\n if a > b:\r\n print(\">\")\r\n elif a < b:\r\n print(\"<\")\r\n else:\r\n print(\"=\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\na = input()[:-1].rjust(10**6 + 1, '0')\r\nb = input()[:-1].rjust(10**6 + 1, '0')\r\nif a < b:\r\n print('<')\r\nif a == b:\r\n print('=')\r\nif a > b:\r\n print('>')", "def strip_leading_zero(s):\r\n l = len(s)\r\n index = 0\r\n for i in range(l):\r\n if s[i] == '0':\r\n index = i + 1\r\n else:\r\n break\r\n return s[index:]\r\n\r\na = strip_leading_zero(input().strip())\r\nb = strip_leading_zero(input().strip())\r\n\r\nif len(a) < len(b):\r\n print('<')\r\nelif len(a) > len(b):\r\n print('>')\r\nelse:\r\n for i in range(len(a)):\r\n da = a[i]\r\n db = b[i]\r\n if da < db:\r\n print('<')\r\n exit(0)\r\n elif da > db:\r\n print('>')\r\n exit()\r\n print('=')\r\n", "a=input().lstrip('0')\r\nb=input().lstrip('0')\r\n#print(a,b)\r\nlen1=len(a);len2=len(b)\r\n#print(len1,len2)\r\nif len1==len2:\r\n if (a>b):\r\n print('>')\r\n elif a<b:\r\n print('<')\r\n else:\r\n print('=')\r\nelse:\r\n if (len1>len2):\r\n print('>')\r\n else:\r\n print('<')", "num1 = input()\r\nnum2 = input()\r\ni=0\r\nj=0\r\nwhile(i<len(num1) and num1[i] == '0'):\r\n i+=1\r\nwhile(j<len(num2) and num2[j] == '0'):\r\n j+=1\r\n\r\nif(i!=len(num1)):\r\n num11 = num1[i:len(num1)]\r\nelse:\r\n num11='0'\r\nif(j!=len(num2)):\r\n num12 = num2[j:len(num2)]\r\nelse:\r\n num12 ='0'\r\n\r\nif len(num11)>len(num12):\r\n print('>')\r\nelif len(num11)<len(num12):\r\n print('<')\r\nelse:\r\n if num11 <num12:\r\n print('<')\r\n elif num11 >num12:\r\n print('>')\r\n else:\r\n print('=')\r\n", "A = input().lstrip('0')\r\nB = input().lstrip('0')\r\n\r\nif len(A) > len(B):\r\n print('>')\r\nelif len(A) < len(B):\r\n print('<')\r\nelse:\r\n for i in range(len(A)):\r\n if A[i] > B[i]:\r\n print('>')\r\n break\r\n elif A[i] < B[i]:\r\n print('<')\r\n break\r\n else:\r\n print('=')", "from sys import stdin\r\n\"\"\"\r\nn=int(stdin.readline().strip())\r\nn,m=map(int,stdin.readline().strip().split())\r\ns=list(map(int,stdin.readline().strip().split()))\r\n\"\"\"\r\na=stdin.readline().strip()\r\nb=stdin.readline().strip()\r\nx=len(a)-1\r\ny=len(b)-1\r\nfor i in range(len(a)):\r\n if a[i]!='0':\r\n x=i\r\n break\r\nfor i in range(len(b)):\r\n if b[i]!='0':\r\n y=i\r\n break\r\na=a[x::]\r\nb=b[y::]\r\nif a==b:\r\n print(\"=\")\r\nelif len(a)>len(b) or (len(a)==len(b) and a>b):\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n", "a,b=input().rjust(10**6,\"0\"),input().rjust(10**6,\"0\")\r\nprint(\">\" if a>b else (\"<\" if a<b else \"=\")) ", "\ndef func(x,y):\n if(len(x)==len(y)):\n return (x,y)\n else:\n if(len(x)>len(y)):\n u='0'*(len(x)-len(y))+y\n return (x,u)\n else:\n v='0'*(len(y)-len(x))+x\n return (v,y)\n\na=str(input())\nb=str(input())\n\n(i,j)=func(a,b)\n\nif(i>j):\n print(\">\")\nif(i<j):\n print(\"<\")\nif(i==j):\n print(\"=\")", "a=input()\r\nb=input()\r\nast=bst=0\r\nfor i in range(len(a)):\r\n if a[i]!='0':ast=i;break\r\nfor i in range(len(b)):\r\n if b[i]!='0':bst=i;break\r\nc0a=a.count('0')\r\nc0b=b.count('0')\r\nif c0a==len(a):\r\n ast=len(a)-1\r\nif c0b==len(b):\r\n bst=len(b)-1\r\naa=a[ast:]\r\nbb=b[bst:]\r\nif len(aa)>len(bb):print('>')\r\nelif len(aa)<len(bb):print('<')\r\nelse:\r\n c=0\r\n for i in range(len(aa)):\r\n if aa[i]>bb[i]:\r\n print('>')\r\n c=-1;break\r\n elif aa[i]<bb[i]:\r\n print('<')\r\n c=-1;break\r\n if c==0:print('=')", "a = input()\nb = input()\n\nla = len(a)\nlb = len(b)\nif la < lb:\n a = (lb - la) * \"0\" + a\nelif la > lb:\n b = (la - lb) * \"0\" + b\n\nif a < b:\n print(\"<\")\nelif a > b:\n print(\">\")\nelse:\n print(\"=\")\n", "a = input()\r\nb = input()\r\na, b = a.lstrip(\"0\"), b.lstrip(\"0\")\r\nc, d = len(a), len(b)\r\n\r\nif c == d:\r\n if a > b:\r\n print(\">\")\r\n elif a == b:\r\n print(\"=\")\r\n else:\r\n print(\"<\")\r\nelse:\r\n if c > d:\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na = input().rstrip().lstrip(\"0\")\r\nb = input().rstrip().lstrip(\"0\")\r\n\r\nif len(a) == len(b):\r\n if a == b:\r\n print(\"=\")\r\n else:\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n print(\">\" if a[i] > b[i] else \"<\")\r\n break\r\nelif len(a) > len(b):\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "a = input()\r\nb = input()\r\nna = len(a)\r\nnb = len(b)\r\ni = 0\r\nwhile i < na and a[i] == '0':\r\n i += 1\r\n \r\nj = 0\r\nwhile j < nb and b[j] == '0':\r\n j += 1\r\n\r\nans = \"=\"\r\n\r\nif na - i > nb - j:\r\n ans = \">\"\r\nelif nb-j > na-i:\r\n ans = \"<\"\r\nelse:\r\n for k in range(na - i):\r\n if int(a[k + i]) > int(b[k+j]):\r\n ans = \">\"\r\n break\r\n elif int(a[k + i]) < int(b[k+j]):\r\n ans = \"<\"\r\n break\r\n\r\nprint(ans)\r\n", "a = input()\nb = input()\n\nif a[0]=='0':\n a = int(a)\n a = str(a)\nif b[0]=='0':\n b = int(b)\n b = str(b) \n\nif len(a)==len(b):\n if a>b:\n print('>')\n elif a<b:\n print('<')\n else:\n print('=')\nelse:\n if len(a)>len(b):\n print('>')\n else:\n print('<')\n \t\t\t \t \t\t\t\t \t\t\t \t\t\t \t\t\t\t", "\na = input().strip()\nb = input().strip()\na = a.lstrip('0')\nb = b.lstrip('0')\nif len(a) < len(b):\n print(\"<\")\nelif len(a) > len(b):\n print(\">\")\nelse:\n for i in range(len(a)):\n if a[i] < b[i]:\n print(\"<\")\n break\n elif a[i] > b[i]:\n print(\">\")\n break\n else:\n print(\"=\")\n \t \t\t\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\tif len(a) < len(b):\r\n\t\ta = \"0\" * (len(b) - len(a)) + a;\r\n\telse:\r\n\t\tb = \"0\" * (len(a) - len(b)) + b;\r\n\r\nif a == b:\r\n\tprint(\"=\")\r\nelse:\r\n\tprint(\"<\" if a < b else \">\")", "x=input()\r\ny=input()\r\nif(len(x)>len(y)):\r\n y='0'*(len(x)-len(y))+y\r\nelif(len(y)>len(x)):\r\n x='0'*(len(y)-len(x))+x\r\nif(x>y):\r\n print('>')\r\nelif(y>x):\r\n print('<')\r\nelse:\r\n print('=')\r\n", "a = input()\nb = input()\n\ndef to_string(x):\n new = \"\"\n for i in x:\n if i != '!':\n new += i\n\n return new\n\ndef nah(x):\n x = list(x)\n \n for i in range(len(x)):\n if x[i] == '0':\n x[i] = '!'\n else:\n break\n\n return to_string(x)\n\na = nah(a)\nb = nah(b)\n\nif len(a) > len(b):\n print('>')\nelif len(b) > len(a):\n print('<')\nelse:\n for i in range(len(a)):\n inted_a = int(a[i])\n inted_b = int(b[i])\n\n if inted_a > inted_b:\n print(\">\")\n exit()\n elif inted_b > inted_a:\n print(\"<\")\n exit()\n\n print(\"=\")\n", "a, b = [input().rjust(10 ** 6, '0') for i in range(2)]\r\nprint('>' if a > b else '<' if a < b else '=')", "a=input()\r\nb=input()\r\nl=max(len(a),len(b))\r\nda=len(a)-l\r\ndb=len(b)-l\r\nfor i in range(l):\r\n tempa='0'\r\n if da+i>=0:\r\n tempa=a[da+i]\r\n tempb='0'\r\n if db+i>=0:\r\n tempb=b[db+i]\r\n if tempa<tempb:\r\n print('<')\r\n exit(0)\r\n else:\r\n if tempa>tempb:\r\n print('>')\r\n exit(0)\r\nprint('=')", "aa = input()\nbb = input()\naa = aa.lstrip('0')\nbb = bb.lstrip('0')\nla = len(aa)\nlb = len(bb)\nflag = 0\nif la > lb:\n print(\">\")\nelif la < lb:\n print(\"<\")\nelse:\n for i in range(la):\n if aa[i] > bb[i]:\n print(\">\")\n flag = 1\n break\n elif aa[i] < bb[i]:\n print(\"<\")\n flag = 1\n break\n if flag == 0:\n print(\"=\")\n \t \t \t\t \t \t\t\t \t\t\t \t \t \t\t\t", "import heapq\r\nimport math, itertools\r\nimport sys, collections\r\nimport bisect, queue\r\nimport copy\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nn1 = len(s1)\r\nn2 = len(s2)\r\nif n1 > n2:\r\n s2 = \"0\" * (n1-n2) + s2\r\nelse:\r\n s1 = \"0\" * (n2-n1) + s1\r\n\r\nif s1 > s2:\r\n print(\">\")\r\nelif s1 == s2:\r\n print(\"=\")\r\nelse:\r\n print(\"<\")\r\n\r\n\r\n\r\n", "a, b = input(), input()\r\nsize = max(len(a), len(b))\r\na = a.zfill(size)\r\nb = b.zfill(size)\r\nif a < b:\r\n print('<')\r\nelif a == b:\r\n print('=')\r\nelse:\r\n print('>')", "a = input()\r\nb = input()\r\nif len(a) < len(b):a = '0'*(len(b)-len(a)) + a\r\nelse:b = '0'*(len(a)-len(b)) + b\r\nif a > b:print('>')\r\nelif b > a:print('<')\r\nelse:print('=')", "a=input()\nb=input()\nast=bst=0\nfor i in range(len(a)):\n if a[i]!='0':ast=i;break\nfor i in range(len(b)):\n if b[i]!='0':bst=i;break\nc0a=a.count('0')\nc0b=b.count('0')\nif c0a==len(a):\n ast=len(a)-1\nif c0b==len(b):\n bst=len(b)-1\naa=a[ast:]\nbb=b[bst:]\nif len(aa)>len(bb):print('>')\nelif len(aa)<len(bb):print('<')\nelse:\n c=0\n for i in range(len(aa)):\n if aa[i]>bb[i]:\n print('>')\n c=-1;break\n elif aa[i]<bb[i]:\n print('<')\n c=-1;break\n if c==0:print('=')\n\t \t \t \t\t \t \t\t\t\t\t \t", "a = input()\r\nb = input()\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\nif len(a) != len(b):\r\n print('<' if len(a)<len(b) else '>')\r\n exit(0)\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n print('<' if a[i]<b[i] else '>')\r\n exit(0)\r\nprint('=')", "exec('a, b = '+ 2 * 'input().rjust(10 ** 6, \"0\"),')\r\nprint('<>='[(a == b) + (a >= b)])", "a,b=input(),input()\nm=max(len(a),len(b))\na,b=a.zfill(m),b.zfill(m)\nprint('>' if a>b else ('<' if a<b else '='))\n\t \t\t\t \t \t\t\t \t \t\t \t \t\t", "import sys\r\na = sys.stdin.readline().strip()\r\nb = sys.stdin.readline().strip()\r\nacnt=0\r\nbcnt=0\r\nfor data in a:\r\n if data ==\"0\":\r\n acnt = acnt + 1\r\n else:\r\n break\r\nfor data in b:\r\n if data ==\"0\":\r\n bcnt = bcnt + 1\r\n else:\r\n break\r\n\r\n#print(acnt,bcnt)\r\n#print(a[acnt::],b[bcnt::])\r\na= a[acnt::]\r\nb = b[bcnt::]\r\nif len(a) > len(b):\r\n print(\">\")\r\nelif len(a) < len(b):\r\n print(\"<\")\r\nelse:\r\n if a<b:\r\n print(\"<\")\r\n elif a > b:\r\n print(\">\")\r\n else:\r\n print(\"=\")\r\n", "a = input()\r\nb = input()\r\n\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\n\r\nif len(a) > len(b):\r\n print('>')\r\nelif len(a) < len(b):\r\n print('<')\r\nelse:\r\n for x, y in zip(a, b):\r\n if int(x) > int(y):\r\n print('>')\r\n exit(0)\r\n elif int(x) < int(y):\r\n print('<')\r\n exit(0)\r\n print('=')", "a,b=input().rjust(10**6,'0'),input().rjust(10**6,'0')\r\nc='='\r\nif a>b:c='>'\r\nelif a<b:c='<'\r\nprint(c)", "import sys\r\nimport math\r\n\r\na = input()\r\nb = input()\r\na = \"0\"*max((len(b) - len(a)), 0) + a;\r\nb = \"0\"*max((len(a) - len(b)), 0) + b;\r\nif(a == b):\r\n print(\"=\")\r\nelif(a < b):\r\n print(\"<\")\r\nelse:\r\n print(\">\")", "# Bismillah\r\n# In the name of GOD\r\n\r\nx = input()\r\ny = input()\r\nl = max(len(x), len(y))\r\ndx = len(x) - l\r\ndy = len(y) - l\r\nfor i in range(l):\r\n vn = '0'\r\n if dx + i >= 0:\r\n vn = x[dx + i]\r\n vm = '0'\r\n if dy + i >= 0:\r\n vm = y[dy + i]\r\n if vn < vm:\r\n print(\"<\")\r\n exit()\r\n else:\r\n if vn > vm:\r\n print(\">\")\r\n exit()\r\nprint(\"=\")\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nA=list(readline().rstrip())\r\nB=list(readline().rstrip())\r\nA=A[::-1]\r\nB=B[::-1]\r\nwhile A and A[-1]==\"0\":\r\n A.pop()\r\nwhile B and B[-1]==\"0\":\r\n B.pop()\r\nA=A[::-1]\r\nB=B[::-1]\r\nif len(A)<len(B):\r\n ans=\"<\"\r\nelif len(A)>len(B):\r\n ans=\">\"\r\nelif A<B:\r\n ans=\"<\"\r\nelif A>B:\r\n ans=\">\"\r\nelse:\r\n ans=\"=\"\r\nprint(ans)", "a,b=[input().rjust(10**6,'0') for i in range(2)]\r\n \r\nif a < b:\r\n\tprint ('<')\r\nelif a > b:\r\n\tprint ('>')\r\nelse:\r\n\tprint ('=')", "def run_code():\r\n f = input()\r\n s = input()\r\n\r\n fs = f.lstrip('0')\r\n ss = s.lstrip('0')\r\n\r\n if fs == '' and ss == '':\r\n print('=')\r\n else:\r\n if len(fs) == len(ss):\r\n equal = True\r\n\r\n for i in range(0, len(fs)):\r\n if int(fs[i]) > int(ss[i]):\r\n print('>')\r\n equal = False\r\n break\r\n elif int(fs[i]) < int(ss[i]):\r\n print('<')\r\n equal = False\r\n break\r\n\r\n if equal:\r\n print('=')\r\n elif len(fs) > len(ss):\r\n print('>')\r\n else:\r\n print('<')\r\n\r\n\r\nif __name__ == '__main__':\r\n run_code()\r\n", "a = input().lstrip(\"0\")\r\nb = input().lstrip(\"0\")\r\n\r\nlena = len(a)\r\nlenb = len(b)\r\n\r\nif lena < lenb:\r\n print(\"<\")\r\nelif lena > lenb:\r\n print(\">\")\r\nelse:\r\n for c1, c2 in zip(a, b):\r\n if c1 > c2:\r\n print(\">\")\r\n exit()\r\n elif c1 < c2:\r\n print(\"<\")\r\n exit()\r\n print(\"=\")", "a = input()\r\nb = input()\r\nia = 0\r\nwhile ia<len(a) and a[ia]=='0':\r\n ia+=1\r\na = a[ia:]\r\nib = 0\r\nwhile ib<len(b) and b[ib]=='0':\r\n ib+=1\r\nb = b[ib:]\r\nif len(a)>len(b):\r\n print(\">\")\r\nelif len(b)>len(a):\r\n print(\"<\")\r\nelif a>b:\r\n print(\">\")\r\nelif a<b:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "s = input()\r\nt = input()\r\nif (len(s) > len(t)):\r\n \r\n t = \"0\"*(len(s)-len(t)) + t\r\nelse:\r\n s = \"0\"*(len(t)-len(s)) + s\r\n \r\n \r\nif (s > t):\r\n print(\">\")\r\nelif (s < t):\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "a, b = [input().rjust(10 ** 6, '0') for i in range(2)]\r\nif a > b:\r\n print('>')\r\nelif a < b:\r\n print('<')\r\nelse:\r\n print('=')", "# LUOGU_RID: 101606893\nfrom decimal import Decimal\r\na = Decimal(input())\r\nb = Decimal(input())\r\nprint('=' if a == b else '>' if a > b else '<')", "a = input().lstrip(\"0\")\nb = input().lstrip(\"0\")\nif len(a) > len(b):\n print(\">\")\nelif len(b) > len(a):\n print(\"<\")\nelse:\n for i in range(len(a)):\n if a[i] > b[i]:\n print(\">\")\n exit(0)\n elif b[i] > a[i]:\n print(\"<\")\n exit(0)\n print(\"=\")\n", "a = input().lstrip('0')\r\nb = input().lstrip('0')\r\nif len(a) < len(b):\r\n\tprint('<')\r\nelif len(a) > len(b):\r\n\tprint('>')\r\nelse:\r\n\tif a < b:\r\n\t\tprint('<')\r\n\telif a > b:\r\n\t\tprint('>')\r\n\telse:\r\n\t\tprint('=')", "# https://codeforces.com/problemset/problem/616/A\n# 900\n\na = input()\nb = input()\nal = len(a)\nbl = len(b)\n\ndf = abs(al-bl)\nif al > bl:\n b = \"0\" * df + b\nelif bl > al:\n a = \"0\" * df + a\n\n\ne = \"=\"\nfor ac, bc in zip(a, b):\n if ac > bc:\n e = \">\"\n break\n elif bc > ac:\n e = \"<\"\n break\n\nprint(e)", "s1=input()\r\ns2=input()\r\nif len(s1)<len(s2):\r\n s1='0'*(len(s2)-len(s1))+s1\r\nelse:\r\n s2='0'*(len(s1)-len(s2))+s2\r\ncheck=0\r\nfor i in range(len(s2)):\r\n if s1[i]<s2[i]:\r\n check=1\r\n break\r\n elif s1[i]>s2[i]:\r\n check=2\r\n break\r\nif check==0:\r\n print('=')\r\nelif check==1:\r\n print('<')\r\nelse:\r\n print('>')", "a,b=[input().rjust(10**6,'0')for i in range(2)]\r\nif a>b:\r\n\tprint('>')\r\nelif a<b:\r\n\tprint('<')\r\nelse:\r\n\tprint('=')\t\t", "a = input()\nb = input()\nlength = max(len(a), len(b))\na = a.zfill(length)\nb = b.zfill(length)\nfor x, y in zip(a, b):\n if x == y:\n continue\n if x > y:\n print(\">\")\n exit()\n elif x < y:\n print(\"<\")\n exit()\nprint(\"=\")\n", "import sys\nimport math\n# range = xrange\n# input = raw_input\n\na = input()\nind = 0\nwhile ind < len(a) and a[ind] == '0':\n\tind += 1\na = a[ind:]\nb = input()\nind = 0\nwhile ind < len(b) and b[ind] == '0':\n\tind += 1\nb = b[ind:]\nif len(a) < len(b):\n\tprint('<')\nelif len(b) < len(a):\n\tprint('>')\nelif a < b:\n\tprint ('<')\nelif a == b:\n\tprint ('=')\nelse:\n\tprint ('>')", "s1 = input()\r\ns2 = input()\r\n\r\ns1 = s1.lstrip(\"0\")\r\ns2 = s2.lstrip(\"0\")\r\nif(len(s1) > len(s2)):\r\n print(\">\")\r\nelif(len(s1) < len(s2)):\r\n print(\"<\")\r\nelse:\r\n done = True\r\n for i ,j in zip(s1,s2):\r\n if(i > j):\r\n print(\">\")\r\n done = False\r\n break\r\n elif(i < j):\r\n print(\"<\")\r\n done = False\r\n break\r\n if(done):\r\n print(\"=\")\r\n\r\n", "a = input()\r\nb = input()\r\n\r\nm = max(len(a), len(b))\r\na = \"0\" * (m - len(a)) + a\r\nb = \"0\" * (m - len(b)) + b\r\nif a < b:\r\n print(\"<\")\r\nelif a > b:\r\n print(\">\")\r\nelse:\r\n print(\"=\")", "n = input() \r\nm = input() \r\nl = max(len(n), len(m))\r\ndn = len(n) - l\r\ndm = len(m) - l\r\nfor i in range(l):\r\n vn = '0'\r\n if dn + i >= 0:\r\n vn = n[dn + i]\r\n vm = '0'\r\n if dm + i >= 0:\r\n vm = m[dm + i]\r\n if vn < vm:\r\n print(\"<\")\r\n exit(0)\r\n else:\r\n if vn > vm:\r\n print(\">\")\r\n exit(0)\r\nprint(\"=\")", "aa = input()\r\nbb = input()\r\n\r\ncta = 0\r\nctb = 0\r\nstart = False\r\nfor let in aa:\r\n if let == \"0\":\r\n cta += 1\r\n if let != \"0\":\r\n break\r\nfor let in bb:\r\n if let == \"0\":\r\n ctb += 1\r\n if let != \"0\":\r\n break\r\nstart = False\r\n\r\na = aa[cta:]\r\nb = bb[ctb:]\r\n\r\n\r\n\r\nif len(a) > len(b):\r\n print(\">\")\r\nelif len(a) < len(b):\r\n print(\"<\")\r\nelif a == b:\r\n print(\"=\")\r\nelse:\r\n if a > b:\r\n print(\">\")\r\n else:\r\n print(\"<\")", "import sys\r\na = sys.stdin.readline()\r\nb = sys.stdin.readline()\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\nlena = len(a)\r\nlenb = len(b)\r\nif lena>lenb:\r\n print('>')\r\nelif lena<lenb:\r\n print('<')\r\nelse:\r\n if a>b:\r\n print('>')\r\n elif a<b:\r\n print('<')\r\n else:\r\n print('=')\r\n", "a = input().rjust(10**6, '0')\nb = input().rjust(10**6, '0')\n\nif a > b:\n print('>')\nelif a < b:\n print('<')\nelse:\n print('=')\n", "import sys\r\n#input = sys.stdin.readline\r\na = input()\r\nb = input()\r\n\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\n \r\n\r\nif len(a)>len(b):\r\n print('>')\r\nelif len(a) < len(b):\r\n print('<')\r\nelse:\r\n \r\n at = False\r\n bt = False\r\n \r\n for i in range(len(a)):\r\n if a[i] > b[i]:\r\n at = True\r\n break\r\n elif b[i] > a[i]:\r\n bt = True\r\n break\r\n \r\n if at:\r\n print('>')\r\n elif bt:\r\n print('<')\r\n else:\r\n print('=')\r\n \r\n\r\n\r\n", "from decimal import Decimal\r\na=Decimal(input())\r\nb=Decimal(input())\r\nif a>b:\r\n print('>')\r\nelif a==b:\r\n print('=')\r\nelse:\r\n print('<')", "input1 = input().lstrip('0')\r\ninput2 = input().lstrip('0')\r\nfound = False\r\n\r\n\r\ndef checkInput(num1, num2):\r\n if int(num1) > int(num2):\r\n return '>'\r\n elif int(num1) < int(num2):\r\n return '<'\r\n else:\r\n return '='\r\n\r\n\r\nif len(input1) > len(input2):\r\n print('>')\r\nelif len(input1) < len(input2):\r\n print('<')\r\nelse:\r\n for x in range(0, len(input1)):\r\n value = checkInput(input1[x], input2[x])\r\n if value != '=':\r\n print(value)\r\n found = True\r\n break\r\n else:\r\n continue\r\n if not found:\r\n print('=')\r\n" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\nk = set(range(1, n+1))\r\nneed = k-s\r\nvis = set()\r\n\r\nfor i in range(n):\r\n if a[i] in vis:\r\n a[i] = need.pop()\r\n else:\r\n if a[i] not in k:\r\n a[i] = need.pop()\r\n vis.add(a[i])\r\n else:\r\n vis.add(a[i])\r\n\r\nprint(*a)\r\n", "def main():\n n = int(input()) + 1\n res, fil, rest = list(map(int, input().split())), [True] * n, []\n for i, x in enumerate(res):\n if x >= n or not fil[x]:\n rest.append(i)\n else:\n fil[x] = False\n for i, x in zip(rest, filter(fil.__getitem__, range(1, n))):\n res[i] = x\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=list(filter(lambda x: x not in s,[i for i in range(1,n+1)]))\r\nj=0\r\nfor i in range(n):\r\n\tif 1<=a[i]<=n and a[i] in s:\r\n\t\ts.remove(a[i])\r\n\telse:\r\n\t\ta[i]=l[j]\r\n\t\tj+=1\r\nprint(*a)", "'''\r\n\r\n\r\n'''\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nm = {}\r\nfor i in range(1,n+1):\r\n m[i] = 0\r\n \r\nmissing = []\r\ncanReplace = []\r\ncnt = 0\r\nfor i in l:\r\n try:\r\n m[i]+=1\r\n if(m[i]>1):\r\n canReplace.append(cnt)\r\n m[i]-=1\r\n except:\r\n canReplace.append(cnt)\r\n cnt+=1\r\n# print(*canReplace)\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n if(m[i] == 0):\r\n l[canReplace[cnt]] = i\r\n cnt+=1\r\nprint(*l)\r\n", "from collections import *\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nlst = [0]*n\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] <= n:\r\n lst[a[i]-1] = 1\r\nmiss = []\r\nfor i in range(n):\r\n if lst[i] == 0:\r\n miss.append(i+1)\r\nlst = list(miss)\r\nd = defaultdict(int)\r\nfor i in range(n):\r\n if a[i] > n:\r\n print(lst[-1],end=\" \")\r\n lst.pop()\r\n elif d[a[i]] == 0:\r\n d[a[i]] += 1\r\n print(a[i],end=\" \")\r\n else:\r\n print(lst[-1],end=\" \")\r\n lst.pop()", "from collections import *\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nd = defaultdict(int)\r\nfor i in x:\r\n d[i] += 1\r\nm = 1\r\nfor i in range(n):\r\n if d[x[i]] > 1 or x[i] > n:\r\n d[x[i]] -= 1\r\n while d[m] > 0:\r\n m += 1\r\n x[i] = m\r\n m += 1\r\n print(x[i],end=' ')", "n = int(input())\r\ninp = list(map(int,input().split(' ')))\r\nused = set(x for x in inp if x > 0 and x <= n)\r\ntoadd = {i+1 for i in range(n)}.difference(used)\r\nres = []\r\nfor num in inp:\r\n if num in used:\r\n used.remove(num)\r\n else:\r\n num = toadd.pop()\r\n res.append(num)\r\nprint(*res)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmn = set()\r\nans = set()\r\nsp = []\r\nfor i in range(1, n + 1):\r\n mn.add(i)\r\nfor i in lst:\r\n if i in mn:\r\n mn.remove(i)\r\nfor i in lst:\r\n if i in ans or i > n:\r\n a = mn.pop()\r\n ans.add(a)\r\n sp.append(a)\r\n if i not in ans and i <= n:\r\n ans.add(i)\r\n sp.append(i)\r\n \r\nprint(*sp) \r\n", "maxn = 100000 + 10\r\nn = int(input())\r\ncnt = [0] * maxn\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nfor i in a:\r\n cnt[i]+=1\r\nneed = []\r\n\r\nfor i in range(1, n+1):\r\n if cnt[i] == 0:\r\n need.append(i)\r\n\r\ncur = 0\r\n\r\nfor i in a:\r\n if i > n:\r\n print(need[cur], end=' ')\r\n cur+=1\r\n elif cnt[i]>1:\r\n print(need[cur], end=' ')\r\n cur+=1\r\n cnt[i]-=1\r\n else:\r\n print(i, end=' ')\r\n", "from sys import stdin\r\nfrom sys import stdout\r\n\r\nn = int(stdin.readline())\r\nan = list(map(int, stdin.readline().split()))\r\n\r\nk = [0] * n\r\ntp = []\r\nztp = []\r\nfor i in range(0, n):\r\n if an[i] <= n and k[an[i] - 1] == 0:\r\n k[an[i] - 1] = 1\r\n else:\r\n tp.append(i)\r\n\r\nf = 0\r\nfor j in tp:\r\n while f < n:\r\n if k[f] == 0:\r\n an[j] = f + 1\r\n f += 1\r\n break\r\n else:\r\n f += 1\r\n\r\nprint(\" \".join([str(x) for x in an]))\r\n \r\n ", "n = int(input())\na = [int(x)-1 for x in input().split()]\ncount = [0 for i in range(len(a))]\nans = [-1 for i in range(len(a))]\nfor i in range(len(a)):\n\tif a[i] < len(count):\n\t\tcount[a[i]] += 1\n\nfor i in range(len(a)):\n\tif a[i] < len(count):\n\t\tif count[a[i]] >= 1:\n\t\t\tans[i] = a[i]\n\t\t\tcount[a[i]] = -1\n\njIt = 0\nfor i in range(len(ans)):\n\tif ans[i] == -1:\n\t\twhile count[jIt] < 0:\n\t\t\tjIt += 1\n\t\tans[i] = jIt\n\t\tjIt += 1\n\nprint(\" \".join(str(x+1) for x in ans))", "n, a = int(input()), list(map(int, input().split()))\nd, r = set(range(1, n + 1)), []\nfor i, x in enumerate(a):\n\tif x not in d: r.append(i)\n\td.discard(x);\nfor x in r:\n\ta[x] = d.pop()\nprint(' '.join(map(str, a)))\n", "n = int(input())\n\nnums = [False] * n\nseen = [False] * n\ni = 0\nA = list(map(int, input().split()))\n\n# First walk\nfor num in A:\n if 1 <= num <= n:\n nums[num - 1] = True\n\n# Second walk\nfor num in A:\n if 1 <= num <= n:\n if not seen[num - 1]:\n seen[num - 1] = True\n print(num, end = \" \")\n else:\n while nums[i]:\n i += 1\n nums[i] = True\n i += 1\n print(i, end = \" \")\n else:\n while nums[i]:\n i += 1\n nums[i] = True\n i += 1\n print(i, end = \" \")", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = rr()\r\nx = Counter(arr)\r\nneed = set(list(range(1, n + 1)))\r\nfor i in x.keys():\r\n try:\r\n need.remove(i)\r\n except:\r\n pass\r\n# print(need)\r\nfor i, j in enumerate(arr):\r\n if x[j] > 1 or j > n:\r\n x[j] -= 1\r\n c = next(iter(need))\r\n arr[i] = c\r\n need.remove(c)\r\n\r\nprint(*arr)", "import sys\r\na=int(input())\r\nd=dict()\r\narr=list(map(int,input().split()))\r\nfor i in arr:\r\n d[i]=1\r\ns=set()\r\nfor i in range(1,a+1):\r\n if(i not in d):\r\n s.add(i)\r\nd=dict()\r\nfor i in range(0,len(arr)):\r\n if(arr[i] in d or arr[i]>a):\r\n arr[i]=s.pop()\r\n else:\r\n d[arr[i]]=1\r\nprint(\" \".join(map(str,arr)))", "n=int(input())\r\nb=set(range(1,n+1))\r\nc=[]\r\nfor x in map(int,input().split()):\r\n if x in b:\r\n b.remove(x)\r\n c.append(x)\r\n else:\r\n c.append(None)\r\ns=\"\"\r\nfor x in c:\r\n if x is None:\r\n s+=str(b.pop())+\" \"\r\n else:\r\n s+=str(x)+\" \"\r\nprint(s)\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nar1=set(range(1,n+1))\r\nar2=[]\r\nfor i in ar:\r\n if i in ar1:\r\n ar1.remove(i)\r\n ar2.append(i)\r\n else:\r\n ar2.append(0)\r\nfor i in ar2:\r\n if i==0:\r\n print(ar1.pop(),end=' ')\r\n else:\r\n print(i,end=' ')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl2=[0 for i in range(1,n+1)]\r\ny=[]\r\nno=[]\r\nfor i in range(n):\r\n if l[i]<=n:\r\n if l2[l[i]-1]==0:\r\n l2[l[i]-1]=1\r\n y.append(l[i])\r\nfor i in range(n):\r\n if l2[i]==0:\r\n no.append(i+1)\r\n#print(y)\r\n#print(no)\r\nans=[]\r\nl2=[0 for i in range(1,n+1)]\r\nfor i in range(n):\r\n if l[i]<=n:\r\n if l2[l[i]-1]==0:\r\n l2[l[i]-1]=1\r\n ans.append(l[i])\r\n else:\r\n ans.append(no.pop())\r\n else:\r\n ans.append(no.pop())\r\nprint(*ans)\r\n", "N = int(input())\r\nthings = list(map(int, input().split()))\r\nans = []\r\ndif = set(things)\r\ndouble = set()\r\nto_zen = []\r\npnt = 0\r\nfor i in things:\r\n if i > N:\r\n dif.discard(i)\r\n to_zen += [pnt]\r\n elif i in double:\r\n to_zen += [pnt]\r\n double.add(i)\r\n pnt += 1\r\nfor i in range(1, N + 1):\r\n if i not in dif:\r\n things[to_zen.pop()] = i\r\n dif.add(i)\r\nprint(' '.join(list(map(str, things))))", "n=int(input())\na=list(map(int,input().split()))\nx=[0]*(100001)\nz=[0]*(100001)\ny=list()\nfor i in range(0,n):\n\tx[a[i]]+=1\nfor i in range(1,n+1):\n\tif x[i]==0:\n\t\ty.append(i)\nj=0\nfor i in range(0,n):\n\tif z[a[i]]==0 and a[i]<=n:\n\t\tprint(a[i],end=\" \")\n\t\tz[a[i]]=1\n\telse:\n\t\tprint(y[j],end=\" \")\n\t\tj+=1\n\t", "n = int(input())\ns = list(map(int,input().split()))\nf = [0]*n\nfor i in range(n):\n if s[i]>n:\n s[i]=0\n else:\n if f[s[i]-1]==0:\n f[s[i]-1]=1\n else:\n s[i]=0\na = 0\nfor i in range(n):\n if s[i]==0:\n while 1:\n if f[a]==1:\n a+=1\n else:\n s[i]=a+1\n a+=1\n break\nprint(' '.join(map(str,s)))", "n, a = int(input()), list(map(int,input().split()))\nusd = [ False for i in range(n) ]\ngot = [ False for i in range(n) ]\nfor i in range(n):\n if a[i] <= n and not usd[a[i]-1]:\n got[i] = usd[a[i]-1] = True\nnxt = 0\nfor i in range(n):\n if not got[i]:\n while usd[nxt]:\n nxt += 1\n a[i] = nxt + 1\n usd[nxt] = True\nprint( \" \".join(str(x) for x in a) )\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\np = [0] * n\r\ns = set(range(1,n+1))\r\nfor i,x in enumerate(a):\r\n\tif x in s:\r\n\t\ts.remove(x)\r\n\t\tp[i] = x\r\nfor i,x in enumerate(p):\r\n\tif not x:\r\n\t\tp[i] = s.pop()\r\nprint(' '.join(map(str, p)))", "n=int(input())\niv=[int(x) for x in input().split()]\ns,st=set(range(1,n+1)),[]\nfor i in range(n):\n if iv[i] not in s:st.append(i)\n s.discard(iv[i])\nfor i in st:iv[i]=s.pop()\nprint(*iv)", "n = int(input())\r\n\r\ncontains = set()\r\nres = []\r\nfor item in input().split(' '):\r\n num = int(item)\r\n val = None\r\n if num not in contains and num <= n:\r\n contains.add(num)\r\n val = num\r\n res.append(val)\r\n\r\nmissed_nums = list(set(range(1, n + 1)) - contains)\r\n\r\nfor i in res:\r\n if i is None:\r\n print(missed_nums.pop())\r\n else:\r\n print(i)\r\n", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n numbers = [int(i) for i in input().split()]\r\n\r\n freq = [0]*(n+1)\r\n for no in numbers:\r\n try:\r\n freq[no] += 1\r\n except:\r\n continue\r\n\r\n missed = []\r\n for i in range(1, n+1): # [1]\r\n if freq[i] == 0:\r\n missed.append(i)\r\n # print(missed)\r\n\r\n\r\n index = 0 # to access missed\r\n for i in range(n): # to loop numbers\r\n if numbers[i] >= 1 and numbers[i] <= n:\r\n if freq[numbers[i]] > 1: # if not > 1 it is = 1\r\n freq[numbers[i]] -= 1\r\n freq[missed[index]] += 1 # not neccessary but consistant\r\n numbers[i] = missed[index]\r\n index += 1\r\n else:\r\n continue\r\n else:\r\n numbers[i] = missed[index]\r\n freq[missed[index]] += 1 # not neccessary but consistant\r\n index += 1\r\n\r\n # print(freq)\r\n print(*numbers)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\n\r\nthings_numbers = list(map(int, input().split()))\r\nthings_numbers_set = set(things_numbers)\r\nis_not_free = set()\r\n\r\nj = 1\r\nfor i in range(0, n):\r\n if things_numbers[i] not in is_not_free and things_numbers[i] <= n:\r\n is_not_free.add(things_numbers[i])\r\n else:\r\n while j in things_numbers_set:\r\n j += 1\r\n things_numbers[i] = j\r\n j += 1\r\n\r\nprint(*things_numbers)", "import sys\r\n\r\n\r\nn = int(sys.stdin.readline())\r\n\r\na = sys.stdin.readline()\r\n\r\ndef writeAllNumbers(n,a):\r\n a = a.strip().split()\r\n a = [int(x) for x in a]\r\n posNeedChange = []\r\n exists = [0]*(10**5+1)\r\n for pos in range(len(a)):\r\n num = a[pos]\r\n if exists[num] == 1:\r\n posNeedChange.append(pos)\r\n else:\r\n if num>n:\r\n posNeedChange.append(pos)\r\n exists[num] = 1\r\n notExists = [] \r\n for pos in range(1,n+1):\r\n if exists[pos]==0:\r\n notExists.append(pos)\r\n #print(len(notExists),len(posNeedChange))\r\n posInNotExists=0\r\n for pos in posNeedChange:\r\n a[pos] = notExists[posInNotExists]\r\n posInNotExists += 1\r\n \r\n for num in a:\r\n print(num,end=' ')\r\n \r\n\r\n \r\nwriteAllNumbers(n,a)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(0)\r\nl1=[int(i) for i in input().split()]\r\nfor i in l1:\r\n if (i<=n):\r\n l[i-1]+=1\r\nx=-1\r\ntry:\r\n x=l.index(0)\r\nexcept:\r\n pass\r\nif (x==-1):\r\n for i in l1:\r\n print (i,end=' ')\r\nelse:\r\n for i in range(n):\r\n if (l1[i]>n):\r\n l1[i]=x+1\r\n l[x]=1\r\n f=0\r\n while (True):\r\n try:\r\n if (l[x]==0):\r\n break\r\n else:\r\n x+=1\r\n except:\r\n f=1\r\n break\r\n if (f==1):\r\n break\r\n else:\r\n if (l[l1[i]-1]!=1):\r\n l[l1[i]-1]-=1\r\n l1[i]=x+1\r\n l[x]=1\r\n f=0\r\n while (True):\r\n try:\r\n if (l[x]==0):\r\n break\r\n else:\r\n x+=1\r\n except:\r\n f=1\r\n break\r\n if (f==1):\r\n break\r\n for i in l1:\r\n print (i,end=' ')\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\nn = int(input())\na = list(map(int, input().rstrip().split()))\nc = Counter(i for i in range(1, n + 1))\ninp = Counter(a)\nc.subtract(inp)\nc += Counter()\n# print(inp)\nans = []\nfor x in a:\n if inp[x] == -1 or x > n:\n for y in c:\n ans += [y]\n del c[y]\n break\n else:\n ans += [x]\n inp[x] = -1\nprint(*ans)", "n = int(input())\r\ninv = [int(x) for x in input().split()]\r\ns = set(range(1, n+1))\r\nd = []\r\nfor i in range(n):\r\n if inv[i] not in s:\r\n d.append(i)\r\n s.discard(inv[i])\r\nfor i in d:\r\n inv[i] = s.pop()\r\nprint(*inv)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = set(a)\r\nl = list(filter(lambda x: x not in s,[i for i in range(1,n+1)]))\r\nj = 0\r\nfor i in range(n):\r\n\tif 1 <= a[i] <= n and a[i] in s:\r\n\t\ts.remove(a[i])\r\n\telse:\r\n\t\ta[i] = l[j]\r\n\t\tj += 1\r\nprint(*a)# 1698074021.3837621", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(100005)]\r\n empty_index = 1\r\n\r\n for i in a:\r\n hash_a[i] += 1\r\n #print(hash_a[:10])\r\n for i in range(len(a)):\r\n target_a = a[i]\r\n if hash_a[target_a] > 1 or n < target_a:\r\n hash_a[target_a] -= 1\r\n while hash_a[empty_index] != 0:\r\n empty_index += 1\r\n a[i] = empty_index\r\n hash_a[empty_index] += 1\r\n print(\" \".join([str(i) for i in a]))\r\n #\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#main_function()", "n = int(input())\r\na = list(map(int, input().split()))\r\n\"\"\"\r\nimport time\r\n\r\nf = open('in', 'r')\r\nn = int(f.readline())\r\na = list(map(int, f.readline().split()))\r\nf.close()\r\n\r\n#print(time.process_time())\r\n\"\"\"\r\n\r\nmp = {}\r\nfor ai in a:\r\n if ai in mp:\r\n mp[ai] += 1\r\n else:\r\n mp[ai] = 1\r\n\r\nnum = 1\r\n\r\nfor i in range(n):\r\n if a[i] > n or (a[i] in mp and mp[a[i]] > 1):\r\n if a[i] in mp:\r\n mp[a[i]] -= 1\r\n while num in mp:\r\n num += 1\r\n a[i] = num\r\n mp[a[i]] = 1\r\n\r\nfor ai in a:\r\n print(ai, end=' ')\r\n\r\n#print('\\n', time.process_time())\r\n", "n = int(input())\r\nfix = list()\r\nfactors = set(range(1, n + 1))\r\nfor i in map(int, input().split()):\r\n if i in factors:\r\n factors.remove(i)\r\n fix.append(i)\r\n else:\r\n fix.append(None)\r\nprint(' '.join(str(factors.pop()) if i is None else str(i) for i in fix))", "n=int(input())\r\nval=[0 for i in range(n)]\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if(i<=n):\r\n val[i-1]+=1\r\nnotdone=[]\r\nfor i in range(n):\r\n if(val[i]==0):\r\n notdone.append(i+1)\r\ncurr=0\r\nfor i in a:\r\n if(i>n or val[i-1]>1):\r\n if(i<=n):\r\n val[i-1]-=1\r\n print(notdone[curr],end=\" \")\r\n curr+=1\r\n else:\r\n print(i,end= \" \")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[0]*(100005)\r\nfor i in range(n):\r\n d[l[i]]+=1\r\nk=1\r\nfor i in range(n):\r\n while(k<n and d[k]):\r\n k+=1\r\n if(d[l[i]]>1 or l[i]>n):\r\n d[k]+=1\r\n d[l[i]]-=1\r\n l[i]=k\r\nprint(*l)\r\n", "from collections import defaultdict\r\nn = int(input())\r\na =[int(i) for i in input().split()]\r\nd =defaultdict(int)\r\nfor i in a:\r\n d[i]+=1\r\nnp =[]\r\nfor i in range(1,n+1):\r\n if d[i]==0:\r\n np.append(i)\r\ns= set()\r\ncurr = 0\r\nfor i in range(n):\r\n if a[i]<=n and a[i] not in s:\r\n s.add(a[i])\r\n else:\r\n a[i] = np[curr]\r\n curr+=1\r\nprint(*a)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = [0] * 100000\r\nfor i in range(n):\r\n c[a[i] - 1] += 1\r\ns = []\r\nfor i in range(n):\r\n if c[i] == 0:\r\n s.append(i + 1)\r\nif not s:\r\n print(*a)\r\n exit()\r\nans = a[:]\r\nx = 0\r\nfor i in range(n):\r\n if c[a[i] - 1] > 1 or a[i] > n:\r\n c[a[i] - 1] -= 1\r\n ans[i] = s[x]\r\n x += 1\r\nprint(*ans)", "n = int(input())\r\na = input().split()\r\nd = {}\r\nfor i in range(n):\r\n d[i+1] = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n if not a[i] in d:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\nnls_pos = []\r\nfor i in range(n):\r\n if d[i+1] == 0:\r\n nls_pos.append(i+1)\r\nfor i in range(n):\r\n if d[a[i]] > 1 or a[i]>n:\r\n d[a[i]] -= 1\r\n a[i] = nls_pos[-1]\r\n nls_pos.pop()\r\nfor i in a:\r\n print(i, end=\" \")", "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\tx=list(stdin.readline())\n\tx.pop()\n\treturn x\ndef si(): return stdin.readline()\nn=ii()\np=[0]*n\nv=[1]*(n+1)\na=li()\nfor i in range(n):\n\tif a[i]<=n and v[a[i]]:\n\t\tp[i]=a[i]\n\t\tv[a[i]]=0\ni=1\nj=0\nwhile j<n:\n\tif not p[j]:\n\t\tif v[i]:\n\t\t\tp[j]=i\n\t\t\ti+=1\n\t\t\tj+=1\n\t\telse:\n\t\t\ti+=1\n\telse:\n\t\tj+=1\nprint(*p)\n\t\t\t \t \t \t\t \t\t\t \t \t\t \t \t \t", "n = int(input())\r\nfix = list()\r\nfactors = set(range(1, n + 1))\r\nfor i in map(int, input().split()):\r\n if i in factors:\r\n factors.remove(i)\r\n fix.append(i)\r\n else:\r\n fix.append(None)\r\nans = ''\r\nfor i in fix:\r\n if i is None:\r\n ans += str(factors.pop()) + ' '\r\n else:\r\n ans += str(i) + ' '\r\nprint(ans) ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd={}\r\n\r\nfor i in range(len(l)):\r\n if l[i]<=n and l[i] not in d:\r\n d[l[i]] = 1\r\n else:\r\n l[i] = -1\r\n\r\nind = 1\r\n\r\n\r\nfor i in range(len(l)):\r\n if l[i]==-1:\r\n \r\n while(ind<=n):\r\n if ind not in d:\r\n l[i] = ind\r\n d[ind]=1\r\n break\r\n else:\r\n ind+=1\r\nprint(*l)", "\r\n\r\n\r\nn = int(input())\r\nt = list(map(int,input().split()))\r\n\r\n\r\n\r\nf={}\r\n\r\nfor j in t:\r\n if j not in f:\r\n f[j]=1\r\n else:\r\n f[j]+=1\r\n\r\nu=[]\r\nfor i in range(1,n+1):\r\n if i not in f:\r\n u.append(i)\r\n\r\nif len(u)==0:\r\n print(*t)\r\nelse:\r\n\r\n for j in range(n):\r\n if t[j] in f:\r\n if f[t[j]]>1:\r\n f[t[j]]-=1\r\n t[j]=u.pop()\r\n for j in range(n):\r\n if t[j]>n:\r\n t[j]=u.pop()\r\n \r\n\r\n print(*t)\r\n \r\n", "n,a=int(input()), list(map(int, input().split()))\r\nd=set(range(1,n + 1))\r\nr=[]\r\nfor i,x in enumerate(a):\r\n\tif x not in d: r.append(i)\r\n\td.discard(x);\r\nfor x in r:\r\n\ta[x]=d.pop()\r\nprint(' '.join(map(str, a)))\r\n", "#!/usr/bin/python3\nn = int(input())\na = map(int,input().split())\nmemo =[False]*n\nres=[-1]*n\nfor i,v in enumerate(a):\n t=v-1\n if t < n and memo[t] == False:\n memo[t]=True\n res[i]=v\nnotin=list() \nfor i in range(0,n):\n if memo[i]==False:\n notin.append((i+1))\nfor i,v in enumerate(res):\n if v == -1:\n res[i]=notin.pop()\nprint(*res) \n \n\n", "n = int(input())\r\nans=[0]*(100003)\r\nlis=list(map(int,input().split()))\r\nfor i in range(n):\r\n ans[lis[i]]+=1\r\n#print(ans)\r\nj=1\r\nfor i in range(n):\r\n while j<n and ans[j]:\r\n j+=1\r\n # print(j,ans[j],ans[lis[i]]) \r\n if ans[lis[i]]>1 or lis[i] >n:\r\n ans[j]+=1\r\n ans[lis[i]]-=1\r\n lis[i]=j\r\nprint(*lis) \r\n\r\n", "n = int(input())\r\nli = list(map(int , input().split()))\r\nnewset = set(range(1,n+1))\r\ns = []\r\nfor i in li :\r\n if i in newset :\r\n newset.remove(i)\r\n s.append(i)\r\n else :\r\n s.append(None)\r\nfor i in s :\r\n if i is None :\r\n print(newset.pop() , end = \" \")\r\n else:\r\n print(i, end = \" \")", "n = int(input())\nnums = list(map(int, input().strip().split(' ')))\n\nsnums = sorted(enumerate(nums), key=lambda x: x[1])\n\nbonus = set()\nholes = set()\nskip = set()\ncount = 1\n\nfor i, v in snums:\n if v < count or v > n:\n bonus.add(i)\n if v == count:\n count += 1\n elif v > count:\n holes.update(j for j in range(min(n+1, count), min(n+1, v)))\n count = v + 1\n\nwhile len(bonus) > 0 and len(holes) > 0:\n idx = bonus.pop()\n x = holes.pop()\n nums[idx] = x\n skip.add(idx)\n\nif len(holes) == 0:\n last = snums[-1][1] + 1\n for i in bonus:\n nums[i] = last\n last += 1\nelse:\n assert(len(bonus) == 0)\n for i, v in snums[::-1]:\n if i in skip:\n continue\n if len(holes) == 0:\n break\n x = holes.pop()\n nums[i] = x\n\nprint(' '.join(map(lambda x: str(x), nums)))\n", "from collections import Counter\r\ndef t(s):\r\n while True:\r\n if p[s]==0:s+=1;return s\r\n else: s+=1\r\n\r\ni=int(input())\r\nl=list(map(int,input().split()))\r\nc=Counter(l)\r\np=[0]*100000\r\nfor x in l:p[x-1]=1\r\nnew=[];s=0\r\nfor x in l:\r\n if x>i: s=t(s);new.append(s)\r\n elif c[x]>1: c[x]-=1;s=t(s);new.append(s)\r\n else: new.append(x)\r\nprint(*new)", "n = int(input())\nused = (n + 1) * [ False ]\nfinal = n * [ None ]\ngiven = list(map(int, input().split()))\n\nfor i, x in enumerate(given):\n if x <= n and not used[x]:\n final[i] = x\n used[x] = True\n\nused_pos, final_pos = 0, 0\ni, x = 0, 1\nwhile i < n:\n if final[i] == None:\n while used[x]:\n x += 1\n final[i] = x\n x += 1\n i += 1\n\nprint(' '.join(map(str, final)))\n", "from re import *\r\nfrom sys import stderr\r\ndef readint():\r\n return int(input())\r\ndef readfloat():\r\n return float(input())\r\ndef readarray(N, foo=input):\r\n return [foo() for i in range(N)]\r\ndef readlinearray(foo=int):\r\n return map(foo, input().split())\r\n \r\ndef NOD(a, b):\r\n while b:\r\n a,b = b, a%b\r\n return a\r\n \r\ndef gen_primes(max):\r\n primes = [1]*(max+1)\r\n for i in range(2, max+1):\r\n if primes[i]:\r\n for j in range(i+i, max+1, i):\r\n primes[j] = 0\r\n primes[0] = 0\r\n return [x for x in range(max+1) if primes[x]]\r\n \r\ndef is_prime(N):\r\n i = 3\r\n if not(N % 2):\r\n return 0\r\n while i*i < N:\r\n if not(N % i):\r\n return 0\r\n i += 3\r\n return 1\r\n \r\nn = readint()\r\na = list(readlinearray())\r\n \r\nfrom collections import Counter\r\n \r\nmin_ok = 1\r\nc = Counter(a)\r\nfor i, x in enumerate(a):\r\n if x > n or c[x] > 1:\r\n while c[min_ok] > 0:\r\n min_ok += 1\r\n a[i] = min_ok\r\n c[x] -= 1\r\n c[min_ok] += 1\r\n \r\nprint(' '.join(map(str, a)))", "n = int(input())\r\nA = [*map(int, input().split())]\r\nX = set(range(1,n+1)) - set(A)\r\nused = set()\r\n\r\nfor a in A:\r\n if 0<a<=n and a not in used:\r\n print(a, end=' ')\r\n used.add(a)\r\n else:\r\n print(X.pop(), end=' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = [0] * (100001)\r\nfor ai in a:\r\n c[ai] += 1\r\nb = [x for x in range(1, n + 1) if c[x] == 0]\r\nj = 0\r\nfor i, ai in enumerate(a):\r\n if c[ai] > 1 or ai > n:\r\n a[i] = b[j]\r\n j += 1\r\n c[ai] -= 1\r\nprint(' '.join(map(str, a)))", "n=int(input())\r\na=input().split()\r\nA = [0] * n\r\nfor i in range(n):\r\n if int(a[i]) <= n:\r\n if A[int(a[i])-1] == 0:\r\n A[int(a[i])-1] = 1\r\n else:\r\n a[i] = 'q'\r\n else:\r\n a[i] = 'q'\r\nper = 0\r\nl=0\r\n\r\nfor i in range(n):\r\n if A[i] == 0:\r\n\r\n while per < n:\r\n if a[per] == 'q':\r\n\r\n a[per] = i+1\r\n per+=1\r\n break\r\n else:\r\n per+=1\r\nfor i in a:\r\n print(i, end = ' ')", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nused = [False] * n\r\nfixed = [False] * n\r\n\r\nfor i in range(n):\r\n if a[i] < n + 1:\r\n if not used[a[i] - 1]:\r\n used[a[i] - 1] = True\r\n fixed[i] = True\r\n\r\navail = []\r\n\r\nfor i in range(n):\r\n if not used[i]:\r\n avail.append(i + 1)\r\n\r\nfor i in range(n):\r\n if not fixed[i]:\r\n a[i] = avail.pop()\r\n \r\nstdout.write(\" \".join(map(str, a)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmp = {}\r\nfor ai in a:\r\n if ai in mp:\r\n mp[ai] += 1\r\n else:\r\n mp[ai] = 1\r\n\r\nnum = 1\r\n\r\nfor ai in a:\r\n if ai > n or (ai in mp and mp[ai] > 1):\r\n if ai in mp:\r\n mp[ai] -= 1\r\n while num in mp:\r\n num += 1\r\n mp[num] = 1\r\n ai = num\r\n print(ai, end=' ')\r\n", "n = int(input())\nq = [int(x) for x in input().split()]\nnumbers = set(range(1, n+1))\nans = []\n\nfor x in q:\n\tif x in numbers:\n\t\tnumbers.remove(x)\n\t\tans.append(x)\n\telse:\n\t\tans.append(-999)\n\t\t\nfor x in ans:\n\tif ( x == (-999) ):\n\t\tprint(numbers.pop(), end= ' ')\n\telse:\n\t\tprint(x, end= ' ')\n\t\t\nprint()\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", "n = int(input())\r\nA = list(map(int, input().split()))\r\nused = [False] * (n + 1)\r\nfor a in A:\r\n if a <= n:\r\n used[a] = True\r\nunused = [i for i, u in enumerate(used[1:], 1) if not u]\r\nresult = []\r\nfor a in A:\r\n if a > n or used[a] == 2:\r\n result.append(unused.pop())\r\n else:\r\n used[a] += 1\r\n result.append(a)\r\nprint(*result)\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nnumbers = set(i for i in range(1, n + 1))\r\nused = numbers & set(a)\r\nleft = list(numbers - used)\r\nfor i in range(n):\r\n if a[i] not in used:\r\n a[i] = left[0]\r\n left.remove(left[0])\r\n else:\r\n used.remove(a[i])\r\nprint(' '.join(map(str, a)))", "n = int(input())\r\nl = list(map(int , input().split()))\r\nans = [0 for i in range(n)]\r\ntmp = set(range(1, n+1))\r\nfor i , j in enumerate(l):\r\n if j in tmp:\r\n ans[i] = j\r\n tmp.remove(j)\r\nfor i, j in enumerate(ans):\r\n if not ans[i]:\r\n ans[i] = tmp.pop()\r\n#print(ans , tmp)\r\nprint(*ans)", "n = int(input())\nseen = [0 for _ in range(100001)]\narr = list(map(int, input().split()))\nnotseen = []\n\nfor i in arr:\n seen[i] += 1\n\nfor i in range(1, n+1):\n if seen[i] == 0:\n notseen.append(i)\n\nfor i in range(n):\n if seen[arr[i]] > 1 or arr[i] > n:\n nxt = notseen.pop()\n print(nxt, end = \" \")\n seen[nxt] += 1\n seen[arr[i]] -= 1\n else:\n print(arr[i], end = \" \")\n", "\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nv=set()\r\nl=list(set(b))\r\nfor i in range(1,n+1):\r\n v.add(i)\r\np=v-set(b)\r\nfor j in range(n):\r\n if b[j] not in v:\r\n b[j]=p.pop()\r\n elif b[j] in l:\r\n l.remove(b[j])\r\n else:\r\n b[j]=p.pop()\r\nprint(*b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = [0] * (100001)\r\nb = [0] * (100001)\r\nj = 1\r\nfor i in range(n):\r\n b[a[i]] = True\r\nfor i in range(n):\r\n if a[i] > n or c[a[i]]:\r\n while b[j]:\r\n j += 1\r\n b[j] = True\r\n c[j] = True\r\n print(j, end = ' ')\r\n else:\r\n print(a[i], end = ' ')\r\n c[a[i]] = True\r\n \r\n", "import queue\r\nn= int(input())\r\nmas = list(map(int,input().split(\" \")))\r\ns=set([i for i in range(1,n+1)])\r\ndi=queue.Queue()\r\nbo=0\r\nfor i in range(n):\r\n if (mas[i] in s):\r\n s.remove(mas[i])\r\n else:\r\n di.put(i)\r\nfor i in s:\r\n mas[di.get()]=i\r\nprint(' '.join(list(map(str,mas))))\r\n\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\ndp = [0 for i in range(n + 1)]\npos = []\nfor i in range(n):\n\tflag = 0\n\tif l[i] <= n:\n\t\tif dp[l[i]] == 0:\n\t\t\tdp[l[i]] = 1\n\t\t\tflag = 1\n\tif not flag:\n\t\tpos.append(i)\n\t\t\nj = 0\nfor i in range(1, n + 1):\n\tif dp[i] == 0:\n\t\tl[pos[j]] = i\n\t\tj += 1\n\t\t\nfor i in range(n):\n\tprint (l[i], end = ' ')\nprint ()\n", "from collections import deque\r\nx = int(input())\r\nstack = deque(list(map(int,input().split())))\r\ncheck = set(stack)\r\nmyset = set()\r\nans = []\r\nnah = 1\r\nwhile stack:\r\n if stack[0]<=x and (stack[0] not in myset):\r\n elpop = stack.popleft()\r\n ans.append(elpop)\r\n myset.add(elpop)\r\n else:\r\n while nah in myset or nah in check:\r\n nah+=1\r\n stack.popleft()\r\n ans.append(nah)\r\n myset.add(nah)\r\n nah+=1\r\nprint(*ans)", "n = int(input())\na = [int(x) for x in input().split()]\ns = set(a)\nexist = set(s)\nnext = 1\nfor i in range(n):\n\tif a[i] <= n and a[i] in s:\n\t\ts.remove(a[i])\n\telse:\n\t\twhile next in exist:\n\t\t\tnext += 1\n\t\ta[i] = next\n\t\tnext += 1\nprint(' '.join(str(x) for x in a))\n", "n = int(input())\r\ninp = list(map(int,input().split(' ')))\r\ntoreplace = set()\r\nvalues = set(range(1,n+1))\r\nfor i in range(n):\r\n num = inp[i]\r\n if num in values:\r\n values.remove(num)\r\n else:\r\n toreplace.add(i)\r\nfor index in toreplace:\r\n inp[index] = values.pop()\r\nprint(*inp)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nh=[0]*(n+1)\r\nfor i in x:\r\n if i<=n:\r\n h[i]+=1\r\nc=0\r\ny=[]\r\nfor i in range(1,n+1):\r\n if h[i]==0:\r\n y.append(i)\r\nj=0\r\nfor i in range(n):\r\n if x[i]<1 or x[i]>n or h[x[i]]>1:\r\n if x[i]>=1 and x[i]<=n:\r\n h[x[i]]-=1\r\n x[i]=y[j]\r\n j+=1\r\n if j==len(y):\r\n break\r\nfor i in x:\r\n print(i,end=\" \")", "n = int(input())\nlst = [int(x) for x in input().split()]\ntmp = [False] * 100007\ntmp2 = [False] * 100007\n\nfor x in lst:\n\ttmp[x] = True\n\n\n\nanswer, index = [], 1\nfor x in lst:\n\tif not tmp2[x] and x <= len(lst):\n\t\tanswer.append(x)\n\t\ttmp2[x] = True\n\telse:\n\t\twhile tmp[index]:\n\t\t\tindex += 1\n\t\ttmp[index] = True\n\t\tanswer.append(index)\n\n\nprint(' '.join(map(str, answer)))", "# بسم الله الرحمن الرحيم\r\nnumber_of_item = int(input())\r\nout = []\r\narr1 = {x for x in range(1,number_of_item+1)}\r\ninitial_inventory = [int(i) for i in input().split()]\r\nfor x in initial_inventory:\r\n if x in arr1:\r\n arr1.remove(x)\r\n out.append(x)\r\n else:\r\n out.append(None)\r\ni = 0\r\nfor x in out:\r\n if x is None:\r\n out[i]=arr1.pop()\r\n i +=1\r\nprint(*out)\r\n", "num = int(input())\r\nlist1 = input().split(' ')\r\n\r\ninv = set()\r\n\r\nfor i in list1:\r\n inv.add(int(i))\r\n \r\nmissing = []\r\nnotE = []\r\n\r\nfor i in range(1,num+1):\r\n if i not in inv:\r\n missing.append(i)\r\n\r\nwritten = set()\r\n\r\nj = 0\r\n\r\nfor i in range(len(list1)):\r\n if list1[i] in written or int(list1[i])>num:\r\n list1[i] = str(missing[j])\r\n written.add(list1[i])\r\n j += 1\r\n else:\r\n written.add(list1[i])\r\n \r\n \r\nprint(*list1)\r\n", "__author__ = 'Алексей'\n\nn = int(input())\nnumbers = list(map(int, input().split()))\n\ntrash = []\nmask = list(range(1, n+1))\n\nfor i in range(n):\n if numbers[i] > n:\n trash.append(i)\n elif mask[numbers[i]-1] == 0:\n trash.append(i)\n else:\n mask[numbers[i]-1] = 0\n\nj = 0\nfor i in trash:\n while mask[j] == 0:\n j += 1\n numbers[i] = j+1\n j += 1\n\nprint(' '.join(map(str, numbers)))\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = set(a)\r\nexist = set(s)\r\nnext = 1\r\nfor i in range(n):\r\n\tif a[i] <= n and a[i] in s:\r\n\t\ts.remove(a[i])\r\n\telse:\r\n\t\twhile next in exist:\r\n\t\t\tnext += 1\r\n\t\ta[i] = next\r\n\t\tnext += 1\r\nprint(' '.join(str(x) for x in a))", "def main():\n n = int(input())\n a = list(map(int,input().split()))\n used = set()\n original = set(a)\n not_used = set(range(1,n+1)) - original\n\n for i in range(n):\n if a[i] > n or a[i] in used:\n temp = next(iter(not_used),None)\n if temp is not None:\n a[i] = temp\n not_used.remove(temp)\n used.add(temp)\n else:\n used.add(a[i])\n print(*a)\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nc = [0] * (n+1)\r\n\r\nfor e in a:\r\n if e <= n:\r\n c[e] = 1\r\nl = [e for e in range(1,n+1) if c[e] == 0]\r\n\r\ns = 0\r\nc = [0] * (n+1)\r\nfor i in range(n):\r\n if a[i] <= n and c[a[i]] < 1:\r\n c[a[i]] = 1\r\n else:\r\n a[i] = l[s]\r\n s += 1\r\n\r\nfor e in a:\r\n print(e, end = ' ')\r\n \r\n \r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\na = list(mints())\r\nok = [True]*n\r\ncnt = [0]*((10**5)+1)\r\nfor i in range(len(a)):\r\n\tx = a[i]\r\n\tif x <= n and cnt[x] == 0:\r\n\t\tok[i] = False\r\n\t\tcnt[x] += 1\r\nj = 1\r\nr = 0\r\nfor i in range(len(a)):\r\n\tif ok[i]:\r\n\t\twhile cnt[j] != 0:\r\n\t\t\tj += 1\r\n\t\ta[i] = j\r\n\t\tcnt[j] += 1\r\nprint(*a)\r\n", "def main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n\r\n d = [0] * n\r\n for i in range(n):\r\n if a[i] > n or d[a[i] - 1] == 1:\r\n a[i] = -1\r\n else:\r\n d[a[i] - 1] = 1\r\n for s in range(n):\r\n if d[s] == 0:\r\n break\r\n for i in a:\r\n if i == -1:\r\n print(s + 1, end=' ')\r\n for s in range(s + 1, n):\r\n if d[s] == 0:\r\n break\r\n else:\r\n print(i, end=' ')\r\n \r\nmain()\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmissing = set(range(1,n+1)) - set(a)\r\nhash = set()\r\nfor i in range(n):\r\n if a[i] in hash or a[i] > n or a[i] < 1:\r\n a[i] = missing.pop()\r\n hash.add(a[i])\r\nprint(\" \".join(map(str,a)))", "n = int(input())\r\n\r\ninvens = [int(i) for i in input().split(' ')]\r\nflag = ['0'] * n\r\nmark_modify = []\r\nfor i in range(len(invens)):\r\n inv = invens[i]\r\n if inv > n:\r\n mark_modify.append(i)\r\n continue\r\n if flag[inv - 1] == '0':\r\n flag[inv - 1] = '1'\r\n else:\r\n mark_modify.append(i)\r\n\r\nf = 0\r\nfor j in range(len(flag)): \r\n if flag[j] == '0':\r\n invens[mark_modify[f]] = j + 1\r\n f += 1\r\nprint(' '.join([str(i) for i in invens]))", "import sys\r\n\r\n\r\nn = int(input())\r\nx = str(input()).split()\r\na = {a : 1 for a in range(1, n + 1)}\r\nc = []\r\n\r\nfor i in range(n):\r\n if int(x[i]) > n:\r\n c.append(i)\r\n continue\r\n if a.get(int(x[i])) == 1:\r\n a.pop(int(x[i]))\r\n continue\r\n else:\r\n c.append(i)\r\n\r\nfor i in range(len(c)):\r\n x[c[i]] = a.popitem()[0]\r\n\r\nfor i in range(n - 1):\r\n print(x[i], end=\" \")\r\nprint(x[n - 1])\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\nused=[0]*(n+1)\r\nused[0]=1\r\nB=[]\r\nfor i in range(n):\r\n if A[i]>n:\r\n B.append(i)\r\n else:\r\n if used[A[i]]==1:\r\n B.append(i)\r\n else:\r\n used[A[i]]=1\r\nindex=0\r\nfor i in range(1,n+1):\r\n if used[i]==0:\r\n A[B[index]]=i\r\n index+=1\r\nprint(*A)", "#!/usr/bin/env python3\n\ndef solve(n, a):\n found = set(a)\n available = {i for i in range(1, n+1) if i not in found}\n seen = set()\n for i, v in enumerate(a):\n if v in seen or v > n:\n nv = available.pop()\n a[i] = nv\n seen.add(a[i])\n return a\n\nif __name__ == '__main__':\n n = int(input())\n a = list(map(int, input().split()))\n print(*solve(n, a))\n", "__author__ = 'Алексей'\n\nn = int(input())\nnumbers = set(range(1, n+1))\nanswer = []\n\nfor x in map(int, input().split()):\n if x in numbers:\n numbers.remove(x)\n answer.append(x)\n else:\n answer.append(None)\n\nfor i in range(n):\n if answer[i] is None:\n answer[i] = numbers.pop()\n\nprint(' '.join(map(str, answer)))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd = set(range(1, n+1))\r\n\r\na = set(w)\r\na = list(d - a)\r\n\r\nd = []\r\nx = set()\r\nfor i in range(n):\r\n if w[i] in x or w[i] > n:\r\n d.append(a.pop())\r\n else:\r\n d.append(w[i])\r\n x.add(w[i])\r\nprint(' '.join(map(str, d)))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = pow(10, 5) + 5\r\nx = [[] for _ in range(l)]\r\nfor i in range(n):\r\n x[a[i]].append(i)\r\nans = [0] * n\r\nu, v = [], []\r\nfor i in range(1, l):\r\n if not x[i]:\r\n u.append(i)\r\n continue\r\n if i <= n:\r\n j = x[i].pop()\r\n ans[j] = i\r\n for j in x[i]:\r\n v.append(j)\r\nfor i, j in zip(u, v):\r\n ans[j] = i\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\npin = input().split(\" \")\narr = [int(i)-1 for i in pin]\nfree = [True]*n\nchange = []\nfor i in range(n):\n if arr[i] <n:\n if free[arr[i]]:\n free[arr[i]] = False\n else:\n change.append(i) \n else:\n change.append(i)\n \nfor i in range (n):\n if free[i]:\n arr[change.pop()] = i\n\nfor i in arr:\n print (i+1, end=\" \")" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = [0 for i in range(n)]\r\nb = [[a[i], i] for i in range(n)]\r\n\r\nb.sort()\r\nok = True\r\n\r\nlast = 0\r\nlast_count = 10 ** 10\r\ncur_count = 10 ** 10\r\nit = 1\r\n\r\nfor i in range(n):\r\n if b[i][0] - last >= 2:\r\n ok = False\r\n break\r\n if b[i][0] == last:\r\n cur_count += 1\r\n if cur_count > last_count:\r\n ok = False\r\n break\r\n res[b[i][1]] = it\r\n it += 1\r\n else:\r\n res[b[i][1]] = 1\r\n it = 2\r\n last_count, cur_count = cur_count, 1\r\n last = b[i][0]\r\n\r\nif not ok or last_count < cur_count:\r\n print(-1)\r\nelse:\r\n print(a.count(1))\r\n for i in res:\r\n print(i, end=\" \")\r\n", "input()\np=list(map(int,input().split()))\nmx=max(p)\nc=[0]*(mx+1)\nfor i in p:c[i]+=1\nif any(c[i]<c[i+1]for i in range(1,mx)):print(-1);exit(0)\nprint(c[1])\nfor i in p:print(c[i],end=' ');c[i]-=1\nprint()\n", "n = int(input())\n\nt = list(map(int, input().split()))\n\na, b = min(t), max(t)\n\nif a < 1 or b > n: print(-1)\n\nelse:\n\n r, p = [0] * (b + 1), [0] * n\n\n for i, j in enumerate(t):\n\n r[j] += 1\n\n p[i] = r[j]\n\n if any(r[j + 1] > r[j] for j in range(1, b)): print(-1)\n\n else:\n\n print(r[1])\n\n print(' '.join(map(str, p)))\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\na = list(map(int,input().split()))\ncount = [0]*100005\nmx = 0\nfor i in range(n):\n count[a[i]] += 1\n mx = max(mx,count[a[i]])\n a[i] = count[a[i]]\nans = True\nfor i in range(1,100004):\n if (count[i]<count[i+1]):\n ans = False\n break\nif (ans):\n print(mx)\n print(*a)\nelse:\n print(-1)\n", "input()\r\np=list(map(int,input().split()))\r\nmx=max(p)\r\nc=[0]*(mx+1)\r\nfor i in p:c[i]+=1\r\nif any(c[i]<c[i+1]for i in range(1,mx)):print(-1);exit(0)\r\nprint(c[1])\r\nfor i in p:print(c[i],end=' ');c[i]-=1\r\nprint()\r\n", "input()\np = list(map(int, input().split()))\na, mx = sorted(p), max(p)\nc = [0]*(mx+1)\nfor i in a:\n\tc[i] += 1\n\nif any(c[a]<c[a+1] for a in range(1, mx)):\n\tprint(-1)\n\texit(0)\n\nprint(c[1])\nfor i in p:\n\tprint(c[i], end=' ')\n\tc[i] -= 1\nprint()\n", "import sys\r\nn= int(input())\r\narr = [int(x) for x in input().split()] \r\nkk = max(arr) \r\na2 = []\r\nfor i in range(kk+1):\r\n a2.append(0) \r\nfor i in range(n): \r\n a2[arr[i]]+=1 \r\n \r\nfor i in range(2,len(a2)): \r\n if a2[i]>a2[i-1]: \r\n print(-1)\r\n sys.exit() \r\nprint(a2[1])\r\nfor i in range(n):\r\n print(a2[arr[i]],end=\" \")\r\n a2[arr[i]]-=1 \r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nif (max(l) > n):\r\n print(-1)\r\n exit()\r\ncnt = [0]*(n+1)\r\nans = [0]*(n+1)\r\nfor i in range(n):\r\n cnt[l[i]] += 1\r\n ans[i] = cnt[l[i]]\r\nfor i in range(1, n):\r\n if cnt[i] < cnt[i+1]:\r\n print(-1)\r\n exit()\r\nprint(cnt[1])\r\nfor i in range(n):\r\n print(ans[i], end=' ')\r\n", "n = int(input())\r\ncnt = [set() for i in range(10 ** 5 + 1)]\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n cnt[a[i] - 1].add(i)\r\n\r\nres = [0] * n\r\nends = []\r\nfor i in range(len(cnt) - 1):\r\n if len(cnt[i + 1]) - len(cnt[i]) > 0:\r\n print(-1)\r\n exit()\r\n ends.append((i + 1, - len(cnt[i + 1]) + len(cnt[i])))\r\n\r\nif len(cnt[-1]) > 0:\r\n ends.append((10 ** 5, len(cnt[-1])))\r\n\r\nnew_cnt = 0\r\nfor i in ends:\r\n for j in range(i[1]):\r\n new_cnt += 1\r\n cur = []\r\n for k in range(i[0]):\r\n res[cnt[k].pop()] = new_cnt\r\n\r\nprint(new_cnt)\r\nprint(\" \".join(map(str, res)))", "from collections import defaultdict\r\nd = defaultdict(int)\r\nd1 = defaultdict(list)\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n d[i]+=1\r\nk =d.copy()\r\nperm = d[1]\r\nif d[1]<max(d.values()):\r\n print(-1)\r\n exit()\r\n\r\nfor i in l:\r\n d1[k[i]].append(i)\r\n k[i]-=1\r\n\r\nfor keys,values in d1.items():\r\n if sum(values)!=(len(values)*(len(values)+1))//2:\r\n print(-1)\r\n exit()\r\n\r\nprint(perm)\r\nfor i in l:\r\n print(d[i],end=\" \")\r\n d[i]-=1", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nMAX_ARR = 100001\r\ndef main():\r\n input()\r\n arr = list(map(int, input().split()))\r\n\r\n dct = [0] * MAX_ARR\r\n \r\n result = list()\r\n for i in arr:\r\n dct[i] += 1\r\n # result = result + str(dct[i]) + \" \"\r\n result.append(str(dct[i]))\r\n pre = MAX_ARR\r\n for i in range(1, MAX_ARR):\r\n if dct[i] > pre:\r\n print(\"-1\")\r\n return\r\n else:\r\n pre = dct[i]\r\n \r\n print(\"%s\\n\" % dct[1])\r\n \r\n print(\" \".join(result))\r\n\r\nif __name__ == '__main__':\r\n main()", "from collections import defaultdict as dc,Counter as C\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmn,mx=min(arr),max(arr)\r\nans=[0]*n\r\nmp=dc(lambda:list())\r\nfor i in range(n):mp[arr[i]].append(i)\r\nctr=C(arr)\r\nflag=0\r\nfor i in range(2,mx+1):\r\n if ctr[i]>ctr[i-1]:flag=1\r\nif flag:print(-1); quit()\r\nfor i in mp:\r\n cnt=1\r\n for j in mp[i]:ans[j]=cnt; cnt+=1\r\nprint(max(ans))\r\nprint(*ans)", "input()\np = list(map(int, input().split()))\nmx = max(p)\nc = [0]*(mx+1)\nfor i in p:\n\tc[i] += 1\nif any(c[i]<c[i+1] for i in range(1, mx)):\n\tprint(-1)\n\texit(0)\nprint(c[1])\nfor i in p:\n\tprint(c[i], end=' ')\n\tc[i] -= 1\nprint()\n", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\nres = [0] * n\r\nmx = 0\r\nl = [0] * 100001\r\nfor i in range(n):\r\n l[arr[i]] += 1\r\n mx = max(mx,arr[i])\r\nfor i in range(1,mx):\r\n if l[i+1] > l[i]:\r\n print(-1)\r\n break\r\nelse:\r\n copy = l[:]\r\n print(l[1])\r\n for i in range(n):\r\n l[arr[i]] -= 1\r\n res[i] = copy[arr[i]] - l[arr[i]]\r\n\r\n print(\" \".join(list(map(str,res))))\r\n", "from collections import Counter\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nq=Counter(w)\r\nc=list(q.keys())\r\nc.sort()\r\nif c!=list(range(1, max(w)+1)):\r\n print(-1)\r\nelse:\r\n for j in range(1, len(c)):\r\n if q[c[j]]>q[c[j-1]]:\r\n print(-1)\r\n break\r\n else:\r\n print(q[1])\r\n for j in range(n):\r\n x=w[j]\r\n w[j]=q[x]\r\n q[x]-=1\r\n print(\" \".join([str(k) for k in w]))", "import sys\r\nn=int(sys.stdin.readline())\r\na=list(map(int,sys.stdin.readline().split()))\r\nl=[0]*(10**5)\r\nfor i in range(n):\r\n l[a[i]-1]+=1 \r\nflag=True\r\nfor i in range(1,len(l)):\r\n if l[i]>l[i-1]:\r\n print(-1)\r\n flag=False\r\n break\r\nif flag:\r\n arr=[0]*(10**5+1)\r\n ans=[0]*n \r\n for i in range(n):\r\n ans[i]=arr[a[i]]+1 \r\n arr[a[i]]+=1\r\n print(max(ans)) \r\n print(*ans) ", "n= int(input())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\nk = [0]*(100001)\r\na1=[0]*(n+1)\r\nmaxK=1\r\nmaxA=a[1]\r\nfor i in range(1,n+1):\r\n k[a[i]]+=1\r\n if k[a[i]]>maxK: maxK=k[a[i]]\r\n if a[i]>maxA: maxA=a[i]\r\n a1[i]=k[a[i]]\r\n\r\nf=1\r\nfor i in range(1,maxA):\r\n if k[i]<k[i+1]:\r\n f=0\r\n break\r\nif f:\r\n print(maxK)\r\n print(*a1[1:])\r\nelse:\r\n print(-1)\r\n \r\n\n# Fri Jan 07 2022 10:36:34 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nd,di={},{}\r\nfor i,x in enumerate(lst):\r\n if d.get(x)==None:d[x]=[];di[x]=0\r\n d[x].append(i)\r\n di[x]+=1\r\nlst=[*set(lst)]\r\nlst.sort()\r\nfrom sys import exit\r\nif d.get(1)==None:print(-1);exit()\r\nres=[0]*n\r\nfor i,x in enumerate(d[1]):\r\n res[x]=i+1\r\nfor i,x in enumerate(lst[1:]):\r\n if x-lst[i]==1:\r\n if di[x]<=di[lst[i]]:\r\n for j,y in enumerate(d[x]):\r\n res[y]=j+1\r\n else:print(-1);exit()\r\n else:print(-1);exit()\r\nprint(di[1])\r\nprint(*res)", "n = int(input())\na = []\nmx = -1\nfor x in input().split():\n a.append(int(x))\n mx = max(mx, int(x))\nb = [0 for x in range(mx + 1)]\nfor x in a:\n b[x] += 1\nck = True\nfor i in range(1, mx):\n if b[i + 1] > b[i]:\n ck = False\n break\nif ck:\n c = [1 for x in range(mx + 1)]\n ans = []\n for x in a:\n ans.append(c[x])\n c[x] += 1\n print(max(c) - 1)\n print(*ans)\nelse:\n print(-1)\n" ]

[ "# python3\n# utf-8\n\nclass Trie:\n def __init__(self):\n self.letter___node = {}\n self.words_nr = 0\n\n def add_word(self, word):\n word = word + '$'\n curr_node = self\n for letter in word:\n if letter not in curr_node.letter___node:\n curr_node.letter___node[letter] = Trie()\n curr_node.words_nr += 1\n curr_node = curr_node.letter___node[letter]\n\n def check_word(self, word):\n word = word + '$'\n curr_node = self\n for letter in word:\n if letter not in curr_node.letter___node:\n return False\n curr_node = curr_node.letter___node[letter]\n return True\n\n def count_word(self, word):\n word = word + '$'\n curr_node = self\n curr_state = 0\n presses_saved = 0\n for letter in word:\n if letter not in curr_node.letter___node:\n if curr_state == 1:\n # print(presses_saved)\n if '$' in curr_node.letter___node:\n return min(len(word) - 1,\n len(word) - 1 - presses_saved + 1\n )\n else:\n return len(word) - 1\n if curr_state == 0:\n return len(word) - 1\n if curr_node.words_nr > 1:\n curr_node = curr_node.letter___node[letter]\n elif curr_node.words_nr == 1:\n # print(letter, presses_saved)\n if curr_state == 0:\n curr_state = 1\n presses_saved += 1\n curr_node = curr_node.letter___node[letter]\n elif curr_node.words_nr == 0:\n if curr_state == 1:\n return min(len(word) - 1,\n len(word) - 1 - presses_saved + 1\n )\n elif curr_state == 0:\n return len(word) - 1\n if curr_node.words_nr == 0:\n presses_saved -= 1\n if curr_state == 1:\n return min(len(word) - 1,\n len(word) - 1 - presses_saved + 1\n )\n elif curr_state == 0:\n return len(word) - 1\n\n\n\n\ntext = ''\nwhile(1):\n try:\n line = input()\n if line == '':\n raise Exception('e')\n text += line + '\\n'\n except:\n break\n# print(text)\nans = 0\nsyms = ['\\n', '.', ',', '?', '!', \"'\", '-']\nfor sym in syms:\n text = text.replace(sym, ' ')\nans += text.count(' ')\nidx___word = text.split(' ')\nroot = Trie()\nroot.add_word('$')\nroot.add_word('$$')\nfor word in idx___word:\n if word == '':\n continue\n count = root.count_word(word)\n check = root.check_word(word)\n # print(word, check, count)\n ans += count\n if not check:\n root.add_word(word)\n\nprint(ans)\n" ]

[ "#!/usr/bin/env python\n# coding=utf-8\n\ns, t = input(), input()\nn, m = len(s), len(t)\nt = '$'.join((t, s))\np = [0]\nk = 0\nfor i in range(1, n + m + 1):\n while k and t[k] != t[i]:\n k = p[k - 1]\n if t[k] == t[i]:\n k += 1\n p.append(k)\nans = [0] * n\nsums = [0] * (n + 1)\ncurs = 0\nwas = False\nj = 0\nmod = 1000000007\nfor i in range(n):\n if p[i + m + 1] == m:\n if not was:\n was = True\n curs = 1\n while j <= i - m:\n curs = (curs + sums[j] + 1) % mod\n j += 1\n ans[i]= curs;\n sums[i] = (sums[i - 1] + ans[i]) % mod;\nprint(sum(ans) % mod)\n", "s, t = input(), input()\r\nn, m = len(t), len(s) + 1\r\nd = 1000000007\r\ng = [1] * m\r\nf = k = 0\r\nfor i in range(1, m) :\r\n if s[i - n:i] == t : k = i\r\n if k : f = (f + g[k - n]) % d\r\n g[i] += (g[i - 1] + f) % d\r\nprint(f)", "mod = 1000000007\r\n\r\ndef count_prefix(n,m,t):\r\n p = [0]\r\n k = 0\r\n for i in range(1, n + m + 1):\r\n while k and t[k] != t[i]:\r\n k = p[k - 1]\r\n if t[k] == t[i]:\r\n k += 1\r\n p.append(k)\r\n return p\r\n\r\ndef find_sum_ending(n,m,p):\r\n ans = [0] * n\r\n sums = [0] * (n + 1)\r\n curs = 0\r\n was = False\r\n j = 0\r\n\r\n\r\n for i in range(n):\r\n if p[i + m + 1] == m:\r\n if not was:\r\n was = True\r\n curs = 1\r\n while j <= i - m:\r\n curs = (curs + sums[j] + 1) % mod\r\n j += 1\r\n ans[i] = curs\r\n sums[i] = (sums[i - 1] + ans[i]) % mod\r\n return ans\r\n\r\ndef main():\r\n s, t = input(), input()\r\n n, m = len(s), len(t)\r\n t = '$'.join((t, s))\r\n\r\n p = count_prefix(n,m,t)\r\n\r\n ans = find_sum_ending(n,m,p)\r\n\r\n print(sum(ans) % mod)\r\n\r\nmain()\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "s=input().split('@'); n=len(s)-1\r\nfor i in range(1,n):\r\n if len(s[i])<2: print('No solution'); exit()\r\n else: s[i]=s[i][0]+','+s[i][1:]\r\nif n>0 and s and s[0] and s[n]: print('@'.join(s))\r\nelse: print('No solution')", "# -*- coding: utf-8 -*-\r\n\r\ns = input().split('@')\r\nn = len(s) - 1\r\n \r\nfor i in range(1, n):\r\n \r\n if len(s[i]) < 2: s = False; break\r\n s[i] = s[i][0] + ',' + s[i][1:]\r\n \r\nif n > 0 and s and s[0] and s[n]: print('@'.join(s))\r\n \r\nelse: print('No solution')\r\n\r\n", "\n\ndef main() :\n s = input().split('@')\n ans = ''\n itr = 0\n if len(s)<2 or len(s[0])<1 or len(s[-1])<1 :\n print(\"No solution\")\n return\n for i in range(1,len(s)-1) :\n if len(s[i]) < 2 : \n print(\"No solution\")\n return\n ans = s[0]+'@'+s[1][0]\n for i in range( 1,len(s)-1 ) :\n ans += ',' + s[i][1:] + '@' + s[i+1][0]\n ans += s[-1][1:]\n print(ans)\nmain()\n\t \t\t \t \t\t \t\t \t \t\t \t\t \t\t\t\t\t", "s=input().split('@')\nn=len(s) - 1\nfor i in range(1,n):\n\tif len(s[i])<2:\n\t\ts=False\n\t\tbreak\n\ts[i]=s[i][0]+','+s[i][1:]\nif n>0 and s and s[0] and s[n]:\n\tprint('@'.join(s))\nelse:\n\tprint('No solution')\n", "\n\nA = input().split('@')\n\nif len(A[0]) == 0 or len(A[-1]) == 0 or \\\n any([len(x) < 2 for x in A[1:-1]]):\n print(\"No solution\")\nelif len(A) == 1:\n print(\"No solution\")\nelif len(A) == 2:\n print('@'.join(A))\nelse:\n result = [A[0] + '@' + A[1][0]]\n for i in range(1, len(A) - 2):\n result += [A[i][1:] + '@' + A[i + 1][0]]\n result += [A[-2][1:] + '@' + A[-1]]\n print(','.join(result))\n", "s = input().strip()\r\n\r\nat_count = s.count('@')\r\n\r\n# 如果@的数量少于1或字符串以@开始或结束，直接输出\"No solution\"\r\nif at_count < 1 or s[0] == '@' or s[-1] == '@':\r\n print('No solution')\r\n exit()\r\n\r\nemails = []\r\ni = 0\r\n\r\nwhile i < len(s):\r\n at_pos = s.find('@', i)\r\n\r\n if at_pos == -1:\r\n break\r\n\r\n # 查找下一个@\r\n next_at_pos = s.find('@', at_pos + 1)\r\n\r\n # 如果没有找到下一个@，则添加剩下的部分到emails列表\r\n if next_at_pos == -1:\r\n emails.append(s[i:])\r\n break\r\n\r\n # 如果两个@之间的字符数小于3，则输出\"No solution\"\r\n if next_at_pos - at_pos < 3:\r\n print('No solution')\r\n exit()\r\n\r\n # 添加电子邮件地址到emails列表\r\n emails.append(s[i:next_at_pos - 1])\r\n i = next_at_pos - 1\r\n\r\n# 输出电子邮件地址列表\r\nprint(','.join(emails))\r\n", "from math import *\r\nfrom sys import stdin, stdout, setrecursionlimit\r\ninput = lambda: stdin.readline().strip()\r\nprint = stdout.write\r\n\r\ns=input()\r\norgs=len(s)\r\n\r\na=[-2]\r\nfor i in range(len(s)):\r\n if s[i]==\"@\":\r\n a.append(i)\r\n\r\na.append(len(s))\r\n\r\nans=[]\r\nfor i in range(1,len(a)-1):\r\n if i==len(a)-2:\r\n ans.append(s[a[i-1]+2:])\r\n else:\r\n ans.append(s[a[i-1]+2:a[i]+2])\r\n\r\nnews=0;flag=0;r=\"\"\r\nfor i in range(len(ans)):\r\n r+=ans[i];r+=\",\"\r\n if ans[i][0]==\"@\" or ans[i][-1]==\"@\":\r\n flag=1\r\n break\r\n else:\r\n news+=len(ans[i])\r\n\r\nif orgs!=news:\r\n flag=1\r\n\r\nif flag:\r\n print(\"No solution\")\r\nelse:\r\n print(r[:-1])", "s = input(); ans = \"No solution\"\r\nl = list(); var = \"\"; beg = 0\r\nif s[-1] == \"@\":\r\n print(ans); exit()\r\nfor i in range(len(s)):\r\n var += s[i]\r\n if var[0] == \"@\":\r\n print(ans); break\r\n elif s[i-1] == \"@\" and i > 0:\r\n if s[i] == \"@\":\r\n print(ans); break\r\n l.append(s[beg:i+1]); beg = i+1; var = \"\"\r\nelse:\r\n if l != []:\r\n l[-1] += s[beg:]; print(\",\".join(l))\r\n else:\r\n print(ans)", "s = list(input().split('@'))\r\n\r\nif len(s) == 1 or s[0] == '' or s[-1] == '':\r\n print('No solution')\r\nelse:\r\n for i in range(1, len(s) - 1):\r\n if len(s[i]) < 2:\r\n print('No solution')\r\n break\r\n else:\r\n print(s[0], '@', sep='', end='')\r\n for i in range(1, len(s) - 1):\r\n print(s[i][0], ',', s[i][1:], '@', sep='', end='')\r\n print(s[-1])", "s=input()\nif s.count('@')==0 or s[0] == '@' or s[-1] == '@':\n print('No solution')\n exit()\na=[]\nx=''\nn = 0\nfor i in range(len(s)):\n x+=s[i]\n if n == 1:\n x+=','\n if s[i] == '@':\n n = 1\n else:\n n = 0\n\na = ' '.join(x.split(',')).split()\nfor i in range(len(a)):\n if '@' not in a[i]:\n a[i-1]+=a[i]\n a[i]=''\n elif a[i][0] == '@' or a[i][-1] == '@':\n print('No solution')\n exit()\nprint((','.join(a)).rstrip(','))\n", "t = input().split('@')\r\nn = len(t) - 1\r\nfor i in range(1, n):\r\n if len(t[i]) < 2:\r\n t = False\r\n break\r\n t[i] = t[i][0] + ',' + t[i][1:]\r\nif n > 0 and t and t[0] and t[n]:\r\n print('@'.join(t))\r\nelse:\r\n print('No solution')", "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\ns = input().rstrip()\r\nans = []\r\n\r\nwhile s and s[0] != '@':\r\n for i in range(len(s) - 1):\r\n if s[i] == '@':\r\n ans.append(s[:i + 2])\r\n s = s[i + 2:]\r\n break\r\n else:\r\n break\r\n\r\nif s and '@' not in s and ans:\r\n ans[-1] += s\r\n s = ''\r\n\r\nif not s and all(addr.count('@') == 1 for addr in ans):\r\n print(','.join(ans))\r\nelse:\r\n print('No solution')\r\n", "s=input()\r\nm=list(s)\r\nch=s.split('@')\r\nif len(s)<3:\r\n print('No solution')\r\nelse:\r\n if s.count('@')==0 or s[0]=='@' or s[len(s)-1]=='@':\r\n print('No solution')\r\n else:\r\n test=True\r\n for i in range(1,len(ch)-1):\r\n if len(ch[i])<2:\r\n test=False\r\n break\r\n if test==False:\r\n print('No solution')\r\n else:\r\n if s.count('@')==1:\r\n print(s)\r\n else:\r\n c=ch[0]+'@'\r\n for i in range(1,len(ch)-1):\r\n c+=ch[i][0]+','\r\n for j in range(1,len(ch[i])):\r\n c+=ch[i][j]\r\n c+='@'\r\n c+=ch[len(ch)-1]\r\n print(c)\r\n", "s=list(input())\r\nans,tmp=list(),list()\r\nflag=0\r\nctr=1\r\nnum=s.count('@')\r\nfor i in range(len(s)):\r\n if i>0 and s[i-1]=='@':\r\n if ctr<num:tmp.append(s[i]); ans.append(tmp); tmp=list(); ctr+=1\r\n else:tmp.append(s[i])\r\n else:tmp.append(s[i])\r\nif len(tmp):ans.append(tmp)\r\n#print(ans)\r\nfor i in ans:\r\n if i.count('@')!=1 or i[0]=='@' or i[-1]=='@':print(\"No solution\"); quit()\r\nfor i in range(len(ans)):\r\n if i==len(ans)-1:print(*ans[i],sep='')\r\n else:print(*ans[i],sep='',end=',')", "def main():\n email = input()\n \n if len(email) < 3 or email.count('@') == 0:\n print('No solution')\n return\n \n if len(email) == 3:\n if email.count('@') != 1 or email[1] != '@':\n print('No solution')\n return\n \n pos = []\n for i in range(0, len(email)):\n if(email[i] == '@'):\n pos.append(i)\n \n if i == 0 or i == len(email) - 1:\n print('No solution')\n return\n elif len(pos) >= 2:\n \n if (pos[-1] - pos[-2]) <= 2:\n print('No solution')\n return\n\n ans = []\n \n temp = \"\"\n atual = 2\n i = 0\n while(i < len(email)):\n temp += email[i]\n \n if email[i] == '@':\n temp += email[i+1]\n ans.append(temp)\n \n i += 1\n temp = \"\"\n \n i += 1\n \n ans.append(temp)\n \n if(len(ans) >= 2):\n if(ans[-1].count('@') == 0):\n ans[-2] += ans[-1]\n del ans[-1]\n \n print(','.join(ans))\n \nmain()", "a = input()\r\nb = a.split(\"@\")\r\nans = []\r\n\r\nflag = True\r\n\r\nfor i in b[1:-1]:\r\n if len(i) < 2:\r\n flag = False\r\n break\r\n\r\nif len(b) < 2:\r\n flag = False\r\n\r\nif b[0] and b[-1] and flag:\r\n ind = 0\r\n index_list = []\r\n str_len = len(a)\r\n temp = \"\"\r\n j = 0\r\n ans = []\r\n while j != str_len:\r\n temp += a[j]\r\n if a[j] == \"@\":\r\n temp += a[j + 1]\r\n ans.append(temp)\r\n temp = \"\"\r\n j += 1\r\n j += 1\r\n ans[-1] = ans[-1] + temp\r\n print(\",\".join(ans))\r\nelse:\r\n print(\"No solution\")\r\n", "s = input().split('@')\r\nlns = len(s)\r\nst = ''\r\nfor i in range(lns):\r\n if lns==1:\r\n print('No solution')\r\n break\r\n if (i==0 or i==lns-1) and s[0] and s[-1]:\r\n if i==lns-1:\r\n st+='@'+s[i]\r\n else:\r\n st+=s[i]\r\n else:\r\n if len(s[i])>1:\r\n st+='@'+s[i][0]+','+s[i][1:]\r\n else:\r\n print('No solution')\r\n break\r\nelse:\r\n print(st)", "s=input().split('@')\r\nb=True\r\nt=len(s)\r\nif(t<2):b=False\r\nfor i in range(t):\r\n if(i==0 or i==t-1):\r\n if(len(s[i])<1):b=False\r\n elif(len(s[i])<2):b=False\r\nif(b):\r\n for i in range(t):\r\n if(0!=i and i!=t-1):\r\n print(\"%s,%s@\"%(s[i][0:1],s[i][1:len(s[i])]),end=\"\" )\r\n else:\r\n print(\"%s\"%(s[i]),end=\"\" )\r\n if(i==0):print(\"%s\"%(\"@\"),end=\"\")\r\nelse:\r\n print(\"No solution\")", "import re\na = input()\nans = re.findall(r'\\w+@\\w+$|\\w+@.', a)\nif ans and a.count('@') == len(ans):\n print(','.join(ans))\nelse:\n print('No solution')\n\t \t \t\t\t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\t", "n = input().split('@')\r\narr = len(n) - 1\r\ni = 1\r\nwhile i < arr:\r\n if len(n[i]) < 2:\r\n n = False\r\n break\r\n n[i] = n[i][0] + ',' + n[i][1: ]\r\n i += 1\r\nif arr > 0 and n and n[0] and n[arr]:\r\n print('@'.join(n))\r\nelse:\r\n print('No solution')", "def solve(w):\r\n if w[0] == '@' or w[-1] == '@':\r\n return \"No solution\"\r\n \r\n atCount = w.count('@')\r\n if atCount == 0:\r\n return \"No solution\"\r\n if atCount == 1:\r\n return w\r\n \r\n lst = w.split('@') \r\n if any(len(x) < 2 for x in lst[1:-1]):\r\n return \"No solution\"\r\n\r\n k = len(lst)\r\n res = [f'{lst[0]}@{lst[1][0]}'] \r\n res += [f'{lst[x][1:]}@{lst[x+1][0]}' for x in range(1, k-2)] \r\n res += [f'{lst[k-2][1:]}@{lst[k-1]}']\r\n return \",\".join(res)\r\n\r\nw = input()\r\nprint(solve(w))", "s = input()\r\nif len(s) < 3 or s[0] == '@' or s[-1] == '@' or s.count('@') == 0 :\r\n print(\"No solution\")\r\n exit()\r\nls = []\r\nfor i in range(len(s)) :\r\n if s[i] == '@' :\r\n ls.append(i)\r\nfor i in range(1,len(ls)) :\r\n if ls[i] - ls[i-1] < 3 :\r\n print(\"No solution\")\r\n break\r\nelse :\r\n i = 0\r\n while i < len(s) :\r\n if s[i] == '@' :\r\n if i != ls[-1] :\r\n print(s[i],s[i+1],sep='',end=',')\r\n i += 1\r\n else :\r\n print(s[i:])\r\n i = len(s)\r\n else :\r\n print(s[i],end='')\r\n i += 1" ]

[ "n, m, k = map(int, input().split())\nspan = n+m+1\ncount = (span+1)*[0]\ncount[span] = k\nkey = (span+1)*[False]\nkey[1] = True\nhire = []\nday = 1\nwhile True:\n\twhile day <= span and count[day] >= k:\n\t\tday += 1\n\tif day > span:\n\t\tif key[span]:\n\t\t\tbreak\n\t\tday -= 1\n\twhile not key[day]:\n\t\tday -= 1\n\thire.append(day)\n\tlast = min(span, day+n-1)\n\tfor i in range(day, last+1):\n\t\tcount[i] += 1\n\t\tkey[i] = True\nprint(len(hire))\nprint(' '.join([str(x) for x in hire]))\n", "def readInts(): return map(int, input().split())\r\n\r\ndef solve():\r\n line0 = []\r\n try: line0 = readInts()\r\n except EOFError: return False\r\n n, m, k = line0\r\n\r\n cnt = [0] * 10000\r\n ans = []\r\n keyPos = 1\r\n head = 1\r\n while head <= n+m or keyPos <= n+m:\r\n \r\n head = min ( head, keyPos )\r\n keyPos = max ( keyPos, head+n-1 )\r\n \r\n ans.append ( head )\r\n for i in range(head, head+n):\r\n cnt[i] += 1\r\n \r\n while cnt[head] >= k:\r\n head += 1\r\n\r\n print ( len(ans) )\r\n print ( \" \".join(map(str,ans)) )\r\n return True\r\n\r\nwhile solve(): pass\r\n", "n,m,k = map(int,input().split())\r\ncnt = [0]*100010\r\na = []\r\n\r\nfor day in range(n+m):\r\n while cnt[day] < k or cnt[day+1] == 0 :\r\n a.append(day+1)\r\n for i in range(n):\r\n cnt[day+i] += 1\r\nprint(len(a))\r\nprint(*a)", "n, m, k = map(int, input().split())\r\nans, a = [], 1\r\nif(k == 1):\r\n while a <= n + m:\r\n ans += [str(a)]\r\n a += n - 1\r\nelse:\r\n ans = ['1']\r\n while a <= n + m:\r\n ans += [str(a)] * (k-1)\r\n a += n\r\n if a <= n + m + 1:\r\n ans.append(str(a-1))\r\nprint(len(ans))\r\nprint(' '.join(ans))# 1691757388.942295", "# 216C\ndef do():\n n, m, k = map(int, input().split(\" \"))\n res = [1] * k\n p = [k] * n + [0] * 5000\n for i in range(n + 1, n + m + 1):\n if p[i] == 0:\n res.append(i - 1)\n for j in range(i - 1, i - 1 + n):\n p[j] += 1\n if p[i] < k:\n gap = k - p[i]\n for j in range(1, gap + 1):\n res.append(i)\n for j in range(i, i + n):\n p[j] += gap\n if p[n +m + 1] == 0:\n res.append(n + m)\n return [len(res), \" \".join(str(c) for c in res)]\n\nx, y = do()\nprint(x)\nprint(y)\n", "n,m,k = map(int,input().split())\r\ncnt = [0] * 100010\r\na = []\r\nfor day in range(n+m):\r\n while cnt[day] < k or cnt[day + 1] == 0 :\r\n a.append(day + 1)\r\n for i in range(n):\r\n cnt[day+i] += 1\r\nprint (len(a))\r\nfor i in range(len(a)):\r\n print (a[i],end = \" \")" ]

[ "MOD = 1000000007\r\nn, m, x = map(int, input().split())\r\nif n > m:\r\n print(0)\r\n exit()\r\ndp = [[0] * (n + 1) for _ in range(n + 1)]\r\ndp[0][0] = 1\r\nfor i in range(1, m + 1):\r\n for j in range(n, -1, -1):\r\n for k in range(j, -1, -1):\r\n if i == x:\r\n dp[j][k] = 0\r\n if j:\r\n dp[j][k] = (dp[j][k] + dp[j - 1][k]) % MOD\r\n if i != x and k:\r\n dp[j][k] = (dp[j][k] + dp[j][k - 1]) % MOD\r\n if j and k:\r\n dp[j][k] = (dp[j][k] + dp[j - 1][k - 1]) % MOD\r\nres = 1\r\nfor i in range(1, n + 1):\r\n res = (res * i) % MOD\r\nprint(res * dp[n][n] % MOD)\r\n#moondance bobfut.near" ]

[ "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef exi():\r\n print(\"NO\")\r\n sys.exit()\r\n\r\n\r\nI = lambda: list(map(int, input().split()))\r\ng = []\r\nn, m = I()\r\nfor i in range(n):\r\n g.append(list(input()))\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(1, m):\r\n if g[i][j - 1] != g[i][j]:\r\n temp += 1\r\n # print(temp)\r\n if temp > 2 or temp == 2 and g[i][0] == 'B': exi()\r\nfor j in range(m):\r\n temp = 0\r\n for i in range(1, n):\r\n if g[i - 1][j] != g[i][j]:\r\n temp += 1\r\n if temp > 2 or temp == 2 and g[0][j] == 'B': exi()\r\nfor i1 in range(n):\r\n for j1 in range(m):\r\n if g[i1][j1] == 'B':\r\n\r\n for i2 in range(n):\r\n for j2 in range(m):\r\n if g[i2][j2] == 'B':\r\n if g[i1][j2] == 'W' and g[i2][j1] == 'W': exi()\r\nprint(\"YES\")", "import sys\r\n#import threading\r\n#sys.setrecursionlimit(10**8)\r\n#threading.stack_size(10**8)\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 Convex_Shape2():\r\n n,m = invr()\r\n\r\n full_matrix = []\r\n row_pos = []\r\n col_pos = [] \r\n\r\n for row_index in range(n):\r\n row = insr()\r\n full_matrix.append(row)\r\n\r\n black_started = False \r\n black_ended = False \r\n\r\n for col_index in range(m):\r\n if row[col_index] == 'B':\r\n row_pos.append(row_index)\r\n col_pos.append(col_index)\r\n\r\n if not black_started:\r\n black_started = True\r\n\r\n elif black_started and black_ended:\r\n print(\"NO\")\r\n return \r\n\r\n elif row[col_index] == 'W' and black_started:\r\n black_ended = True \r\n \r\n for col_index in range(m):\r\n\r\n black_started = False \r\n black_ended = False \r\n\r\n for row_index in range(n): \r\n\r\n if full_matrix[row_index][col_index] == 'B':\r\n if not black_started:\r\n black_started = True \r\n elif black_started and black_ended:\r\n print(\"NO\")\r\n return \r\n \r\n elif full_matrix[row_index][col_index] == 'W' and black_started:\r\n black_ended = True \r\n \r\n num_black_squares = len(row_pos)\r\n\r\n for black_squre_index in range(num_black_squares):\r\n for next_index in range(black_squre_index+1,num_black_squares):\r\n row_inital = row_pos[black_squre_index]\r\n row_target = row_pos[next_index]\r\n col_initial = col_pos[black_squre_index]\r\n col_target = col_pos[next_index]\r\n\r\n if full_matrix[row_inital][col_target] != 'B' and full_matrix[row_target][col_initial] != 'B':\r\n print(\"NO\")\r\n return \r\n \r\n print(\"YES\")\r\n return \r\n\r\nConvex_Shape2()", "n, m = map(int, input().split())\r\nc = [input() for _ in ' ' * n]\r\ndef sol(n, m):\r\n for i in range(n):\r\n count = 0\r\n for j in range(1, m):\r\n if c[i][j] != c[i][j - 1]:\r\n count += 1\r\n if count > 2:\r\n return False\r\n if count == 2 and c[i][0]=='B':\r\n return False\r\n\r\n for j in range(m):\r\n count = 0\r\n for i in range(1, n):\r\n if c[i][j] != c[i - 1][j]:\r\n count += 1\r\n if count > 2:\r\n return False\r\n if count == 2 and c[0][j]=='B':\r\n return False\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if c[i][j] == 'B':\r\n for x in range(i, n):\r\n for y in range(m):\r\n if c[x][y] == 'B':\r\n if c[i][y] == 'W' and c[x][j] == 'W':\r\n return False\r\n return True\r\n\r\n\r\nprint('NYOE S'[sol(n, m)::2])\r\n", "import sys\r\ndef exi():\r\n print(\"NO\")\r\n sys.exit()\r\nI=lambda:list(map(int,input().split()))\r\ng=[]\r\nn,m=I()\r\nfor i in range(n):\r\n g.append(list(input()))\r\nfor i in range(n):\r\n temp=0\r\n for j in range(1,m):\r\n if g[i][j-1]!=g[i][j]:\r\n temp+=1\r\n if temp>2 or temp==2 and g[i][0]=='B':exi()\r\nfor j in range(m):\r\n temp=0\r\n for i in range(1,n):\r\n if g[i-1][j]!=g[i][j]:\r\n temp+=1\r\n if temp>2 or temp==2 and g[0][j]=='B':exi()\r\nfor i1 in range(n):\r\n for j1 in range(m):\r\n if g[i1][j1]=='B':\r\n \r\n for i2 in range(n):\r\n for j2 in range(m):\r\n if g[i2][j2]=='B':\r\n if g[i1][j2]=='W' and g[i2][j1]=='W':exi()\r\nprint(\"YES\")", "import sys\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n n, m = map(int, f.readline().split())\r\n grid = list()\r\n for _ in range(n):\r\n grid.append(f.readline().rstrip())\r\n\r\n return n, m, grid\r\n\r\n\r\ndef h(t):\r\n i, n = 0, len(t)\r\n while i < n and 'B' not in t[i]: i += 1\r\n\r\n while i < n:\r\n a = t[i].find('B')\r\n if a < 0:\r\n i += 1\r\n break\r\n b = t[i].rfind('B')\r\n if 'W' in t[i][a: b + 1]:\r\n return 1\r\n i += 1\r\n\r\n while i < n:\r\n if 'B' in t[i]:\r\n return 1\r\n i += 1\r\n\r\n return 0\r\n\r\n\r\ndef sol(n, m, grid):\r\n t = grid\r\n p = [''.join(i) for i in zip(*t)]\r\n if h(p):\r\n return [\"NO\"]\r\n\r\n i = 0\r\n while i < n and 'B' not in t[i]:\r\n i += 1\r\n\r\n while i < n:\r\n a = t[i].find('B')\r\n if a < 0:\r\n i += 1\r\n break\r\n b = t[i].rfind('B')\r\n if 'W' in t[i][a: b + 1]:\r\n return [\"NO\"]\r\n\r\n for j in range(i + 1, n):\r\n if a > 0 and t[j][a - 1] == 'B' and t[j][b] == 'W':\r\n return [\"NO\"]\r\n if b < m - 1 and t[j][b + 1] == 'B' and t[j][a] == 'W':\r\n return [\"NO\"]\r\n i += 1\r\n\r\n while i < n:\r\n if 'B' in t[i]:\r\n return [\"NO\"]\r\n i += 1\r\n\r\n return [\"YES\"]\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n\r\nn,m=L()\r\nA=[input() for i in range(n)]\r\nB=[]\r\ndef bfs(i,j):\r\n q=deque()\r\n q.append([i,j])\r\n B.append([i,j])\r\n vis[i][j]=1\r\n while(q):\r\n x,y=q.popleft()\r\n r=[-1,0,0,1]\r\n c=[0,-1,1,0]\r\n for k in range(4):\r\n a=x+r[k]\r\n b=y+c[k]\r\n if 0<=a<n and 0<=b<m and vis[a][b]==0 and A[a][b]==\"B\":\r\n q.append([a,b])\r\n vis[a][b]=1\r\n B.append([a,b])\r\n\r\n\r\nvis=[[0 for i in range(m)] for j in range(n)]\r\ndone=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"B\":\r\n if vis[i][j]==0:\r\n if done==0:\r\n bfs(i,j)\r\n done=1\r\n else:\r\n print(\"NO\")\r\n exit()\r\nB.sort()\r\n\r\n\r\ndef check(i,j):\r\n x,y=B[i]\r\n a,b=B[j]\r\n if a>x:\r\n dx=1\r\n else:\r\n dx=-1\r\n if b>y:\r\n dy=1\r\n else:\r\n dy=-1\r\n curx=x\r\n\r\n cury=y\r\n\r\n while(curx!=a):\r\n if A[curx][cury]==\"W\":\r\n break \r\n curx+=dx\r\n else:\r\n while(cury!=b):\r\n if A[curx][cury]==\"W\":\r\n break \r\n cury+=dy\r\n else:\r\n return 1\r\n curx=x\r\n\r\n cury=y\r\n\r\n while(cury!=b):\r\n if A[curx][cury]==\"W\":\r\n break \r\n cury+=dy\r\n else:\r\n while(curx!=a):\r\n if A[curx][cury]==\"W\":\r\n break \r\n curx+=dx\r\n else:\r\n return 1\r\n return 0 \r\n\r\nfor i in range(len(B)):\r\n for j in range(i+1,len(B)):\r\n if not check(i,j):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import bisect\r\nimport itertools\r\nimport sys\r\nimport collections\r\n\r\nn, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n# print('\\n'.join(map(str, grid)))\r\n\r\n# row check\r\ngood = True\r\nfor i in range(n):\r\n b = False\r\n w = False\r\n for j in range(m):\r\n if grid[i][j] == 'B' and not b:\r\n b = True\r\n elif grid[i][j] == 'W' and b and not w:\r\n w = True\r\n elif grid[i][j] == 'B' and b and w:\r\n good = False\r\n # print('rowcheck', i, j)\r\n break\r\n if not good:\r\n break\r\n\r\n# col check\r\nif good:\r\n for j in range(m):\r\n b = False\r\n w = False\r\n for i in range(n):\r\n if grid[i][j] == 'B' and not b and not w:\r\n b = True\r\n elif grid[i][j] == 'W' and b and not w:\r\n w = True\r\n elif grid[i][j] == 'B' and b and w:\r\n good = False\r\n # print('colcheck', i, j)\r\n break\r\n if not good:\r\n break\r\n\r\n# 2 change check\r\nif good:\r\n points = [(i, j) for i in range(n) for j in range(m) if grid[i][j] == 'B']\r\n for (i1, j1), (i2, j2) in itertools.combinations(points, 2):\r\n if grid[i1][j2] == 'W' and grid[i2][j1] == 'W':\r\n # print('2change', i1, j1, i2, j2)\r\n good = False\r\n break\r\n \r\nprint(\"YES\" if good else \"NO\")" ]

[ "import os\nimport math\ncumsum = [int(x) for x in os.read(0, os.fstat(0).st_size).split()]\nn = cumsum[0]\ncumsum[0] = 0\nfor i in range(n):\n cumsum[i+1] += cumsum[i]\n\n\ndef work(besta, i, sqrtbesta, lowerbound, upperbound, cumsumi):\n for j in range(i+1, min(n, i - 1 + sqrtbesta) + 1):\n if lowerbound < cumsum[j] < upperbound and (j-i)**2 + (cumsum[j] - cumsumi)**2 < besta:\n besta = (j-i)**2 + (cumsum[j] - cumsumi)**2\n return besta\n\n\nbesta = 10100**2\nfor i in range(1, n):\n sqrtbesta = int(math.sqrt(besta)) + 1\n lowerbound = -sqrtbesta + cumsum[i]\n upperbound = sqrtbesta + cumsum[i]\n besta = work(besta, i, sqrtbesta, lowerbound, upperbound, cumsum[i])\nprint(besta)\n \t\t\t\t \t\t \t \t \t \t\t \t \t \t", "#coding=utf-8\r\nfrom math import *\r\nDEBUG = 0\r\n\r\nif DEBUG==1:\r\n data = open('sample2.in', 'r')\r\n\r\ndef readline():\r\n if DEBUG == 1:\r\n return data.readline().strip('\\r\\n')\r\n else:\r\n try:\r\n return input().strip('\\r\\n')\r\n except EOFError:\r\n return ''\r\n\r\ndef readi():\r\n return [int(t) for t in readline().split()]\r\n\r\nn, = readi()\r\na = readi()\r\nasum = [0] * n\r\nasum[0] = a[0]\r\nfor i in range(1,n):\r\n asum[i]=asum[i-1]+a[i]\r\n\r\npt = []\r\nfor i in range(n):\r\n pt.append([i,asum[i]])\r\n\r\ndef dist(a,b):\r\n return (a[0]-b[0])**2+(a[1]-b[1])**2\r\n\r\ndef closest_pair(l,r):\r\n d = 1e18\r\n if l==r:\r\n return d\r\n if l+1==r:\r\n return dist(pt[l],pt[r])\r\n mid = (l+r)//2\r\n d1 = closest_pair(l,mid)\r\n d2 = closest_pair(mid+1,r)\r\n d = min(d1,d2)\r\n q = []\r\n for i in range(l,r+1):\r\n if abs(pt[i][0]-pt[mid][0]) <= d:\r\n q.append(pt[i])\r\n q.sort(key = lambda r:r[1])\r\n for i in range(len(q)):\r\n for j in range(i+1, min(i+6,len(q))):\r\n d = min(d,dist(q[i],q[j]))\r\n return d\r\n\r\nprint(closest_pair(0,n-1))\r\n\r\nif DEBUG==1:\r\n data.close() \r\n", "import sys\r\nsys.setrecursionlimit(100000)\r\nINF = 1e9\r\n \r\n \r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n \r\n \r\ndef distance(p1, p2):\r\n x = p1.x - p2.x\r\n y = p1.y - p2.y\r\n return (x ** 2 + y ** 2) ** 0.5\r\n \r\n \r\ndef brute_force(point_set, left, right):\r\n min_dist = INF\r\n for i in range(left, right):\r\n for j in range(i + 1, right):\r\n min_dist = min(min_dist, distance(point_set[i], point_set[j]))\r\n return min_dist\r\n \r\n \r\ndef strip_closest(point_set, left, right, mid, dist_min):\r\n point_mid = point_set[mid]\r\n splitted_points = []\r\n for i in range(left, right):\r\n if abs(point_set[i].x - point_mid.x) <= dist_min:\r\n splitted_points.append(point_set[i])\r\n splitted_points.sort(key=lambda p: p.y)\r\n \r\n smallest = INF\r\n l = len(splitted_points)\r\n for i in range(0, l):\r\n for j in range(i + 1, l):\r\n if not (splitted_points[j].y - splitted_points[i].y) < dist_min:\r\n break\r\n d = distance(splitted_points[i], splitted_points[j])\r\n smallest = min(smallest, d)\r\n return smallest\r\n \r\n \r\ndef closest_util(point_set, left, right):\r\n if right - left <= 3:\r\n return brute_force(point_set, left, right)\r\n mid = (right + left) // 2\r\n dist_left = closest_util(point_set, left, mid)\r\n dist_right = closest_util(point_set, mid + 1, right)\r\n dist_min = min(dist_left, dist_right)\r\n return min(dist_min, strip_closest(point_set, left, right, mid, dist_min))\r\n \r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\npoint_set = []\r\nfor i in range(n):\r\n if (i > 0):a[i] += a[i - 1]\r\n point_set.append(Point(i , a[i]))\r\n\r\npoint_set.sort(key=lambda a: a.x)\r\nans = closest_util(point_set, 0, n)\r\nprint('%.0f' % (ans * ans))\r\n", "def closest_pair(points):\n\n assert len(points) >= 2\n initial_distance = abs(points[0] - points[1])\n closest_pair = (0, 1)\n grid = {}\n\n for i, point in enumerate(points):\n fx = int(point.real / initial_distance)\n fy = int(point.imag / initial_distance)\n\n grid.setdefault((fx, fy), []).append(i)\n\n current_distance = initial_distance\n for dx in range(-1, 2):\n for dy in range(-1, 2):\n nx = fx + dx\n ny = fy + dy\n\n if (nx, ny) in grid:\n for j in grid[(nx, ny)]:\n if i == j:\n continue\n\n distance = abs(points[i] - points[j])\n if current_distance > distance:\n current_distance = distance\n closest_pair = (i, j)\n\n if current_distance < initial_distance:\n initial_distance = current_distance\n for j in range(i + 1):\n p = points[j]\n fx = int(p.real / initial_distance)\n fy = int(p.imag / initial_distance)\n\n grid.setdefault((fx, fy), []).append(j)\n\n return closest_pair\n\nN = int(input())\nAs = list(map(int, input().split()))\n\npoints = []\ny = 0\n\nfor i in range(N):\n y += As[i]\n points.append(complex(i, y))\n\ni, j = closest_pair(points)\ndistance_squared = int(abs(points[i] - points[j]) ** 2 + 0.5)\nprint(distance_squared)\n" ]

[ "def exgcd(i, j):\r\n if j == 0:\r\n return 1, 0, i\r\n u, v, d = exgcd(j, i % j)\r\n return v, u - v * (i // j), d\r\nma, ra, mb, rb, L, R = map(int, input().split(' '))\r\nL = max(L, ra, rb)\r\nif L > R:\r\n print(0)\r\n exit(0)\r\nif ra > rb:\r\n ma, ra, mb, rb = mb, rb, ma, ra\r\n_, _, md = exgcd(ma, mb)\r\nif md != 1:\r\n if (rb - ra) % md != 0:\r\n print(0)\r\n exit(0)\r\n m = ma * mb // md\r\n rev, _, _ = exgcd(ma // md, mb // md)\r\n rev = (rev % (mb // md) + mb // md) % (mb // md)\r\n r = ma * (rb - ra) // md * rev + ra\r\n r = (r % m + m) % m\r\nelse:\r\n m = ma * mb\r\n bv, av, _ = exgcd(ma, mb)\r\n r = ra * mb * av + rb * ma * bv\r\n r = (r % m + m) % m\r\ndef calc(i):\r\n return (i - r) // m\r\nprint(calc(R) - calc(L - 1))\r\n", "#from IPython import embed\r\n\r\ndef xgcd(b, n):\r\n x0, x1, y0, y1 = 1, 0, 0, 1\r\n while n != 0:\r\n q, b, n = b // n, n, b % n\r\n x0, x1 = x1, x0 - q * x1\r\n y0, y1 = y1, y0 - q * y1\r\n return b, x0, y0\r\n\r\ndef ffloor(a, b):\r\n\tif(b < 0): return ffloor(-a,-b);\r\n\treturn a//b\r\ndef cceil( a, b):\r\n\tif(b < 0): return cceil(-a,-b);\r\n\tif a % b == 0: \r\n\t\treturn a//b\r\n\treturn a//b+1;\r\n\t\r\n\r\n\r\ndef main():\r\n\ts = input()\r\n\ta1, b1, a2, b2, L, R = [int(i) for i in s.split()]\r\n\r\n\tif b2 < b1:\r\n\t\ta1, a2 , b1, b2 = a2, a1 , b2, b1\r\n\r\n\td,x,y = xgcd(a1,-a2)#extended_gcd(a1,-a2)\r\n\tif(d < 0):\r\n\t\td *= -1\r\n\t\tx *= -1\r\n\t\ty *= -1\r\n\t\r\n\tif (b2 - b1) % d != 0: \r\n\t\tprint(0)\r\n\t\treturn\r\n\r\n\t#print(d,x,y)\r\n\tfact = (b2-b1)//d\r\n\tx *= fact\r\n\ty *= fact\r\n\r\n\tc1 = a2//d;\r\n\tc2 = a1//d;\r\n\r\n\r\n\ttope1 = ffloor(R-b1-a1*x, a1*c1);\r\n\tbajo1 = cceil(L-b1-a1*x,c1*a1);\r\n\tbajo2 = cceil(L-b2-a2*y,c2*a2);\r\n\ttope2 = ffloor(R-b2-a2*y, a2*c2);\r\n\r\n\tbajo3 = max(cceil(-x,c1),cceil(-y,c2));\r\n\r\n\tbajo = max(bajo1,bajo2,bajo3);\r\n\ttope = min(tope1,tope2);\r\n\tprint(max(0,tope+1-bajo))\r\n\t#embed()\r\nmain()", "import math\r\n\r\na1, b1, a2, b2, l, r = map(int, input().split())\r\nif b1 < l:\r\n b1 = (b1 - l) % a1 + l\r\nif b2 < l:\r\n b2 = (b2 - l) % a2 + l\r\nc = a1 // math.gcd(a1, a2) * a2\r\nm = min(1 + r, c + max(b1, b2))\r\nwhile b1 != b2 and m > b1:\r\n if b1 < b2:\r\n b1 = (b1 - b2) % a1 + b2\r\n else:\r\n b2 = (b2 - b1) % a2 + b1\r\nprint((m > b1) * (1 + (r - b1) // c))\r\n", "#from IPython import embed\r\ndef mod(a, b):\r\n\tif b < 0:\r\n\t\treturn mod(a,-b)\r\n\tif a >= 0:\r\n\t\treturn a % b\r\n\treturn - ((-a)%b)\r\ndef extended_gcd(a, b):\r\n\ttmp1 = a\r\n\ttmp2 = b\r\n\txx = 0\r\n\ty = 0\r\n\tyy = 1\r\n\tx = 1\r\n\twhile b != 0:\r\n\t\tq = a//b\r\n\t\tt = b\r\n\t\tb = mod(a,b)\r\n\t\ta = t\r\n\t\ttt = xx\r\n\t\txx = x-q*xx\r\n\t\tx = t\r\n\t\tt = yy\r\n\t\tyy = y-q*yy\r\n\t\ty = t;\r\n\tassert(a == tmp1*x+tmp2*y)\r\n\treturn (a,x,y)\r\ndef xgcd(b, n):\r\n x0, x1, y0, y1 = 1, 0, 0, 1\r\n while n != 0:\r\n q, b, n = b // n, n, b % n\r\n x0, x1 = x1, x0 - q * x1\r\n y0, y1 = y1, y0 - q * y1\r\n return b, x0, y0\r\n\r\ndef ffloor(a, b):\r\n\tif(b < 0): return ffloor(-a,-b);\r\n\treturn a//b\r\ndef cceil( a, b):\r\n\tif(b < 0): return cceil(-a,-b);\r\n\tif a % b == 0: \r\n\t\treturn a//b\r\n\treturn a//b+1;\r\n\t\r\n\r\n\r\ndef main():\r\n\ts = input()\r\n\ta1, b1, a2, b2, L, R = [int(i) for i in s.split()]\r\n\r\n\tif b2 < b1:\r\n\t\ta1, a2 , b1, b2 = a2, a1 , b2, b1\r\n\r\n\td,x,y = xgcd(a1,-a2)#extended_gcd(a1,-a2)\r\n\tif(d < 0):\r\n\t\td *= -1\r\n\t\tx *= -1\r\n\t\ty *= -1\r\n\t\r\n\tif (b2 - b1) % d != 0: \r\n\t\tprint(0)\r\n\t\treturn\r\n\r\n\t#print(d,x,y)\r\n\tfact = (b2-b1)//d\r\n\tx *= fact\r\n\ty *= fact\r\n\r\n\tc1 = a2//d;\r\n\tc2 = a1//d;\r\n\r\n\r\n\ttope1 = ffloor(R-b1-a1*x, a1*c1);\r\n\tbajo1 = cceil(L-b1-a1*x,c1*a1);\r\n\tbajo2 = cceil(L-b2-a2*y,c2*a2);\r\n\ttope2 = ffloor(R-b2-a2*y, a2*c2);\r\n\r\n\tbajo3 = max(cceil(-x,c1),cceil(-y,c2));\r\n\r\n\t#print((R-b1-a1*x) /( a1*c1) ,(R-b2-a2*y)/ (a2*c2))\r\n\t#print((L-b1-a1*x)/(c1*a1) ,(L-b2-a2*y)/(c2*a2))\r\n\t#print(-x/c1,-y/c2)\r\n\t#print(bajo1,tope1)\r\n\t\r\n\t#print(bajo2,tope2)\r\n\t#print(bajo3)\r\n\tbajo = max(bajo1,bajo2,bajo3);\r\n\ttope = min(tope1,tope2);\r\n\tprint(max(0,tope+1-bajo))\r\n\t#embed()\r\nmain()", "#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\nimport math\r\na1,b1,a2,b2,l,r=map(int,input().split())\r\nif b1<l:b1=(b1-l)%a1+l\r\nif b2<l:b2=(b2-l)%a2+l\r\nc=a1//math.gcd(a1,a2)*a2\r\nm=min(1+r,c+max(b1,b2))\r\nwhile b1!=b2 and m>b1:\r\n\tif b1<b2:b1=(b1-b2)%a1+b2\r\n\telse:b2=(b2-b1)%a2+b1\r\nprint((m>b1)*(1+(r-b1)//c))", "import sys\r\n\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# ax+by=c\r\ndef extgcd(a, b, c):\r\n if b == 0: return c, 0\r\n x, y = extgcd(b, a % b, c)\r\n return y, x - a // b * y\r\n\r\ndef first_term(a1, b1, a2, b2):\r\n g = gcd(a1, a2)\r\n T = lcm(a1, a2)\r\n\r\n # s*a1+t*a2=b2-b1\r\n if (b2 - b1) % g != 0: return -(10 ** 100)\r\n x0 = extgcd(a1 // g, a2 // g, (b2 - b1) // g)[0] * a1 + b1 - T * 10 ** 30\r\n\r\n ok = 10 ** 60\r\n ng = -1\r\n\r\n while ok - ng > 1:\r\n mid = (ok + ng) // 2\r\n val = x0 + T * mid\r\n k = (val - b1) // a1\r\n l = (val - b2) // a2\r\n\r\n if k >= 0 and l >= 0:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\n return x0 + ok * T\r\n\r\ndef f(a0, T, v):\r\n ok = 10 ** 36\r\n ng = -1\r\n\r\n while ok - ng > 1:\r\n mid = (ok + ng) // 2\r\n\r\n if a0 + T * mid >= v:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\n return ok\r\n\r\na1, b1, a2, b2, L, R = map(int, input().split())\r\n\r\nT = lcm(a1, a2)\r\na0 = first_term(a1, b1, a2, b2)\r\n\r\nif a0 == -(10 ** 100):\r\n print(0)\r\n sys.exit()\r\n\r\nprint(f(a0, T, R + 1) - f(a0, T, L))\r\n", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\ndef extgcd(a, b):\r\n if not b:\r\n return 1, 0\r\n u, v = extgcd(b, a % b)\r\n x, y = v, u - a // b * v\r\n return x, y\r\n\r\na1, b1, a2, b2, l, r = map(int, input().split())\r\nif not a1 and not a2:\r\n ans = 1 if l <= b1 == b2 <= r else 0\r\nelif not a1:\r\n ans = 1 if not (b1 - b2) % a2 and (b1 - b2) // a2 >= 0 else 0\r\nelif not a2:\r\n ans = 1 if not (b2 - b1) % a1 and (b2 - b1) // a1 >= 0 else 0\r\nelif b1 == b2:\r\n u = b1\r\n v = lcm(a1, a2)\r\n if u < l:\r\n u += (l - u) // v * v\r\n if u < l:\r\n u += v\r\n ans = (r - u) // v + 1 if l <= u <= r else 0\r\nelse:\r\n u, v, w = a1, -a2, b2 - b1\r\n if w % math.gcd(u, v):\r\n ans = 0\r\n else:\r\n x, y = extgcd(u, v)\r\n z = x * u + y * v\r\n c = w // z\r\n x *= c\r\n y *= c\r\n l0 = lcm(a1, a2)\r\n x0, y0 = l0 // a1, l0 // a2\r\n if x < 0:\r\n d = -x // x0 + min(-x % x0, 1)\r\n x += d * x0\r\n y += d * y0\r\n if y < 0:\r\n d = -y // y0 + min(-y % y0, 1)\r\n x += d * x0\r\n y += d * y0\r\n d = min(x // x0, y // y0)\r\n x -= d * x0\r\n y -= d * y0\r\n s = x * a1 + b1\r\n d = a1 * x0\r\n if s < l:\r\n z = (l - s) // d + min((l - s) % d, 1)\r\n s += d * z\r\n if r < s:\r\n ans = 0\r\n else:\r\n ans = (r - s) // d + 1\r\nprint(ans)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nimport math\na1,b1,a2,b2,l,r=map(int,input().split())\nif b1<l:b1=(b1-l)%a1+l\nif b2<l:b2=(b2-l)%a2+l\nc=a1//math.gcd(a1,a2)*a2\nm=min(1+r,c+max(b1,b2))\nwhile b1!=b2 and m>b1:\n\tif b1<b2:b1=(b1-b2)%a1+b2\n\telse:b2=(b2-b1)%a2+b1\nprint((m>b1)*(1+(r-b1)//c))\n", "import sys\r\n# Uz ma to pretekanie nebavi!!!\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return [a, 1, 0]\r\n c = a%b\r\n [g, x1, y1] = gcd(b, c)\r\n x = y1\r\n y = x1 - y1 * (a//b)\r\n return [g, x, y]\r\n\r\na1, b1, a2, b2, l, r = [int(i) for i in input().split(\" \")]\r\nif max(b1, b2) > r:\r\n print(0)\r\n sys.exit(0)\r\n\r\nl = max(l, b1, b2)\r\n[g, xg, yg] = gcd(a1, a2)\r\nif (b2 - b1) % g == 0:\r\n xg *= (b2 - b1) // g\r\nelse:\r\n print(0)\r\n sys.exit(0)\r\nlcm = (a1 * a2) // g\r\nval = xg * a1 + b1\r\nif val >= l:\r\n val -= (((val - l) // lcm) + 1) * lcm\r\n \r\nprint(((r - val) // lcm) - ((l - val - 1) // lcm))\r\n" ]

[ "n = int(input())\r\nv = list(map(int, input().split()))\r\nans = \"NO\"\r\np = []\r\nfor i in range(n + 1):\r\n p.append(-1)\r\nfor i in range(n):\r\n p[v[i]] = i\r\nfor i in range(n - 1):\r\n for j in range(i + 1, min(n, i + 6)):\r\n if v[i] * 2 - v[j] >= 1 and v[i] * 2 - v[j] <= n and p[v[i] * 2 - v[j]] < i:\r\n ans = \"YES\"\r\n break\r\n if v[j] * 2 - v[i] >= 1 and v[j] * 2 - v[i] <= n and p[v[j] * 2 - v[i]] > j:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)" ]

[ "d=0\r\nc=0\r\nfor i in range (0,8):\r\n a=input()\r\n if a!='BBBBBBBB' and d==0:\r\n d=1\r\n for j in range (0,8):\r\n if a[j]=='B':\r\n c+=1\r\n if a=='BBBBBBBB':\r\n c+=1\r\nprint(c)\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nb = [list(input()) for _ in range(8)]\ncnt1 = sum([1 for s in b if s == ['B'] * 8])\ncnt2 = sum([1 for s in zip(*b) if list(s) == ['B'] * 8])\nprint(8 if cnt1 == 8 else cnt1 + cnt2)\n", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\nt = [input().count('B') for i in range(8)]\r\nprint(t.count(8) + min(t)%8)\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\n\r\n ", "l = []\r\nx = y = n = 0\r\n\r\nfor _ in range(8):\r\n s = input()\r\n if s == \"BBBBBBBB\":\r\n x += 1\r\n elif \"B\" in s:\r\n y += s.count(\"B\")\r\nif x != 8:\r\n print(x+(y//(8-x)))\r\nelse:\r\n print(x)", "import sys\r\n\r\ngrid = []\r\n\r\ndef getrow(i):\r\n return ''.join(grid[i])\r\n\r\ndef getcol(i):\r\n col = \"\"\r\n for j in range(8):\r\n col += grid[j][i]\r\n return col\r\n\r\nfor i in range(8):\r\n grid.append(list(input()))\r\n\r\ncount = 0\r\nfor i in range(8):\r\n if getcol(i) == \"B\"*8:\r\n count += 1\r\nif count == 8:\r\n print(8)\r\n sys.exit()\r\nfor i in range(8):\r\n if getrow(i) == \"B\"*8:\r\n count += 1\r\nprint(count)", "k = 0; a = []\r\nfor i in range(8):\r\n b = list(input()); c = b.count(\"B\")\r\n if c == 8:\r\n k += 1\r\n a.append(b)\r\nfor i in range(len(a)):\r\n c = a[i].count(\"B\")\r\n if c != 8:\r\n k += c\r\n break\r\nprint(k)", "s=[]\r\nfor n in range(8):\r\n s.append(list(input()))\r\nd=['B']*8\r\nl=0\r\nj=0\r\nfor n in range(8):\r\n if s[n]==d:\r\n l+=1\r\n else:\r\n if j==0:\r\n l+=s[n].count('B')\r\n j=1\r\nprint(l)\r\n ", "l = []\r\nfor i in range(8):\r\n l.append(list(input()))\r\n\r\ndef function(f, k):\r\n if len(f) == 0:\r\n return k\r\n else:\r\n g = f.pop(0)\r\n if g == 'B':\r\n k += 1\r\n return function(f, k)\r\n\r\nj = 0\r\nm = 0\r\nfor y in range(8):\r\n f = l[y]\r\n k = function(f, 0)\r\n if k == 8:\r\n j += 1\r\n else:\r\n m = k\r\n\r\nprint(j+m)", "hor=0\r\nver=9\r\nll=[]\r\nfor i in range(8):\r\n s=input()\r\n if s==\"BBBBBBBB\":\r\n hor+=1\r\n t=s.count(\"B\")\r\n if t<ver:\r\n ver=t\r\n ll.append(s)\r\nif hor+ver==16:\r\n print(8)\r\nelse:\r\n print(hor+ver)", "n = 8\r\ng = [list(input()) for _ in range(n)]\r\nr = set()\r\nc = set()\r\n\r\nfor i in range(n):\r\n if g[i].count(\"B\") == n:\r\n r.add(i)\r\n else:\r\n c |= set(j for j in range(n) if g[i][j] == \"B\")\r\n\r\nprint(len(r) + len(c))\r\n", "row = []\r\ncol = []\r\nfor i in range(8):\r\n col.append('')\r\nfor i in range(8):\r\n x = input()\r\n row.append(x)\r\n for i in range(8):\r\n col[i]+=x[i]\r\n\r\ndef isblack(s):\r\n for c in s:\r\n if c!='B':\r\n return False\r\n return True\r\na = 0\r\nb = 0\r\nfor x in row:\r\n if isblack(x):\r\n a+=1\r\nif a==8:\r\n print(8)\r\nelse:\r\n for y in col:\r\n if isblack(y):\r\n b+=1\r\n print(a+b)\r\n", "e=0\r\ns1=''\r\ns2=''\r\ns3=''\r\ns4=''\r\ns5=''\r\ns6=''\r\ns7=''\r\ns8=''\r\nfor i in range(8):\r\n s=str(input())\r\n if(s==('B'*8)):\r\n e=e+1\r\n s1=s1+s[0]\r\n s2=s2+s[1]\r\n s3=s3+s[2]\r\n s4=s4+s[3]\r\n s5=s5+s[4]\r\n s6=s6+s[5]\r\n s7=s7+s[6]\r\n s8=s8+s[7]\r\nif(s1==('B'*8)):\r\n e=e+1\r\nif(s2==('B'*8)):\r\n e=e+1\r\nif(s3==('B'*8)):\r\n e=e+1\r\nif(s4==('B'*8)):\r\n e=e+1\r\nif(s5==('B'*8)):\r\n e=e+1\r\nif(s6==('B'*8)):\r\n e=e+1\r\nif(s7==('B'*8)):\r\n e=e+1\r\nif(s8==('B'*8)):\r\n e=e+1\r\nif(e==16):\r\n print(8)\r\nelse:\r\n print(e)", "row=0\r\ncol=0\r\nl=[]\r\nfor i in range(8):\r\n l.append(input())\r\n if(l[i]==\"BBBBBBBB\"):\r\n row+=1\r\nif(row==8):\r\n print(8)\r\nelse:\r\n for i in range(8):\r\n if(\"\".join([x[i] for x in l])==\"BBBBBBBB\"):\r\n col+=1\r\n print(col+row)", "def main():\n grid = []\n for _ in range(8):\n grid.append(input())\n\n if all(all(c == 'B' for c in row) for row in grid):\n print('8')\n return\n\n rows = []\n for i, row in enumerate(grid):\n if all(c == 'B' for c in row):\n rows.append(i)\n\n cols = []\n for j in range(8):\n if all(grid[i][j] == 'B' for i in range(8)):\n cols.append(j)\n\n print(len(rows) + len(cols))\n\nmain()\n", "import sys\nnum_black_rows = 0\nother_row = 'WWWWWWWW'\n\nfor i in range(8):\n line = sys.stdin.readline().rstrip()\n if line == 'BBBBBBBB':\n num_black_rows += 1\n else:\n other_row = line\n\nprint(num_black_rows + other_row.count('B'))\n", "#!/usr/bin/env python3\n\ngrid = [input() for _ in range(8)]\nresult = grid.count('B'*8)\ngrid = '\\n'.join(''.join(grid[i][j] for i in range(8)) for j in range(8))\nresult += grid.count('B'*8)\nresult = 8 if result == 16 else result\nprint(result)", "a=b=0\r\nfor i in range(8):\r\n x=input()\r\n c=x.count('B')\r\n if(c==8):\r\n a+=1\r\n elif(c<8):\r\n b=c\r\nprint(a+b)", "from typing import Counter\r\n\r\n\r\narr = [input() for _ in range(8)]\r\nbase = 'B'*8\r\nans = arr.count(base)\r\n\r\nfor _ in range(ans):\r\n arr.remove(base)\r\n\r\nx = 0\r\nif arr:\r\n x = arr[0].count('B')\r\nprint(ans + x)\r\n", "hor,ver = 0,0\r\nfor _ in range(8):\r\n strip = input()\r\n count = 0\r\n for color in strip:\r\n if color == 'B':\r\n count+=1\r\n if count == 8:\r\n hor+=1\r\n else:\r\n ver = count\r\nprint(hor+ver)\r\n", "x = [list(input()).count(\"B\") for i in range(8)]\r\nprint(min(x) % 8 + x.count(8))", "a = [input() for i in range(8)]\r\nb = [\"\".join(j[i] for j in a) for i in range(8)]\r\ns = a.count(\"B\" * 8) + b.count(\"B\" * 8)\r\nprint(s if s != 16 else 8)\r\n", "import math\r\nimport string\r\n\r\ndef main_function():\r\n table = [input() for i in range(8)]\r\n counter = 0\r\n is_already_looked = False\r\n for i in table:\r\n if i == \"BBBBBBBB\":\r\n counter += 1\r\n elif not is_already_looked:\r\n for j in i:\r\n if j == \"B\":\r\n counter += 1\r\n is_already_looked = True\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "def rr(): return input().rstrip()\r\ndef rri(): return int(rr())\r\ndef rrl(): return list(map(int, rr().split()))\r\ndef rrt(): return tuple(map(int, rr().split()))\r\nfrom collections import defaultdict\r\ndef mus(d=lambda: 0): return defaultdict(lambda: defaultdict(d))\r\ndef dd0(d=lambda: 0): return defaultdict(d)\r\ndef ms(x, y, d=0): return [[0]*y for i in range(x)]\r\ndef ar(x, d=0): return [d]*x\r\ndef ppm(m, n=0, x=0, y=0): print(\"\\n\".join((\"\\t\".join((str(m[j][i]) for j in range(y or n))) for i in range(x or n))))\r\ndef ppa(a, n): print(\"\\t\".join(map(str, a[0:n])))\r\ndef ppl(a=0, x=[1]): x[0]=a or (x[0]+1); print(\"-\"+\"- -\"*14+\"-# \"+str(x[0]-2)+\" #-\"+\"- -\"*14+\"-\")\r\ndef fltn(a): (i for sub in a for i in sub)\r\ndef yn(x): return \"YES\" if x else \"NO\"\r\nfrom itertools import accumulate\r\nfrom itertools import groupby\r\ndef grp(x): return ((i, sum(1 for _ in g)) for i, g in groupby(x))\r\nimport math\r\ndef rnar(): return (*rrl(), rrl())\r\ndef rn(): return (*rrl(),)\r\ndef dpp(*args): print(*args)\r\n\r\ndef read():\r\n l = [rr() for _ in range(8)]\r\n \r\n\r\n return (l,)\r\n\r\ndef solve(l):\r\n vert = 99\r\n \r\n for row in l:\r\n vert = min(vert, row.count(\"B\"))\r\n\r\n horiz = 99 \r\n for x in range(8):\r\n cur_b = 0\r\n for y in range(8):\r\n if l[y][x] == \"B\":\r\n cur_b += 1\r\n horiz = min(horiz, cur_b)\r\n\r\n if (vert == 8): horiz = 0\r\n\r\n\r\n ans = vert + horiz\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n #test_count = rri()\r\n test_count = 1\r\n for _ in range(test_count):\r\n input_data = read()\r\n result = solve(*input_data)\r\n print(result)\r\n", "S=[list(input()) for i in range(8)]\r\nANS=0\r\n\r\nMAP=[[\"W\"]*8 for i in range(8)]\r\n\r\nwhile MAP!=S:\r\n for i in range(8):\r\n if S[i]==[\"B\"]*8 and MAP[i]!=[\"B\"]*8:\r\n ANS+=1\r\n MAP[i]=[\"B\"]*8\r\n break\r\n\r\n else:\r\n for j in range(8):\r\n wflag=0\r\n wflag2=0\r\n for i in range(8):\r\n if S[i][j]==\"W\":\r\n wflag=1\r\n if MAP[i][j]==\"W\":\r\n wflag2=1\r\n\r\n if wflag==0 and wflag2==1:\r\n for i in range(8):\r\n MAP[i][j]=\"B\"\r\n ANS+=1\r\n break\r\n\r\nprint(ANS)\r\n \r\n \r\n", "x=y=0\r\nfor _ in range(8):\r\n n = input().count('B')\r\n \r\n if n<8:\r\n y=n\r\n else:\r\n x+=1\r\nprint(x+y)", "chess_board = []\r\ncount_ = 0\r\nfor i in range(8):\r\n list_ = list(input().strip())\r\n chess_board.append(list_)\r\nfor i in range(8): # цикл по строкам\r\n all_paint = True\r\n for j in range(8):\r\n if chess_board[i][j] == \"W\":\r\n all_paint = False\r\n break\r\n if all_paint:\r\n count_ += 1\r\nif count_ < 8:\r\n for j in range(8): # цикл по столбцам\r\n all_paint = True\r\n for i in range(8):\r\n if chess_board[i][j] == \"W\":\r\n all_paint = False\r\n break\r\n if all_paint:\r\n count_ += 1\r\nprint(count_)", "cb = [list(input()) for _ in range(8)]\ncount = 0\nfor i in range(8):\n\tfor j in range(8):\n\t\tif cb[i][j] != 'B':\n\t\t\tbreak\n\telse:\n\t\tcount+=1\n\tfor j in range(8):\n\t\tif cb[j][i] != 'B':\n\t\t\tbreak\n\telse:\n\t\tcount+=1\nif(count == 16):\n\tprint(8)\nelse:\n\tprint(count)\n\n", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\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 s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n grid = []\r\n ans = 0\r\n\r\n for i in range(8):\r\n grid.append(insr())\r\n if grid[i] == \"BBBBBBBB\":\r\n ans += 1\r\n grid[i] = \"XXXXXXXX\"\r\n for i in range(8):\r\n for j in range(8):\r\n cnt = 0\r\n if grid[j][i] == \"B\":\r\n ans += 1\r\n break\r\n print(ans)\r\n", "l = []\r\nlp = []\r\n\r\nbr = 0\r\n\r\nfor i in range(8):\r\n s = input()\r\n l.append(list(s))\r\n\r\n if len(set(s)) == 1 and 'B' in s:\r\n br += 1\r\n lp.append([1 for j in range(8)])\r\n\r\n else:\r\n lp.append([0 for j in range(8)])\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if l[i][j] == 'B' and lp[i][j] == 0:\r\n for k in range(8):\r\n if lp[k][j] == 0:\r\n lp[k][j] = 1\r\n\r\n br += 1\r\n\r\nprint(br)\r\n", "board = [[],[],[],[],[],[],[],[]]\r\nfor x in range(len(board)):\r\n s = input()\r\n for y in s:\r\n if y == \"W\":\r\n board[x].append(False)\r\n else:\r\n board[x].append(True)\r\ndrawn = 0\r\nfor x in board:\r\n if not(False in x):\r\n drawn += 1\r\nif drawn == 8:\r\n print(8)\r\n exit()\r\nfor x in range(8):\r\n temp = [y[x] for y in board]\r\n if not(False in temp):\r\n drawn += 1\r\nprint(drawn)", "a = [[x == 'B' for x in input()] for _ in range(8)]\n\nh = [False] * 8\nfor i in range(8):\n h[i] = all(a[i])\n\nv = [False] * 8\nfor i in range(8):\n v[i] = all(x[i] for x in a)\n\ns = sum(h) + sum(v)\n\nprint(s if s < 16 else 8)\n", "li=[]\r\nn=8 \r\nh=0\r\nst='BBBBBBBB'\r\nfor i in range(n):\r\n s=input()\r\n if s==st:\r\n h+=1 \r\n li.append(s)\r\nif h==8:\r\n print(8)\r\nelse:\r\n v=0\r\n f=0\r\n for i in range(n):\r\n for j in range(n):\r\n if li[j][i]!='B':\r\n f=1 \r\n break\r\n if f==0:\r\n v+=1 \r\n f=0\r\n print(h+v)\r\n ", "import sys\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn = 8\r\n\r\nlines = [input() for i in range(n)]\r\nres = 0\r\nfor line in lines:\r\n if line == 'B' * n:\r\n res += 1\r\n \r\nif res==n:\r\n print(res)\r\n exit(0)\r\n\r\nfor i in range(n):\r\n column = [lines[j][i] for j in range(n)]\r\n if column == ['B'] * n:\r\n res += 1\r\n\r\nprint(res)\r\n", "board = []\r\nlines = 0\r\ndrawn = False\r\n \r\nfor i in range(8): #insert BW combinations\r\n row = list(input())\r\n board.append(row) \r\n \r\nfor r in board:\r\n count = 0\r\n for c in r:\r\n if (c == 'B'): #Checking for Black tiles in a specific row UNTIL the end of the row\r\n count += 1 #if 7/8 tiles are black, it won't count\r\n if (count == 8):\r\n lines += 1 #one complete line of B tiles\r\n elif (count > 0 and not drawn):\r\n drawn = True\r\n lines += count\r\n \r\nprint(lines)", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nmaxr=0;mat=[]\r\nfor _ in range(8):\r\n *arr,=input()\r\n if (arr.count('B'))==8:maxr+=1\r\n mat.append(arr)\r\n \r\n# print(maxw,mat) \r\nmaxc=0;\r\nfor c in range(8):\r\n countw=0\r\n for r in range(8):\r\n if mat[r][c]=='B':countw+=1\r\n if countw==8:maxc+=1 \r\n \r\n \r\nans=(maxr+maxc) \r\nif ans==16:print(8)\r\nelse:print(ans) \r\n\r\n ", "# LUOGU_RID: 100408671\nimport sys\r\n# n = (int)(input())\r\n# lis = list(map(int, input().split()))\r\ngraph = []\r\nfor i in range(8):\r\n s = input()\r\n graph.append(s)\r\nans = 0\r\ns = \"BBBBBBBB\"\r\nfor i in range(8):\r\n if graph[i] == s:\r\n ans += 1\r\nfor i in range(8):\r\n ss = \"\"\r\n for j in range(8):\r\n ss += graph[j][i]\r\n if ss == s:\r\n ans += 1\r\nif ans == 16:\r\n print(8)\r\nelse:\r\n print(ans)\r\n", "l = []\r\nfor _ in range(8):\r\n l.append(input())\r\n\r\nr = set()\r\nc = set()\r\nfor i in range(8):\r\n for j in range(8):\r\n if(l[i][j] == \"W\"):\r\n r.add(i)\r\n c.add(j)\r\n\r\nif(not r and not c):\r\n print(8)\r\nelse:\r\n print(16 - len(r) - len(c))", "s1=[]\r\ns2=['' for i in range(8)]\r\nfor i in range(8):\r\n s=input()\r\n s1.append(s)\r\n for j in range(8):\r\n s2[j]+=s[j]\r\nk1=s1.count('BBBBBBBB')\r\nk2=s2.count('BBBBBBBB')\r\nif k1==8:\r\n print(k1)\r\nelse:\r\n print(k1+k2)", "l = [e.strip('\\n') for e in [*open(0)]]\r\nx = l.count('BBBBBBBB')\r\nl = [''.join(e) for e in zip(*l)]\r\nprint(eval('{0} if {0} != 16 else 8'.format(x+l.count('BBBBBBBB'))))", "# LUOGU_RID: 101910065\na = [input() for _ in range(8)]\r\nx = a.count('BBBBBBBB')\r\ny = list(zip(*a)).count(tuple('BBBBBBBB'))\r\nprint(x == y == 8 and 8 or x + y)", "import sys\n\nm = []\n\ndef is_row(x):\n for i in range(8):\n if m[i][x] != 'B':\n return False\n return True\n \ndef is_col(x):\n for i in range(8):\n if m[x][i] != 'B':\n return False\n return True\n\nfor i in range(8):\n m.append(list(sys.stdin.readline().strip()))\n\nresult = 0\n\nfor i in range(8):\n if is_row(i):\n result += 1\n if is_col(i):\n result += 1\n\nif result == 16:\n result //= 2\nprint(result)\n", "def judge(i,flag):\r\n global a;\r\n paint=1;\r\n if(flag==0):\r\n for j in range(8):\r\n if(a[i][j]=='W'):\r\n paint=0;\r\n break;\r\n else:\r\n for j in range(8):\r\n if(a[j][i]=='W'):\r\n paint=0;\r\n break;\r\n return paint;\r\na=[];\r\nans=0;\r\nfor i in range(8):\r\n r=list(input());\r\n a.append(r);\r\nfor i in range(8):ans+=judge(i,0);\r\nfor i in range(8):ans+=judge(i,1);\r\nif(ans==16):print(8);\r\nelse: print(ans);\r\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n board = [input() for i in range(8)]\r\n column_counted = False\r\n count = 0\r\n for line in board:\r\n if line == 'BBBBBBBB':\r\n count += 1\r\n elif not column_counted:\r\n count += line.count('B')\r\n column_counted = True\r\n else:\r\n pass\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "c = [input().count('B') for i in range(8)]\r\nprint(min(c) % 8 + c.count(8))\r\n", "a=[]\r\nc=0\r\nfor i in range(8):\r\n a.append(input())\r\n if a[i]=='B'*8:\r\n c+=1\r\n a[i]='A'*8\r\nfor j in range(8):\r\n d=0\r\n for i in range(8):\r\n if a[i][j]=='W':\r\n d=0\r\n break\r\n elif a[i][j]=='B':\r\n d=1\r\n c+=d\r\nprint(c)", "ans=0\r\narr=[None]*8\r\nfor i in range(8):\r\n arr[i]=list(input())\r\n if arr[i].count(\"B\")==8:\r\n arr[i]=[\"W\"]*8\r\n ans+=1\r\nfor i in range(8):\r\n for j in range(8):\r\n if arr[i][j]==\"B\":\r\n ans+=1\r\n for k in range(8):\r\n arr[k][j]=\"W\"\r\nprint(ans)", "\r\nb=0\r\na=0\r\nfor i in range(8):\r\n k = input()\r\n\r\n n = k.count(\"B\")\r\n\r\n if n<8:\r\n\r\n a = n\r\n\r\n else:\r\n\r\n b+=1\r\n\r\nprint(a+b)\r\n\r\n", "ans = 0\r\nchars = ['W'] * 8\r\nchecked = False\r\nfor i in range(8):\r\n s=input()\r\n\r\n if s == \"BBBBBBBB\":\r\n ans+=1\r\n elif not checked:\r\n for char in s:\r\n if char == 'B':\r\n ans+=1\r\n checked = True\r\nprint(ans)\r\n\r\n", "board = [input() for _ in range(8)]\r\nrows, cols = 0, 0\r\nfor i in range(8):\r\n if all(board[i][j] == 'B' for j in range(8)):\r\n rows += 1\r\n if all(board[j][i] == 'B' for j in range(8)):\r\n cols += 1\r\nprint(8 if rows == cols == 8 else rows + cols)", "t = [input().count('B') for i in range(8)]\r\nprint(min(t) % 8 + t.count(8))", "chess = []\r\nstrokes = 0\r\nfilled = True\r\nfor i in range(8):\r\n row = input()\r\n if row.count('W') == 0:\r\n strokes += 1\r\n elif filled:\r\n filled = False\r\n strokes += row.count('B')\r\nprint(strokes)\r\n", "n = 8\nchess = []\nfor _ in range(n):\n chess.append(input())\nrow, col = 0, 0\nfor i in range(n):\n f, cnt = 0, 0\n for j in range(n):\n if chess[i][j] == 'B':\n cnt += 1\n else:\n f = 1\n if f == 0:\n row += 1\n else:\n col = cnt\nprint(row + col)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\ng = []\r\nst = set()\r\nx = ''\r\nc = 0\r\nz1 = []\r\nfor i in range(8):\r\n s = STR()\r\n if len(set(s)) == 1 and s[0] == 'B':\r\n c+=1\r\n z1.append(i)\r\n for i in s :\r\n x = i\r\n st.add(i)\r\n g.append(s)\r\n\r\nif len(st) == 1 and x == 'B':\r\n print(8)\r\n exit(0)\r\n\r\nif len(st) == 1 and x == 'W':\r\n print(0)\r\n exit(0)\r\n\r\nz2 = []\r\nfor i in range(8):\r\n for j in range(8):\r\n if g[i][j] == 'B' :\r\n if len(z2) == 0 and len(z1) == 0 :\r\n c+=1\r\n z2.append(j)\r\n else:\r\n if i in z1 or j in z2 :\r\n continue\r\n else:\r\n c+=1\r\n z2.append(j)\r\n\r\n#print(z2)\r\nprint(c)\r\n\r\n\r\n", "def main():\n field, res = [c == 'B' for _ in range(8) for c in input()], 0\n for i in range(0, 64, 8):\n if all(field[i:i + 8]):\n field[i:i + 8] = [False] * 8\n res += 1\n for i in range(8):\n if any(field[i::8]):\n field[i::8] = [False] * 8\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "row, col = 0, 0\r\nfor i in range(8):\r\n s = input()\r\n ans = 0\r\n for it in s:\r\n if it == 'B':\r\n ans += 1\r\n if ans == 8:\r\n row += 1\r\n else:\r\n col = ans\r\nprint (row+col)", "board = [[0]*8]*8\n\nfor i in range(8):\n aux = input()\n for j in range(8):\n board[i] = aux\n\ncount = 0\nfor i in board:\n if i.count('B') == 8:\n count += 1\n\nif count == 8:\n print(8)\n exit(0)\n\nfor i in range(8):\n aux_count = 0\n for j in range(8):\n if board[j][i] == 'B':\n aux_count += 1\n if aux_count == 8:\n count += 1\n\nprint(count)\n\n# 1512827419058\n", "r=0\r\nc=0\r\nfor _ in range(8):\r\n\ta=input()\r\n\ts=a.count('B')\r\n\tif s==8:\r\n\t\tr+=1\r\n\telif c==0:\r\n\t\tc=s\r\nprint(c+r)", "def solve(m):\r\n\tvert = 0\r\n\thor = 0\r\n\tfor i in range(8):\r\n\t\tis_vert = True\r\n\t\tis_hor = True\r\n\t\tfor j in range(8):\r\n\t\t\tif m[i][j] != 'B':\r\n\t\t\t\tis_hor = False\r\n\t\t\tif m[j][i] != 'B':\r\n\t\t\t\tis_vert = False\r\n\r\n\t\tif is_vert:\r\n\t\t\tvert = vert + 1\r\n\t\tif is_hor:\r\n\t\t\thor = hor + 1\r\n\r\n\treturn vert + hor if hor != 8 or hor != vert else hor\r\n\r\nboard = []\r\n\r\nfor i in range(8):\r\n\tboard.append(input())\r\n\r\nprint(solve(board))\r\n", "import math\r\n\r\n__author__ = 'Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n list_matrix = list()\r\n rows = 0\r\n col = 0\r\n for i in range(8):\r\n linea = input()\r\n linea = linea.replace(\"W\",\"0\")\r\n linea = linea.replace(\"B\",\"1\")\r\n lista = list(linea)\r\n lista = list(map(int,lista))\r\n if (sum(lista)== 8):\r\n rows = rows + 1\r\n else:\r\n col = sum(lista)\r\n print(rows + col)\r\n", "board = [input(), input(), input(), input(), input(), input(), input(), input()]\nrow_count = 0\ncol_count = 0\ncol_index = []\n\n\ndef return_index(ele, inp):\n rslt = []\n for i in range(len(inp)):\n if inp[i] == ele:\n rslt.append(i)\n\n return rslt\n\n\nfor row in board:\n if row == 'BBBBBBBB':\n row_count += 1\n else:\n if 'B' in row:\n arr = return_index('B', row)\n for i in arr:\n if i not in col_index:\n col_index.append(i)\n col_count += 1\n\nprint(col_count+row_count)\n\n", "# cook your dish here\r\nl=[]\r\nfor _ in range(8):\r\n l.append(input().count('B'))\r\nprint(min(l)%8+l.count(8))\r\n", "chess = [input().count('B') for i in range(8)]\r\nprint(chess.count(8)+min(chess)%8)", "l = [];o=[];n=0;columns_colored = []\r\nfor i in range(8):\r\n l.append(input())\r\n o.append('WWWWWWWW')\r\n\r\nfor i in range(8):\r\n count = 0\r\n if l[i] == 'BBBBBBBB':\r\n n += 1\r\n continue\r\n for j in range(8):\r\n if l[i][j] == 'B':\r\n if j not in columns_colored:\r\n n += 1\r\n columns_colored.append(j)\r\nprint(n)", "V=[input().count('B') for _ in range(8)]\ncnt=0\nfor i in V:\n if i==8:\n cnt+=1\nif min(V)!=8:\n cnt+=min(V)\nprint(cnt)\n", "# LUOGU_RID: 119297730\na = 0\r\nb = 0\r\n\r\nfor _ in range(8):\r\n n = input().count('B')\r\n if n < 8:\r\n b = n\r\n else:\r\n a += 1\r\n\r\nprint(a + b)", "a=True\r\nc=0\r\nfor i in range(8):\r\n x=input()\r\n if 'W' not in x:\r\n c+=1\r\n elif a:\r\n for i in x:\r\n if i=='B':\r\n c+=1\r\n a=False\r\nprint(c)", "x = y = 0\r\n\r\nfor _ in range(8):\r\n n = input().count('B')\r\n if n < 8:\r\n y = n\r\n else:\r\n x += 1\r\n\r\nprint(x+y)", "k=0\r\nv=True\r\nfor i in range(8):\r\n s=input()\r\n if s=='BBBBBBBB':\r\n k+=1\r\n else:\r\n if v:\r\n k+=s.count('B')\r\n v=False\r\nprint(k)\r\n", "s,p=[],['']*8\r\nfor i in range(8):\r\n s.append(input())\r\n for j in range(8):p[j]+=s[i][j]\r\na,b=s.count('BBBBBBBB'),p.count('BBBBBBBB')\r\nprint(8if(a==8)else(a+b))", "counter = 0\r\ncolumns_counted = False\r\nfor i in range(8):\r\n row = input()\r\n if row == 'B' * 8:\r\n counter += 1\r\n elif not columns_counted:\r\n counter += row.count('B')\r\n columns_counted = True\r\nprint(counter)\r\n", "count = 0\r\ncolumns = [\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]\r\nfor _ in range(8):\r\n line = input()\r\n if \"W\" not in line:\r\n count += 1\r\n for index, character in enumerate(line):\r\n columns[index] += character\r\nfor column in columns:\r\n if \"W\" not in column:\r\n count += 1\r\nprint(8 if count == 16 else count)\r\n", "x = 0\r\nl =[]\r\nfor i in range(8):\r\n t = input()\r\n if t == 'BBBBBBBB':\r\n x+=1\r\n continue\r\n l.append(t)\r\nif l == []:\r\n print(8)\r\nelse:\r\n d = l[0]\r\n for i in d:\r\n if i == 'B':\r\n x+=1\r\n print(x)", "l,l2,count=[],[],0\r\nb,w= 'BBBBBBBB', 'WWWWWWWW'\r\nfor _ in range(8):\r\n l.append(input())\r\nfor i in range(8):\r\n if l[i] == b:\r\n count+=1\r\n l[i]= w\r\nfor i in range(8):\r\n c = [x[i] for x in l]\r\n l2.append(c)\r\nfor col in l2:\r\n if 'B' in col:\r\n count+=1\r\nprint(count)", "ln=8\r\nwc='W'\r\nbc='B'\r\n\r\ndef ss(s,pos,ns):\r\n\treturn s[:pos]+ns+s[pos+1:]\r\n\r\ndef ish(s,cl):\r\n\tcl=wc if cl==bc else bc\r\n\tfor c in s:\r\n\t\tif c==cl:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\t\r\ndef isv(v,x,cl):\t\r\n\tcl=wc if cl==bc else bc\r\n\tfor c in range(ln):\r\n\t\tif v[c][x]==cl:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\t\r\ndef pth(v,z,cl):\r\n\t\tv[c]=ln*cl\r\n\t\t\r\ndef ptv(v,x,cl):\r\n\tfor c in range(ln):\r\n\t\tv[c]=ss(v[c],x,cl)\r\n\r\nv=[]\r\nfor c in range(ln):\r\n\ts=input()\r\n\tv.append(s)\r\npv=[x for x in ln*[ln*wc]]\r\nres=0\r\nfor c in range(ln):\r\n\tif ish(v[c],bc) and not ish(pv[c],bc):\r\n\t\tpth(pv,c,bc)\r\n\t\tres+=1\r\nfor c in range(ln):\r\n\tif isv(v,c,bc) and not isv(pv,c,bc):\r\n\t\tptv(pv,c,bc)\r\n\t\tres+=1\r\nprint(res)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 25 08:47:55 2021\r\n\r\n@author: Usuario\r\n\"\"\"\r\n\r\nfilas = 0\r\ncolumnas = 0 \r\ntotal_lineas = 0\r\n\r\nmatriz = list()\r\nfor i in range(8):\r\n matriz.append(list(input()))\r\n \r\nfor i in range(8):\r\n nb = 0\r\n for j in range(8):\r\n if matriz[i][j] == 'B':\r\n nb = nb + 1\r\n else:\r\n break;\r\n if nb == 8:\r\n filas = filas + 1\r\n\r\nif filas == 8:\r\n print(8)\r\nelse:\r\n for j in range(8):\r\n nb = 0\r\n for i in range(8):\r\n if matriz[i][j] == 'B':\r\n nb = nb + 1\r\n else:\r\n break;\r\n if nb == 8:\r\n columnas = columnas + 1\r\n total_lineas = filas + columnas\r\n print(total_lineas) ", "#!/usr/bin/env python3\n\ngrid = [input() for _ in range(8)]\nresult = grid.count('B'*8)\ngrid = [''.join(l) for l in zip(*grid)]\nresult += grid.count('B'*8)\nresult = 8 if result == 16 else result\nprint(result)", "ans = 0\r\nmet = False\r\nfor i in range(8):\r\n line = input()\r\n if line == \"BBBBBBBB\":\r\n ans += 1\r\n elif not met:\r\n ans += line.count(\"B\")\r\n met = True\r\n\r\nprint(ans)\r\n", "m1 = []\nm2 = [\"\" for i in range(8)]\nfor i in range(8):\n row = input()\n m1.append(row)\n for j in range(8):\n m2[j] += row[j]\ncnt1 = m1.count(\"B\" * 8)\ncnt2 = m2.count(\"B\" * 8)\nif cnt1 == 8:\n print(8)\nelse:\n print(cnt1 + cnt2)", "chess_board = []\r\nn = 8\r\ncount = 0\r\ndiagonal = ''\r\ncount_B = 0\r\nwhile n:\r\n chess_board.append(input())\r\n diagonal += chess_board[-1][8 - n]\r\n count_B += chess_board[-1].count('B')\r\n n -= 1\r\nif diagonal == 'BBBBBBBB'and count_B == 64:\r\n count = 8\r\nelse:\r\n for i in range(8):\r\n if diagonal[i] == 'B':\r\n if chess_board[i] == 'BBBBBBBB':\r\n count += 1\r\n painted = 1\r\n for j in range(8):\r\n if chess_board[j][i] != 'B':\r\n painted = 0\r\n break\r\n if painted:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "def isFull():\r\n\tfor i in rows:\r\n\t\tif i != 'BBBBBBBB':\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nrows = []\r\nfor i in range(8):\r\n\trows.append(input())\r\n\r\nif isFull():\r\n\tprint(8)\r\n\texit(0)\r\n\r\ncolumns = []\r\nfor i in range(8):\r\n\ts = ''\r\n\tfor c in rows:\r\n\t\ts += c[i]\r\n\tcolumns.append(s)\r\n\r\nstrokes = 0\r\n\r\nfor i in rows:\r\n\tif i == 'BBBBBBBB':\r\n\t\tstrokes += 1\r\n\r\nfor i in columns:\r\n\tif i == 'BBBBBBBB':\r\n\t\tstrokes += 1\r\n\r\nprint(strokes)", "\"\"\"\nCodeforces\n7A - Kalevitch and Chess\nhttp://codeforces.com/contest/7/problem/A\n\nHéctor González Belver\n../07/2018\n\"\"\"\nimport sys\n\ndef main():\n chessboard = [line.strip() for line in sys.stdin.readlines()]\n\n count = len([row for row in chessboard if row == 'B' * 8])\n if count < 8:\n count += len([column for column in (''.join(c) for c in zip(*chessboard)) if column == 'B' * 8])\n\n sys.stdout.write(str(count) + '\\n') \n\nif __name__ == '__main__': \n main()", "paint = 0\r\ncolumn = [\"\"] * 8\r\n\r\nfor n in range(8):\r\n row = input()\r\n paint += (\"W\" not in row)\r\n for i in range(8):\r\n column[i] += row[i]\r\n\r\nfor c in column:\r\n paint += (\"W\" not in c)\r\n\r\nif paint == 16:\r\n paint = 8\r\n\r\nprint(paint)\r\n", "grid = []\nfor i in range(8):\n grid.append(input().strip())\n\nnum_rows = 0\nnum_cols = 0\n\ndef all_Bs(line):\n for c in line:\n if c != 'B':\n return False\n return True\n\ndef all_Bs_column(index):\n for i in range(8):\n if grid[i][index] != 'B':\n return False\n return True\n\nfor line in grid:\n if all_Bs(line):\n num_rows += 1\n\nfor i in range(8):\n if all_Bs_column(i):\n num_cols += 1\n\nresult = num_rows + num_cols\nif result == 16:\n print(8)\nelse:\n print(result)\n", "x=y=0\nfor _ in range(8):\n n = input().count('B')\n\n if n<8:\n y=n\n else:\n x+=1\nprint(x+y)", "a = [0] * 8\nk = 0\nfor _ in range(8):\n\ti = input()\n\tif i == 'B'*8: k += 1\n\telse:\n\t\tfor e in range(8):\n\t\t\tif i[e] == 'B':\n\t\t\t\ta[e] = 1\nprint(k + sum(a))", "inp = []\r\nstroke = 0\r\nfor i in range(8):\r\n inp.append(input())\r\n\r\n\r\ndef count(inp):\r\n stroke = 0\r\n for key, val in enumerate(inp[0]):\r\n if val == \"B\":\r\n flag = True\r\n for i in range(7):\r\n if inp[i+1][key] == \"W\":\r\n flag = False\r\n break\r\n if flag:\r\n stroke += 1\r\n\r\n if stroke == 8:\r\n return 8\r\n\r\n for i in inp:\r\n if \"B\" in i:\r\n if \"W\" not in i:\r\n stroke += 1\r\n\r\n return stroke\r\n\r\n\r\nprint(count(inp))\r\n", "a=[]\r\nans=0\r\nfor i in range(8):\r\n temp=input()\r\n a.append(temp)\r\n if(temp==\"BBBBBBBB\"):\r\n ans+=1 \r\n\r\nif(ans<8):\r\n for i in range(8):\r\n x=0\r\n for j in range(8):\r\n if(a[j][i]==\"B\"):\r\n x+=1\r\n else:\r\n break\r\n if(x==8):\r\n ans+=1\r\nprint(ans)\r\n\r\n", "a = []\r\nfor i in range(0, 8):\r\n a.append(input())\r\nt1 = 0\r\nt2 = 0\r\nfor i in range(0, 8):\r\n if a[i].count('B') == 8:\r\n t1 += 1\r\n else:\r\n t2 = a[i].count('B')\r\nprint(t1+t2)", "a = []\nverts = [0] * 8\nhors = [0] * 8\nfor i in range(8):\n\ta.append(input())\n\thors[i] = sum(x == 'B' for x in a[-1])\nfor i in range(8):\n\tverts[i] = sum(x[i] == 'B' for x in a)\nif hors == [8] * 8 and verts == [8] * 8:\n\tprint(8)\nelse:\n\tprint(sum(x == 8 for x in verts) + sum(x == 8 for x in hors))\n", "#First count the horizonatal rows. and then check the columns:?\r\ndef count():\r\n M=[]\r\n for i in range(8):\r\n x=input()\r\n M.append(x)\r\n c=0\r\n mark=[]\r\n for i in range(len(M)):\r\n if M[i]=='B'*8:\r\n c+=1\r\n mark.append(i)\r\n for i in range(8):\r\n if i not in mark:\r\n for j in M[i]:\r\n if j=='B':\r\n c+=1\r\n break\r\n\r\n print(c)\r\ncount()\r\n", "l=[]\ncount=0\nfor i in range(8):\n l.append(input())\nfor i in range(8):\n b=[]\n if l[i]==\"BBBBBBBB\":\n count+=1\n for j in range(8):\n if l[j][i]=='W':\n break\n else:\n b.append(l[j][i])\n if len(b)==8:\n count+=1\nif count==16:\n print(8)\nelse:\n print(count)\n", "a = []\r\nfor i in range(8):\r\n a.append(list(input()))\r\nb = []\r\nfor i in range(8):\r\n t = []\r\n for j in range(8):\r\n t.append(a[j][i])\r\n b.append(t)\r\nans = 0\r\ntt = ['B','B','B','B','B','B','B','B']\r\nfor i in range(8):\r\n if(a[i] == tt):\r\n ans+=1\r\nif(ans==8):\r\n print(8)\r\n exit()\r\nfor i in range(8):\r\n if(b[i]==tt):\r\n ans+=1\r\n\r\nprint(ans)", "m = []\n\nfor i in range(8):\n s = input()\n m.append( [s[j] for j in range(len(s))] )\n\nl = []\nc = []\ncheck = 0\n\nfor i in range(8):\n check = 0\n for j in range(8):\n if m[i][j] == 'B':\n check += 1\n if check == 8:\n l.append(i)\n\nfor j in range(8):\n check = 0\n for i in range(8):\n if m[i][j] == 'B':\n check += 1\n if check == 8:\n c.append(j)\n\nif len(c) == 8 or len(l) == 8:\n print(8)\nelse:\n print(len(c) + len(l))\n", "a = []\nfor _ in range(8):\n b = str(input())\n a.append(b)\nans = 0\nfor i in range(8):\n horizontal = True\n vertical = True\n for j in range(8):\n if a[i][j] == 'W':\n horizontal = False\n if a[j][i] == 'W':\n vertical = False\n if horizontal: ans+=1\n if vertical: ans+=1\nif ans==16: ans=8\nprint(ans)\n", "import math\n\nhave = [['W' for i in range(8)] for x in range(8)]\n\ndef paintcol(x):\n for row in range(8):\n have[row][x] = 'B'\n\ndef paintrow(x):\n for col in range(8):\n have[x][col] = 'B'\n\nwant = list()\nfor i in range(8):\n want.append(list(input()))\n\n\nres = 0\nfor row in range(8):\n count = 0\n for col in range(8):\n if want[row][col] == 'B': count+=1\n if count == 8:\n res+=1\n paintrow(row)\n\nfor col in range(8):\n good = True\n for row in range(8):\n if want[row][col] != have[row][col]: good = False\n if not good:\n res+=1\n paintcol(col)\n\nprint(res)", "c = []\r\ns = 0\r\nf = 0\r\nfor i in range(8):\r\n c.append(list(input()))\r\nfor i in c:\r\n if \"W\" not in i:\r\n s += 1\r\n else:\r\n if f == 0:\r\n s += i.count(\"B\")\r\n f += 1\r\nprint(s)\r\n", "NumberOfRows = 8\r\nFullRow = \"BBBBBBBB\"\r\n\r\ncount = 0\r\n\r\nfor i in range(NumberOfRows):\r\n row = input()\r\n if row == FullRow:\r\n count += 1\r\n else:\r\n notFullRow = row\r\n\r\nif not (count == NumberOfRows):\r\n for c in notFullRow:\r\n if c == 'B':\r\n count += 1\r\n\r\nprint(count)", "a=[]\r\nfor _ in range(8):\r\n a.append(input())\r\nx=0\r\nfor i in a:\r\n if i=='BBBBBBBB':\r\n x+=1\r\nif x==8:\r\n print(8)\r\n exit()\r\n\r\nfor i in range(8):\r\n q=True\r\n for j in range(8):\r\n if a[j][i]=='W':\r\n q=False\r\n if q:\r\n x+=1\r\nprint(x)\r\n \r\n", "br = [input() for i in range(8)]\r\nbc = [''.join(r[j] for r in br) for j in range(8)]\r\nv = br.count('B' * 8) + bc.count('B' * 8)\r\nprint(v if v < 16 else 8)", "# -*- coding: utf-8 -*-\r\n\r\na = [input().count('B') for i in range(8)]\r\n\r\nif min(a) != 8: print(min(a) + a.count(8))\r\nelse: print(a.count(8))\r\n\r\n", "board = []\nstrokes = 0\nchecked = False\n\nfor i in range(8):\n row = list(input())\n board.append(row)\n\nfor r in board:\n count = 0\n for c in r:\n if (c == 'B'):\n count += 1\n if (count == 8):\n strokes += 1\n elif (count > 0 and not checked):\n checked = True\n strokes += count\n\nprint(strokes)\n", "import cmath\r\nd={}\r\nc=0;ans=0;\r\nfor i in range (1,9) :\r\n x=list(\"0\"+input());\r\n if \"W\" in x:\r\n c=1\r\n else :\r\n ans=ans+1\r\n for j in range (1,9) :\r\n z=complex(i,j)\r\n d[z]=x[j]\r\nif (c==0):\r\n exit (print(\"8\"))\r\nfor i in range (1,9):\r\n w=0\r\n for j in range (1,9):\r\n if d[complex(j,i)]==\"B\" :\r\n w=w+1\r\n if (8==w):\r\n ans=ans+1\r\nprint(ans) ", "n = [input().count('B') for i in range(8)]\nprint(n.count(8) + min(n)%8)\n \t \t \t \t\t\t \t\t\t \t \t \t\t \t", "brd = [input() for _ in range(8)]\r\n\r\nans = 0\r\nfor i in range(8):\r\n if brd[i] == 'B' * 8:\r\n ans += 1\r\n if set([x[i] for x in brd]) == {'B'}:\r\n ans += 1\r\n\r\nif ans == 16:\r\n ans = 8\r\n\r\nprint(ans)\r\n", "s1 = set([_ for _ in range(8)])\r\ns2 = set([_ for _ in range(8)])\r\nfor i in range(8):\r\n line = input()\r\n for j in range(8):\r\n if line[j] == 'W' :\r\n s1.discard(i)\r\n s2.discard(j)\r\nans = len(s1) + len(s2)\r\nprint(ans if not ans == 16 else 8)", "\r\n\r\n\r\nt=[]\r\n\r\nh=0\r\n\r\nfor k in range(8):\r\n f=list(input())\r\n t.append(f)\r\n if f.count('W')==0:\r\n h+=1\r\n \r\n\r\n\r\ny=[]\r\n\r\n\r\n\r\nif h==8:\r\n print(8)\r\nelse:\r\n for u in range(8):\r\n x=[]\r\n for j in range(8):\r\n x.append(t[j][u])\r\n y.append(x)\r\n\r\n d=0\r\n\r\n for i in t:\r\n if i.count('W')==0:\r\n d+=1\r\n\r\n\r\n for j in y:\r\n if j.count('W')==0:\r\n d+=1\r\n\r\n\r\n\r\n\r\n print(d)\r\n \r\n", "ans, s, n, met = 0, '', 8, False\r\n\r\nwhile n > 0:\r\n s = input()\r\n if s == 'BBBBBBBB':\r\n ans += 1\r\n elif not met:\r\n ans += s.count('B')\r\n met = True\r\n n -= 1\r\n\r\nprint(ans)\r\n", "def main():\r\n N = 8\r\n array = [[False for _ in range(N)] for _ in range(N)]\r\n\r\n for row in range(N):\r\n line = input().strip()\r\n for col in range(N):\r\n if line[col] == 'B':\r\n array[row][col] = True\r\n\r\n total = 2 * N\r\n\r\n for row in range(N):\r\n for col in range(N):\r\n if not array[row][col]:\r\n total -= 1\r\n break\r\n\r\n for col in range(N):\r\n for row in range(N):\r\n if not array[row][col]:\r\n total -= 1\r\n break\r\n\r\n if total == 2 * N:\r\n total = N\r\n\r\n print(total)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "matrix=[]\r\nfor i in range(8):\r\n matrix.append(input())\r\nh=[]\r\nr=[]\r\nfor i in range(8):\r\n for j in range(8):\r\n if matrix[i][j]=='B':\r\n if 'W' in matrix[i]:\r\n if j not in h:\r\n h.append(j)\r\n else:\r\n if i not in r:\r\n r.append(i)\r\nprint(len(h)+len(r))", "coloums = [[] for i in range(8)]\r\nrows = [[] for i in range(8)]\r\n\r\nfor i in range(8):\r\n line = input()\r\n rows[i] = list(line)\r\n for j in range(8):\r\n coloums[j].append(line[j])\r\n\r\nresult = 0\r\n\r\nfor i in rows:\r\n if 'W' not in i:\r\n result += 1\r\n\r\nfor i in coloums:\r\n if 'W' not in i:\r\n result += 1\r\n\r\nif result == 16:\r\n result = 8\r\n\r\nprint(result)\r\n\r\n", "\r\n\r\nS = []\r\nfor i in range(8):\r\n\ts = input()\r\n\tS.append(s)\r\n\r\n\r\nsatr_B = 0\r\nustun_B = 0\r\n\r\nfor i in range(8):\r\n\tif(S[i].count(\"B\") == 8):\r\n\t\tsatr_B += 1\r\n\r\nif(satr_B == 8):\r\n\tprint(8)\r\nelse:\r\n\tfor i in range(8):\r\n\t\tt = True\r\n\t\tfor j in range(8):\r\n\t\t\tif(S[j][i] == 'W'):\r\n\t\t\t\tt = False\r\n\t\t\t\tbreak\r\n\t\tif(t):\r\n\t\t\tustun_B += 1\r\n\tprint(ustun_B+satr_B)\r\n\r\n", "a = []\r\nfor i in range(8):\r\n a.append(input())\r\n\r\nr, c = set(), set()\r\nfor i in range(8):\r\n for j in range(8):\r\n if(a[i][j] == \"W\"):\r\n r.add(i)\r\n c.add(j)\r\n\r\nanswer = 16 - len(r) - len(c)\r\nif(answer == 16):\r\n answer = 8\r\nprint(answer)", "s, m = 0, 0\r\nfor i in range(8):\r\n t = input()\r\n if t == 'BBBBBBBB': s += 1\r\n else: m = max(m, t.count('B'))\r\nprint(s + m if m != 8 else s)", "\"\"\"\nProgram for solution problem 7A\n\n\"\"\"\n\n\ndef parse_input():\n \"\"\"\n Read 8 lines for problem\n :return:\n \"\"\"\n temp_string = []\n for i in range(8):\n temp_string.append([x for x in input()])\n return temp_string\n\n\ndef transform_matrix(input_matrix):\n \"\"\"\n Function for transform matrix from letters to digits\n W -> 1\n B -> 0\n :param input_matrix:\n :return output_matrix:\n \"\"\"\n output_matrix = []\n for i in range(8):\n temp_row_matrix = []\n for j in range(8):\n if input_matrix[i][j] == 'W':\n temp_row_matrix.append(1)\n else:\n temp_row_matrix.append(0)\n output_matrix.append(temp_row_matrix)\n return output_matrix\n\n\ndef counting_lines(input_strigs):\n \"\"\"\n Function counting cells for not art,\n and if all cells in row or col then this\n ros or col may art\n But if all cells in rows and cols will be art\n then may only 8 lines for art matrix.\n :param input_strigs:\n :return count_lines for art:\n \"\"\"\n count_lines_for_art = 0\n # count digit 0 in rows\n for i in range(8):\n count_w_in_row = 0\n for j in range(8):\n count_w_in_row += input_strigs[i][j]\n if count_w_in_row == 0:\n count_lines_for_art += 1\n # count digit 0 in cols\n for j in range(8):\n count_w_in_col = 0\n for i in range(8):\n count_w_in_col += input_strigs[i][j]\n if count_w_in_col == 0:\n count_lines_for_art += 1\n if count_lines_for_art == 16:\n return 8\n else:\n return count_lines_for_art\n\n\nif __name__ == '__main__':\n count_lines = counting_lines(transform_matrix(parse_input()))\n print(count_lines)\n", "n = 8\r\nrows = []\r\nfor i in range(n):\r\n rows.append(input())\r\n\r\nans = 0\r\nminCount = 0\r\nfor i in rows:\r\n if i.count(\"B\") == n:\r\n ans += 1\r\n else:\r\n minCount = i.count('B')\r\nprint(ans + minCount)", "l=[]\r\na=0\r\nh=[]\r\nv=[]\r\nfor i in range(8):\r\n l.append(list(input()))\r\nfor j in range(len(l)):\r\n if l[j]==list(\"BBBBBBBB\"):\r\n a+=1\r\n h.append(j)\r\n \r\n else:\r\n for k in range(len(l[j])):\r\n if l[j][k]==\"B\":\r\n if k not in v:\r\n v.append(k)\r\na+=len(v)\r\nprint(a)", "board = []\r\nspecial = True\r\nfor i in range (8):\r\n row = list (input ())\r\n board.append (row)\r\n if 'W' in row:\r\n special = False\r\nif special:\r\n print (8)\r\nelse:\r\n hor = [1] * 8\r\n ver = [1] * 8\r\n for i, row in enumerate (board):\r\n for j, cell in enumerate (row):\r\n if cell == 'W':\r\n hor [i] = 0\r\n ver [j] = 0\r\n num = sum (hor) + sum (ver)\r\n print (num)", "matrix = list()\r\nresult = 0\r\nfor x in range(8):\r\n matrix.append(input())\r\n if (matrix[x].count('B') == 8):\r\n result += 1\r\nif result < 8:\r\n for x in range(8):\r\n count = 0\r\n for y in range(8):\r\n if matrix[y][x] == 'B':\r\n count += 1\r\n if count == 8:\r\n result += 1\r\nprint(result)", "#! /usr/bin/env python3\n\nimport itertools\nimport sys\n\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n board = parse(data)\n output = calc_board(board)\n print(output)\n\n\ndef parse(data):\n return tuple(\n tuple(c == 'B' for c in line.rstrip())\n for line in data\n )\n\n\ndef calc_board(board):\n horiz_strike = [True for _ in range(8)]\n vert_strike = [True for _ in range(8)]\n for i, line in enumerate(board):\n for j, c in enumerate(line):\n if not c:\n horiz_strike[i] = False\n vert_strike[j] = False\n\n if all(horiz_strike) or all(vert_strike):\n return 8\n else:\n return sum(horiz_strike) + sum(vert_strike)\n \n\nif __name__ == '__main__':\n main()\n", "board = []\r\nrowVals = [1]*8\r\ncolVals = [1]*8\r\n\r\nfor row in range(0, 8):\r\n\tline = input().strip()\r\n\tcol = 0\r\n\tfor char in line:\r\n\t\tif char == 'W':\r\n\t\t\trowVals[row] = 0\r\n\t\t\tcolVals[col] = 0\r\n\t\tcol += 1\r\ntotal = 0\r\nfor row in rowVals:\r\n\tif row == 1:\r\n\t\ttotal += 1\r\nfor col in colVals:\r\n\tif col == 1:\r\n\t\ttotal += 1\r\n\r\nif total == 16:\r\n\tprint(8)\r\nelse:\r\n\tprint(total)\r\n\r\n", "field = [input() for i in range(8)]\r\nrows = sum(all(x == 'B' for x in row) for row in field)\r\ncols = sum(all(field[i][j] == 'B' for i in range(8)) for j in range(8))\r\nif rows == 8:\r\n print(8)\r\nelse:\r\n print(rows + cols)\r\n", "chessboard = []\r\nfor row in range(8):\r\n chessboard.append(list(input()))\r\n\r\nrow = 0\r\ncol = 0\r\n\r\nfor r in range(8):\r\n col_num = 0\r\n for c in range(8):\r\n if chessboard[r][c] == 'B':\r\n col_num += 1\r\n if col_num == 8:\r\n row += 1\r\n else:\r\n col = col_num\r\nprint(row + col)", "c = [input() for _ in range(8)]\r\n\r\nh = sum(all(c[_][i] == 'B' for i in range(8)) for _ in range(8))\r\n\r\nv = sum(all(c[i][_] == 'B' for i in range(8)) for _ in range(8))\r\n\r\nif h == 8 or v == 8:\r\n\tprint(8)\r\nelse:\r\n\tprint(h + v)\r\n", "import sys\r\nimport collections as c\r\n\r\na = []\r\nfor s in sys.stdin:\r\n if(s == '\\n'):\r\n break\r\n a.append((s[:-1]).count(\"B\"))\r\n \r\n \r\nprint(min(a)%8 + a.count(8))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = [list(input().rstrip()) for _ in range(8)]\r\nn = 16\r\npow2 = [1]\r\nfor _ in range(n):\r\n pow2.append(2 * pow2[-1])\r\nans = n\r\nfor i in range(pow2[n]):\r\n s0 = [[87] * 8 for _ in range(8)]\r\n c = 0\r\n for j in range(8):\r\n if i & pow2[j]:\r\n c += 1\r\n for k in range(8):\r\n s0[j][k] = 66\r\n for j in range(8, n):\r\n if i & pow2[j]:\r\n c += 1\r\n for k in range(8):\r\n s0[k][j - 8] = 66\r\n ok = 1\r\n for j in range(8):\r\n for k, l in zip(s[j], s0[j]):\r\n if k ^ l:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\n if ok:\r\n ans = min(ans, c)\r\nprint(ans)", "a=['']*8\r\nfor i in range(8):\r\n a[i]=input()\r\na=list(map(lambda a: a.count('B'),a))\r\nb=set(a)\r\nc=0\r\nfor i in b:\r\n if i==8:\r\n c+=a.count(8)\r\n else:\r\n c+=i\r\nprint(c)", "\r\nb=[['B'for j in range(8)] for i in range(8)]\r\n\r\nwb=[[x for x in input()] for i in range(8)]\r\n\r\n\r\ns=0\r\n\r\nfor i in range(8):\r\n if b[i] == wb[i]:\r\n s+=1\r\nif s!=8:\r\n for i in range(8):\r\n r=0\r\n for j in range(8):\r\n if b[j][i] == wb[j][i]:\r\n r+=1\r\n if r==8:\r\n s+=1\r\n\r\nprint(s)\r\n", "a,s=[],0\r\nfor i in range(8):\r\n b=list(input())\r\n if b.count('W')==0:s=s+1\r\n a.append(b)\r\nif s==8:print(s)\r\nelse:\r\n k=a[0].count('B')\r\n for i in range(len(a)):\r\n if a[i].count('B')<k:k=a[i].count('B')\r\n print(s+k)", "brd = [input() for i in range(8)]\r\n\r\nans = 0\r\nfor i in range(8):\r\n if all([brd[i][j] == \"B\" for j in range(8)]):\r\n ans += 1\r\n if all([brd[j][i] == \"B\" for j in range(8)]):\r\n ans += 1\r\n\r\nif ans == 16:\r\n ans = 8\r\n\r\nprint(ans)\r\n", "m = 0\r\nt = 0\r\nfor i in range(8):\r\n n = input()\r\n if n == 'BBBBBBBB':\r\n m += 1\r\n elif t == 0:\r\n t = 1\r\n m += n.count('B')\r\n else:\r\n pass\r\nprint(m)\r\n", "def CF_7A():\r\n board=[]\r\n ans=0\r\n for i in range(0,8):\r\n board.append(' '.join(input()).split())\r\n for i in range(0,8):\r\n if board[i]==['B']*8:\r\n ans+=1\r\n for j in range(0,8):\r\n flag=1\r\n for i in range(0,8):\r\n if board[i][j] != 'B':\r\n flag=0\r\n break\r\n if flag==1:\r\n ans+=1\r\n if ans==16:\r\n ans=8\r\n print(ans)\r\n return\r\n \r\n \r\nCF_7A()", "import sys\r\n\r\nrow_white = [False] * 8\r\ncol_white = [False] * 8\r\nboard = []\r\ncount = 0\r\n\r\nfor line in sys.stdin:\r\n chars = list(line[:len(line) - 1])\r\n board.append(chars)\r\n\r\nfor i in range(len(row_white)):\r\n for j in range(len(col_white)):\r\n if board[i][j] == 'W':\r\n row_white[i] = True\r\n col_white[j] = True \r\n\r\nfor white in row_white:\r\n if not white:\r\n count += 1\r\n\r\nfor white in col_white:\r\n if not white:\r\n count += 1\r\n\r\nif count == 16:\r\n count = 8\r\n\r\nprint(count)", "class A:\n\n def solve(self):\n board = []\n for i in range(8):\n board.append(input())\n\n painted_black = [[0 for i in range(8)] for j in range(8)]\n\n strokes = 0\n for i in range(8):\n if len(set(board[i])) == 1 and 'B' in set(board[i]):\n strokes += 1\n painted_black[i] = [1 for i in range(8)]\n\n for i in range(8):\n if len(set([board[x][i] for x in range(8)])) == 1 and \\\n 'B' in set([board[x][i] for x in range(8)]) and \\\n 0 in set([painted_black[x][i] for x in range(8)]):\n strokes += 1\n\n print(strokes)\n\nA().solve()\n", "c = []\r\nfor i in range(8):\r\n c.append(input().count('B'))\r\n\r\nprint(min(c) % 8 + c.count(8))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ng = [input()[:-1] for _ in range(8)]\r\nw = list(map(''.join, zip(*g)))\r\nB = 'BBBBBBBB'\r\nc = 0\r\nfor i in g:\r\n if i == B:\r\n c += 1\r\n\r\nfor i in w:\r\n if i == B:\r\n c += 1\r\nif c == 16:\r\n c = 8\r\nprint(c)", "chessboard_list1 = []\r\nchessboard_list2 = []\r\nfor i in range(8):\r\n row = input()\r\n chessboard_list1.append(row)\r\n\r\nfor j in range(8):\r\n l = ''\r\n for row in chessboard_list1:\r\n l += row[j]\r\n\r\n chessboard_list2.append(l)\r\nif chessboard_list1.count('BBBBBBBB') == 8:\r\n print(8)\r\nelse:\r\n sum = chessboard_list1.count('BBBBBBBB') + chessboard_list2.count('BBBBBBBB')\r\n print(sum)", "c = 0\nb = 9\nfor i in range(8):\n ec = input()\n cc = ec.count('B')\n if cc == 8:\n c += 1\n b = min(b, cc)\nif c == 8:\n print(8)\nelse:\n print(b + c)\n", "import fileinput as f\n\nr = []\nct = []\nidxcol = 0\nfor l in f.input():\n l = l.strip()\n r.append(l)\n x = sum([1 if i=='B' else 0 for i in l])\n if x ==8:\n ct.append(idxcol)\n idxcol+=1\n\ncc = []\nidxrow = 0\nfor j in range(8):\n c=[]\n for i in range(8):\n c.append(r[i][j]) \n\n x = sum([1 if i=='B' else 0 for i in c])\n\n if x ==8:\n cc.append(idxrow)\n\n idxrow += 1\n\naaa = [['' for i in range(8)] for j in range(8)]\n\nfor i in range(8):\n for j in range(8):\n aaa[i][j] = r[i][j]\n\nres = 0\nfor i in range(8):\n if i in ct and 'B' in aaa[i]:\n res+=1\n for j in range(8):\n aaa[i][j] = 'W'\n\nfor j in range(8):\n c=[]\n for i in range(8):\n c.append(aaa[i][j]) \n\n if j in cc and 'B' in c:\n res+=1\n for i in range(8):\n aaa[i][j] = 'W'\n\nprint(res)\n# 1512820251592\n", "n=[]\r\n\r\ncount=0\r\nfor i in range(8):\r\n n.append(input())\r\n \r\ncount=n.count(\"BBBBBBBB\")\r\nfor i in range(0,8):\r\n lis=[]\r\n for j in range(8):\r\n if n[j][i]=='W':\r\n break\r\n else:\r\n lis.append(n[j][i])\r\n if len(lis)==8:\r\n count+=1\r\nif(count!=16):\r\n print (count)\r\nelse:\r\n print(8)", "c = 0\r\nf = 1\r\nfor _ in range(8):\r\n s = input()\r\n if s == 'B' * 8:\r\n c += 1\r\n elif f:\r\n f = 0\r\n c += s.count('B')\r\nprint(c)\r\n", "ar=[\"\" for i in range(8)]\nk=0\nfor i in range(8):\n a=ar[i]=input()\n if a==\"BBBBBBBB\":\n k+=1\nary=[\"\" for i in range(8)]\nfor i in range(8):\n for j in range(8):\n ary[i]+=ar[j][i]\n if ary[i]==\"BBBBBBBB\":\n k+=1\nif k==16:k=8\nprint(k)\n\n\n\n\n\n", "l1=input()\r\nl2=input()\r\nl3=input()\r\nl4=input()\r\nl5=input()\r\nl6=input()\r\nl7=input()\r\nl8=input()\r\nd=[]\r\nc=0\r\nif(l1.count('B')==8 ):\r\n c+=1\r\nelse:\r\n d+=[l1.count('B')]\r\nif(l2.count('B')==8):\r\n c+=1\r\nelse:\r\n d+=[l2.count('B')] \r\nif(l3.count('B')==8):\r\n c+=1\r\nelse:\r\n d+=[l3.count('B')] \r\nif(l4.count('B')==8 ):\r\n c+=1\r\nelse:\r\n d+=[l4.count('B')]\r\n \r\nif(l5.count('B')==8 ):\r\n \r\n c+=1\r\nelse:\r\n d+=[l5.count('B')]\r\n \r\nif(l6.count('B')==8):\r\n c+=1\r\nelse:\r\n d+=[l6.count('B')] \r\nif(l7.count('B')==8 ):\r\n c+=1\r\nelse:\r\n d+=[l7.count('B')] \r\nif(l8.count('B')==8 ):\r\n c+=1\r\nelse:\r\n d+=[l8.count('B')]\r\nr=0 \r\nif(len(d)>=1):\r\n r=max(d)\r\nprint(c+r)\r\n", "board = [input() for _ in range(8)]\r\nres = 0\r\nfor i in range(8):\r\n if board[i] == \"B\"*8: res += 1\r\n col = \"\"\r\n for j in range(8):\r\n col += board[j][i]\r\n if col == \"B\"*8: res += 1\r\nif board == [\"B\"*8]*8: res = 8\r\nprint(res)", "arr = []\nrow, col = 0, 0\nfor i in range(0, 8):\n s = input()\n if s == 'BBBBBBBB':\n row += 1\n arr.append(list(s))\n\nres = 0\nif row == 8:\n res = 8\nelse:\n for j in range(0, 8):\n temp = ''\n for i in range(0, 8):\n temp += arr[i][j]\n if temp == 'BBBBBBBB':\n col += 1\n res = col + row\n\nprint(res)", "lines = []\r\nfor _ in range(8):\r\n lines.append(input())\r\nres = sum(1 for x in lines if x == 'B' * 8)\r\nres2 = 0\r\nfor j in range(8):\r\n if sum(1 for x in lines if x[j] == \"B\") == 8:\r\n res2 += 1\r\nprint(res + res2 if res < 8 and res2 < 8 else 8)", "s = 0\nt = 0\nfor i in range(8):\n\tn = input()\n\tif n == 'BBBBBBBB':\n\t\ts += 1\n\telif t == 0:\n\t\tt = 1\n\t\ts += n.count('B')\n\telse:\n\t\tpass\nprint(s)\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\na = [input().count('B') for i in range(8)]\nprint(min(a) % 8 + a.count(8))\n", "s, ans, met = \"\", 0, False\r\nfor i in range(8):\r\n s = input()\r\n if s == \"BBBBBBBB\":\r\n ans += 1\r\n elif not met:\r\n ans += s.count('B')\r\n met = True\r\n\r\nprint(ans)", "\r\nans1 = 0\r\nans2 = 0\r\ni = 0\r\nwhile i < 8:\r\n line = input()\r\n temp = line.count('B')\r\n if temp == 8:\r\n ans1 += 1\r\n else:\r\n ans2 = temp\r\n\r\n i += 1\r\n\r\nprint(ans1 + ans2)\r\n\r\n\r\n", "def main():\r\n row = [False] * 8\r\n col = [False] * 8\r\n\r\n for r in range(8):\r\n s = input()\r\n for c in range(8):\r\n if s[c] == 'W':\r\n row[r] = True\r\n col[c] = True\r\n\r\n answer = 16 - sum(row) - sum(col)\r\n if answer == 16:\r\n answer = 8\r\n\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "board = [input().split() for i in range(8)] \r\n\r\nnumberOfLines = 0\r\n\r\nfor y in range(8):\r\n if board[y] == ['BBBBBBBB']:\r\n numberOfLines += 1\r\n\r\nfor x in range(8):\r\n verticalCount = 0\r\n for y in range(8):\r\n # [down from top][0][across from left]\r\n if board[y][0][x] == 'B':\r\n verticalCount += 1\r\n if verticalCount == 8:\r\n numberOfLines +=1\r\n \r\nif numberOfLines == 16:\r\n numberOfLines = 8\r\n\r\nprint(numberOfLines)", "m=[input() for i in range(8)]\r\nr=sum([1 for i in range(8) if m[i]=='B'*8 ])\r\nc=sum([1 for i in range(8) if sum([1 for k in range(8) if m[k][i]=='B'])==8])\r\nif max(r,c)==8:print(8)\r\nelse:print(r+c)\r\n", "s = [input().count('B') for i in range(8)]\r\nprint(min(s) % 8 + s.count(8))", "from sys import stdin\n\na = stdin.read().splitlines()\n\nSwitch = 0\n\nrow = 0\n\ncolumn = 0\n\nanswer = 0\n\nfor i in range(len(a)):\n for j in range(len(a[i])):\n if a[i][j] == 'W':\n Switch = 1\n row = i\n column = j\n break\n if Switch == 1:\n break\n\nif Switch == 0:\n print(8)\nelse:\n for square in a[row]:\n if square == 'B':\n answer += 1\n for k in range(len(a[column])):\n if a[k][column] == 'B':\n answer += 1\n print(answer)\n\n\n\n", "board = []\r\nspecial = True\r\nfor i in range (8):\r\n row = list (input ())\r\n board.append (row)\r\n if 'W' in row:\r\n special = False\r\nif special:\r\n print (8)\r\nelse:\r\n horzi = [1] * 8\r\n verti = [1] * 8\r\n for i, row in enumerate (board):\r\n for j, col in enumerate (row):\r\n if col == 'W':\r\n horzi [i] = 0\r\n verti [j] = 0\r\n ans = sum (horzi) + sum (verti)\r\n print (ans)", "n = 0; m = 0; k = 0\r\nfor _ in range(8):\r\n s = input()\r\n if s == 'BBBBBBBB':\r\n n+=1\r\n else:\r\n for i in s:\r\n if i == 'B':\r\n m+=1\r\n k+=1\r\nif k == 0:\r\n ans = 8\r\nelse:\r\n ans = n + m//k\r\nprint(ans)", "board = []\nfor i in range(8):\n board.append(list(input()))\n\nrows = []\ncolumns = []\nfor i in range(8):\n for j in range(8):\n if i in rows or j in columns or board[i][j] == \"W\":\n continue\n allBlack = True\n for k in range(8):\n if board[i][k] == \"W\":\n allBlack = False\n if allBlack:\n rows.append(i)\n else:\n columns.append(j)\n\nprint(len(rows) + len(columns))\n", "\ncount = 0\ncolumn = [0,0,0,0,0,0,0,0]\ni = 0\nfor x in range(8):\n\tlinha = input()\n\t#print(linha)\n\t\n\tverify = 0\n\tfor c in linha:\n\t\tif(c == 'B'):\n\t\t\tverify += 1\n\t\t\t#print('verify {}'.format(verify))\n\tif(verify == 8):\n\t\tcount = count + 1\n\t\t#print('count {}'.format(count))\n\telif(verify < 8):\n\t\ti = verify\n\t\t#print('i {}'.format(i))\n\nprint((count + i))\n# 1512830742539\n", "a = [input().count('B') for i in range(8)]\r\nprint(min(a) % 8 + a.count(8))", "list1=[]\r\nfor i in range(0, 8, 1):\r\n x=list(input())\r\n list1.append(x)\r\n res=0\r\nfor i in range(0, 8, 1):\r\n if \"\".join(list1[i])==\"B\"*8:\r\n res+=1\r\nif res==8:\r\n print(res)\r\n exit(0)\r\n\r\ni=0\r\nwhile i<8:\r\n list2=[]\r\n for j in range(0, 8, 1):\r\n list2.append(list1[j][i])\r\n if \"\".join(list2)==\"B\"*8:\r\n res+=1\r\n i+=1\r\nprint(res)", "board = []\ncount = 0\nfor _ in range(8):\n\tboard.append(input())\nfor i in range(8):\n\tif board[i] == \"BBBBBBBB\":\n\t\tcount+=1\n\tincount = 0\n\tfor j in range(8):\n\t\tif board[j][i] == 'B':\n\t\t\tincount+=1\n\t\tif incount == 8:\n\t\t\tcount+=1\nif count == 16:\n\tprint(8)\nelse:\n\tprint(count)", "\r\na = [str(input()) for i in range(8)]\r\n\r\nres = 0\r\n\r\nfor horizontal in range(8):\r\n if a[horizontal].count(\"B\")==8:\r\n res+=1\r\n\r\nfor vertical in range(8):\r\n c = 0\r\n for i in range(8):\r\n c += int(a[i][vertical]==\"B\")\r\n res += int(c==8)\r\n\r\nif res==16:\r\n print(8)\r\nelse:\r\n print(res)", "def match_strokes(board):\r\n rows = [\"W\" for x in range(8)]\r\n columns = [\"W\" for x in range(8)]\r\n for i, row in enumerate(board):\r\n if row == \"B\"*8:\r\n rows[i] = \"B\"\r\n elif \"B\" in row:\r\n for j, col in enumerate(row):\r\n if col == \"B\":\r\n columns[j] = \"B\"\r\n print((rows + columns).count(\"B\"))\r\n\r\nmatch_strokes([input() for x in range(8)])", "cnt,m= 0,0\r\n\r\nfor i in range(8):\r\n s =input()\r\n if s == 'BBBBBBBB': cnt+=1\r\n else: m = s.count('B')\r\n \r\nprint(cnt+m)", "a = [input() for i in range(8)]\r\nwas = [[0] * 8 for i in range(8)]\r\ncnt = 0\r\nfor i in range(8):\r\n if a[i] == 'B' * 8 and sum(was[i]) < 8:\r\n was[i] = [1] * 8\r\n cnt += 1\r\nfor i in range(8):\r\n if [a[j][i] for j in range(8)] == ['B'] * 8 and sum(was[j][i] for j in range(8)) < 8:\r\n for j in range(8):\r\n was[j][i] = 1\r\n cnt += 1\r\nprint(cnt)\r\n", "b = [input().count('B') for _ in range(8)]\r\nprint([min(b) + b.count(8), 8][sum(b) == 64])", "#import sys\r\n#sys.stdin = open(\"test.in\", \"r\")\r\nlines = []\r\nres = 0\r\nfor _ in range (0,8,1):\r\n lines.append(input())\r\nfor i in range (0,8,1):\r\n line = True\r\n for k in range(0,8,1):\r\n if lines[k][i]==\"W\":\r\n line = False\r\n if line:\r\n res += 1\r\nif res!=8:\r\n for i in range (0,8,1):\r\n line = True\r\n for k in range(0,8,1):\r\n if lines[i][k]==\"W\":\r\n line = False\r\n if line:\r\n res += 1\r\nprint(res)", "#7A - Kalevitch and Chess\r\n#We get the costumer's requested board: 8 lines of input\r\n# W - white\r\n# B - black\r\norder = []\r\nfor i in range(8):\r\n order.append(input())\r\n#Firstly, we create a variable allBlack (reference to an all-black row) and\r\n #set it to be true\r\nallBlack = True\r\n#We instantiate the count of strokes as zero\r\ncount = 0\r\n#Now, we iterate through the board, row by row\r\nfor row in order:\r\n #If we find a row with all 8 swuares marked as black ('B')\r\n if row == \"BBBBBBBB\":\r\n #We clearly add 1 stroke to the count\r\n count += 1\r\n else:\r\n #else, we say that it's not an all-black row\r\n allBlack = False\r\n#Let's assume that all of the board's squares are marked with 'B'\r\n#It doesn't matter if we have already iterated through rows,\r\n#it's allowed to over-paint a square when rows of black cross columns of black\r\n#The next loop is actually to find columns of black squares\r\nfor i in range(8):\r\n count += 1\r\n for ii in range(8): #This is the second loop, because we have a board of 8x8\r\n #If the square is marked with 'W', we bring the count one step back\r\n if order[ii][i] == \"W\":\r\n count -= 1\r\n break\r\n#The simpliest case: if we got the count result to be 16 black squares,\r\n #we will subsequently need 8 strokes\r\n #We print this directly, just so our program wouldn't bother\r\n #to count the obvious and return a bigger count\r\nif count == 16:\r\n print(\"8\")\r\n #Else, we print the number of counts previously computed\r\nelse:\r\n print(count)", "s,p=[],['']*8\r\nfor i in range(8):\r\n s.append(input())\r\n for j in range(8):p[j]+=s[i][j]\r\nprint(8if(s.count('BBBBBBBB')==8)else(s.count('BBBBBBBB')+p.count('BBBBBBBB')))", "a = []\nfor i in range(8):\n a += [input()]\nb=[i for i in zip(*a)]\nnum = 0\nfor i in a:\n if 'W' not in i:\n num += 1\nfor i in b:\n if 'W' not in i:\n num += 1\nif num == 16:\n print(8)\nelse:\n print(num)" ]

[ "n = int(input())\ne = map(int, input().split())\nm = int(input())\n\naux = [-1] * n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n b -= 1\n\n if aux[b] == -1: aux[b] = c\n else: aux[b] = min(aux[b], c)\n\nif aux.count(-1) > 1: print(-1)\nelse: print(sum(aux) + 1)\n\n \t\t\t \t \t \t\t\t\t\t \t\t\t \t \t \t", "import math\r\nimport sys\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\ndef RSIL(): return sorted(map(int, input().split()), reverse=True)\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom heapq import heapify ,heappop , heappush,heappushpop,heapreplace,_heapify_max ,nlargest ,nsmallest\r\nimport copy\r\n\r\nsys.setrecursionlimit(2500)\r\n\r\ndef solve():\r\n n = I()\r\n q = IL()\r\n m = I()\r\n graph = defaultdict(int)\r\n\r\n for _ in range(m):\r\n a, b ,c = II()\r\n if b not in graph:\r\n graph[b] = c\r\n else:\r\n if c < graph[b]:\r\n graph[b] = c\r\n\r\n minimumCost = sum(graph.values())\r\n\r\n if len(graph) == n-1:\r\n print(minimumCost)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "import sys\r\nimport math\r\n\r\nn=int(input())\r\nq=map(int,input().split())\r\nm=int(input())\r\nupc=[1000005]*n\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n upc[b-1]=min(upc[b-1],c)\r\na,c=0,0\r\nfor x in upc:\r\n if x>1000000:\r\n c+=1\r\n if c>1:\r\n print(\"-1\")\r\n sys.exit(0)\r\n else:\r\n a+=x\r\nprint(a)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tq = list(map(int, input().split()))\r\n\tm = int(input())\r\n\t\r\n\tcost = {}\r\n\t\r\n\tfor _ in range(m):\r\n\t\ta, b, c = map(int, input().split())\r\n\t\ta, b = a - 1, b - 1\r\n\t\t\r\n\t\tif q[a] > q[b]:\r\n\t\t\tif b in cost:\r\n\t\t\t\tif cost[b] > c:\r\n\t\t\t\t\tcost[b] = c\r\n\t\t\telse:\r\n\t\t\t\tcost[b] = c\r\n\t\r\n\tprint(-1 if len(cost) < n - 1 else sum(cost.values()))\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a=int(input())\ninput()\nz=[pow(10,9)]*a\nfor i in range(int(input())):\n a,b=map(int,input().split()[1:])\n z[a-1]=min(z[a-1],b)\nz.remove(max(z))\nif pow(10,9) in z:print(-1)\nelse:print(sum(z))\n\n \t \t \t\t\t \t \t \t \t \t \t\t", "n = int(input())\r\nq = list(map(int, input().split()))\r\napp = int(input())\r\nd = {i:[] for i in range (1, n+1)}\r\nfor i in range (0, app):\r\n a, b, c = map(int, input().split())\r\n if(d[b]==[]):\r\n d[b].append(a)\r\n d[b].append(c)\r\n elif(d[b][1]>c):\r\n d[b][0] = a\r\n d[b][1] = c\r\ncount = 0\r\nfor i in d.values():\r\n if(i==[]):\r\n count += 1\r\nif(count != 1):\r\n print(-1)\r\nelse:\r\n cost = 0\r\n for i in d.values():\r\n if(i!=[]):\r\n cost += i[1]\r\n print(cost)", "import sys; input = sys.stdin.readline\r\nfrom math import inf\r\n\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\n\r\ngraph = [[] for _ in range(n)]\r\nind = [0] * n\r\nfor _ in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n a -= 1; b -= 1\r\n graph[a].append((b, c))\r\n ind[b] += 1\r\n\r\nqueue = []\r\nfor i in range(n):\r\n if not ind[i]:\r\n queue.append(i)\r\n\r\nif len(queue) > 1:\r\n print(-1)\r\n exit()\r\n\r\nresult = 0\r\ncost = [inf] * n\r\nwhile queue:\r\n a = queue.pop()\r\n for b, c in graph[a]:\r\n cost[b] = min(cost[b], c)\r\n ind[b] -= 1\r\n if not ind[b]:\r\n result += cost[b]\r\n queue.append(b)\r\nprint(result)", "n = int(input())\nq = list(map(int, input().split()))\nm = int(input())\n\nA = [[int(j)-1 for j in input().split()] for i in range(m)]\nemp = [[] for i in range(n)]\nh = 10**6 + 2\nl = [h] * n\n\nfor i in range(m):\n emp[A[i][1]].append(A[i][0])\n l[A[i][1]] = min(l[A[i][1]], A[i][2]+1)\n\ncount = 0\n\nfor i in emp:\n if len(i) == 0:\n count += 1\nif(count > 1):\n print(-1)\nelse:\n print(sum([i for i in l if i < h]))\n \t\t \t \t \t\t\t \t\t \t \t", "n, q = int(input()), list(map(int, input().split()))\r\np = [1000001 for i in range(n + 1)]\r\nfor i in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n p[b] = min(p[b], c)\r\nk = q.index(max(q)) + 1\r\np = p[1: k] + p[k + 1:]\r\nprint(-1 if 1000001 in p else sum(p))", "def find(arr,a):\n\tif arr[a]==a:\n\t\treturn a\n\tarr[a]=find(arr,arr[a])\n\treturn arr[a]\nn=int(input())\nx=list(map(int,input().split()))\narr=[i for i in range(n+1)]\nm=int(input())\nl=[]\nfor _ in range(m):\n\tl.append(list(map(int,input().split())))\nl.sort(key=lambda k:k[2])\nval=n\nans=0\nfor i in range(m):\n\tx=find(arr,l[i][0])\n\ty=find(arr,l[i][1])\n\tif x!=y and y==l[i][1]:\n\t\tval-=1\n\t\tarr[y]=x\n\t\tans+=l[i][2]\nif val!=1:\n\tprint(-1)\nelse:\n\tprint(ans)", "def build_inverted_graph(n, statements):\r\n graph = {i: [] for i in range(1, n + 1)}\r\n\r\n for a, b, c in statements:\r\n graph[b].append((a, c))\r\n\r\n return graph\r\n\r\n\r\ndef task4(n: int, qualifications: list, statements: list) -> int:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of company employees\r\n :qualifications (list): staff qualifications\r\n :statements (list): list of statements\r\n :return: minimum cost of creating a hierarchy\r\n \"\"\"\r\n graph = build_inverted_graph(n, statements)\r\n cost = 0\r\n num_ceos = 0\r\n\r\n for node in graph:\r\n if len(graph[node]) == 0:\r\n num_ceos += 1\r\n\r\n if num_ceos > 1:\r\n return -1\r\n else:\r\n cost += min(c for _, c in graph[node])\r\n\r\n return cost\r\nn = int(input())\r\nq = list(map(int,input().split()))\r\nm = int(input())\r\ns = []\r\nfor i in range(0,m):\r\n s.append(list(map(int,input().split())))\r\nprint(task4(n,q,s))", "from collections import defaultdict\r\nn = int(input())\r\nemp = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nempcost = {}\r\nsubordinates = 0\r\n\r\nfor _ in range(m):\r\n sp, sub, cost = list(map(int, input().split()))\r\n\r\n if sub in empcost:\r\n empcost[sub] = min(empcost[sub], cost)\r\n else:\r\n subordinates += 1\r\n empcost[sub] = cost\r\n\r\nif subordinates < n - 1:\r\n print(-1)\r\nelse:\r\n total = 0\r\n for emp in empcost:\r\n total += empcost[emp] \r\n \r\n print(total)", "import sys\r\nimport math\r\n \r\nn = int(input())\r\nq = map(int, input().split())\r\nm = int(input())\r\nupc = [1000005] * n\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n upc[b-1] = min(upc[b-1], c)\r\n\r\na, c = 0, 0\r\n\r\nfor x in upc:\r\n if x > 1000000:\r\n c += 1\r\n if c > 1:\r\n print(\"-1\")\r\n sys.exit(0)\r\n else:\r\n a += x\r\n\r\nprint(a)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n input()\r\n m = int(input())\r\n costs = [1000001] * (n + 1)\r\n for _i in range(m):\r\n a, b, c = map(int, input().split())\r\n if c < costs[b]:\r\n costs[b] = c\r\n boss = 0\r\n for i in range(1, n+1):\r\n if costs[i] == 1000001:\r\n boss += 1\r\n if boss >= 2:\r\n break\r\n if boss != 1:\r\n print(-1)\r\n return\r\n min_cost = 0\r\n for i in range(1, n+1):\r\n if costs[i] != 1000001:\r\n min_cost += costs[i]\r\n print(min_cost)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input())\ninput()\nm=int(input())\nlista=[]\ncontador=0\n\nwhile contador != m:\n a,b,c=map(int,input().split())\n lista.append([b,c,a])\n contador+=1\n \nlista=sorted(lista)\n \ncount,countB,countC=0,0,0\n\nfor i in lista:\n if countB != i[0]:\n \n countB = i[0]\n countC += i[1]\n count += 1\n \nif count >= n-1:\n print(countC)\nelse:\n print(-1)\n\n\n\t\t \t\t\t\t\t\t\t\t \t\t \t \t \t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n############ ---- 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\t\r\n\r\nfrom typing import List\r\n\r\n\r\ndef minCostCreateHierarchy(n: int, edges) -> int:\r\n # sort by distance\r\n # (i, j, d)\r\n # take third element for sort\r\n edges.sort(key=lambda x: x[2])\r\n\r\n has_boss = [False for _ in range(n+1)]\r\n\r\n res = 0\r\n for u, v, d in edges:\r\n if not has_boss[v]:\r\n res += d\r\n has_boss[v] = True\r\n return res\r\n\r\n\r\ndef task4(n: int, qualifications: List[int],\r\n statements: List[List[int]]) -> int:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of company employees\r\n :qualifications (list): staff qualifications\r\n :statements (list): list of statements\r\n :return: minimum cost of creating a hierarchy\r\n \"\"\"\r\n # qualifications are needed only to state that no cycles exist\r\n subordinates = set(statement[1] for statement in statements)\r\n if len(subordinates) != n - 1:\r\n return -1\r\n return minCostCreateHierarchy(n, statements)\r\n\t\r\nn = inp()\r\nqualifications = inlt()\r\nstatements = []\r\nm = inp()\r\nfor i in range(m):\r\n statements.append(inlt())\r\n\r\nprint(task4(n, qualifications, statements))", "num_de_func = int(input())\nqualificacoes_dos_func = map(int, input().split())\nnum_de_inscricoes = int(input())\n\ncustos = num_de_func * [-1] \nfor i in range(num_de_inscricoes):\n numero_a, numero_b, numero_c = map(int, input().split())\n numero_b -= 1\n if(custos[numero_b] != -1):\n aux = min(custos[numero_b], numero_c) \n custos[numero_b] = aux\n else:\n custos[numero_b] = numero_c \n\ncusto_min = sum(custos) + 1\ncontagem_custo = custos.count(-1)\nif(contagem_custo <= 1):\n print(custo_min)\nelse:\n print(-1)\n \t\t \t\t \t\t \t\t \t\t \t\t\t\t \t\t\t\t\t \t", "n = int(input())\nqualificacoes = list(map(int, input().split()))\ncustos = [None] * n\n\nfor _ in range(int(input())):\n a, b, c = map(int, input().split())\n custos[b - 1] = c if custos[b - 1] is None else min(custos[b - 1], c)\n\nresultado = \"\"\nif len(list(filter(lambda x: x is None, custos))) > 1:\n resultado = \"-1\"\nelse:\n soma = 0\n for custo in custos:\n if not custo is None:\n soma += custo\n resultado = str(soma)\n\nprint(resultado)\n\n\t\t \t \t\t\t \t\t \t \t \t \t\t\t \t", "class DSUNode:\r\n __slots__ = ['x', \"p\"]\r\n\r\n def __init__(self, x):\r\n self.x = x\r\n self.p = x\r\n\r\n\r\nclass DSU:\r\n ds = []\r\n\r\n def __init__(self, n):\r\n self.ds = [DSUNode(i) for i in range(n + 1)]\r\n\r\n def find(self, i):\r\n if self.ds[i].p == i:\r\n return i\r\n else:\r\n curr_p = self.ds[i].p\r\n arr = [curr_p]\r\n while self.ds[curr_p].p != curr_p:\r\n curr_p = self.ds[curr_p].p\r\n arr.append(curr_p)\r\n for i in arr:\r\n self.ds[i].p = curr_p\r\n return curr_p\r\n\r\n def union(self, i, j):\r\n a = self.find(i)\r\n b = self.find(j)\r\n if a == b:\r\n return a\r\n else:\r\n self.ds[a].p = b\r\n\r\n\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\nedges = []\r\nsupervised = set()\r\n\r\nfor _ in range(int(input())):\r\n u, v, w = list(map(int, input().split()))\r\n edges.append(((u, v), w))\r\n\r\nedges.sort(key=lambda x: x[1])\r\n\r\nedges_used = 0\r\ncost = 0\r\ndsu = DSU(n+1)\r\nfor e in edges:\r\n u, v = e[0]\r\n w = e[1]\r\n if v in supervised or dsu.find(u) == dsu.find(v):\r\n continue\r\n supervised.add(v)\r\n dsu.union(u, v)\r\n cost += w\r\n edges_used += 1\r\n if edges_used == n-1:\r\n break\r\n\r\nif edges_used == n-1:\r\n print(cost)\r\nelse:\r\n print(-1)\r\n", "def COMP(x):\r\n return comp[CAPITAN(x)]\r\n\r\n\r\ndef COMP_SIZE(x):\r\n return comp_size[COMP(x)]\r\n\r\n\r\ndef CAPITAN(x):\r\n while parent[x] != x:\r\n x = parent[x]\r\n return x\r\n\r\n\r\ndef UNITE(a, b):\r\n if COMP(a) == COMP(b):\r\n return 0\r\n else:\r\n comp_size[CAPITAN(a)] += comp_size[CAPITAN(b)]\r\n parent[b] = a\r\n return 1\r\n\r\n\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\n\r\ng = []\r\nm = int(input())\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n g.append([c, a - 1, b - 1])\r\n\r\ng.sort()\r\ncomp = [i for i in range(n)]\r\nparent = [i for i in range(n)]\r\ncapitan = [i for i in range(n)]\r\ncomp_size = [1 for i in range(n)]\r\n\r\ncost = 0\r\nfor i in range(m):\r\n if parent[g[i][2]] == g[i][2]:\r\n if UNITE(g[i][1], g[i][2]) == 1:\r\n cost += g[i][0]\r\n\r\nif n not in comp_size:\r\n print(-1)\r\nelse:\r\n print(cost)\r\n", "a=int(input())\r\ninput()\r\nz=[pow(10,9)]*a\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split()[1:])\r\n z[a-1]=min(z[a-1],b)\r\nz.remove(max(z))\r\nif pow(10,9) in z:print(-1)\r\nelse:print(sum(z))\r\n", "class Solve:\r\n\r\n def __init__(self) -> None:\r\n self.n: int = 0;\r\n self.q:list = [];\r\n self.m:int = 0;\r\n self.cost:list = []\r\n\r\n def vao(self) -> None:\r\n self.n = int(input());\r\n self.q = [0] + [int(item) for item in input().split(\" \")];\r\n self.m = int(input());\r\n self.cost.append(0);\r\n self.cost += [-1 for _ in range(self.n)];\r\n\r\n def dem(self) -> int:\r\n dem:int = 0;\r\n for i in range(self.n + 1):\r\n if self.cost[i] == -1: dem += 1;\r\n return dem;\r\n \r\n def tinhTong(self) -> int:\r\n tong: int = 0\r\n for i in self.cost:\r\n if(i != -1): tong += i;\r\n return tong;\r\n\r\n def lam(self) -> None:\r\n for _ in range(self.m):\r\n a, b, c = map(int,input().split(\" \"));\r\n if(self.q[a] > self.q[b]):\r\n if(self.cost[b] == -1): self.cost[b] = c;\r\n else: self.cost[b] = min(self.cost[b], c);\r\n if(self.dem() > 1): print(\"-1\");\r\n else: print(self.tinhTong());\r\n\r\n def ra(self) -> None:\r\n pass;\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "n = int(input())\ne = map(int, input().split())\nm = int(input())\n\narr = [-1]*n\n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n b -= 1\n\n if arr[b] == -1:\n arr[b] = c\n else:\n arr[b] = min(arr[b], c)\n\nif arr.count(-1) > 1:\n print(-1)\nelse:\n print(sum(arr) + 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())\ninput()\n\narr = n * [-1] \n\nfor i in range(int(input())):\n a, b, c= map(int, input().split())\n b -= 1\n\n if arr[b] == -1:\n arr[b] = c\n else:\n arr[b] = min(arr[b], c) \n \nif arr.count(-1) > 1:\n print (-1)\nelse:\n print (sum(arr) + 1)\n\n\t\t\t \t \t \t \t \t\t \t \t\t \t", "# imports\r\nimport sys\r\nfrom os import path\r\nfrom collections import *\r\nfrom itertools import *\r\nimport heapq\r\nfrom math import *\r\nfrom typing import List\r\nimport re\r\nmod = 1e9+7\r\noo = float(\"inf\")\r\n\r\n\r\n# IO\r\nif (path.exists('cf')):\r\n sys.stdin = open(\"in.txt\", \"r\")\r\n sys.stdout = open(\"out.txt\", \"w\")\r\n\r\n\r\n# solution class and other functions\r\nclass Solution:\r\n def minCost(self) -> int:\r\n n = int(input().strip())\r\n qual = list(map(int, input().strip().split())) # silly :)\r\n m = int(input().strip())\r\n edges: List[tuple] = []\r\n for _ in range(m):\r\n edges.append(tuple(map(int, input().strip().split())))\r\n\r\n def dsu() -> int:\r\n componantsNum = n\r\n edges.sort(key=lambda e: e[2])\r\n\r\n # dsu = [-1]*(n+1)\r\n # def find(x) -> int:\r\n # return x if dsu[x] < 0 else find(dsu[x])\r\n\r\n buckets = defaultdict(set)\r\n def union(x, y) -> None:\r\n nonlocal componantsNum\r\n if not len(buckets[y]):\r\n buckets[y].add(x)\r\n componantsNum -= 1\r\n # x, y = find(x), find(y)\r\n # dsu[y] = x\r\n\r\n ans = 0\r\n for u, v, w in edges:\r\n if not len(buckets[v]):\r\n ans += w\r\n union(u, v)\r\n return ans if componantsNum == 1 else -1\r\n return dsu()\r\n\r\n\r\ndef Dive() -> None:\r\n t = 1\r\n # t = int(input().strip())\r\n sol = Solution()\r\n while (t):\r\n t -= 1\r\n print(sol.minCost())\r\n\r\n\r\n# driver code\r\nif '__main__':\r\n Dive()\r\n", "#from math import sqrt, inf, ceil\r\n#from collections import defaultdict\r\n#from heapq import heappush, heappop\r\n#from collections import deque\r\n#from bisect import bisect_left, bisect_right\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #input().decode().rstrip('\\r\\n')\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n#mod = 10**9+7\r\n\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n \r\ndef find(item):\r\n while item != link[item]:\r\n item = link[item]\r\n return item\r\n \r\ndef unite(X, Y):\r\n X, Y = find(X), find(Y)\r\n if X == Y:\r\n return\r\n if size[X] < size[Y]:\r\n link[X] = Y\r\n size[Y] += size[X]\r\n else:\r\n link[Y] = X\r\n size[X] += size[Y]\r\n \r\nn = II()\r\nq = LMII()\r\n\r\nm = II()\r\nedges = list()\r\nfor i in range(m):\r\n x, y, w = MII()\r\n edges.append((w,x-1,y-1))\r\nedges.sort()\r\n\r\nresult = 0\r\nlink = list(range(n))\r\nsize = [1]*n\r\nsuperv = [False]*n\r\n \r\nfor w, x, y in edges:\r\n if superv[y]:\r\n continue\r\n set_x, set_y = find(x), find(y)\r\n if set_x == set_y:\r\n continue\r\n superv[y] = True\r\n result += w\r\n unite(set_x,set_y)\r\n \r\nprint(result if size[find(0)] == n else -1)\r\n\r\n \r\n#sys.stdout.write('\\n'.join(map(str, log)))\r\n#sys.stdout.write('\\n'.join(log))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# n = int(input())\r\n#\r\n# arr = [str(i) for i in range(n+1)]+[str(i) for i in range(n-1,-1,-1)]\r\n#\r\n# for i in range(n):\r\n# print(\" \"*(2*(n-i))+\" \".join(arr[:i+1]+arr[:i][::-1]))\r\n#\r\n# print(\" \".join(arr))\r\n#\r\n# for i in range(n-1,-1,-1):\r\n# if i == 0:\r\n# print(\" \"*(2*(n-i))+\" \".join(arr[:i+1]+arr[:i][::-1]), end =\"\")\r\n# else:\r\n# print(\" \" * (2 * (n - i)) + \" \".join(arr[:i + 1] + arr[:i][::-1]))\r\n\r\n\r\n# arr = list(\"olleh\")\r\n# n = input()\r\n# for i in n:\r\n# if i in arr[-1]:\r\n# arr.pop()\r\n# if not arr:\r\n# print(\"YES\")\r\n# exit()2\r\n# print(\"NO\")\r\n#\r\n\r\n\r\n# def setbit(val, i, bit):\r\n#\r\n# num = 1 << i\r\n#\r\n# if bit:\r\n# return val | num\r\n#\r\n# return val & ~num\r\n#\r\n#\r\n# n,m = list(map(int,input().split()))\r\n# a = int(input(),2)\r\n# b = int(input(),2)\r\n# for i in range(m):\r\n# arr = input().split()\r\n#\r\n# if arr[0] == \"set_a\":\r\n# a = setbit(a, int(arr[1]), int(arr[2]))\r\n# elif arr[0] == \"set_b\":\r\n# b = setbit(b, int(arr[1]), int(arr[2]))\r\n# else:\r\n# try:\r\n# print(bin(a+b)[2:][-int(arr[1])-1],end=\"\")\r\n# except:\r\n# print(0, end=\"\")\r\n\r\nfrom collections import defaultdict\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\n\r\ncount = [0 for _ in range(n)]\r\n\r\nm = int(input())\r\ncosts = defaultdict(list)\r\nfor _ in range(m):\r\n a, b, c = list(map(int, input().split()))\r\n costs[b].append(c)\r\n count[b-1] = 1\r\nif count.count(0) != 1:\r\n print(-1)\r\n exit()\r\n\r\ntotal = 0\r\nfor b, cost in costs.items():\r\n total += min(cost)\r\n\r\nprint(total)", "n = int(input())\nnotas = list(map(int, input().split()))\ncq = [None] * n\n\nfor _ in range(int(input())):\n ep, q, c = map(int, input().split())\n if cq[q - 1] is None:\n cq[q - 1] = c\n else:\n cq[q - 1] = min(cq[q - 1], c)\nout = \"\"\nempty = len(list(filter(lambda x: x is None, cq)))\n\nif empty > 1:\n out = \"-1\"\nelse:\n soma = 0\n for c in cq:\n if c is not None:\n soma += c\n out = str(soma)\n\nprint(out)\n\n \t \t\t \t\t\t\t\t \t \t\t\t\t\t\t \t", "a = int(input())\ninput()\nz = [pow(10,9)] * a\nfor i in range(int(input())):\n\t\ta, b = map(int,input().split()[1:])\n\t\tz[a-1] = min(z[a-1], b)\nz.remove(max(z))\nif pow(10,9) in z:\n\tprint(-1)\nelse: \n\tprint(sum(z))\n\t \t\t \t\t \t \t\t \t\t\t \t \t\t \t\t \t\t", "n = int(input())\nquali = input().split()\nm = int(input())\n\nNone\nl = [None]*n\ncnt = 0\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n \n if l[b-1] == None:\n l[b-1] = c\n else:\n l[b-1] = min(l[b-1], int(c))\n\nif (l.count(None) > 1):\n print(-1)\n\nelse:\n for j in l:\n if j != None:\n cnt += j\n print(cnt)\n\n\t\t\t \t \t \t\t \t \t \t \t\t\t \t", "def par(node,parent):\r\n if parent[node] != node:\r\n parent[node] = par(parent[node],parent)\r\n return parent[node]\r\n\r\ndef main():\r\n t = 1\r\n #t=inpu()\r\n for i in range(t):\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n m = int(input())\r\n l=[]\r\n for j in range(m):\r\n x,y,w=map(int,input().split())\r\n l.append([x,y,w])\r\n parent=[0]*(n+1)\r\n rank=[0]*(n+1)\r\n l.sort(key=lambda x:x[2])\r\n for i in range(n+1):\r\n parent[i] = i\r\n rank[i] = 0\r\n cnt=0\r\n ans=0\r\n for i in l:\r\n p,q = par(i[0],parent),par(i[1],parent)\r\n #print(p,q,i[0],i[1])\r\n if p!=q:\r\n if arr[i[0]-1]>arr[i[1]-1] and parent[i[1]] == i[1]:\r\n ans+=i[2]\r\n cnt+=1\r\n parent[i[1]] = i[0]\r\n if cnt!=n-1:\r\n print(-1)\r\n continue\r\n print(ans)\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nq = map(int, input().split())\ncosts = n * [-1]\nfor i in range(int(input())):\n a, b, c = map(int, input().split())\n b -= 1\n if costs[b] != -1:\n s = min(costs[b], c)\n costs[b] = s\n else: costs[b] = c\nans = sum(costs) + 1\ns = costs.count(-1)\nif s <= 1: print(ans)\nelse: print(-1)\n\t\t\t \t\t \t\t\t \t\t \t\t\t\t\t \t \t", "def find(parents, node):\r\n if parents[node] == node:\r\n return node\r\n parents[node] = find(parents, parents[node])\r\n return parents[node]\r\n\r\ndef union(parents, ranks, x, y):\r\n parent_x = find(parents, x)\r\n parent_y = find(parents, y)\r\n\r\n if parent_x == parent_y:\r\n return\r\n\r\n if ranks[parent_x] < ranks[parent_y]:\r\n parents[parent_x] = parent_y\r\n elif ranks[parent_x] > ranks[parent_y]:\r\n parents[parent_y] = parent_x\r\n else:\r\n parents[parent_y] = parent_x\r\n ranks[parent_x] += 1\r\n\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\nedges = []\r\nsupervised = set()\r\n\r\nfor _ in range(int(input())):\r\n u, v, w = list(map(int, input().split()))\r\n edges.append(((u, v), w))\r\n\r\nedges.sort(key=lambda x: x[1])\r\n\r\nedges_used = 0\r\ncost = 0\r\nparents = list(range(n+1))\r\nranks = [0] * (n+1)\r\nfor e in edges:\r\n u, v = e[0]\r\n w = e[1]\r\n if v in supervised or find(parents, u) == find(parents, v):\r\n continue\r\n supervised.add(v)\r\n union(parents, ranks, u, v)\r\n cost += w\r\n edges_used += 1\r\n if edges_used == n-1:\r\n break\r\n\r\nif edges_used == n-1:\r\n print(cost)\r\nelse:\r\n print(-1)", "n=int(input())\r\na=[*map(int,input().split())]\r\nm=int(input())\r\nq={}\r\nfor i in range(n):\r\n q[i+1]=set()\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n q[b].add(c)\r\nt=0\r\nfor i in q:\r\n if len(q[i])==0:\r\n t+=1\r\nif t>1:\r\n print(-1)\r\nelse:\r\n print(sum(min(q[i])if q[i] else 0 for i in q))", "__author__ = 'Darren'\r\n\r\n\r\n# For each employee, select the supervisor that yields the least cost.\r\ndef solve():\r\n n = int(input())\r\n input() # Qualifications are not used\r\n m = int(input())\r\n costs = [1000001] * (n + 1)\r\n for _i in range(m):\r\n a, b, c = map(int, input().split())\r\n if c < costs[b]: # A supervisor with a lower cost\r\n costs[b] = c\r\n\r\n boss = 0\r\n for i in range(1, n+1):\r\n if costs[i] == 1000001:\r\n boss += 1\r\n if boss >= 2:\r\n break\r\n if boss != 1: # There has to be only one boss\r\n print(-1)\r\n return\r\n\r\n # The summation includes costs[0] and cost of the boss as a subordinate\r\n min_cost = sum(costs) - 2 * 1000001\r\n print(min_cost)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from sys import stdin\r\nn = int(input())\r\ninput()\r\nm = int(input())\r\nparent = [None] * (n + 1)\r\ndef find(x):\r\n while x != dsu[x]:\r\n dsu[x] = dsu[dsu[x]]\r\n x = dsu[x]\r\n return x\r\nfor line in stdin:\r\n a, b, c = map(int, line.split())\r\n z = parent[b]\r\n if not z or c < z[1]:\r\n parent[b] = (a, c)\r\ndef answer():\r\n c = 0\r\n total =0\r\n for i in range(1, n+1):\r\n if parent[i] is None:\r\n c += 1\r\n if c == 2:\r\n return -1\r\n else:\r\n total += parent[i][1]\r\n return total\r\nprint(answer())", "import sys; R = sys.stdin.readline\r\ndef S(): return map(int,R().split())\r\n\r\nn = int(R()); S()\r\np = [float(\"inf\")]*(n+1)\r\nfor _ in range(int(R())):\r\n _,v,w = S()\r\n p[v] = min(p[v],w)\r\nr,ok = 0,True\r\nfor i in range(1,n+1):\r\n if p[i]==float(\"inf\"):\r\n if not ok: print(-1); exit()\r\n ok = False\r\n else: r += p[i]\r\nprint(r)", "# UnionFind\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\nn=int(input())\r\nH=list(map(int,input().split()))\r\nM=int(input())\r\nE=[tuple(map(int,input().split())) for i in range(M)]\r\n\r\nE.sort(key=lambda x:x[2])\r\n\r\nGroup = [i for i in range(n+1)] # グループ分け\r\nNodes = [1]*(n+1) # 各グループのノードの数\r\nUSE=[0]*(n+1)\r\nANS=0\r\nfor a,b,c in E:\r\n if find(a)!=find(b) and USE[b]==0:\r\n Union(a,b)\r\n USE[b]=1\r\n ANS+=c\r\n\r\nif Nodes[find(1)]==n:\r\n print(ANS)\r\nelse:\r\n print(-1)\r\n\r\n", "n = int(input())\nqualifications = list(map(int, input().split()))\nm = int(input())\napplications = [[int(e) - 1 for e in input().split()] for i in range(m)]\n\nmaior_custo = 10**6 + 2\nmenor_custo = [maior_custo] * n\nempregados = []\nfor e in range(n):\n empregados.append([])\n\nfor e in range(m):\n empregados[applications[e][1]].append(applications[e][0])\n menor_custo[applications[e][1]] = min(menor_custo[applications[e][1]], applications[e][2] + 1)\n\ncontador = 0\nfor e in empregados:\n if(len(e) == 0):\n contador += 1\nif(contador > 1):\n print(-1)\nelse:\n menor = 0\n for c in menor_custo:\n if(c < maior_custo):\n menor += c\n print(menor)\n\t \t \t\t\t \t \t \t\t \t\t \t", "n = int(input())\np = input()\nm = int(input())\nk = 0\nr = 0\n \ns = [[] for i in range(n)]\nfor i in range(m):\n a, b, c = [int(w) for w in input().split()]\n s[b-1].append(c)\n \nfor i in range(n):\n if len(s[i]) > 0:\n r+=min(s[i])\n else:\n k+=1\n \nif k==1:\n print(r)\n \nelse:\n print(-1)\n\t\t \t\t \t\t \t \t\t \t \t\t \t\t", "n = int(input())\nq = list(map(int, input().split()))\n \nm = int(input())\nl = [-1] * (n)\n \nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n if l[b-1] == -1:\n l[b-1] = c\n else:\n l[b-1] = min(l[b-1],c)\n \nif l.count(-1) > 1:\n print(-1)\nelse:\n print(sum(l)+1)\n\t \t\t\n\t \t\t\t\t \t \t\t\t \t \t\t\t\t \t \t", "k = int(input())\ninput()\nz=[pow(10,9)] * k\nfor i in range(int(input())):\n k,b = map(int, input().split()[1:])\n z[k-1]=min(z[k-1], b)\n\nz.remove(max(z))\n\nif pow(10,9) in z:print(-1)\nelse: print(sum(z))\n\t\t\t \t \t\t\t \t \t \t\t\t\t\t", "def f(n,l):\r\n pl = [None]*(n+1) #p[0] is not used!\r\n for a,b,c in l:\r\n if pl[b] is None:\r\n pl[b] = []\r\n pl[b].append(c)\r\n cr = sum([p is None for p in pl])\r\n if cr>2:\r\n return -1\r\n return sum([min(p) for p in pl if p is not None])\r\n\r\nn = int(input()) #1000\r\ninput()\r\na = int(input())\r\nl = [list(map(int,input().split())) for _ in range(a)]\r\nprint(f(n,l))\r\n", "n=int(input());\r\nq=list(map(int,input().split()));\r\n\r\nchiefq=max(q);\r\nchiefind=0;\r\nfor i in range(n):\r\n if q[i]==chiefq:\r\n chiefind=i;\r\n break;\r\n \r\nm=int(input());\r\n\r\nbestsup=[10**6+1]*n;\r\nbestsup[chiefind]=0;\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split());\r\n bestsup[b-1]=min(bestsup[b-1],c);\r\n\r\nif max(bestsup)>10**6:\r\n print(-1);\r\nelse:\r\n print(sum(bestsup));\r\n \r\n", "from xmlrpc.client import MAXINT\n\n\nif __name__ == '__main__':\n n = int(input())\n employees = [0] + list(map(int,input().strip().split()))[:n]\n m = int(input())\n applications = [MAXINT for i in range(n + 1)]\n for i in range(m):\n a, b, c = map(int,input().split())\n applications[b] = min(applications[b], c)\n sum = 0\n count = 0\n for i in range(1, n + 1):\n if applications[i] == MAXINT:\n count += 1\n else:\n sum += applications[i]\n if count > 1:\n sum = -1\n break\n print(sum)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\ninf = pow(10, 9) + 1\r\nmi = [inf] * (n + 1)\r\nm = int(input())\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n mi[b] = min(mi[b], c)\r\nans = 0\r\nf = 0\r\nfor i in mi[1:]:\r\n if i == inf and not f:\r\n f = 1\r\n elif i == inf and f:\r\n ans = -1\r\n break\r\n else:\r\n ans += i\r\nprint(ans)", "from collections import deque, defaultdict\r\n#----------------------------------------------------------------------------------------\r\nn = int(input())\r\nqualification = list(map(int, input().split()))\r\nm = int(input())\r\ncosts = [float('inf')]*n\r\nfor i in range(m):\r\n u, v, c = list(map(int, input().split()))\r\n if qualification[u-1] > qualification[v-1]:\r\n costs[v-1]= min(costs[v-1], c)\r\ncount = 0\r\nfor i in range(len(costs)):\r\n if costs[i] == float('inf'):\r\n count += 1\r\n costs[i] = 0\r\n \r\nif count > 1:\r\n print(-1)\r\nelse:\r\n print(sum(costs))\r\n \r\n\r\n \r\n", "#t=int(input())\nt=1\nfor i in range(t):\n #n,m=map(int,input().split())\n n=int(input())\n q=[int(x) for x in input().split()]\n #b=[int(x) for x in input().split()]\n big=q.index(max(q))\n costs=[1000001 for x in range(n)]\n\n m=int(input())\n for i in range(m):\n a,b,c=map(int,input().split())\n costs[b-1]=min(costs[b-1],c)\n\n ans=0\n for i in range(n):\n if i==big:\n continue\n if costs[i]==1000001:\n ans=-1\n break\n ans+=costs[i]\n\n print(ans) ", "read1 = [-1] * int(input())\r\nread2 = input()\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n x, y, z = list(map(int, input().split()))\r\n if read1[y-1] == -1:\r\n read1[y-1] = z\r\n else:\r\n read1[y-1] = min(read1[y-1],z)\r\n\r\nif (read1.count(-1) <= 1):\r\n print(sum(read1, 1))\r\nelse:\r\n print(-1)\r\n \t \t\t \t \t \t\t\t \t \t\t\t\t \t\t \t", "\r\n\r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\nm = int(input())\r\nedges = []\r\nfor d in range(m):\r\n edges.append(list(map(int,input().split())))\r\n \r\nedges.sort(key = lambda x: x[2])\r\nvisited = []\r\ncount = 0\r\nfor i in range(m):\r\n if edges[i][1] not in visited:\r\n visited.append(edges[i][1])\r\n count += edges[i][2]\r\n\r\nif len(visited) == n-1:\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "from heapq import *\r\ndef merge_comp(u,v):\r\n if comp[v]==comp[u]:size[comp[u]]+=1;return\r\n if size[comp[v]]>size[comp[u]]:\r\n (u,v) = (v,u)\r\n size[comp[u]]+=size[comp[v]]+1\r\n for i in members[comp[v]]:\r\n comp[i]=comp[u] \r\n members[comp[u]] += (i,)\r\n\r\ndef kruskal():\r\n TE = 0\r\n ans=0\r\n vis = [False]*n\r\n while TE<n-1:\r\n curr = heappop(edges)\r\n u,v = curr[1][0],curr[1][1]\r\n if comp[u]!=comp[v] and not vis[v]:\r\n merge_comp(u,v)\r\n TE+=1\r\n vis[v]=True\r\n ans+=curr[0]\r\n return ans\r\n \r\nn=int(input())\r\nsize=[0]*n\r\ncomp = [i for i in range(n)]\r\nmembers=[[i] for i in range(n)]\r\nq=list(map(int,input().split()))\r\nm=int(input())\r\nedges = []\r\nfor i in range(m):\r\n a,b,c=list(map(int,input().split()))\r\n a-=1;b-=1\r\n if not q[a]>q[b]:print(-1);break\r\n heappush(edges,(c,(a,b)))\r\nelse:\r\n try:\r\n print(kruskal())\r\n except:\r\n print(-1)", "\r\ndef solve():\r\n n = int(input())\r\n e = list(map(int, input().split()))\r\n q = int(input())\r\n b = []\r\n for i in range(q):\r\n x, y, z = map(int, input().split())\r\n if e[x-1] > e[y-1]:\r\n b.append((z, x, y))\r\n b.sort()\r\n\r\n a = [i for i in range(n+1)]\r\n s = [1 for i in range(n+1)]\r\n f = [0 for i in range(n+1)]\r\n\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(x, y, z):\r\n nonlocal cost\r\n x = root(x)\r\n y = root(y)\r\n if x == y:\r\n return \r\n cost += z\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 cost = 0\r\n # print(b)\r\n for c, i, j in b:\r\n if f[j]:\r\n continue\r\n union(i, j, c)\r\n f[j] = 1\r\n\r\n d = set()\r\n for i in range(1, n+1):\r\n d.add(root(i))\r\n if len(d) == 1:\r\n print(cost)\r\n else:\r\n print(-1)\r\nsolve()", "import sys, threading\ninput = sys.stdin.readline\nfrom collections import defaultdict\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\ndef main():\n n = int(input())\n q = list(map(int, input().split()))\n m = int(input())\n G = defaultdict(list)\n edges = []\n for i in range(m):\n a, b, c = list(map(int, input().split()))\n edges.append([a,b,c])\n edges.sort(key = lambda x:x[-1])\n # print(edges)\n p = {i:i for i in range(1, n+1)}\n def getP(i):\n if i == p[i]:\n return i\n p[i] = getP(p[i])\n return p[i]\n \n cost = 0\n for a, b,c in edges:\n # print(p, getP(a), getP(b))\n if getP(a) != getP(b) and q[a-1] > q[b-1] and getP(b) == b:\n # G[a].append(b)\n # G[b].append(a)\n \n p[b] = getP(a)\n cost+=c\n for i in range(1, n+1):\n x = getP(i)\n\n if len(set(p.values())) > 1:\n print(-1)\n else:\n print(cost)\nmain()", "n = int(input())\np = input()\nm = int(input())\nk = 0\nr = 0\n\ns = [[] for _ in range(n)]\nfor i in range(m):\n a, b, c = [int(x) for x in input().split()]\n s[b - 1].append(c)\n\nfor i in range(n):\n if len(s[i]) > 0:\n r += min(s[i])\n else:\n k += 1\n\nif k == 1:\n print(r)\n\nelse:\n print(-1)\n\n \t \t \t\t \t\t \t \t \t\t \t", "def find_min_to_elem(stat):\r\n min_to = {}\r\n for x, y, cost in stat:\r\n val = min_to.get(y, -1)\r\n if val != -1:\r\n if cost < val:\r\n min_to[y] = cost\r\n else:\r\n min_to[y] = cost\r\n return min_to\r\n\r\n\r\ndef task4(n: int, qualifications: list, statements: list) -> int:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of company employees\r\n :qualifications (list): staff qualifications\r\n :statements (list): list of statements\r\n :return: minimum cost of creating a hierarchy\r\n \"\"\"\r\n if n == 1:\r\n return 0\r\n min_to = find_min_to_elem(statements)\r\n if len(min_to.keys()) < n - 1:\r\n return -1\r\n else:\r\n return sum(min_to.values())\r\n\r\nn = int(input())\r\nq = list(map(int,input().split()))\r\nm = int(input())\r\ns = []\r\nfor i in range(0,m):\r\n s.append(list(map(int,input().split())))\r\nprint(task4(n,q,s))", "n = int(input()) \nfuncionarios = str(input()).split()\nm = int(input())\n\nclass node():\n def __init__(self):\n x = 0\n r = 0\n\nN = 1005\ninfinito = 0x3f3f3f3f\nposiFunc = [0 for _ in range(N)]\nvalorFunc = [0 for _ in range(N)]\nvv = [list() for _ in range(N)]\n\n\ndef encontrar(x):\n r = x\n while posiFunc[r]!=r:\n r = posiFunc[r]\n i = x\n j = None\n while i!=r:\n j = posiFunc[i]\n posiFunc[i] = r\n i = j\n return r\n \n\nfor i in range(1,n+1):\n posiFunc[i] = i\n valorFunc[i] = int(funcionarios[i-1])\n\nfor i in range(m):\n contrato = node()\n aplicacao = str(input()).split()\n contrato.x = int(aplicacao[0])\n subalterno = int(aplicacao[1])\n contrato.r = int(aplicacao[2])\n if valorFunc[contrato.x] > valorFunc[subalterno]:\n vv[subalterno].append(contrato)\nresposta = 0\nfor i in range(1,n+1):\n tem = infinito\n index = i\n for j in range(len(vv[i])):\n contrato = vv[i][j]\n if contrato.r<tem:\n tem = contrato.r\n index = contrato.x\n fx = encontrar(i)\n fy = encontrar(index)\n if fx!=fy:\n posiFunc[fx] = fy\n resposta+=tem\nu = 2\nwhile(u < n + 1):\n if encontrar(1)!=encontrar(u):\n break\n u += 1\nif u > n:\n print(resposta)\nelse:\n print(\"-1\")\n \t \t\t\t\t \t\t\t\t \t \t\t\t \t \t\t\t\t", "def task4(n: int, qualifications: list, statements: list) -> int:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of company employees\r\n :qualifications (list): staff qualifications\r\n :statements (list): list of statements\r\n :return: minimum cost of creating a hierarchy\r\n \"\"\"\r\n have_lid = [False for i in range(n)]\r\n dic_min = {}\r\n for line in statements:\r\n a = line[0]\r\n b = line[1]\r\n price = line[2]\r\n if qualifications[a - 1] > qualifications[b - 1]:\r\n if b not in dic_min:\r\n dic_min[b] = price\r\n have_lid[b - 1] = True\r\n else:\r\n if dic_min[b] > price:\r\n dic_min[b] = price\r\n\r\n counter = 0\r\n for have in have_lid:\r\n if not have:\r\n counter += 1\r\n if counter > 1:\r\n return -1\r\n else:\r\n summ = 0\r\n for key in dic_min:\r\n summ += dic_min[key]\r\n return summ\r\nn = int(input())\r\nq = list(map(int,input().split()))\r\nm = int(input())\r\ns = []\r\nfor i in range(0,m):\r\n s.append(list(map(int,input().split())))\r\nprint(task4(n,q,s))", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\ncin1 = list(map(int,sys.stdin.readline().strip().split()))\r\nd = {}\r\nl = []\r\ncin = int(sys.stdin.readline().strip())\r\nfor testcase in range(cin):\r\n cin1 = list(map(int,sys.stdin.readline().strip().split()))\r\n if cin1[1] not in d:\r\n d[cin1[1]] = [[cin1[2],cin1[0]]]\r\n else:\r\n d[cin1[1]].append([cin1[2],cin1[0]])\r\ntfl = [False for i in range(num+1)]\r\ntfl[0] = True\r\nans = 0\r\nfor i in d:\r\n d[i].sort()\r\n ans+=d[i][0][0]\r\n tfl[i] = True\r\nif tfl.count(False) == 1:\r\n print(ans)\r\nelse:\r\n print(-1)", "def main():\r\n n = int(input())\r\n q = list(map(int, input().split()))\r\n max_q = max(q)\r\n max_list = [i for i, j in enumerate(q) if j == max_q]\r\n if len(max_list) > 1:\r\n print(-1)\r\n return\r\n top_employee = max_list[0] + 1\r\n m = int(input())\r\n possible_costs = {}\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n if b in possible_costs:\r\n possible_costs[b].append(c)\r\n else:\r\n possible_costs[b] = [c]\r\n\r\n cost = 0\r\n for i in range(1, n + 1):\r\n if i == top_employee:\r\n continue\r\n if i not in possible_costs:\r\n print(-1)\r\n return\r\n cost += min(possible_costs[i])\r\n\r\n print(cost)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve():\r\n n = eval(input())\r\n qualities = list(map(int,input().split()))\r\n m = eval(input())\r\n parents = [float('inf') for i in range(n)]\r\n for _ in range(m):\r\n a, b, c = list(map(int,input().split()))\r\n if qualities[a-1] > qualities[b-1]:\r\n parents[b-1] = min(parents[b-1], c)\r\n for i, par in enumerate(parents):\r\n if par == float('inf'):\r\n parents[i] = 0\r\n break\r\n if float('inf') in parents:\r\n print(-1)\r\n else:\r\n print(sum(parents))\r\nsolve()", "n = int(input())\r\nq = list(map(int, input().split()))\r\np = [1000011 for i in range(n + 1)]\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n p[b] = min(p[b], c)\r\n \r\nk = q.index(max(q)) + 1\r\np = p[1: k] + p[k + 1:]\r\nif 1000011 in p:\r\n print(-1)\r\nelse:\r\n print(sum(p))", "parent = [0 for i in range(0, 1001)]\r\nSize = [1 for i in range(0, 1001)]\r\nmapp = {}\r\n\r\ndef make(v):\r\n parent[v] = v\r\n Size[v] = 1\r\ndef find(v):\r\n if parent[v] == v:\r\n return v\r\n parent[v] = find(parent[v])\r\n return parent[v]\r\ndef Union(a, b):\r\n a = find(a)\r\n b = find(b)\r\n if a != b and (Size[a] < Size[b]):\r\n a, b = b, a\r\n parent[b] = a\r\n Size[a] += Size[b]\r\n\r\nn = int(input())\r\nqualification = input().split()\r\nchoosen = [False for i in range(0, 1001)]\r\nmat = [[1000001 for i in range(0, 1001)] for j in range(0, 1001)]\r\nedge = []\r\nm = int(input())\r\nfor i in range(0, m):\r\n t = list(map(int, input().split()))\r\n\r\n if mat[t[0]][t[1]] == 1000001:\r\n edge.append([t[2],t[0],t[1]])\r\n mapp[(t[0], t[1])] = len(edge)-1\r\n\r\n elif mat[t[0]][t[1]] > t[2]:\r\n edge[mapp[(t[0], t[1])]][0] = t[2]\r\n\r\nfor i in range(1, n+1):\r\n make(i)\r\n\r\nedge.sort()\r\ntotal = 0\r\nfor i in range(0,len(edge)):\r\n if find(edge[i][2]) == find(edge[i][1]) or choosen[edge[i][2]]:\r\n continue\r\n\r\n choosen[edge[i][2]] = True\r\n Union(edge[i][1], edge[i][2])\r\n total += edge[i][0]\r\n\r\ncnt = 0\r\nfor i in range(1, n+1):\r\n if parent[i] == i:\r\n cnt += 1\r\n\r\nif cnt == 1:\r\n print(total)\r\nelse:\r\n print(-1)\r\n", "from collections import defaultdict\r\ndef main():\r\n n = int(input())\r\n q = list(map(int,input().split()))\r\n m = int(input())\r\n apps = []\r\n adj_list = defaultdict(list)\r\n\r\n for _ in range(m):\r\n cur_input = list(map(int,input().split()))\r\n apps.append(cur_input)\r\n sup,emp,cost = cur_input[0],cur_input[1],cur_input[2]\r\n adj_list[sup].append((emp,cost))\r\n \r\n\r\n apps.sort(key=lambda x:x[2])\r\n # print(apps)\r\n total_cost = 0\r\n parents = {i:-1 for i in range(1,n+1)}\r\n edges = 0\r\n # print('here')\r\n for sup,emp,cost in apps:\r\n # print(sup,emp,cost,parents)\r\n if parents[emp] == -1:\r\n union(sup,emp,parents)\r\n total_cost += cost\r\n edges += 1\r\n\r\n if edges >= n-1: \r\n print(total_cost)\r\n else:\r\n print(-1)\r\n \r\n\r\ndef union(x,y,parents):\r\n xset = find(x,parents)\r\n yset = find(y,parents)\r\n if xset == yset:\r\n return True\r\n parents[yset] = xset\r\n\r\ndef find(x,parents):\r\n if parents[x] == -1:\r\n return x\r\n parents[x] = find(parents[x],parents)\r\n return parents[x]\r\nmain()", "import sys\ninput = sys.stdin.readline\n \ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\n \ndef getResult(n,q,m,edges,graph):\n maxq = max(q)\n pRoots = [i for i, j in enumerate(q) if j == maxq]\n canBeSubbordinateFor = []\n count = 0\n for i in range(n):\n canBeSubbordinateForEach = []\n for u,v,c in edges :\n if v == i :\n canBeSubbordinateForEach.append(c)\n canBeSubbordinateFor.append(canBeSubbordinateForEach)\n if len(canBeSubbordinateForEach) == 0 :\n count+=1;\n if count > 1 :\n return -1\n \n cost = 0\n for i in range(n):\n if len(canBeSubbordinateFor[i]) > 0:\n cost += min(canBeSubbordinateFor[i])\n return cost\n \n \nif __name__ == '__main__':\n n = inp()\n q = inlt()\n m = inp()\n edges = []\n graph = []\n for i in range(n):\n line = []\n for j in range(n):\n line.append(-1)\n graph.append(line)\n \n for i in range(m):\n ed = inlt()\n ed[0] = ed[0]-1\n ed[1] = ed[1]-1\n edges.append(ed)\n \n \n for u,v,c in edges:\n if graph[u][v] > c :\n graph[u][v] = c\n else:\n if graph[u][v] == -1 :\n graph[u][v] = c\n \n result = getResult(n,q,m,edges,graph)\n print(result)\n \t\t \t \t\t \t \t \t \t \t\t\t", "n=int(input())\r\ninput()\r\nm=int(input())\r\nzp_nach=[-1]*(n+1)\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split())\r\n if zp_nach[b]==-1:\r\n zp_nach[b]=c\r\n else:\r\n zp_nach[b]=min(c,zp_nach[b])\r\nif zp_nach.count(-1)==2:\r\n print(sum(zp_nach)+2)\r\nelse:\r\n print(-1)\r\n", "I=input\r\nR=lambda:map(int,I().split())\r\nn=int(I())\r\na=[*R()]\r\nm=int(I())\r\nq={}\r\nfor i in range(n):q[i+1]=set()\r\nfor i in range(m):\r\n a,b,c=R()\r\n q[b].add(c)\r\nt=0\r\nfor i in q:\r\n if len(q[i])==0:t+=1\r\nprint(-1 if t>1 else sum(min(q[i])if q[i] else 0 for i in q))", "arr = [-1] * int(input())\nvalor2 = input()\nm = int(input())\n\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n if arr[b-1] == -1:\n arr[b-1] = c\n else:\n arr[b-1] = min(arr[b-1],c)\n\nif (arr.count(-1) > 1):\n print(-1)\nelse:\n print(sum(arr, 1))\n \t\t\t \t \t\t \t\t \t \t \t\t \t\t \t \t", "n = int(input())\n\ninput()\n\nm = int(input())\n\nsupervisor = [[] for _ in range(n)]\n\nfor i in range(m):\n a, b, c = map(int, input().split())\n\n supervisor[b-1].append(c)\n\n\nboss = 0\nans = 0\nfor i in range(n):\n if len(supervisor[i]) > 0:\n ans += min(supervisor[i])\n else:\n boss += 1\n\n\nif boss == 1:\n print(ans)\n\nelse:\n print(-1)\n\n\n", "n = int(input())\nqualifications = list(map(int, input().split()))\napps = []\nlimit = (10 ** 6) + 1\nresult = [limit for i in range(n)]\nm = int(input())\n \nfor i in range(m):\n a, b, c = map(int, input().split())\n result[b - 1] = min(result[b - 1], c)\n \ncount = 0\nfor i in result:\n if i == limit:\n count += 1\nif count > 1:\n print(-1)\nelse:\n out = 0\n for i in result:\n if i != limit:\n out += i\n print(out)\n\t \t\t\t\t \t \t\t\t \t\t\t\t \t\t \t\t \t", "n = int(input())\r\nq = [int(i) for i in input().split()]\r\nm = int(input())\r\nd = {}\r\nfor i in range(m):\r\n a,b,c = map(int,input().split())\r\n if b in d:\r\n if c < d[b]:\r\n d[b] = c\r\n else:\r\n d[b] = c\r\nm = max(q)\r\nnum = 0\r\nind = 0\r\nfor i in range(n):\r\n if m == q[i]:\r\n num += 1\r\n ind = i\r\nif num > 1:\r\n print(-1)\r\nelse:\r\n if len(d.keys()) < n -1:\r\n print(-1)\r\n else:\r\n sum = 0\r\n for i in d:\r\n sum += d[i]\r\n print(sum)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "'''input\r\n4\r\n7 2 3 1\r\n4\r\n1 2 5\r\n2 4 1\r\n3 4 1\r\n1 3 5\r\n'''\r\n\r\ndef root(node):\r\n\twhile parent[node]!=node:\r\n\t\tparent[node]=parent[parent[node]] # Path Compression\r\n\t\tnode = parent[node]\r\n\treturn node\r\n\r\ndef union(a,b):\r\n\troot_a = root(a)\r\n\troot_b = root(b)\r\n\tif parent.count(root_a)>parent.count(root_b): # Union by rank\r\n\t\tparent[root_b] = root_a\r\n\telse:\r\n\t\tparent[root_a] = root_b\r\n\r\n\r\ndef find(a,b):\r\n\tif root(a)==root(b):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\nn=int(input())\r\nl=list(map(int,input().strip().split(' ')))\r\nq=int(input())\r\ng=[] # adjacency list\r\nfor i in range(q):\r\n\tu,v,w=map(int,input().strip().split(' '))\r\n\tg.append([u-1,v-1,w]) # [src,dest,weight]\r\nparent = [i for i in range(n)]\r\ng.sort(key=lambda x : (x[2]))\r\n# print(g)\r\nmst=[]\r\ne=0\r\ni=0\r\nassigned=[False]*n\r\nwhile e<n-1 and i<q:\r\n\tu=g[i][0]\r\n\tv=g[i][1]\r\n\t# print(u,root(u),v,root(v))\r\n\tif assigned[v]==False and find(u,v)==False:\r\n\t\tassigned[v]=True\r\n\t\tmst.append(g[i])\r\n\t\tunion(u,v)\r\n\t\te+=1\r\n\ti+=1\r\nif assigned.count(False)>1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(sum(x[2] for x in mst))", "n = int(input())\nls = [int(i) for i in input().split()]\npar = list(range(0,n+1))\nappls = []\nfor i in range(int(input())):\n x,y,z = [int(i) for i in input().split()]\n appls.append((x,y,z))\n \nappls.sort(key=lambda item: item[2])\n \ndef find(p):\n return par[p]\n \ncount = 0\nfor tup in appls:\n if tup[1]==find(tup[1]):\n par[tup[1]] = tup[0]\n count+=tup[2]\nres = 0\nfor i in range(1,n+1):\n if i==par[i]:\n res+=1\nif res==1:\n print(count)\nelse:\n print(-1)\n \t\t\t \t \t\t\t \t \t\t\t \t \t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nm = int(input())\r\nd = [[] for i in range(n)]\r\nx = set()\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n d[b-1].append(c)\r\n x.add(b-1)\r\n\r\nif len(x) != n-1:\r\n print(-1)\r\n exit()\r\n\r\nc = 0\r\nfor i in range(n):\r\n if len(d[i]) != 0:\r\n c += min(d[i])\r\n\r\nprint(c)", "from sys import stdin\r\nfrom collections import defaultdict\r\nfrom heapq import *\r\nn = int(input())\r\nq = list(map(int, input().split()))\r\nm = int(input())\r\nheap = []\r\ndsu = list(range(n + 1))\r\ncost = dict()\r\nparent = [None] * (n + 1)\r\ndef find(x):\r\n while x != dsu[x]:\r\n dsu[x] = dsu[dsu[x]]\r\n x = dsu[x]\r\n return x\r\nfor line in stdin:\r\n a, b, c = map(int, line.split())\r\n z = parent[b]\r\n if not z or c < z[1]:\r\n parent[b] = (a, c)\r\n\r\n dsu[find(b)] = find(a)\r\n # if (a, b) not in cost:\r\n # cost[(a,b)] = c\r\n # else:\r\n # cost[(a,b)] = min(cost[(a,b)], c)\r\n\r\ndef connected():\r\n s = set()\r\n for i in range(1, n+1):\r\n s.add(find(i))\r\n if len(s) >= 2:\r\n return False\r\n return True\r\n\r\ndef answer():\r\n c = 0\r\n total =0\r\n for i in range(1, n+1):\r\n if parent[i] is None:\r\n c += 1\r\n if c == 2:\r\n return -1\r\n else:\r\n total += parent[i][1]\r\n return total\r\n\r\nprint(answer())", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\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\nq = ints()\r\nm = int(input())\r\nedges = []\r\nfor _ in range(m):\r\n a, b, c = ints()\r\n edges.append((a - 1, b - 1, c))\r\n\r\ndsu = UnionFind(n)\r\nedges.sort(key=lambda x: x[2])\r\n\r\ncost = 0\r\ndone = {}\r\nfor e in edges:\r\n if not dsu.same(e[0], e[1]) and str(e[1]) not in done:\r\n cost += e[2]\r\n dsu.join(e[0], e[1])\r\n done[str(e[1])] = True\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if dsu.link[i] == i:\r\n count += 1\r\n\r\nif count > 1:\r\n print(\"-1\")\r\nelse:\r\n print(cost)", "def main():\n n = int(input())\n cost = [0] * (n+1)\n check = [False] * (n+1)\n temp = map(int, input().split())\n\n m = int(input())\n total = 0\n childs = 0\n\n for i in range(1, m+1):\n a, b, c = map(int, input().split())\n if not check[b]:\n childs += 1\n total += c\n cost[b] = c\n check[b] = True\n else:\n if cost[b] > c:\n total = total - cost[b] + c\n cost[b] = c\n\n if childs == n-1:\n print(total)\n else:\n print(-1)\n\nmain()\n\n\t\t \t \t\t\t\t \t \t\t \t", "n = int(input())\nparent = [i for i in range(n)]\n\n\ndef root(node):\n while parent[node] != node:\n parent[node] = parent[parent[node]]\n node = parent[node]\n return node\n\n\ndef union(a, b):\n root_a = root(a)\n root_b = root(b)\n if parent.count(root_a) > parent.count(root_b):\n parent[root_b] = root_a\n else:\n parent[root_a] = root_b\n\n\ndef find(a, b):\n if root(a) == root(b):\n return True\n return False\n\n\nl = list(map(int, input().split()))\nq = int(input())\ngrafo = []\nfor i in range(q):\n u, v, w = map(int, input().split())\n grafo.append((w, u - 1, v - 1))\n\ngrafo.sort()\nresultado = 0\ne = 0\ni = 0\nassociado = [False] * n\nwhile e < n - 1 and i < q:\n w, u, v = grafo[i]\n if not associado[v] and not find(u, v):\n associado[v] = True\n resultado += w\n union(u, v)\n e += 1\n i += 1\nif associado.count(False) > 1:\n print(-1)\nelse:\n print(resultado)\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\ns=0\r\nd={}\r\nfor i in range(m):\r\n a,b,c=(int(i) for i in input().split())\r\n if(b in d):\r\n d[b]=min(d[b],c)\r\n else:\r\n d[b]=c\r\nc1=0\r\nfor i in range(1,n+1):\r\n if(i not in d):\r\n c1+=1\r\nif(c1>1):\r\n print(-1)\r\nelse:\r\n for i in d:\r\n s+=d[i]\r\n print(s)", "n = int(input())\nq = [int(i) for i in input().split()]\nm = int(input())\nA = [[int(j)-1 for j in input().split()] for i in range(m)]\nlist_of_potential_employer = [[] for i in range(n)]\nhigh_cost = 10**6 + 2\nleast_cost = [high_cost for i in range(n)]\nfor i in range(m):\n list_of_potential_employer[A[i][1]].append(A[i][0])\n least_cost[A[i][1]] = min(least_cost[A[i][1]], A[i][2]+1)\nzero_count = 0\nfor i in list_of_potential_employer:\n if len(i) == 0:\n zero_count += 1\nif zero_count > 1:\n print(-1)\nelse:\n print(sum([i for i in least_cost if i < high_cost]))\n \t \t \t\t \t \t \t \t\t\t\t \t\t\t\t\t", "from heapq import *\r\n\r\n\r\nclass TREE:\r\n def __init__(self, n) -> None:\r\n self.parent = [i for i in range(n + 1)]\r\n self.numSets = n\r\n\r\n def findParent(self, i):\r\n return self.parent[i]\r\n\r\n def addEdge(self, i, j):\r\n self.parent[j] = i\r\n self.numSets -= 1\r\n\r\n\r\nn = int(input())\r\ntree = TREE(n)\r\narr = list(map(int, input().split()))\r\n\r\nm = int(input())\r\npq = []\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n heappush(pq, (c, a, b))\r\n\r\ns = 0\r\nwhile pq:\r\n edge = heappop(pq)\r\n c = edge[0]\r\n a = edge[1]\r\n b = edge[2]\r\n\r\n if tree.findParent(b) == b:\r\n tree.addEdge(a, b)\r\n s += c\r\n\r\nprint(s if tree.numSets == 1 else -1)\r\n", "n = int(input())\nq = list(map(int, input().split()))\nm = int(input())\n\nA = [0] * m\nfor i in range(m):\n entry = list(map(int, input().split()))\n for j in range(len(entry)):\n entry[j] -= 1\n A[i] = entry\n\ne = [0] * n\nfor i in range(n):\n e[i] = []\n\nh = 10**6 + 2\nl = [h] * n\n\nfor i in range(m):\n e[A[i][1]].append(A[i][0])\n l[A[i][1]] = min(l[A[i][1]], A[i][2]+1)\n\ncount = 0\nfor i in e:\n if len(i) == 0:\n count += 1\n\nif(count > 1):\n print(-1)\n \nelse:\n print(sum([i for i in l if i < h]))\n \n \t\t\t \t\t\t \t \t \t \t\t\t \t\t\t", "n=int(input())\r\ninput()\r\nm=int(input())\r\nl=[]\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n l.append([b,c,a])\r\nl.sort()\r\n\r\nx=0\r\nk=0\r\ns=0\r\nfor i in l:\r\n if i[0]!=k:\r\n x+=1\r\n k=i[0]\r\n s+=i[1]\r\n\r\nif x<n-1:print(-1)\r\nelse:print(s)\r\n \r\n \r\n", "from collections import namedtuple\n\nEdge = namedtuple(\"Edge\", [\"q\", \"b\", \"len\"])\n\nn = int(input())\nq = list(map(int, input().split()))\nm = int(input())\nedges = []\nfor i in range(m):\n a, b, len = map(int, input().split())\n edges.append(Edge(q[b - 1], b - 1, len))\n\nedges.sort()\nedges.append(Edge(-1, -1, -1))\ntotal_cost = 0\ncnt = 0\nfor i in range(m):\n if edges[i].b != edges[i - 1].b:\n total_cost += edges[i].len\n cnt += 1\nif cnt == n - 1:\n print(total_cost)\nelse:\n print(-1)\n", "n = int(input())\r\nq = map(int, input().split())\r\ncost = n * [-1] \r\nfor i in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n b -= 1\r\n if(cost[b] != -1):\r\n aux = min(cost[b], c) \r\n cost[b] = aux\r\n else:\r\n cost[b] = c \r\n\r\nres = sum(cost) + 1\r\naux = cost.count(-1)\r\nif(aux <= 1):\r\n print(res)\r\nelse:\r\n print(-1)\r\n \t\t \t\t \t\t \t\t \t\t \t\t\t\t \t\t\t\t\t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nP = [[] for _ in range(N)]\r\nfor _ in range(int(input())):\r\n a,b,c = map(int, input().split())\r\n P[b-1].append((c,a-1))\r\n\r\npre = -1\r\nidx = -1\r\nfor i in range(N):\r\n if A[i]>pre:\r\n idx = i\r\n pre = A[i]\r\n \r\nans = 0\r\nfor i in range(N):\r\n if i==idx:continue\r\n b = P[i]\r\n b.sort()\r\n if b:\r\n ans += b[0][0]\r\n else:\r\n exit(print(-1))\r\nprint(ans)\r\n\r\n" ]

[ "from array import array\r\nfrom sys import stdin\r\nimport bisect\r\nfrom bisect import *\r\nimport itertools\r\nfrom itertools import *\r\n\r\ndef scan_gen():\r\n for line in stdin: yield from iter(line.split())\r\nscan = scan_gen()\r\ndef nint(): return int(next(scan))\r\ndef nintk(k): return tuple(nint() for _ in range(k))\r\ndef nfloat(): return float(next(scan))\r\ndef intar_init(size): return array('i',[0]) *size\r\ndef intar(size=None):\r\n if size == None: size = nint()\r\n arr = intar_init(size) \r\n for x in range(size): arr[x]=nint()\r\n return arr\r\n\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef solve():\r\n n,m = nintk(2)\r\n if m <n-1:\r\n print(\"Impossible\")\r\n return\r\n res = []\r\n for x in range(2,n+1):\r\n res += [(1,x)]\r\n m-=1\r\n for (x,y) in product(range(2,n+1), range(2,n+1)):\r\n if x<y and gcd(x,y)==1:\r\n if m==0 : break\r\n res += [(x,y)]\r\n m -=1\r\n if m==0 : break\r\n if m !=0: \r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n for p in res:\r\n print(*p)\r\n\r\nsolve()\r\n\r\n", "import sys\r\nimport math\r\nn,m=map(int,(input().split()))\r\nif m<n-1:\r\n print (\"Impossible\")\r\n sys.exit()\r\nl=[]\r\nfor i in range(1,n):\r\n l.append((i,i+1))\r\nm-=(n-1)\r\nfor i in range(1,n+1):\r\n if m==0: break\r\n for j in range(i+2,n+1):\r\n if (math.gcd(i,j))==1:\r\n l.append((i,j))\r\n m-=1\r\n if m==0: break\r\nif m==0:\r\n print (\"Possible\")\r\n for a,b in l:\r\n print (a,b)\r\nelse: print (\"Impossible\")", "def gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\nn, m = [int(i) for i in input().split()]\r\n\r\nmi = n - 1\r\nmx = (n * (n - 1)) // 2\r\n\r\nif m < mi:\r\n print(\"Impossible\")\r\n\r\nelse:\r\n\r\n l = []\r\n c = 0\r\n for i in range(1, n):\r\n for j in range(i + 1, n + 1):\r\n\r\n if gcd(i, j) == 1:\r\n l.append([i, j])\r\n c += 1\r\n if c == m:\r\n break\r\n if c == m:\r\n break\r\n if c == m:\r\n print(\"Possible\")\r\n for i in l:\r\n print(*i)\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\n \r\n \r\n", "from math import gcd\r\n\r\n\r\nn,m=map(int,input().split())\r\nif m<n-1:\r\n\tprint('Impossible')\r\n\texit()\r\nel=[]\r\nfor b in range(1,n):\r\n\tif len(el)==m:break\r\n\tfor o in range(b+1,n+1):\r\n\t\tif len(el)==m:break\r\n\t\tif gcd(b,o)!=1:continue\r\n\t\tel.append((b,o))\r\n\r\nif len(el)<m:\r\n\tprint('Impossible')\r\n\texit()\r\n\r\nprint('Possible\\n'+'\\n'.join(map(lambda e:f'{e[0]} {e[1]}',el)))\r\n", "import sys\nfrom functools import lru_cache\nfrom collections import defaultdict, deque \nfrom types import GeneratorType\ninput = sys.stdin.readline\n\ndef gcd(a, b):\n\n while a % b != 0:\n a, b = b, a % b\n return b\n\ndef solve(n, m):\n \n if m < n - 1:\n print(\"Impossible\")\n return \n\n edges = []\n for i in range(1, n+1):\n for j in range(i+1, n+1):\n if gcd(j, i) == 1:\n edges.append((i, j))\n \n if len(edges) == m:\n print(\"Possible\") \n for edge in edges:\n print(*edge)\n return \n \n print(\"Impossible\")\n \n \nif __name__ == \"__main__\":\n n, m = [int(val) for val in input().split()]\n \n solve(n, m)\n \n \n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nif(m<n-1):\r\n print(\"Impossible\")\r\nelse:\r\n l=[]\r\n c=0\r\n for i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if(math.gcd(i,j)==1):\r\n l.append([i,j])\r\n c+=1\r\n if(c==m):\r\n break\r\n if(c==m):\r\n break\r\n if(c<m):\r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n for i in range(m):\r\n print(*l[i])", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nif n > m + 1:\r\n ans = \"Impossible\"\r\n print(ans)\r\n exit()\r\nuv = []\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if math.gcd(i, j) == 1:\r\n uv.append((i, j))\r\n if len(uv) == m:\r\n break\r\n if len(uv) == m:\r\n break\r\nans = \"Possible\" if len(uv) == m else \"Impossible\"\r\nprint(ans)\r\nif ans == \"Possible\":\r\n for u, v in uv:\r\n print(u, v)", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\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 from fractions import gcd\r\n n, m = map(int, input().split())\r\n a = []\r\n for i in range(1, n):\r\n for j in range(i+1, n+1):\r\n if gcd(i, j) == 1:\r\n a.append([i, j])\r\n if len(a) == m:\r\n break\r\n if len(a) == m:\r\n break\r\n if m < n-1 or len(a) != m:\r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n for x in a:\r\n print(x[0], x[1])\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", "from operator import itemgetter\r\nfrom typing import *\r\nfrom collections import deque, Counter, defaultdict\r\nfrom bisect import *\r\nimport heapq, math\r\nfrom functools import cmp_to_key, reduce\r\n\r\n# from sortedcontainers import SortedSet\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n if m < n - 1:\r\n print(\"Impossible\")\r\n else:\r\n\r\n def tmp_fn():\r\n for i in range(1, n):\r\n for j in range(i + 1, n + 1):\r\n if math.gcd(i, j) == 1:\r\n yield (i, j)\r\n\r\n ans = [(x, y) for _, (x, y) in zip(range(m), tmp_fn())]\r\n if len(ans) == m:\r\n print(\"Possible\")\r\n for x, y in ans:\r\n print(f\"{x} {y}\")\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\nmain()\r\n", "from math import *\r\nn,m=map(int,input().split())\r\na,c='Possible',0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if gcd(i,j)==1:\r\n c+=1; a+='\\n%d %d'%(i,j)\r\n if c==m: break\r\n if c==m: break\r\nprint(a if c==m and m>n-2 else 'Impossible')", "import math\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(1, n+1):\r\n j = i + 1\r\n while len(a) < m and j <= n:\r\n if math.gcd(i, j) == 1:\r\n a.append([i, j])\r\n j += 1\r\n\r\nif len(a) != m or m < n-1:\r\n print(\"Impossible\")\r\nelse:\r\n print('Possible')\r\n for i in a:\r\n print(i[0], i[1])", "n,m=map(int,input().split())\r\nimport math \r\nif m<n-1 or m>(n-1)*n//2:print(\"Impossible\");exit()\r\nans=[[1,i] for i in range(2,n+1)]\r\nm-=n-1\r\ni=0\r\nb=2\r\nk=b+1\r\nwhile i<m and b<n:\r\n\tif math.gcd(b,k)==1:\r\n\t\ti+=1\r\n\t\tans.append([b,k])\r\n\tk+=1\r\n\tif k==n+1:\r\n\t\tb+=1\r\n\t\tk=b+1\r\nif i==m:\r\n\tprint(\"Possible\")\r\n\tfor i in ans:\r\n\t\tprint(*i)\r\nelse:\r\n\tprint(\"Impossible\")", "n, m = map(int, input().split())\r\n\r\nif m < n-1:\r\n print('Impossible')\r\n exit()\r\n\r\nans = []\r\nimport math\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n if len(ans) == m:\r\n break\r\n if math.gcd(i+1, j+1) == 1:\r\n ans.append((i+1, j+1))\r\n else:\r\n continue\r\n break\r\n\r\nif len(ans) == m:\r\n print('Possible')\r\n for i in range(m):\r\n print(*ans[i])\r\nelse:\r\n print('Impossible')\r\n", "from itertools import islice\ndef get_all(n):\n q = [(0, 1, 1, 1)]\n while q:\n a, b, c, d = q.pop()\n e, f = a + c, b + d\n if f <= n:\n yield e, f\n q.append((a, b, e, f))\n q.append((e, f, c, d))\n\ndef solve(n, m):\n x = list(islice(get_all(n), m))\n if len(x) == m >= n - 1:\n return x\n\nres = solve(*map(int, input().split()))\nif res is not None:\n print('Possible')\n for e in res: print(*e)\nelse:\n print('Impossible')\n", "import unittest\n\ndef gcd(a, b) :\n while b != 0 :\n a , b = b, a % b\n return a\n\ndef rel_prime_graph(_vertices, _req_edges) :\n found_solution = False\n solution = []\n if _req_edges + 1 >= _vertices :\n for bvertex in range (1, _vertices) :\n if found_solution is True :\n break\n for evertex in range (bvertex + 1, _vertices + 1) :\n if gcd(bvertex, evertex) == 1 :\n solution.append((bvertex, evertex))\n if len(solution) == _req_edges :\n found_solution = True\n break\n\n return (\"Possible\", solution) if found_solution else (\"Impossible\", [])\n\nclass TestScenario(unittest.TestCase) :\n\n def testUnitTest(self):\n self.assertEqual(3,gcd(9, 6))\n self.assertEqual(3,gcd(6, 9))\n self.assertEqual(6,gcd(6, 6))\n self.assertEqual(6,gcd(0, 6))\n self.assertEqual(6,gcd(6, 0))\n self.assertEqual(1,gcd(6, 1))\n self.assertEqual(1,gcd(1, 6))\n\n (found, solution) = rel_prime_graph(5, 6)\n self.assertEqual(found, \"Possible\")\n (found, solution) = rel_prime_graph(6, 12)\n self.assertEqual(found, \"Impossible\")\n (found, solution) = rel_prime_graph(6, 2)\n self.assertEqual(found, \"Impossible\")\n pass\n\nif __name__ == \"__main__\":\n [vertices, edges] = list(map(int, input().split()))\n (found, solution) = rel_prime_graph(vertices, edges)\n print(found) \n for sol in solution :\n print(str(sol[0]) + \" \" + str(sol[1]))\n\n unittest.main()\n", "from math import gcd\r\nn,m=map(int,input().split())\r\nl=[]\r\ncnt=0\r\nif n>=m+2:\r\n print(\"Impossible\")\r\nelse:\r\n for i in range(1,n):\r\n l.append([i,i+1])\r\n cnt=cnt+1\r\n if cnt==m:\r\n break\r\n for i in range(1,n+1):\r\n if cnt==m:\r\n break\r\n for j in range(i+2,n+1):\r\n if gcd(i,j)==1:\r\n l.append([i,j])\r\n cnt=cnt+1\r\n if(cnt==m):\r\n break\r\n if cnt<m:\r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n for i in l:\r\n print(i[0],end=\" \")\r\n print(i[1])", "import math\r\nn, m = [int(x) for x in input().split()]\r\nif m < n - 1:\r\n print(\"Impossible\")\r\nelse:\r\n count = 0\r\n flag = False\r\n ans = list()\r\n for i in range(1, n):\r\n if flag:\r\n break\r\n for j in range(i+1, n+1):\r\n if count == m:\r\n flag = True\r\n break\r\n if math.gcd(i, j) == 1:\r\n count += 1\r\n ans.append([i, j])\r\n if count < m:\r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n for x in ans:\r\n print(x[0], x[1])\r\n ", "\r\nimport math\r\nn,m=map(int,input().split())\r\nif(m<n-1):\r\n print('Impossible')\r\n\r\nelse:\r\n\r\n c=0\r\n flag=0\r\n for i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if(math.gcd(i,j)==1):\r\n #print(i,j)\r\n c+=1\r\n if(c>=m):\r\n flag=1\r\n break\r\n\r\n if(flag==1):\r\n break\r\n\r\n\r\n if(flag==0):\r\n print('Impossible')\r\n else:\r\n print('Possible')\r\n c=0\r\n flag=0\r\n for i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if(math.gcd(i,j)==1):\r\n print(i,j)\r\n c+=1\r\n if(c>=m):\r\n flag=1\r\n break\r\n\r\n if(flag==1):\r\n break\r\n\r\n \r\n\r\n \r\n", "from math import gcd\r\n\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m = map(int, input().split())\\\r\n\r\n# m=n-1\r\n\r\nif m < n-1:\r\n print('Impossible')\r\n exit()\r\nres = []\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if len(res) == m:\r\n break\r\n if (gcd(i+1, j+1) == 1):\r\n res.append([i+1, j+1])\r\n\r\nif len(res) != m:\r\n print('Impossible')\r\n exit()\r\n\r\nprint('Possible')\r\nfor i in res:\r\n print(*i)\r\n", "############################################## Libraries ###########################################################\r\n\r\nimport sys\r\nfrom math import gcd,ceil,log\r\nfrom queue import PriorityQueue\r\nfrom bisect import bisect_left\r\nfrom collections import deque\r\n\r\n############################################## Definitions #########################################################\r\n\r\nmod = pow(10,9)+7\r\ne = pow(10,-6)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nN = pow(10,6)\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\n############################################## Input forms #########################################################\r\n\r\ndef imap(): # Multiple numbers input\r\n return map(int,input().split())\r\n\r\ndef ilist(): # List input \r\n return list(map(int,input().split()))\r\n\r\ndef ilgraph(n,m): # Graph input as Adjacency List\r\n\r\n l = [[]for i in range(n+1)]\r\n for i in range(m):\r\n x,y = imap()\r\n l[x].append(y)\r\n l[y].append(x)\r\n return l\r\n\r\ndef iagraph(n,m): # Graph input as Adjacency Matrix\r\n l = [[0 for i in range(n+1)]for i in range(n+1)]\r\n for i in range(m):\r\n x,y = imap()\r\n l[x][y] = 1\r\n l[y][x] = 1\r\n return l\r\n\r\n############################################## Data Structures #######################################################\r\n\r\nclass SegmentTree: # //O(logn) for operations and O(n) for building//\r\n\r\n def init(arr): # n shld be a power of 2...hence add extra zeros before itself if needed //O(n)//\r\n n = len(arr)\r\n tree = [0]*(2*n) \r\n for i in range(n):\r\n tree[n+i] = arr[i] # The actual array is between indices n to 2*n-1 the first nodes store sums\r\n\r\n for i in range(n-1,-1,-1):\r\n tree[i] = tree[i<<1]+tree[(i<<1) | 1] # parent node value = child node's sum i<<1 = 2*i, i<<1 |1 = 2*i+1\r\n return tree\r\n \r\n def add(tree,i,v): # Sets vertex i to value v (i shld be 0 based indexing) //O(logn)//\r\n i += len(tree)//2 # As the actual array is between n and 2*n-1, we add n to i (n = len(tree)//2)\r\n tree[i] = v\r\n while i>1:\r\n tree[i>>1] = tree[i]+tree[i^1] \r\n i >>=1\r\n # Calculating the values of prev nodes. (eg if node 9 is changed 9>>1 = 4 takes values of node i(9) and node i^1(8))\r\n\r\n def range_sum(tree,l, r): # calculates the sum of values in the range [l,r-1] (l and r take 0 based indexing) //O(logn)//\r\n l += len(tree)//2\r\n r += len(tree)//2\r\n sum = 0\r\n while l<r: \r\n if l&1:\r\n sum += tree[l] # If the index is odd, add its value to sum. if the index is even it means there would be a parent \r\n l += 1 # of this with odd index\r\n if r&1:\r\n r -= 1\r\n sum += tree[r]\r\n l >>= 1\r\n r >>= 1\r\n return sum\r\n\r\n############################################# Common functions #######################################################\r\n\r\ndef freq(l): # Returns count of a number in a list/string // O(nlog(n)) //\r\n d = {}\r\n for i in l:\r\n d[i] = d.get(i,0)+1\r\n return d\r\n\r\ndef prefix_sum_2d(l): #Returns the 2d prefix sum array of size (n+1)*(m+1) with 0 padded on first row and first col for easy calc.\r\n n = len(l)\r\n m = len(l[0])\r\n p = [[0 for i in range(m+1)] for j in range(n+1)]\r\n\r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n p[i][j] = p[i-1][j]+p[i][j-1]+l[i-1][j-1]-p[i-1][j-1]\r\n return p \r\n \r\n # //O(nm)//\r\n\r\n############################################### Number Theory #########################################################\r\n\r\ndef is_pow2(x): #Checks if a number is a power of 2 // O(1) //\r\n return max(1-(x&(x-1)),0)\r\n\r\ndef lgcd(l): # Returns gcd of a list // O(nlog(n)) //\r\n a = 0\r\n for i in l:\r\n a = gcd(a,i)\r\n return a\r\n\r\ndef SieveOfEratosthenes(num): # Returns an array with Prime numbers upto num // O(nlog(log(n))) //\r\n prime = [True for i in range(num+1)]\r\n Highest_Prime = [0 for i in range(num+1)] # Returns an array with the highest prime factor of each i between 0 and Num \r\n Lowest_Prime = [0 for i in range(num+1)] # Returns an array with the lowest prime factor of each i between 0 and Num\r\n prime[0] = prime[1] = False\r\n p = 2\r\n while (p <= num):\r\n if (prime[p] == True):\r\n Lowest_Prime[p] = p\r\n Highest_Prime[p] = p\r\n for i in range(2*p, num+1, p):\r\n prime[i] = False\r\n Highest_Prime[i] = p\r\n if Lowest_Prime[i] == 0:\r\n Lowest_Prime[i] = p\r\n p += 1\r\n # print(prime,'\\n',Highest_Prime,'\\n',Lowest_Prime) #Checker\r\n return Lowest_Prime #An array containing the lowest prime factors of all numbers till num\r\n\r\n # return Highest_Prime # An array containing the highest prime factors of all numbers till num\r\n\r\n # return prime # An array with boolean values indicating if the number is prime/not prime\r\n p = []\r\n for i in range(num+1):\r\n if prime[i]:\r\n p.append(i)\r\n return p # An array with just prime numbers till the given number\r\n\r\ndef PrimeFactors(num,Prime_array):# Returns a dictionary with prime factors mapped with their respective powers // O(nlogn) //\r\n \r\n # COmplexity is O(logn) for this code, but this requires that u have a Prime array which could be highest or lowest prime which can be calculated from the prev Sieve of Erastothenes) hence over complexity is O(nlogn)\r\n \r\n d = {}\r\n while num != 1: \r\n x = Prime_array[num]\r\n d[x] = d.get(x,0)+1\r\n num//=x\r\n return d\r\n\r\ndef facotrization(n): #returns a dict with prime factors and their powers for a given number in // O(sqrt(n)) // \r\n #Use this approach if you don't have a prime array\r\n \r\n d = {}\r\n x = 2\r\n while x*x<=n:\r\n while n%x == 0:\r\n d[x] = d.get(x,0)+1\r\n n//=x\r\n x += 1\r\n if n>1:\r\n d[n] = d.get(n,0)+1\r\n return d\r\n\r\ndef ETF(n,p):\r\n # p is the prime array.\r\n # n is the number\r\n\r\n d = PrimeFactors(n,p)\r\n\r\n for i in d:\r\n n = n*(i-1)//i\r\n return n\r\n\r\n################################################## Combinatorics ############################################################\r\n\r\ndef fact(n,mod): #Returns the factorial of all numvers from 1 to n % mod\r\n f = [1]\r\n for i in range(1,n+1):\r\n f.append((f[i-1]*i%mod)%mod)\r\n return f\r\n\r\ndef dearrange(n,mod): #Returns an array containing the dearragements of all numbers from 1 to n % mod\r\n if mod == -1:\r\n dearr = [1,0]\r\n for i in range(2,n+1):\r\n dearr.append((i-1)*(dearr[i-1]+dearr[i-2]))\r\n else:\r\n dearr = [1,0]\r\n for i in range(2,n+1):\r\n dearr.append(((i-1)%mod*(dearr[i-1]+dearr[i-2])%mod)%mod)\r\n return dearr\r\n\r\n################################################ Binary Arithmetic ##########################################################\r\n\r\ndef bin_search(p,x): #Returns -1 if the element doesn't exist in the list and its index if it does. //O(logn)//\r\n i = bisect_left(p, x)\r\n if i != len(p) and p[i] == x:\r\n return i\r\n else:\r\n return -1\r\n\r\ndef bin_left(p,x): #Returns the index of max element less than x and -1 if all elements r greater than x // O(logn) //\r\n n = len(p)\r\n l,r = 0,n-1\r\n if p[0]>x:\r\n return -1\r\n while l<=r:\r\n mid = (l+r)//2\r\n if p[mid] <= x:\r\n if mid != n-1:\r\n if p[mid+1]>x:\r\n break\r\n else:\r\n l = mid+1\r\n else:\r\n mid = n-1\r\n break\r\n else:\r\n r = mid-1\r\n return mid\r\n\r\ndef bin_right(p,x): #Returns the index of min element greater than x and n if all elements r less than x // O(logn) //\r\n n = len(p)\r\n l,r = 0,n-1\r\n if p[-1]<x:\r\n return n\r\n\r\n while l<=r:\r\n mid = (l+r)//2\r\n if p[mid] >= x:\r\n if mid != 0:\r\n if p[mid-1]<x:\r\n break\r\n else:\r\n r = mid-1\r\n else:\r\n mid = 0\r\n break\r\n else:\r\n l = mid+1\r\n return mid\r\n\r\ndef bin_sqrt(x): # Returns floor of sqrt // O(logx) //\r\n if x == 0 or x == 1:\r\n return x\r\n l = 1\r\n r = x\r\n while l<=r:\r\n mid = (l+r)/2\r\n y = mid*mid\r\n if y>x:\r\n r = mid-1\r\n elif y == x:\r\n return mid\r\n else:\r\n if ((mid+1)*(mid+1))>x:\r\n return mid\r\n else:\r\n l = mid+1\r\n \r\ndef bin_exp(a,b,mod): #Returns (a^b) mod m where 0 <= a,b <= 10^18 // O(log(b)) //\r\n ans = 1\r\n a %= mod\r\n while b:\r\n if b&1:\r\n ans = (ans*a)% mod\r\n a = (a*a)%mod\r\n b >>= 1\r\n return ans\r\n############################################################ DP #############################################################\r\n\r\ndef lcs(a, b): # Returns the longest common subsequence of two strings in //O(n^2)//\r\n dp = [[0]*(len(b)+1) for _ in range(len(a)+1)]\r\n for i in range(1,len(a)+1):\r\n for j in range(1,len(b)+1):\r\n if a[i-1] == b[j-1]:\r\n dp[i][j] = dp[i-1][j-1] + 1\r\n else:\r\n dp[i][j] = max(dp[i-1][j],dp[i][j-1])\r\n i,j = len(a),len(b)\r\n l = []\r\n while i!=0 and j!=0:\r\n if dp[i][j] == dp[i][j-1]:\r\n j-=1\r\n elif dp[i][j] == dp[i-1][j]:\r\n i-=1\r\n else:\r\n i-=1\r\n j-=1\r\n l.append(a[i])\r\n s = ''.join(l)\r\n # return len(s) \r\n return s[::-1]\r\n\r\ndef lis(arr): # Returns the length of longest increasing subsequence in an array of intigers/characters. // O(nlogn) //\r\n l = []\r\n for i in arr:\r\n pos = bisect_left(l,i)\r\n if pos == len(l): \r\n l.append(i) # we can have a new, longer increasing subsequence!\r\n else:\r\n l[pos] = i # At least we can make the ending element smaller\r\n return len(l)\r\n\r\n######################################################## Graph Algos ########################################################\r\n\r\ngraph = [] # Adjacenceny lists\r\nvis = [] # Visited array\r\n\r\ndef dfs(ver): # Ver = vertex on which dfs is applied\r\n stack = []\r\n stack.append(ver)\r\n vis[ver] = 1\r\n\r\n while (len(stack)):\r\n ver = stack.pop()\r\n print(ver,end = ' ')\r\n\r\n for node in graph[ver]:\r\n if (not vis[node]):\r\n stack.append(node)\r\n vis[node] = 1\r\n\r\ndef bfs(ver): # Ver = vertex on which dfs is applied\r\n q = deque()\r\n q.append(ver)\r\n vis[ver] = 1\r\n\r\n while (len(q)):\r\n ver = q.popleft()\r\n print(ver,end = ' ')\r\n\r\n for node in graph[ver]:\r\n if (not vis[node]):\r\n q.append(node)\r\n vis[node] = 1\r\n \r\n\r\n######################################################## Starting off #######################################################\r\n\r\nn,m = imap()\r\np = SieveOfEratosthenes(10**5)\r\n\r\ns = 0\r\nfor i in range(2,n+1):\r\n s += ETF(i,p)\r\n\r\nif m<(n-1) or m>s:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Possible\")\r\n\r\n for i in range(2,n+1):\r\n print(1,i)\r\n \r\n m -= (n-1)\r\n for i in range(2,n+1):\r\n for j in range(2,i):\r\n if (gcd(i,j) == 1):\r\n print(i,j)\r\n m -= 1\r\n if m == 0:\r\n break\r\n if m == 0:\r\n break\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n########################################################## By Shri ##########################################################\r\n", "from math import gcd\r\nfrom itertools import islice\r\ndef get_all(n):\r\n for i in range(1, n+1):\r\n for j in range(i+1, n+1):\r\n if gcd(i, j) == 1: yield i, j\r\n\r\ndef solve(n, m):\r\n x = list(islice(get_all(n), m))\r\n if len(x) == m >= n - 1:\r\n return x\r\n\r\nres = solve(*map(int, input().split()))\r\nif res is not None:\r\n print('Possible')\r\n for e in res: print(*e)\r\nelse:\r\n print('Impossible')\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef gcd(a, b):\r\n if a > b:\r\n a, b = b, a \r\n if b % a==0:\r\n return a \r\n return gcd(b % a, a)\r\n \r\ndef process(n, m):\r\n if m < n-1:\r\n sys.stdout.write('Impossible\\n')\r\n return\r\n answer = []\r\n for i in range(2, n+1):\r\n answer.append([1, i])\r\n m-=1 \r\n if m==0:\r\n sys.stdout.write('Possible\\n')\r\n for a, b in answer:\r\n sys.stdout.write(f'{a} {b}\\n')\r\n return\r\n for j in range(3, n+1):\r\n for i in range(2, j):\r\n if gcd(i, j)==1:\r\n answer.append([i, j])\r\n m-=1 \r\n if m==0:\r\n sys.stdout.write('Possible\\n')\r\n for a, b in answer:\r\n sys.stdout.write(f'{a} {b}\\n')\r\n return\r\n sys.stdout.write('Impossible\\n')\r\n \r\nn, m = [int(x) for x in input().split()]\r\nprocess(n, m)", "#!/usr/bin/python3\n\nimport math\n\n\ndef solve(N, M):\n if M < N - 1:\n return None\n\n edges = []\n for i in range(2, N + 1):\n edges.append((1, i))\n\n for u in range(2, N + 1):\n if len(edges) == M:\n break\n for v in range(u + 1, N + 1):\n if len(edges) == M:\n break\n if math.gcd(u, v) == 1:\n edges.append((u, v))\n\n if len(edges) < M:\n return None\n return edges\n\n\ndef main():\n N, M = [int(e) for e in input().split(' ')]\n\n edges = solve(N, M)\n if edges is None:\n print(\"Impossible\")\n return\n\n print(\"Possible\")\n for u, v in edges:\n print(u, v)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\ndef primes(a):\r\n if a < 2:\r\n return set([])\r\n initial = [2, 3]\r\n p = []\r\n maxp = 0\r\n for i in initial:\r\n if i <= a:\r\n p.append(i)\r\n for i in range(p[-1]+1, a + 1):\r\n isprime = True\r\n for j in p:\r\n if j * j > i:\r\n break\r\n if i % j == 0:\r\n isprime = False\r\n break\r\n\r\n if isprime:\r\n p.append(i)\r\n\r\n return p\r\n\r\ndef pfactors(a, ps):\r\n hasdup = False\r\n cur = a\r\n count = 0\r\n for p in ps:\r\n if cur == 1:\r\n break\r\n if cur % p == 0:\r\n count += 1\r\n times = 0\r\n while cur % p == 0 and cur > 1:\r\n cur = cur // p\r\n times += 1\r\n if times > 1:\r\n hasdup = True\r\n\r\n return count, hasdup\r\n\r\n\r\ndef count(a):\r\n alls = {}\r\n ps = primes(a)\r\n for b in range(2, a //2 + 1):\r\n _, dup = pfactors(b, ps)\r\n if dup:\r\n continue\r\n\r\n alls[b] = a//b\r\n\r\n total = a * (a-1) // 2\r\n\r\n # print(ps)\r\n\r\n for x, y in alls.items():\r\n factors, _ = pfactors(x, ps)\r\n z = y\r\n # for yy in y:\r\n # if yy > a:\r\n # print(\"bad\", yy, x, a)\r\n if factors % 2 == 1:\r\n total -= z * (z-1) // 2\r\n else:\r\n total += z * (z-1) // 2\r\n # print(a, total)\r\n return total, alls\r\n\r\n\r\ndef graph(a, b):\r\n if b < a-1:\r\n return \"Impossible\"\r\n if a < 1000:\r\n total, alls = count(a)\r\n if b > total:\r\n # print (total)\r\n return \"Impossible\"\r\n num = 0\r\n # return\r\n edges = []\r\n for i in range(1, a+1):\r\n for j in range(i+1, a+1):\r\n if math.gcd(i, j) == 1:\r\n edges.append([i,j])\r\n num += 1\r\n if num == b:\r\n break\r\n\r\n if num == b:\r\n break\r\n # print(edges)\r\n return \"Possible\\n\" + '\\n'.join([' '.join([str(ee) for ee in e]) for e in edges])\r\n\r\nina, inb = map(int, input().split(\" \"))\r\nprint(graph(ina, inb))\r\n", "import math\np = list(map(int, input().split()))\nn = p[0]\nm = p[1]\nans1 = []\nans2 = []\nsum = int(n - 1)\ntot = int(0)\nif sum > m:\n print(\"Impossible\")\nelse:\n for i in range(2, n + 1):\n ans1.append(1)\n ans2.append(i)\n tot += 1\n m -= 1\n for i in range(2, n):\n for j in range(i + 1, n + 1):\n if m == 0:\n break\n ff = int(math.gcd(i, j))\n if ff == 1:\n ans1.append(i)\n ans2.append(j)\n tot += 1\n m -= 1\n if m > 0:\n print(\"Impossible\")\n else:\n print(\"Possible\")\n for i in range(0, tot):\n print(ans1[i], end=\" \")\n print(ans2[i])\n \t\t \t \t\t\t \t\t\t\t\t\t \t\t \t \t\t\t \t", "import collections\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b, a%b)\n\n\n\nn,m = tuple(map(int,input().split()))\n\nif m < n-1:\n\tprint(\"Impossible\")\n\texit()\nedges = 0\nflag = False\n\ngraph = collections.defaultdict(list)\n\nfor i in range(1,n):\n\tfor j in range(i+1,n+1):\n\n\t\tif gcd(i,j) == 1:\n\t\t\tgraph[i].append(j)\n\t\t\tedges+=1\n\n\t\t\tif edges == m:\n\t\t\t\tflag = True\n\t\t\t\tbreak\n\tif flag:\n\t\tbreak\n\nif edges == m:\n\tprint(\"Possible\")\n\tfor i in graph:\n\t\tfor j in graph[i]:\n\t\t\tprint(str(i) + \" \" + str(j))\nelse:\n\tprint(\"Impossible\")\n\n", "from math import gcd\r\n\r\nn, m = map(int, input().split())\r\n\r\nedges = []\r\ncnt = 0\r\n\r\nif m < n - 1:\r\n print('Impossible')\r\nelse:\r\n for i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if gcd(i, j) == 1:\r\n edges.append((i, j))\r\n cnt += 1\r\n if cnt == m:\r\n break\r\n if cnt == m:\r\n break\r\n if cnt != m:\r\n print('Impossible')\r\n else:\r\n print('Possible')\r\n for pair in edges:\r\n print(*pair)", "import copy\r\nimport random\r\nimport heapq\r\nimport math\r\nimport sys\r\nimport bisect\r\nimport datetime\r\nfrom functools import lru_cache\r\nfrom collections import deque\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom itertools import combinations\r\nfrom itertools import permutations\r\nfrom types import GeneratorType\r\nfrom functools import cmp_to_key\r\nfrom functools import reduce\r\nfrom operator import xor\r\nfrom operator import mul\r\nfrom operator import add\r\nfrom decimal import Decimal\r\nfrom heapq import nlargest\r\n\r\ninf = float(\"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():\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, 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 isinstance(to, 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\ndef main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n if m < n-1:\r\n ac.st(\"Impossible\")\r\n return\r\n\r\n ans = [[1, i] for i in range(2, n+1)]\r\n x = 2\r\n while len(ans) < m and x < n:\r\n for y in range(x+1, n+1):\r\n if math.gcd(x, y) == 1:\r\n ans.append([x, y])\r\n x += 1\r\n if len(ans) < m:\r\n ac.st(\"Impossible\")\r\n else:\r\n ac.st(\"Possible\")\r\n for a in ans[:m]:\r\n ac.lst(a)\r\n return\r\n\r\n\r\nmain()\r\n" ]

[ "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [[set() for _ in range(k)] for _ in range(n)]\r\nfor i in range(n - 1,-1,-1):\r\n x = a[i]\r\n for j in range(i + 1, n):\r\n for d in range(k - 1):\r\n for y in dp[j][d]:\r\n dp[i][d + 1].add(x & y)\r\n x += a[j]\r\n dp[i][0].add(x)\r\nprint(max(dp[0][k - 1]))", "\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n le = sum(a).bit_length()\r\n s = [0] * (n+1)\r\n\r\n for i in range(1, n+1): s[i] = s[i-1] + a[i-1]\r\n\r\n res = 0\r\n for l in range(le-1, -1, -1):\r\n res += 1<<l\r\n f = [[0] * (k+1) for _ in range(n+1)]\r\n f[0][0] = 1 \r\n\r\n for i in range(1, n+1):\r\n for j in range(1, k+1):\r\n for t in range(i):\r\n f[i][j] |= f[t][j-1] & ((s[i] - s[t]) & res == res)\r\n\r\n if not f[n][k]: res -= 1<<l\r\n \r\n print(res)\r\n\r\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n sum = [0 for i in range(n + 1)]\r\n for i, v in enumerate(a):\r\n sum[i + 1] = sum[i] + v\r\n\r\n def pos(m: int) -> bool:\r\n dp = [[False for i in range(n + 1)] for j in range(k + 1)]\r\n dp[0][0] = True\r\n for i in range(1, k + 1):\r\n for used in range(i, n + 1):\r\n for prev in range(i - 1, used):\r\n dp[i][used] = dp[i - 1][prev] and (sum[used] - sum[prev]) & m == m\r\n if dp[i][used]:\r\n break\r\n return dp[k][n]\r\n\r\n cur, bit = 0, 1 << 60\r\n while bit > 0:\r\n if pos(cur | bit):\r\n cur |= bit\r\n bit //= 2\r\n print(cur)", "[n, k] = [int(x) for x in input().split()]\r\nsum = [int(x) for x in input().split()]\r\nfor i in range(1, n):\r\n sum[i] += sum[i - 1]\r\n \r\ndef check(mask, all):\r\n dp = [[False for j in range(n)] for i in range(k)]\r\n for i in range(n):\r\n dp[0][i] = ((sum[i] & all & mask) == mask)\r\n for i in range(1, k):\r\n for j in range(n):\r\n dp[i][j] = any(dp[i - 1][p] and ((sum[j] - sum[p]) & all & mask) == mask for p in range(0, j))\r\n return dp[k - 1][n - 1]\r\n \r\n \r\nans = 0\r\nfor i in range(60, -1, -1):\r\n if(check(ans | (1 << i), ~((1 << i) - 1))):\r\n ans |= 1 << i\r\nprint(ans)", "n, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\ns = [0]\r\nfor v in nums:\r\n s.append(s[-1] + v)\r\nL = len(bin(s[n])) - 2\r\n\r\nans = 0\r\nfor b in range(L - 1, -1, -1):\r\n bit = 1 << b\r\n target = ans | bit\r\n # 能否构成target？\r\n f = [[False] * (n + 1) for _ in range(k + 1)]\r\n f[0][0] = True\r\n for i in range(1, k + 1):\r\n for r in range(1, n + 1):\r\n for l in range(r):\r\n if f[i - 1][l] and (s[r] - s[l]) & target == target:\r\n f[i][r] = True\r\n break\r\n\r\n if f[k][n]:\r\n ans = target\r\n\r\nprint(ans)", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\nMOD = 10**9+7\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ndef solve():\r\n n, k = MII()\r\n a = LII()\r\n s = list(accumulate(a, initial=0))\r\n res = 0\r\n for i in range(s[n].bit_length() - 1, -1, -1):\r\n bit = 1 << i\r\n target = res | bit\r\n # f[i][r]: 前r个数能否分成i段，且高位能保留住target\r\n f = [False] * (n + 1)\r\n f[0] = True\r\n for _ in range(k):\r\n for r in range(n, 0, -1):\r\n f[r] = False\r\n for l, ok in enumerate(f[:r]):\r\n if ok and (s[r] - s[l]) & target == target:\r\n f[r] = True\r\n break\r\n f[0] = False\r\n if f[n]:\r\n res = target\r\n print(res)\r\n return\r\n\r\nsolve()\r\n", "def is_submask(n,mask):\r\n return (n&mask)==mask\r\n\r\ndef check(mask):\r\n s=[[0 for j in range(n) ]for i in range(n)]\r\n for i in range(n):\r\n add=0\r\n for j in range(i,n):\r\n add+=a[j]\r\n s[i][j]=is_submask(add,mask)\r\n dp=[[0]*(n) for i in range(k)]\r\n dp[0]=s[0][:]\r\n for k1 in range(1,k):\r\n for r in range(0,n):\r\n for l in range(1,r+1):\r\n dp[k1][r]|=dp[k1-1][l-1]&s[l][r]\r\n return dp[k-1][n-1]\r\n\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(56,-1,-1):\r\n if check(2**i+count):\r\n count+=2**i\r\nprint(count)", "def check(mask, pre, n, k):\r\n dp = [[False for i in range(k)] for i in range(n)]\r\n for i in range(n):\r\n dp[i][0] = True if ((pre[i] & mask) == mask) else False\r\n for i in range(1, n):\r\n for j in range(1, k):\r\n for l in range(i - 1, -1, -1):\r\n if dp[l][j - 1] and ((pre[i] - pre[l]) & mask == mask):\r\n dp[i][j] = True\r\n return dp[n - 1][k - 1]\r\n \r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\npre = []\r\npre.append(a[0])\r\nfor i in range(1, n):\r\n pre.append(pre[-1] + a[i])\r\nans = 0\r\nfor bit in range(62, -1, -1):\r\n if check(ans | (1 << bit), pre, n, k):\r\n ans |= (1 << bit)\r\nprint(ans)\r\n", "import os\nimport sys\nfrom io import BytesIO, IOBase\n\nBUFSIZE = 4096\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n \n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin = IOWrapper(sys.stdin)\nsys.stdout = IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef I():\n return input()\n\ndef II():\n return int(input())\n\ndef LII():\n return list(map(int, input().split()))\n\ndef count_bit(num):\n cnt = 0\n while num != 0:\n cnt += 1\n num //= 2\n return cnt\n\nn, k = LII()\na = LII()\n\ns = [0] * (n + 1)\nfor i in range(1, n + 1):\n s[i] = s[i - 1] + a[i - 1]\nans = 0\nfor i in range(count_bit(s[n]) - 1, -1, -1):\n target = ans | (1 << i)\n f = [[False] * (n + 1) for _ in range(k + 1)]\n f[0][0] = True\n for j in range(1, k + 1):\n for r in range(1, n + 1):\n for l, ok in enumerate(f[j - 1][:r]):\n if ok and (s[r] - s[l]) & target == target:\n f[j][r] = True\n break\n if f[k][n]:\n ans = target\n\nprint(ans)\n\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na_sum = [0]\r\nfor i in range(n):\r\n a_sum.append(a_sum[-1] + a[i])\r\na = [0] + a\r\n\r\n\r\ndef get(i, j):\r\n assert 0 <= i <= j <= n\r\n if i > 0:\r\n return a_sum[j] - a_sum[i - 1]\r\n else:\r\n return a_sum[j]\r\n\r\n\r\nans = 0\r\nnowmax = 0\r\nfor bit in range(60, -1, -1):\r\n tmpmax = nowmax + (1 << bit)\r\n dp = [[0]*(n + 10) for i in range(n + 10)]\r\n dp[0][0] = tmpmax\r\n for pos in range(1, n + 1):\r\n for div in range(1, k + 1):\r\n for l in range(1, pos + 1):\r\n dp[pos][div] = max(dp[pos][div], dp[pos - l]\r\n [div - 1] & get(pos - l + 1, pos) & tmpmax)\r\n if dp[n][k] == tmpmax:\r\n nowmax += (1 << bit)\r\nprint(nowmax)", "def main():\r\n n, k = [int(i) for i in input().split()]\r\n arr = [int(i) for i in input().split()]\r\n res = 0\r\n f = [0]*(n+1)\r\n for i in range(n):\r\n f[i+1] = f[i]+arr[i]\r\n\r\n maxLen = len(bin(f[n])[2:])\r\n # print(maxLen)\r\n for i in range(maxLen-1,-1,-1):\r\n b = 1 << i\r\n target = res | b\r\n dp = [False] * (n+1)\r\n dp[0] = True\r\n for j in range(k):\r\n for r in range(n,0,-1):\r\n dp[r] = False\r\n for l in range(r):\r\n if dp[l] and ((f[r]-f[l]) & target == target):\r\n dp[r] = True\r\n break\r\n dp[0] = False\r\n if dp[n]:\r\n res = target \r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "get_bit = lambda x, i: (x >> i) & 1\r\nn, k = map(int, input().split())\r\na, ans = [int(x) for x in input().split()], 0\r\n\r\nfor bit in range(56, -1, -1):\r\n mem, su = [[False] * k for _ in range(n)], 0\r\n for i in range(n):\r\n su += a[i]\r\n mem[i][0] = su & (1 << bit) and su & ans == ans\r\n\r\n for j in range(1, k):\r\n for i in range(n):\r\n su = 0\r\n for i1 in range(i - 1, -1, -1):\r\n su += a[i1 + 1]\r\n mem[i][j] = max(mem[i][j], bool(mem[i1][j - 1] and su & (1 << bit) and su & ans == ans))\r\n ans |= (mem[-1][-1] << bit)\r\nprint(ans)" ]

[ "\r\na = int(input())\r\nb = input()\r\nc = ''\r\nd = ''\r\nif a % 2 == 0:\r\n for i in range(0,a,2):\r\n c += b[i]+b[i+1]+'-'\r\nelse:\r\n for i in range(0,a-3,2):\r\n d += b[i]+b[i+1]+'-'\r\nif a % 2 == 0:\r\n print(c[:-1])\r\n\r\nelse:\r\n print(d+b[-3:])\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nst = sys.stdin.readline()\r\n\r\nres = []\r\nfor i in range(0, n, 2):\r\n res.append(st[i:i + 2])\r\n\r\nif(n % 2 != 0):\r\n print(\"-\".join(res[:int(n/2)]) + st[n - 1])\r\nelse:\r\n print(\"-\".join(res))\r\n", "n = int(input())\r\ns = input()\r\nl = []\r\nif n > 3:\r\n if n % 2 == 0:\r\n for i in range(0, n, 2):\r\n l.append(s[i:i + 2])\r\n else:\r\n l.append(s[:3])\r\n for i in range(3, n, 2):\r\n l.append(s[i:i + 2])\r\n print(*l, sep='-')\r\nelse:\r\n print(s)\r\n", "n = int(input())\r\ns = str(input())\r\n\r\nflag = 3\r\nif n % 2 == 0:\r\n flag = 2\r\n\r\nres = []\r\ncurr = 0\r\nfor i in range(len(s)):\r\n if curr == 3 and flag == 3:\r\n flag = 2\r\n res.append(\"-\")\r\n res.append(s[i])\r\n curr = 1\r\n else:\r\n res.append(s[i])\r\n curr += 1\r\n \r\n if flag != 3 and curr == 2 and i < len(s) - 1:\r\n res.append(\"-\")\r\n curr = 0\r\n\r\nprint(\"\".join(res))", "n = int(input())\r\ns = input()\r\nans=\"\"\r\nif(n%2==0):\r\n for i in range(0,n,2):\r\n if(i<n-2):\r\n ans = ans + s[i:i+2]+\"-\"\r\n if(i==n-2):\r\n ans = ans + s[i:i+2]\r\nelse :\r\n j = n-3\r\n k = 0\r\n while (k<j):\r\n ans = ans + s[k:k+2]+\"-\"\r\n k+=2\r\n ans = ans+s[j:]\r\nprint(ans) \r\n\r\n\r\n \r\n \r\n ", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n assert n >= 2\r\n phone = input()\r\n if n == 2 or n == 3:\r\n print(phone)\r\n return\r\n remember = ''\r\n for i in range(0, len(phone), 2):\r\n rem = n - i\r\n if rem == 3 or rem == 2:\r\n remember += phone[i:]\r\n break\r\n j = i + 2\r\n remember += phone[i: j]+'-'\r\n print(remember)\r\n\r\nif __name__=='__main__':\r\n main()", "n = int(input())\nv = input()\n\nans = []\n\ni = 0\nwhile(i < n):\n if(n - i == 3):\n ans.append(v[i]+v[i+1]+v[i+2])\n i += 4\n break\n else:\n ans.append(v[i]+v[i+1])\n i += 2\n \nprint('-'.join(ans))\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 = int(input())\r\n number = input().strip()\r\n\r\n if len(number) <= 3:\r\n print(number)\r\n else:\r\n index = 0\r\n\r\n if len(number) % 2 == 1:\r\n print(number[:3], end=\"\")\r\n index = 3\r\n else:\r\n print(number[:2], end=\"\")\r\n index = 2\r\n\r\n while index < len(number):\r\n print(\"-\", end=\"\")\r\n print(number[index:index + 2], end=\"\")\r\n index += 2\r\n\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# https://codeforces.com/contest/25/problem/B\n\nn = int(input())\np = input()\n\ns = \"\"\n\nif n%2==0:\n b = int(n/2)\n for i in range(b):\n s += p[(2*i):(2*i+2)] + \"-\" \n print(s[:-1])\nelse:\n s += p[0:3] + \"-\"\n p = p[3:]\n b = int(len(p)/2)\n for i in range(b):\n s += p[(2*i):(2*i+2)] + \"-\" \n print(s[:-1])\n\n\n", "n = int(input());\r\nsl = input();\r\nans=[];\r\nfor i in range(n):\r\n ans+=[sl[i]];\r\n if i%2 and i<(n-(n%2)-2):\r\n ans+=['-'];\r\nprint(''.join(ans));", "\r\nn = int(input())\r\ns = input()\r\n\r\nwhile (len(s) > 4):\r\n print (s[0:2], end='-')\r\n s = s[2:]\r\n\r\nif (len(s) <=3):\r\n print (s)\r\nelse:\r\n print (s[0:2], s[2:4], sep='-')\r\n", "n=int(input())\r\na=input()\r\ns=[]\r\nif n%3==0:\r\n for i in range(0, n, 3):\r\n s+=a[i:i+3]+'-'\r\nelif n%2==0:\r\n for i in range(0, n, 2):\r\n s+=a[i:i+2]+'-'\r\nelse:\r\n for i in range(0, n, 2):\r\n if i+2 is not n-1:\r\n s+=a[i:i+2]+'-'\r\n else:\r\n s+=a[i:i+3]+'-'\r\n s.pop()\r\n s.pop()\r\ns=list(s)\r\ns.pop()\r\nprint(''.join(s))", "n = int(input())\r\ns = input()\r\nif n <= 3: print(s); exit()\r\nelse:\r\n if n&1:\r\n print(s[:3] + \"-\", end = \"\")\r\n for i in range(3, n - 2, 2):\r\n print(s[i:i+2] + \"-\", end = \"\")\r\n print(s[n-2:])\r\n else:\r\n for i in range(0, n - 2, 2):\r\n print(s[i:i+2] + \"-\", end = \"\")\r\n print(s[n-2:])", "n = int(input())\r\n\r\ns = list(input())\r\nl = []\r\n\r\nif n%2 == 0:\r\n for i in range(n):\r\n if i%2 == 0:\r\n a = s[i] + s[i+1]\r\n l.append(a)\r\nelse:\r\n for i in range(n-3):\r\n if i%2 == 0:\r\n a = s[i] + s[i+1]\r\n l.append(a)\r\n a = s[-3] + s[-2] + s[-1]\r\n l.append(a)\r\n\r\nstring = \"\"\r\nfor i in l:\r\n string += i + \"-\"\r\n\r\nprint(string[:-1])", "x = input()\r\ny = input()\r\ny = y + ' '\r\nz= list()\r\nfor tt in range(3*int(x)):\r\n z.append(' ')\r\nfor t in range(int((float(x)+1)/2 )):\r\n z[3*t] = y[2*t]\r\n z[3*t+1] = y[2*t+1]\r\n z[3*t+2] = '-'\r\nzz = (''.join(z)).strip()[:-1]\r\n\r\nif int(x)%2 != 0:\r\n zz = list(zz)\r\n zzz = zz[:-3]\r\n zzz.append(zz[-2])\r\n zz = (''.join(zzz)).strip()\r\nprint(zz.strip())", "n = int(input())\r\ns = input()\r\n\r\nif n%2==0:\r\n ans = [s[i:i+2] for i in range(0,n,2)]\r\n print('-'.join(ans))\r\nelse:\r\n x = s[:3]\r\n s = s[3:]\r\n ans =[x] + [s[i:i+2] for i in range(0,n-3,2)]\r\n print('-'.join(ans))\r\n", "n = int(input())\r\nl = input()\r\na=[]\r\n\r\nm=n\r\nif m%2==1:\r\n m=m-1\r\nfor i in range(n):\r\n a.append(l[i])\r\n if i%2==1 and i!=m-1:\r\n a.append('-')\r\n\r\nprint(''.join(a))\r\n", "def main():\r\n\tn = int(input())\r\n\ts = list(str(input()))\r\n\r\n\tif n % 2 == 0:\r\n\t\tans = ''\r\n\t\tfor i in range(0, n, 2):\r\n\t\t\tans += s[i] + s[i + 1] + '-'\r\n\t\tprint(ans[:-1])\r\n\telse:\r\n\t\tans = ''\r\n\t\tfor i in range(0, n - 1, 2):\r\n\t\t\tans += s[i] + s[i + 1] + '-'\r\n\t\tans = ans[:-1]\r\n\t\tans += s[-1]\r\n\t\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n=int(input());\r\nnum=input();\r\n\r\nout=[];\r\nif n%2==0:\r\n for i in range(0,n,2):\r\n out.append(num[i:i+2]);\r\nelse:\r\n for i in range(0,n-3,2):\r\n out.append(num[i:i+2]);\r\n out.append(num[n-3:n]);\r\n\r\nprint('-'.join(out));\r\n", "n=int(input())\r\ns=input()\r\ntemp=[]\r\nif n%2==0:\r\n for i in range(0,n,2):\r\n temp.append(s[i:i+2])\r\nelse:\r\n for j in range(0,n-3,2):\r\n temp.append(s[j:j+2])\r\n temp.append(s[n-3:])\r\n\r\nprint('-'.join(temp))", "a=int(input())\r\nnumber=str(input())\r\n\r\n# when a%3==0, perfect 3 pairs\r\n# when a%3==1, if a is even, make all pairs of 2, elif a is odd, make 1 pair of 3, rest pairs of 2\r\n# whn a%3==2, make pairs of 3 and one pair of 2 \r\n\r\n\r\nans=\"\"\r\nif a%3==2:\r\n for i in range(0,a-1,3):\r\n ans=ans+number[i:i+3]+\"-\"\r\n \r\n print(ans[:-1])\r\nelif a%3==0:\r\n for i in range(0,a-1,3):\r\n ans=ans+number[i:i+3]+\"-\"\r\n print(ans[0:-1])\r\n\r\nelif a%3==1 and a%2==0: #make all pairs of two\r\n for i in range(0,a,2):\r\n ans=ans+number[i:i+2]+\"-\"\r\n print(ans[0:-1])\r\n\r\nelif a%3==1 and a%2==1: #make 1 pair of three, all other do ka pair\r\n for i in range(0,3):\r\n print(number[i],end='')\r\n print('-',end='')\r\n for i in range(3,a,2):\r\n ans=ans+number[i:i+2]+\"-\"\r\n print(ans[:-1])\r\n", "n = int(input())\ns = input()\nst = ''\nk = (n%2) + 2\nfor i in range(len(s[:-k]))[::2]:\n st += str(s[i])+ str(s[i+1]) + '-'\nprint(st+s[-k:])\n", "if __name__ == '__main__':\r\n cin = input\r\n n = int(cin())\r\n s = cin()\r\n print(\"-\".join([s[i * 2:i * 2 + 2] for i in range(n // 2)]) + s[n - n % 2:])", "class CodeforcesTask25BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.number = ''\n\n def read_input(self):\n self.n = int(input())\n self.number = input()\n\n def process_task(self):\n result = []\n if self.n % 2:\n result.append(self.number[:3])\n self.number = self.number[3:]\n a = \"\"\n for c in self.number:\n if a:\n result.append(a + c)\n a = \"\"\n else:\n a = c\n self.result = \"-\".join(result)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask25BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\ns=input()\r\nss=[]\r\nfor i in range(len(s)):\r\n if(i!=0 and i%2==0):\r\n ss.append('-')\r\n ss.append(s[i])\r\nif(len(s)%2!=0):\r\n ss.pop(len(ss)-2)\r\nprint(\"\".join(ss))", "n=int(input())\r\ns=input()\r\nif n%2==0:\r\n l=[s[2*i:2*(i+1)] for i in range(n//2)]\r\n print('-'.join(l))\r\nelse:\r\n l=[s[2*i:2*(i+1)] for i in range((n//2))]\r\n print('-'.join(l), end='')\r\n print(s[-1])", "n = int(input()) #How many numbers?\r\npn = input() #The number to split\r\npn = list(pn)\r\nk = int(n/2)\r\nchunks = [pn[x:x+2] for x in range(0, len(pn), 2)]\r\nfor i in range(len(chunks)):\r\n chunks[i] = ''.join(chunks[i])\r\nif n % 2 != 0:\r\n chunks[-2] += chunks[-1]\r\n chunks.pop(-1)\r\n\r\nfor i in range(len(chunks)-1):\r\n chunks[i] += '-'\r\nnumber = ''.join(chunks)\r\nprint(number)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nno = input()\r\nif n%2==0:\r\n len = 0\r\n for i in range(n):\r\n if len == 1:\r\n if i!=n-1:\r\n print(no[i],end='-')\r\n else:\r\n print(no[i])\r\n len = 0\r\n else:\r\n print(no[i],end='')\r\n len+=1\r\nelse:\r\n len = 0\r\n for i in range(n-1):\r\n if len == 1:\r\n if i!=n-2:\r\n print(no[i],end='-')\r\n else:\r\n print(no[i],end='')\r\n len = 0\r\n else:\r\n print(no[i],end='')\r\n len+=1\r\n print(no[n-1])", "n = int(input())\r\nm = input()\r\n\r\na = int(0)\r\n\r\nif n%2 == 0:\r\n for i in range(n):\r\n if i%2 == 0 and i != 0:\r\n m = ''.join((m[:(i+a)],'-',m[(a+i):]))\r\n a += 1\r\nelif n > 3:\r\n m = ''.join(((m[:-3]),'-',m[-3:]))\r\n for i in range(n-3):\r\n if i%2 == 0 and i != 0:\r\n m = ''.join((m[:(i+a)],'-',m[(a+i):]))\r\n a += 1\r\n\r\nprint(m)", "n=int(input())\r\nnumber=input()\r\ndef insert (source_str, insert_str, pos):\r\n return source_str[:pos]+insert_str+source_str[pos:]\r\nif (n<4):\r\n print(number)\r\nelif n%2==0:\r\n t=0\r\n for i in range(2,n,2):\r\n number=insert (number,\"-\", i+t)\r\n t+=1\r\n print(number)\r\nelse:\r\n t=0\r\n for i in range(3,n,2):\r\n number = insert (number,\"-\",i+t)\r\n t+=1\r\n print(number)", "n = input()\r\nnum = [int(i) for i in input()]\r\nans = ''\r\n\r\n\r\ndef three(key):\r\n return str(num[key]) + str(num[key+1]) + str(num[key+2]) + '-', 2\r\n\r\n\r\ndef two(key):\r\n return str(num[key]) + str(num[key+1]) + '-', 1\r\n\r\n\r\nskip = 0\r\nfor i in range(len(num)):\r\n if skip != 0:\r\n skip -= 1\r\n continue\r\n if len(num) - i == 3:\r\n add, skip = three(i)\r\n ans += add\r\n continue\r\n add, skip = two(i)\r\n ans += add\r\n\r\nprint(ans.rstrip('-'))\r\n", "num = int(input())\nphone = input()\nphone = phone.strip()\nif num % 2 == 0:\n\tstring = phone[:2]\n\tphone = phone[2:]\nelse:\n\tstring = phone[:3]\n\tphone = phone[3:]\nfor i in range(int(num/2) - 1):\n\tstring = string + \"-\" + phone[:2]\n\tphone = phone[2:]\nprint(string) \n", "n = int(input())\r\ns = input()\r\nif n%2==0:\r\n for i in range(0,len(s)-1,2):\r\n if i!=len(s)-2:\r\n print(s[i]+\"\"+s[i+1]+\"-\",end='')\r\n else:\r\n print(s[i]+\"\"+s[i+1])\r\nelse:\r\n for i in range(0,len(s)-2,2):\r\n if i!=len(s)-3:\r\n print(s[i]+\"\"+s[i+1]+\"-\",end='')\r\n else:\r\n print(s[i]+\"\"+s[i+1]+\"\"+s[i+2])", "n=int(input())\r\nl=input()\r\nm=[]\r\nif (n%2==0):\r\n m=[l[i:i+2] for i in range(0, len(l), 2)]\r\n p=\"-\".join(i for i in (m))\r\n print(p)\r\nelse:\r\n f=l[n-3:n]\r\n l=l[0:n-3]\r\n m=[l[i:i+2] for i in range(0, len(l), 2)]\r\n m.append(f)\r\n p=\"-\".join(i for i in (m))\r\n print(p)\r\n\r\n \r\n \r\n \r\n \r\n", "# Phone number in Berland is a sequence of n digits. Often, to make it easier to memorize the number, it is divided into groups of two or three digits. For example, the phone number 1198733 is easier to remember as 11-987-33. Your task is to find for a given phone number any of its divisions into groups of two or three digits.\r\n\r\n# Input\r\n# The first line contains integer n (2 ≤ n ≤ 100) — amount of digits in the phone number. The second line contains n digits — the phone number to divide into groups.\r\n\r\n# Output\r\n# Output any of divisions of the given phone number into groups of two or three digits. Separate groups by single character -. If the answer is not unique, output any.\r\n# ____ _ _ _ _ _ \r\n# / ___| __ _ _ __ __ _ | | | | __ _ _ __ ___| |__ (_) |_ \r\n# | | _ / _` | '__/ _` |_____| |_| |/ _` | '__/ __| '_ \\| | __|\r\n# | |_| | (_| | | | (_| |_____| _ | (_| | | \\__ \\ | | | | |_ \r\n# \\____|\\__,_|_| \\__, | |_| |_|\\__,_|_| |___/_| |_|_|\\__|\r\n# |___/ \r\n\r\nfrom typing import Counter\r\nimport sys\r\nfrom collections import defaultdict as dd\r\nfrom math import *\r\n\r\ndef vinp():\r\n return map(int,input().split())\r\ndef linp():\r\n return list(map(int,input().split()))\r\ndef sinp():\r\n return input()\r\ndef inp():\r\n return int(input())\r\ndef mod(f):\r\n return f % 1000000007\r\ndef pr(*x):\r\n print(*x)\r\ndef finp():\r\n f=open(\"input.txt\",\"r\")\r\n f=f.read().split(\"\\n\")\r\n return f\r\ndef finp():\r\n f=open(\"input.txt\",\"r\")\r\n f=f.read().split(\"\\n\")\r\n return f\r\ndef fout():\r\n return open(\"output.txt\",\"w\")\r\ndef fpr(f,x):\r\n f.write(x+\"\\n\")\r\ndef csort(c):\r\n sorted(c.items(), key=lambda pair: pair[1], reverse=True)\r\ndef indc(l,n):\r\n c={}\r\n for i in range(n):\r\n c[l[i]]=c.get(l[i],[])+[i+1]\r\n return c\r\n\r\nif __name__ ==\"__main__\":\r\n n = inp()\r\n s = sinp()\r\n k = n%3\r\n if k == 1:\r\n s2 = \"\"\r\n for i in range(n-4):\r\n if (i+1)%3 == 0:\r\n s2 += s[i]\r\n s2 += \"-\"\r\n else:\r\n s2 += s[i]\r\n s2 += s[n-4:n-2] + \"-\" + s[n-2:n]\r\n else:\r\n s2 = \"\"\r\n for i in range(n):\r\n if (i+1)%3 == 0:\r\n s2 += s[i]\r\n s2 += \"-\"\r\n else:\r\n s2 += s[i]\r\n if s2[-1] == \"-\":\r\n s2 = s2[:-1]\r\n pr(s2)", "a = int(input())\r\ns = input()\r\nq = [s[i: i + 2] for i in range(0, a, 2)]\r\nif a % 2 != 0:\r\n q[-2] += q[-1]\r\n q.pop()\r\nprint(\"-\".join(q))", "#My last problem in Riverside\r\nn = int(input())\r\ns = input()\r\nb = \"-\".join(s[i:i+2]for i in range(0, n, 2))\r\nif n % 2 == 1:\r\n\t\tb = b[:-2] + b[-1:]\r\nprint(b)", "def solve(w):\r\n if len(w) in [2,3]: return w\r\n return w[0:2] + \"-\" + solve(w[2:])\r\n\r\nn = int(input())\r\nword = input()\r\nprint(solve(word))", "n=int(input())\r\ns=list(map(int,input()))\r\nres=[]\r\nif n<=3:\r\n print(\"\".join(map(str,s)))\r\nelse:\r\n res.append(s[0])\r\n res.append(s[1])\r\n i=2\r\n while (n>i):\r\n if i%2==0 and n-i!=1 :\r\n res.append(\"-\")\r\n res.append(s[i])\r\n i=i+1\r\n print(\"\".join(map(str, res)))", "int(input())\r\nsp = []\r\nStr = ''\r\nNum = input()\r\nfor i in range(len(Num)):\r\n Str = Str + Num[i]\r\n if len(Str) == 2 and len(Num) - i >= 3:\r\n sp.append(Str)\r\n Str = ''\r\nsp.append(Str)\r\nprint('-'.join(sp))\r\n", "N = int(input())\r\narr = input()\r\nA = ''\r\ns = 0\r\nif N%2 == 0:\r\n while s < N:\r\n A = A+arr[s:s+2]+'-'\r\n s+=2\r\n A = A[:-1]\r\n print(A)\r\nelse:\r\n while s < N-1:\r\n A = A+arr[s:s+2]+'-'\r\n s+=2\r\n A = A[:-1]+arr[-1]\r\n print(A)", "def main():\n n = int(input())\n p = input()\n r = n\n pd = ''\n index = 0\n while r > 0:\n if r==2 or r == 3:\n pd += p[index:index+r]\n break\n if r==4:\n pd += p[index: index+2]\n index += 2\n r = r - 2\n else:\n pd += p[index: index+3]\n index += 3\n r = r - 3\n pd += '-'\n print (pd);\n\nmain()\n", "n=int(input())\r\na=input()\r\nk=1\r\nh=0\r\ns=''\r\n\r\nif(n%2==0):\r\n l=n/2;\r\n while(k<=l):\r\n for i in range(h,2*k):\r\n s=s+a[i]\r\n if k!=l:\r\n s=s+'-'\r\n h=2*k\r\n k=k+1\r\nelse:\r\n l=n/2-1;\r\n while(k<=l):\r\n for i in range(h,2*k):\r\n s=s+a[i]\r\n \r\n s=s+'-'\r\n h=2*k\r\n k=k+1\r\n \r\n for i in range(h,n):\r\n s=s+a[i]\r\nprint(s)", "n = int(input())\r\ns = input()\r\n\r\nprint('-'.join(s[2*i:2*i+2] for i in range(n//2)) + s[-1]*(n%2))", "def insert(line, ind, s):\r\n line = line[:ind] + s + line[ind:]\r\n return line\r\n\r\n\r\nsize = int(input())\r\nphoneNum = input()\r\ni = size - 2 if size % 2 == 0 else size - 3\r\nfor i in range(i, 0, - 2):\r\n phoneNum = insert(phoneNum, i, '-')\r\nprint(phoneNum)", "\r\nn = int(input())\r\ns = input()\r\n\r\nfor i in range (n):\r\n print(s[i], end='')\r\n if (i % 2 and (i < (n -(n % 2) - 2))):\r\n print ('-', end = '')\r\n", "n=int(input())\r\ns=input()\r\nt=s[:2+n%2]\r\nfor i in range(2+n%2,n,2):\r\n t=t+'-'+s[i:i+2]\r\nprint(t)", "def solve(n, s):\n if n <= 3:\n print(s)\n elif n % 2 == 0:\n print(s[0:2], end=\"\")\n for start in range(2, n - 1, 2):\n print(\"-\", end=\"\")\n print(s[start: start + 2], end=\"\")\n print()\n else:\n print(s[0:3], end=\"\")\n for start in range(3, n - 1, 2):\n print(\"-\", end=\"\")\n print(s[start: start + 2], end=\"\")\n print()\n\ndef main():\n n = int(input())\n s = input()\n solve(n, s)\n\nmain()", "t=int(input())\r\nx=(input())\r\nx=list(x)\r\ny=[]\r\nif(t%3==0):\r\n for i in range(0,len(x),3):\r\n \r\n y.extend([x[i],x[i+1],x[i+2],\"-\"])\r\nelif(t%3==1):\r\n \r\n y.extend([x[0],x[1],\"-\"])\r\n for i in range(2,len(x)-3,3):\r\n y.extend([x[i],x[i+1],x[i+2],\"-\"])\r\n y.extend([x[len(x)-2],x[len(x)-1],\"-\"])\r\nelse:\r\n y.extend([x[0],x[1],\"-\"])\r\n for i in range(2,len(x),3):\r\n y.extend([x[i],x[i+1],x[i+2],\"-\"])\r\nfor i in range(0,len(y)-1):\r\n \r\n print(y[i],end=\"\")\r\n ", "I=input\r\nn=int(I())\r\ns=I()\r\nprint('-'.join(s[i*2:i*2+2:]for i in range(n//2))+s[-1]*(n%2))", "n=int(input())\r\np=input()\r\ng=[]\r\nif n<4:\r\n print(p)\r\nelse:\r\n if n%2==1:\r\n g=[p[:3],'-']\r\n p=p[3:]\r\n n-=3\r\n for i in range(n):\r\n g+=p[i]\r\n if i%2==1:\r\n g+='-'\r\n e=''\r\n for i in range(len(g)):\r\n e+=g[i]\r\n print(e[:-1])", "n=int(input())\np=input()\no=[]\nif n%2==0:\n for i in range(0,n-1,2):\n o.append(p[i:i+2])\n print(\"-\".join(o))\nelse:\n if n==3:\n print(p)\n else:\n o.append(p[:3])\n n=n-3\n p=p[3:]\n for i in range(0,n-1,2):\n o.append(p[i:i+2])\n print(\"-\".join(o))\n ", "n=int(input())\r\ns=list(input())\r\nx=[]\r\nif len(s)%2==0:\r\n i=0\r\n while(i<n):\r\n x.append(s[i]+s[i+1])\r\n i+=2\r\nelse:\r\n x.append(s[0]+s[1]+s[2])\r\n i = 3\r\n while (i < n):\r\n x.append(s[i] + s[i + 1])\r\n i += 2\r\nprint('-'.join(x))", "n = int(input())\r\nnumber = input()\r\nrest = len(number) % 2 \r\nres='' \r\nfor i in range(0,n, 2) : \r\n res += number[i : i+2] + \"-\"\r\nif rest == 1: \r\n res = res[ : -3]\r\n print(res+number[-1])\r\nelse:\r\n print(res.strip(\"-\"))\r\n ", "n=int(input())\r\ns=input()\r\nif(n%2==0):\r\n for i in range(0,n-2,2):\r\n print(s[i],s[i+1],\"-\",sep=\"\",end=\"\")\r\n print(s[-2],s[-1],sep=\"\")\r\nelse:\r\n for i in range(0,n-3,2):\r\n print(s[i],s[i+1],\"-\",sep=\"\",end=\"\")\r\n print(s[-3],s[-2],s[-1],sep=\"\")", "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\ns = input().rstrip()\r\nans = []\r\n\r\nif n >= 4 and n % 3 == 1:\r\n ans.extend((s[:2], s[2:4]))\r\n s = s[4:]\r\n\r\nwhile len(s) > 3:\r\n ans.append(s[:3])\r\n s = s[3:]\r\n\r\nif s:\r\n ans.append(s)\r\n\r\nprint('-'.join(ans))\r\n", "a = int(input())\n\nb = input()\n\nc = ''\n\nlength = len(b)\n\nfor x in range(1, length + 1):\n if length - (x - 1) == 3 and length % 2 != 0:\n for i in range(3):\n c += b[i + x - 1]\n break\n\n c += b[x - 1]\n\n if x % 2 == 0 and not x == length:\n c += '-'\n\nprint(c)\n", "n=int(input())\r\ns=input()\r\nss=[]\r\nc=0\r\nfor i in range(2,n,2):\r\n s=list(s)\r\n s.insert(c+i,\"-\")\r\n c+=1\r\nif n%2==0:\r\n print(''.join(s))\r\nelse:\r\n s.pop(-2)\r\n print(''.join(s))\r\n", "x=int(input())\r\ns=input()\r\nn=0\r\nl=0\r\nj=0\r\nwhile 1:\r\n\tif (n+1)%3==0 and n!=0:\r\n\t\tif j<(x//2)-1:\r\n\t\t\tprint('-',end='')\r\n\t\t\tj+=1\r\n\telse:\r\n\t\tprint(s[l],end='')\r\n\t\tl+=1\r\n\tn+=1\r\n\tif l==x:\r\n\t\tbreak", "n = int(input())\r\n\r\nnum = input()\r\n\r\nif n%3==0:\r\n for i in range(0,n,3):\r\n print(num[i:i+3],end=\"\")\r\n if i<n-3:\r\n print('-',end=\"\")\r\nelif n%2==0:\r\n for i in range(0,n,2):\r\n print(num[i:i+2],end=\"\")\r\n if i<n-2:\r\n print('-',end=\"\")\r\nelse:\r\n end = n//2 * 2\r\n re = n-end\r\n if re==1:\r\n end-=2\r\n re+=2\r\n for i in range(0,end,2):\r\n print(num[i:i+2],end=\"\")\r\n print('-',end=\"\")\r\n print(num[end:end+3],end=\"\")\r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nk=0\r\nif(n%2==0):\r\n for i in s:\r\n c+=1\r\n print(i,end=\"\")\r\n if(c%2==0 and c!=n):\r\n print(\"-\",end=\"\")\r\n \r\n print()\r\nelse:\r\n for i in range(len(s)):\r\n c+=1\r\n print(s[i],end=\"\")\r\n \r\n if(c%2==0 and c!=n):\r\n if(c!=n-1):\r\n print(\"-\",end=\"\")\r\n k+=1\r\n \r\n \r\n print()\r\n \r\n \r\n ", "n=int(input())\r\na=input()\r\n\r\nr=0\r\nif n%2==1:\r\n r=3\r\n print(a[0],a[1],a[2],sep='',end='-' if n>3 else '')\r\n\r\nfor i in range(r,n-1,2): \r\n print(a[i],a[i+1],sep='',end='-' if n-i>2 else '')\r\n\r\n", "z = int(input())\r\nn = input()\r\nx = []\r\nb = 0\r\nif z % 2 == 0:\r\n for i in range(int(z / 2)):\r\n c = ''\r\n while True:\r\n c = c + n[b]\r\n b += 1\r\n if len(c) == 2:\r\n break\r\n x.append(c)\r\nelif z % 2 != 0:\r\n z -= 1\r\n for i in range(int(z / 2)):\r\n c = ''\r\n while True:\r\n c = c + n[b]\r\n b += 1\r\n if len(c) == 2:\r\n break\r\n x.append(c)\r\n x[-1] = x[-1] + n[-1]\r\nh = '-'.join(x)\r\nprint(h)\r\n", "n = int(input())\r\ns = str(input())\r\nif n%3 == 0:\r\n ans = []\r\n for i in range(n//3):\r\n ans.append(s[3*i:3*i+3])\r\nelif n%3 == 1:\r\n ans = []\r\n for i in range((n-4)//3):\r\n ans.append(s[3*i:3*i+3])\r\n ans.append(s[-4:-2])\r\n ans.append(s[-2:])\r\nelse:\r\n ans = []\r\n for i in range((n-2)//3):\r\n ans.append(s[3*i:3*i+3])\r\n ans.append(s[-2:])\r\nprint('-'.join(ans))\r\n", "n = int(input())\r\nnum = input()\r\nif n%2 == 0:\r\n s = ''\r\n for i in range(0,len(num),2):\r\n s += (num[i:i+2] + '-')\r\n print(s[:len(s)-1])\r\nelse:\r\n s = num[0:3]+'-'\r\n for i in range(3,len(num),2):\r\n s += (num[i:i+2] + '-')\r\n print(s[:len(s)-1])", "n = int(input())\ns = input()\nif n&1==0:\n ans = s[0]+s[1]\nelse:\n ans = s[:3]\nfor i in range(2+(n&1) , n , 2):\n \n ans += '-'+s[i]+s[i+1]\nprint(ans) \n ", "n=int(input())\r\ns=input()\r\nans=[]\r\nfor i in range(n):\r\n\tif(i%2==0):\r\n\t\tans.append('-')\r\n\tans.append(s[i])\r\nans.pop(0)\r\nif(ans[-2]=='-'):\r\n\tans.pop(-2)\r\nprint(''.join(ans))", "n = int(input())\r\ns = input().strip()\r\n\r\nif n%2:\r\n ans, s = s[:3], s[3:]\r\n for i in range(0,len(s), 2):\r\n ans += \"-\"+s[i:i+2] \r\n\r\nelse:\r\n ans =\"\"\r\n for i in range(0, len(s), 2):\r\n ans += s[i:i+2]+\"-\"\r\n \r\n ans = ans[:-1]\r\n \r\nprint(ans)", "func = lambda s: s if len(s) <= 3 else s[:2] + '-' + func(s[2:])\ninput()\nprint(func(input()))\n", "c=int(input())\nph=input()\nnph = \"\"\nif c%2==0:\n for i in range(0,c,2):\n nph+= \"-\"+ph[i:i+2]\nelif c%3==0:\n for i in range(0,c,3):\n nph+=\"-\"+ph[i:i+3]\nelse:\n nph+=\"-\"+ph[:3]\n for i in range(3,c,2):\n nph+=\"-\" + ph[i:i+2]\nprint(nph[1:])\n \t\t\t \t \t\t\t \t \t\t\t\t\t \t \t \t", "n = int(input())\r\ndigit = input()\r\nif not (n % 2):\r\n for i in range(0, n - 2, 2):\r\n print(digit[i: i + 2], end='-')\r\n print(digit[n - 2: n])\r\nelse:\r\n if n > 3:\r\n print(digit[0:3], end='-')\r\n for i in range(3, n - 2, 2):\r\n print(digit[i: i + 2], end='-')\r\n print(digit[n - 2: n])\r\n else:\r\n print(digit[0:3])\r\n", "n=int(input())\r\nl=list(map(int,input()))\r\nans=[]\r\nif n%2==1:\r\n ans.append(l[0])\r\n l=l[1:]\r\n n-=1\r\nans+=l[0:2]\r\nfor i in range(2,n,2):\r\n ans.append('-')\r\n ans+=l[i:i+2]\r\nprint(*ans,sep=\"\")", "a = int(input())\r\ns = input()\r\nprint(s[0] + s[1], end='')\r\nfor i in range(2, a - 1, 2):\r\n print('-' + s[i] + s[i + 1], end='')\r\nif (a % 2 == 1):\r\n print(s[-1])\r\n", "n = int(input().strip())\r\nl = input().strip()\r\ntsel = n // 3\r\nbaq = n % 3\r\nif baq == 1:\r\n if tsel == 1:\r\n print(l[0:2]+'-'+l[2:])\r\n else:\r\n jav = ''\r\n j = ''\r\n for i in l[0:n-4]:\r\n j = j + i\r\n if len(j) == 3:\r\n jav = jav + j + '-'\r\n j = ''\r\n jav = jav + l[n-4:n-2] + '-' + l[n-2:]\r\n print(jav)\r\nelif baq == 2:\r\n if tsel == 0:\r\n print(l)\r\n else:\r\n jav = ''\r\n j = ''\r\n for i in l[0:n-2]:\r\n j = j + i\r\n if len(j) == 3:\r\n jav = jav + j + '-'\r\n j = ''\r\n jav = jav + l[n-2:]\r\n print(jav)\r\nelse:\r\n jav = ''\r\n j = ''\r\n for i in l:\r\n j = j + i\r\n if len(j) == 3:\r\n jav = jav + j + '-'\r\n j = ''\r\n print(jav[0:len(jav)-1])\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 22:34:18\nLastEditTime: 2021-11-27 22:51:08\nDescription: Phone number\nFilePath: CF25B.py\n'''\n\n\ndef func():\n n = int(input())\n phone1 = input().strip()\n init = 2 if n % 2 == 0 else 3\n phone2 = phone1[:init]\n for i in range(init, n):\n if (i - init) % 2 == 0:\n phone2 += \"-\" + phone1[i]\n else:\n phone2 += phone1[i]\n print(phone2)\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\na = list(input())\r\nif n == 2: print(a[0],end = \"\");print(a[1])\r\nelif n == 3: print(a[0],end = \"\"); print(a[1],end = \"\"); print(a[2])\r\nelse:\r\n if n % 2 == 0:\r\n for i in range(0,len(a)-2,2):\r\n print(a[i],end = \"\")\r\n print(a[i+1],end = \"-\")\r\n print(a[-2],end = \"\")\r\n print(a[-1])\r\n else:\r\n for i in range(0,len(a)-3,2):\r\n print(a[i],end = \"\")\r\n print(a[i+1],end = \"-\")\r\n print(a[-3],end = \"\")\r\n print(a[-2],end = \"\")\r\n print(a[-1])", "n=int(input())\r\ns=input()\r\nx=\"\"\r\nif n&1:\r\n for i in range(3):\r\n x+=s[i]\r\n for i in range(3,n,2):\r\n x+=\"-\"+s[i]+s[i+1]\r\nelse:\r\n for i in range(0,n,2):\r\n x+=s[i]+s[i+1]+\"-\"\r\n x=x[:-1]\r\nprint(x)\r\n", "n = int(input())\r\ns = input()\r\nnew_s = ''\r\ni = 0\r\nif n % 2 == 0:\r\n while i < n:\r\n new_s += s[i:i+2] + '-'\r\n i += 2\r\n new_s = new_s[:-1]\r\nelse:\r\n while i < n - 3:\r\n new_s += s[i:i+2] + '-'\r\n i += 2\r\n new_s += s[-3:]\r\nprint(new_s)", "# LUOGU_RID: 117398619\na,b=int(input()),list(input())\r\nfor c in range(a):\r\n print(b[c],end='')\r\n if (c-1)%2==0 and c<a-2:\r\n print('-',end='')", "l=int(input())\r\narr=input()\r\nans=''\r\nif l==3:\r\n print(arr)\r\nelif l%2==0:\r\n ans=arr[0]\r\n for i in range(1,l):\r\n if i%2==0:\r\n ans+='-'\r\n ans+=arr[i]\r\n else:\r\n ans+=arr[i]\r\nelse:\r\n ans=arr[0]\r\n for i in range(1,l-3):\r\n if i%2==0:\r\n ans+='-'\r\n ans+=arr[i]\r\n else:\r\n ans+=arr[i]\r\n ans+='-'\r\n ans+=arr[l-3]+arr[l-2]+arr[l-1]\r\nprint(ans)\r\n \r\n \r\n", "def main():\n n, s = int(input()), input()\n for t in range(n, -1, -2):\n if not t % 3:\n break\n print('-'.join([s[i:i + 3] for i in range(0, t, 3)] + [s[i:i + 2] for i in range(t, n, 2)]))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ns = input()\r\n\r\niseven = n % 2 == 0\r\n\r\nif iseven:\r\n ns = '-'.join(s[i:i+2] for i in range(0, len(s), 2))\r\nelse:\r\n ns = s[0] + '-'.join(s[i:i+2] for i in range(1, len(s), 2))\r\nprint(ns)", "n=int(input())\r\ns=input()\r\nif n%2==0:\r\n p=\"\"\r\n for i in range(0,n,2):\r\n p=p+(s[i:i+2]+\"-\")\r\n print(p[:len(p)-1])\r\nelse:\r\n p=\"\"\r\n for i in range(0,n-3,2):\r\n p=p+(s[i:i+2]+\"-\")\r\n print(p+s[len(s)-3:])", "n=int(input())\r\nm=input()\r\nr=[]\r\nk=1\r\nwhile(k<n):\r\n elemento=str(m[k-1])+str(m[k])\r\n r.append(elemento)\r\n k+=2\r\nif n%2==1:\r\n res=str(m[n-3])+str(m[n-2])+str(m[n-1])\r\nelse:\r\n res=str(m[n-2])+str(m[n-1])\r\nr[len(r)-1]=res\r\np='-'\r\nprint(p.join(r))", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n s = str(input())\r\n\r\n p = [0, 0]\r\n for a in range(n):\r\n for b in range(n):\r\n if 2 * a + 3 * b == n:\r\n p = [a, b]\r\n\r\n res = \"\"\r\n for i in range(p[0]):\r\n res += s[2 * i] + s[2 * i + 1] + \"-\"\r\n for i in range(p[1]):\r\n res += s[2 * p[0] + 3 * i] + s[2 * p[0] + 3 * i + 1] + s[2 * p[0] + 3 * i + 2] + \"-\"\r\n\r\n print(res[0:-1])\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\r\nm = list(map(int, input()))\r\ns = []\r\nif len(m) <= 3:\r\n\tprint(''.join(map(str, m)))\r\nelse:\r\n\tfor i in range(0, n - 3, 2):\r\n\t\ts.append(m[i])\r\n\t\ts.append(m[i + 1])\r\n\t\ts.append(\"-\")\r\n\ts += m[i + 2:]\r\n\tprint(''.join(map(str, s)))\r\n", "# https://codeforces.com/contest/25/problem/B\r\n\r\nn = int(input())\r\ns = input()\r\nbouts = []\r\ni = 0\r\n\r\nif n % 2 == 1:\r\n bouts.append(s[i:i + 3])\r\n i += 3\r\n\r\nwhile i < n:\r\n bouts.append(s[i:i + 2])\r\n i += 2\r\n\r\nprint('-'.join(bouts))\r\n", "n = int(input())\r\nmas = input()\r\ns = []\r\nif len(mas) % 2 == 1:\r\n s.append(mas[:3])\r\n mas = mas[3:]\r\nfor i in range(0, len(mas), 2):\r\n s.append(mas[i] + mas[i + 1])\r\nprint(\"-\".join(s))\r\n", "n = int(input())\r\nans = \"\"\r\ns = input()\r\nwhile(len(s) >= 4):\r\n ans = ans + s[ : 2] + \"-\"\r\n s = s[2:]\r\nans = ans + s\r\nprint(ans)", "t=int(input())\r\nc=input()\r\no=\"\"\r\nif t%2==0:\r\n o+=c[:2]\r\n i=2\r\nelse:\r\n o+=c[:3]\r\n i=3\r\nwhile i<t:\r\n o+=\"-\"+c[i:i+2]\r\n i+=2\r\nprint(o)", "n=int(input())\r\ns=input()\r\nif(n%2==0):\r\n print(s[0],end=\"\")\r\n for i in range(1,n):\r\n if(i%2==0):\r\n print(\"-\",end=\"\")\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[i],end=\"\")\r\nelse:\r\n d=n//2\r\n print(s[0],end=\"\")\r\n for i in range(1,d):\r\n if(i%2==0):\r\n print(\"-\",end=\"\")\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[i],end=\"\")\r\n print(s[d],end=\"\")\r\n for i in range(d+1,n):\r\n if(i%2!=0):\r\n print(\"-\",end=\"\")\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[i],end=\"\")\r\n \r\n\r\n#6\r\n#549871\r\n\r\n#7\r\n#1198733\r\n\r\n", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn = ii1()\r\ns = is1()\r\nst = 2\r\nif n % 2 != 0:\r\n st = 3\r\nres = s[: st]\r\nfor i in range(st, n-1, 2):\r\n res += \"-\"+s[i] + s[i + 1]\r\nprint(res)\r\n \r\n", "n=int(input())\r\ns=input()\r\nif n==2 or n==3:\r\n print(s)\r\n raise SystemExit\r\nif n&1:\r\n print(s[:3],end=\"\")\r\n for i in range(3,n):\r\n if (i-1)%2==0:\r\n print(\"-\",end='')\r\n print(s[i],end=\"\")\r\nelse:\r\n for i in range(n):\r\n if i&1 or i==0:\r\n pass\r\n else:\r\n print('-',end=\"\")\r\n print(s[i],end=\"\")", "n = int(input())\r\ns = input()\r\n\r\nif n % 2 == 0:\r\n ans = s[0] + s[1] + '-'\r\n start = 2\r\nelse:\r\n ans = s[0] + s[1] + s[2] + '-'\r\n start = 3\r\nfor i in range(start, n, 2):\r\n ans += s[i] + s[i+1] + '-'\r\n\r\nprint(ans[:-1])", "# The same file will be used throughout Problem Set by saving after writing different codes\r\n#Ques URL - https://codeforces.com/contest/25/problem/B\r\nn = int(input());\r\ns = input();\r\nif n & 1 == 1:\r\n y = n - 1;\r\nelse:\r\n y = n;\r\nans = s[0];\r\nfor x in range(1, y):\r\n ans += s[x];\r\n if x&1 == 1 and x != y - 1:\r\n ans += '-';\r\nif y < n:\r\n ans += s[-1];\r\nprint(ans);\r\n\r\n", "import re\r\ninput()\r\nprint('-'.join(re.findall(r'\\d{3}$|\\d{2}', input())))", "\r\nn = int(input())\r\ns = str(input())\r\nr = ''\r\nif(n % 2 == 0):\r\n for el in range(0, n-1, 2):\r\n r += s[el] \r\n r += s[el+1]\r\n r += '-'\r\n \r\nelse:\r\n r += s[0]\r\n r += s[1]\r\n r += s[2]\r\n r += '-'\r\n for el in range(3, n-1 , 2):\r\n r += s[el]\r\n r += s[el+1]\r\n r += '-'\r\n \r\n\r\nprint(r[:len(r)-1])", "n = int(input())\r\ns = input()\r\n\r\nfor i in range((n//2-1)):\r\n print(s[2*i:2*i+2],end = '-')\r\n\r\nprint(s[2*(n//2-1):])", "t=int(input())\r\nl=list(input())\r\n\r\nif t%2==0:\r\n y=t//2-1\r\n k=0\r\n for i in range(y):\r\n print(l[k]+l[k+1]+\"-\",end='')\r\n k+=2\r\n print(l[k]+l[k+1])\r\nelse:\r\n y=t//2-1\r\n k=0\r\n for i in range(y):\r\n print(l[k]+l[k+1]+\"-\",end='')\r\n k+=2\r\n print(l[k]+l[k+1]+l[k+2])", "n=int(input())\nx=input()\nans=''\nif n%2==0:\n for i in range(0,n,2):\n ans+=x[i]+x[i+1]+'-'\nelse:\n ans+=x[:3]+'-'\n for i in range(3,n,2):\n ans+=x[i]+x[i+1]+'-'\nprint(ans[:-1])", "n = int(input())\r\ninput = input()\r\nstr=\"\"\r\nif n%2==1:\r\n str+=input[:1]\r\n input = input[1:]\r\nwhile not input==\"\":\r\n str+=input[:2]\r\n input = input[2:]\r\n str+=\"-\"\r\nstr = str[:-1]\r\nprint(str)", "n=int(input())\r\ns=list(input())\r\nk=2\r\nj=True\r\n\r\n\r\nwhile k<=(len(s)-2):\r\n if n%2==0 :\r\n s.insert(k,'-')\r\n k+=3\r\n else: \r\n s.insert(k,'-')\r\n if j:\r\n k+=4\r\n j=False\r\n else:\r\n k+=3\r\n j=True\r\n\r\n\r\nfor i in s:\r\n \r\n print(i,end='')\r\n", "a=int(input())\r\nl=list(input())\r\nprint(l[0],end='')\r\nfor i in range(1,a-1):\r\n if i%2==0:\r\n print('-',end='')\r\n print(l[i],end='')\r\nprint(l[a-1])\r\n\r\n", "\r\n\r\n\r\n\r\nw = int(input())\r\ns = list(input())\r\n\r\n\r\nif w > 3:\r\n if w % 2 == 0:\r\n i = 1\r\n else:\r\n i = 2\r\n \r\n while i < w-1:\r\n s[i] = s[i] + '-'\r\n i+= 2\r\n \r\n \r\n \r\n\r\nprint(''.join(s))\r\n", "\r\n# это задача 25B\r\n\r\nb = int(input())\r\na = list(map(int, input()))\r\nif b % 2 == 0:\r\n g = 0\r\n for i in range(b//2):\r\n if g+2 != b:\r\n print(a[g], a[g+1], \"-\", sep=\"\", end=\"\")\r\n else:\r\n print(a[g], a[g+1], sep=\"\", end=\"\") \r\n g = g + 2 \r\nelse:\r\n g = 0\r\n for i in range(b//2-1):\r\n print(a[g], a[g+1], \"-\", sep=\"\", end=\"\")\r\n g = g + 2 \r\n print(a[g], a[g+1], a[g+2], sep=\"\", end=\"\") \r\n ", "t=int(input())\r\ns=input()\r\nres=\"\"\r\nif t%2==0:\r\n for i in range(1,len(s),2):\r\n res+=s[i-1]+s[i]+\"-\"\r\n print(res[:-1])\r\nelse:\r\n for i in range(1,len(s)-3,2):\r\n res+=s[i-1]+s[i]+\"-\"\r\n res+=s[-3:]\r\n print(res)\r\n", "a=int(input())\r\nb=input()\r\nl=[];i=-1\r\nfor m in b:\r\n i+=1\r\n if i%2==0 and i>0:\r\n l.append(\"-\")\r\n l.append(m)\r\n else:\r\n l.append(m)\r\nif a%2==0:\r\n print(\"\".join(l))\r\nelse:\r\n l.pop(-2)\r\n print(\"\".join(l)) ", "n = int(input())\r\nnum = input()\r\nop = []\r\ni = 0\r\nwhile i<n-3:\r\n op.append(num[i]+num[i+1]+\"-\")\r\n i += 2\r\nop.append(num[i:])\r\nprint(\"\".join(op))\r\n", "p = int(input())\ns = input()\nb = False;\nans = ''\n\nfor j in range(0,p,2):\n if j+1 >= p:\n b = True\n break\n ans += s[j]+s[j+1]+'-'\n\nif b:\n ans = ans[:len(ans)-1]+s[-1]\nelse:\n ans = ans[:len(ans)-1]\nprint(ans)\n\n\t\t\t\t \t \t \t \t\t\t\t \t \t", "'''input\n2\n74\n'''\nn = int(input())\na = input()\nif n == 2 or n == 3:\n\tprint(a)\n\tquit()\nfor x in range(0, n-3, 2):\n\tprint(a[x] + a[x+1] + \"-\", end=\"\")\nif n % 2 == 0:\n\tprint(a[x+2] + a[x+3])\nelse:\n\tprint(a[x+2:])\n\n\n\n\n\n\n\n\n\n", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn = int(input())\r\ns = input()\r\nans = \"\"\r\nif n%2:\r\n\tfor i in range(0,n-3,2):\r\n\t\tans+=s[i]+s[i+1]+'-'\r\n\tprint(ans+s[-3:])\r\nelse:\r\n\tfor i in range(0,n,2):\r\n\t\tans+=s[i]+s[i+1]+'-'\r\n\tprint(ans.rstrip('-'))", "n = int(input())\r\ns = input()\r\n\r\nif n % 3: l = [s[:2]] + [s[i:i + 3] for i in range(2, n, 3)]\r\nelse: l = [s[i:i + 3] for i in range(0, n, 3)]\r\n\r\nprint('-'.join(l))\r\n", "def solution():\r\n m = input()\r\n s = input()\r\n res = ''\r\n n = len(s) % 3\r\n if n == 0 or n == 2:\r\n for i in range(0, len(s), 3):\r\n res += s[i: min(len(s), i + 3)]\r\n res += '-'\r\n res = res[:-1]\r\n elif n == 1:\r\n for i in range(0, len(s) - 4, 3):\r\n res += s[i: i + 3]\r\n res += '-'\r\n res += s[-4: -2] + '-' + s[-2:]\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "n = int(input())\r\ns = input()\r\nres = \"\"\r\nif (n % 2 == 0):\r\n for i in range(len(s)):\r\n if (i != 0 and i % 2 == 0):\r\n res += \"-\"\r\n res += s[i]\r\n else:\r\n res += s[i]\r\n print(res)\r\nelse:\r\n flag = 0\r\n for i in range(len(s)):\r\n if (flag < 3):\r\n res += s[i]\r\n flag += 1\r\n else:\r\n if (i % 2 != 0):\r\n res += \"-\"\r\n res += s[i]\r\n else:\r\n res += s[i]\r\n print(res)", "n = int(input())\r\ndigits = list(tuple(map(str, input()))) # tuple to take every digit in our number in and turn tuple into list \r\nanswer = \"\"\r\n\r\nif n % 2 == 0:\r\n i = 0\r\n while i < n - 1:\r\n answer += (digits[i] + digits[i+1])\r\n i += 2\r\n if i < n - 1:\r\n answer += \"-\"\r\nelif n % 3 == 0:\r\n i = 0\r\n while i < n - 2:\r\n answer += (digits[i] + digits[i+1] + digits[i+2])\r\n i += 3\r\n if i < n - 2:\r\n answer += \"-\"\r\nelse:\r\n answer = (digits[0] + digits[1] + digits[2] + \"-\")\r\n i = 3\r\n while i < n - 1:\r\n answer += (digits[i] + digits[i+1])\r\n i += 2\r\n if i < n - 1:\r\n answer += \"-\"\r\n\r\nprint(answer)", "n = int(input())\r\nnum = input()\r\ndividors = n // 2 - 1\r\nresult = ''\r\nfor i in range(n):\r\n if i and i % 2 == 0 and dividors:\r\n dividors -= 1\r\n result += '-'\r\n result += num[i]\r\n\r\nprint(result)", "n=int(input())\r\ns=input()\r\nif(n==2)or(n==3):\r\n print(s)\r\nelse:\r\n s1=\"\"\r\n c=\"\"\r\n for i in range(n):\r\n c+=s[i]\r\n if(len(c)%2==0):\r\n s1+=c+'-'\r\n c=\"\"\r\n if(len(c)):\r\n s1+=c\r\n \r\n if(s1[-1]=='-'):\r\n s1=s1[:-1]\r\n elif(s1[-2]=='-'):\r\n s1=s1[:-2]+s1[-1]\r\n print(s1)\r\n \r\n \r\n \r\n", "n=int(input())\r\ns=input()\r\nif n%2==0:\r\n l=[s[i:i+2] for i in range(0,n,2)]\r\n print('-'.join(l))\r\nelif n%2!=0:\r\n l=[s[i:i+2] for i in range(0,n-3,2)]\r\n l.append(s[n-3:])\r\n print('-'.join(l))", "n=int(input())\r\na=input()\r\nl=len(a)\r\nfor i in range(l//2-1):\r\n print(a[2*i:2*(i+1)],end='-')\r\nif (l)%2 == 0:\r\n print(a[l-2:])\r\nelse:\r\n print(a[l-3:])", "n = int(input())\r\ns = input()\r\narr = []\r\nif n == 2 or n == 3:\r\n print(s)\r\nelif n%2 == 0:\r\n for i in range(0,n, 2):\r\n arr.append(s[i:i+2])\r\n arr = arr[0:n-1]\r\n print(\"-\".join(arr))\r\nelse:\r\n arr.append(s[0:3])\r\n for i in range(3,n, 2):\r\n arr.append(s[i:i+2])\r\n arr = arr[0:n-1]\r\n print(\"-\".join(arr))\r\n\r\n", "n = int(input()); s = input()\r\nif n <= 3:\r\n print(s)\r\nelse:\r\n e = \"\"\r\n if n % 2 == 0:\r\n for i in range(0, n, 2):\r\n if i == n-2: e += s[i:i+2]\r\n else: e += s[i:i+2] + \"-\"\r\n print(e)\r\n else:\r\n e = s[:3] + \"-\"\r\n for i in range(3, n, 2):\r\n if i == n-2: e += s[i:i+2]\r\n else: e += s[i:i+2] + \"-\"\r\n print(e)", "n = int(input())\r\nif n%2 == 0:\r\n s = input()\r\n t = iter(s)\r\n print('-'.join(a+b for a,b in zip(t, t)))\r\nelse:\r\n s = input()\r\n t = iter(s[:-1])\r\n print(('-'.join(a+b for a,b in zip(t, t)))+s[-1])\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\ns = stdin.readline()\r\n\r\nif n%2==0:\r\n ans=''\r\n for i in range(n):\r\n if(i%2==0 and i!=0):\r\n ans+='-'\r\n ans+=s[i]\r\n stdout.write(ans)\r\nelse:\r\n ans=''\r\n p = s[1:]\r\n for i in range(len(p)):\r\n if(i%2==0 and i!=0):\r\n ans+='-'\r\n ans+=p[i]\r\n ans = s[0]+ans\r\n stdout.write(ans[:-2])\r\n\r\n", "if __name__ == '__main__':\r\n cin = input\r\n n = int(cin())\r\n s, a = cin(), \"\"\r\n\r\n if not n % 2:\r\n a += \"-\".join([s[i:i + 2] for i in range(0, n, 2)])\r\n elif not n % 3:\r\n a += \"-\".join([s[i:i + 3] for i in range(0, n, 3)])\r\n else:\r\n a += \"-\".join([s[i:i + 2] for i in range(0, n - 3, 2)])\r\n a += \"-%s\"%(s[n - 3:])\r\n print(a)", "f = lambda s: s if len(s) <= 3 else s[:2]+'-'+f(s[2:])\ninput()\nprint(f(input()))", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:25/03/2020\r\n'''\r\nfrom math import ceil,sqrt,log,gcd\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\ndef main():\r\n n=ii()\r\n s=si()\r\n x=n%3\r\n if(x==0):\r\n for i in range(0,n,3):\r\n if(i!=0):\r\n print('-',end=\"\")\r\n print(s[i:(i+3)],end=\"\")\r\n elif(x==1):\r\n print(s[:2],end=\"\")\r\n for i in range(2,n-2,3):\r\n print('-',end=\"\")\r\n print(s[i:(i+3)],end=\"\")\r\n print('-',end=\"\")\r\n print(s[(n-2):])\r\n else:\r\n print(s[:2],end=\"\")\r\n for i in range(2,n,3):\r\n print('-',end=\"\")\r\n print(s[i:(i+3)],end=\"\")\r\n \r\nif __name__ ==\"__main__\":\r\n main()", "# Wadea #\r\n\r\nn = int(input())\r\ns = input()\r\nr = \"\"\r\nif len(s) <= 3:\r\n print(s)\r\nelif len(s) == 4:\r\n r += s[:2] + \"-\" + s[2:]\r\nelif len(s) == 5:\r\n r += s[:2] + \"-\" + s[2:]\r\nelse:\r\n if len(s) % 2 == 0:\r\n r += s[:2]\r\n for j in range(2,len(s)-1,2):\r\n r += \"-\" + s[j:j+2]\r\n else:\r\n r += s[:3]\r\n for j in range(2,len(s)-1,2):\r\n r += \"-\" + s[j+1:j+3]\r\n \r\nprint(r)", "n=int(input())\r\nS=input()\r\n\r\nANS=[]\r\n\r\nfor i in range(n):\r\n ANS.append(S[i])\r\n\r\n if i%2==1 and i<=n-3:\r\n ANS.append(\"-\")\r\n\r\nprint(\"\".join(ANS))", "n = int(input())\r\ns = input()\r\n\r\nc = []\r\nfor i in range(0,len(s),2):\r\n if(i == len(s)-1):\r\n c[-1]+=s[i]\r\n else:\r\n c.append(s[i:i+2])\r\nprint('-'.join(c))", "n = int(input())\r\na = list(map(int, input()))\r\nif n&1^1:\r\n i = 0\r\n while i<n:\r\n if i and i&1^1:\r\n print(\"-\",end=\"\")\r\n print(a[i],end=\"\")\r\n i+=1\r\n print()\r\nelse:\r\n i = 0\r\n while i<n-1:\r\n if i and i&1^1:\r\n print(\"-\",end=\"\")\r\n print(a[i],end=\"\")\r\n i+=1\r\n print(a[-1])\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn = read_int()\r\n\ta = read()\r\n\tb = \"-\".join(a[i:i+2] for i in range(0, n, 2))\r\n\tif n%2==1:\r\n\t\tb = b[:-2]+b[-1:]\r\n\tprint(b)\r\n\r\nsolve()\r\n", "n = int(input())\r\na = input()\r\nif n % 2 == 0:\r\n for i in range(0 ,n - 2,2):\r\n print(a[i : i + 2] + '-' ,end = '')\r\n print(a[-2] + a[-1])\r\nelse:\r\n for i in range(0 ,n - 3,2):\r\n print(a[i : i + 2] + '-' ,end = '')\r\n print(a[-3] + a[-2] + a[-1])\r\n", "a=input()\r\ns=input()\r\nt=len(s)\r\ni=0\r\nwhile(t-3>0):\r\n print(s[i:i+2],end =\"-\")\r\n i=i+2\r\n t=t-2\r\nprint(s[i:])", "def insert(line, ind, s):\r\n return line[:ind] + s + line[ind:]\r\n\r\n\r\nn = int(input())\r\ns = input()\r\ni = n - 3 if n % 2 != 0 else n - 2\r\nwhile i > 0:\r\n s = insert(s, i, '-')\r\n i -= 2\r\n\r\nprint(s)\r\n", "\r\n\r\ndef solve(s):\r\n ans=\"\"\r\n n=len(s)\r\n for i in range(0,n-2,2):\r\n ans=ans+s[i]+s[i+1]+'-'\r\n return ans+s[n-2]+s[n-1];\r\n\r\nn=int(input())\r\ns=input()\r\nif(n%2):\r\n #print(s[:-1])\r\n print(solve(s[:-1])+s[n-1])\r\nelse:\r\n print(solve(s))\r\n", "foo = int(input())\r\nbar = input()\r\n\r\nif foo % 2 == 0:\r\n print('-'.join(bar[i:i+2] for i in range(0, foo, 2)))\r\nelse:\r\n time = bar[-1::]\r\n bar = bar[:-1:]\r\n print('-'.join(bar[i:i+2] for i in range(0, foo-1, 2)) + time)", "n = int(input())\r\ns = str(input())\r\nif n>3 :\r\n\ttemp = str()\r\n\tres = str()\r\n\tif n % 2 == 0 :\r\n\t\tn = n - 2\r\n\t\ttemp = s[-2:]\r\n\t\ts = s[:-2]\r\n\telse :\r\n\t\tn = n - 3\r\n\t\ttemp = s[-3:]\r\n\t\ts = s[:-3]\r\n\tfor i in range(0, n, 2) :\r\n\t\tres = res + s[i:i+2] + '-'\r\n\tprint(res+temp)\r\nelse :\r\n\tprint(s)", "n=int(input())\r\nstrr=input()\r\nx=\"\"\r\nif n%2==0:\r\n for i in range(0,n,2):\r\n \r\n x=x+strr[i:i+2]+\"-\"\r\n print(x[:-1])\r\nelse:\r\n for i in range(0,n-2,2):\r\n \r\n x=x+strr[i:i+2]+\"-\"\r\n x=x[:-1]\r\n x=x+strr[-1]\r\n print(x)\r\n", "x=int(input())\r\na=input()\r\nk=''\r\nfor i in range(len(a)):\r\n if i!=0 and i%2==0:\r\n k+=\"-\"+a[i]\r\n else:\r\n k+=a[i]\r\nif len(k)>2:\r\n ans=k[:-2]\r\n k=k[-2:]\r\n k=list(k)\r\n if '-' in k:\r\n yo=k.pop(0)\r\n k=''.join(k)\r\n ans+=k\r\nelse:\r\n ans=k\r\nprint(ans)", "t=int(input())\r\nx=input()\r\nif(t%2==0):\r\n s=\"\"\r\n for j in range(0,len(x),2):\r\n s=s+x[j:j+2]+\"-\"\r\n print(s[0:-1])\r\nelse:\r\n s=\"\"\r\n for j in range(0,len(x)-3,2):\r\n s=s+x[j:j+2]+\"-\"\r\n print(s+x[-3:])", "n = int(input())\na = input()\nif n%2 == 0:\n ans = ''\nelse:\n ans = f'{a[:3]}-'\n n-=3\n a = a[3::]\nfor i in range(n):\n ans+=a[i]\n if i%2 == 1:\n ans+='-'\nprint(ans[:-1])\n", "n = int(input())\r\nphone_number = input()\r\nif n % 2 == 0:\r\n groups = [phone_number[i:i+2] for i in range(0, n, 2)]\r\nelse:\r\n groups = [phone_number[0:3]] + [phone_number[i:i+2] for i in range(3, n, 2)]\r\n\r\nprint(\"-\".join(groups))\r\n", "n = int(input())\r\ns = input()\r\nfor i in range(n):\r\n print(s[i], end = '')\r\n if (i + 1) % 2 == 0:\r\n if n % 2 == 0 and i != n - 1:\r\n print('-', end = '')\r\n if n % 2 != 0 and i != n - 2:\r\n print('-', end = '')", "def string2list(x):\n x=x.split()\n i=0\n #print(hi)\n for i in range(len(x)):\n x[i]=int(x[i])\n return x\n\n#def list2string(x)\n# (' '.join(state.rem[0:states.total]))\n\nn=int(input())\nnumber=input()\nk=0\ncurrent=0\noutput=['']*(3*n)\nif n % 2==0:\n while k<n:\n #print('The value of k is')\n #print(k)\n #print('The value of current is')\n #print(current)\n if k % 2 == 0:\n output[current]=number[k]\n k=k+1\n current=current+1\n else:\n output[current]=number[k]\n output[current+1]='-'\n current=current+2\n k=k+1\n print(''.join(output[0:current-1]))\nelse:\n output[0]=number[0]\n output[1]=number[1]\n output[2]=number[2]\n output[3]='-'\n k=3\n current=4\n while k<n:\n #print('The value of k is')\n #print(k)\n #print('The value of current is')\n #print(current)\n if (k+1) % 2 == 0:\n output[current]=number[k]\n k=k+1\n current=current+1\n else:\n output[current]=number[k]\n output[current+1]='-'\n current=current+2\n k=k+1\n print(''.join(output[0:current-1]))\n", "n=int(input())\r\ns=input()\r\nwhile(len(s)>3):\r\n print(s[0:2],\"-\",sep=\"\",end=\"\")\r\n s=s[2:]\r\n\r\nif s:\r\n print(s)", "n=int(input())\na=input()\nwhile(len(a)>3):\n print(a[0:2],\"-\",sep=\"\",end=\"\")\n a=a[2:]\nif(len(a)):\n print(a)", "import sys; input = sys.stdin.readline\r\n\r\n\r\nn=int(input())\r\na=input()\r\np=n//3\r\nif n<=3:\r\n print(a)\r\nelif n%3==0:\r\n for i in range(0,n,3):\r\n if i==p*3-3:\r\n print(a[i:i+3])\r\n break\r\n print(a[i:i+3],end='-')\r\nelif n%3==1:\r\n for i in range(0,n,3):\r\n if i==p*3-3:\r\n print(a[i:i+2],end='-')\r\n print(a[i+2:])\r\n break\r\n print(a[i:i+3],end='-')\r\nelse:\r\n for i in range(0,n,3):\r\n if i==p*3:\r\n print(a[i:i+2])\r\n break\r\n print(a[i:i+3],end='-')", "n=int(input())\r\ns=input()\r\nr=''\r\nfor i in range(0,n,2):\r\n r+=s[i:i+2]\r\n r+='-'\r\nif(n%2==1):\r\n r=r[:-3]\r\n r+=s[-1]\r\nelse:\r\n r=r[:-1]\r\nprint(r)", "N = int(input())\r\n\r\nString = input()\r\nif N % 2 == 0:\r\n for i in range(0, N, 2):\r\n print(String[i] + String[i+1], end=\"\")\r\n if i < N-3:\r\n print(\"-\", end=\"\")\r\nelse:\r\n for i in range(0, N, 2):\r\n if i == N-1:\r\n break\r\n print(String[i] + String[i+1], end=\"\")\r\n if i < N-3:\r\n print(\"-\", end=\"\")\r\n print(String[-1], end=\"\")", "n=int(input())\r\ns=str(input())\r\nd=''\r\nif(n%2==0):\r\n for i in range(0,len(s),2):\r\n d=d+s[i]+s[i+1]+'-'\r\n print(d[0:len(d)-1])\r\nelse:\r\n d=d+s[0]+s[1]+s[2]+'-'\r\n for i in range(3,len(s),2):\r\n d=d+s[i]+s[i+1]+'-'\r\n print(d[0:len(d)-1])\r\n ", "n=int(input())\r\ns=input()\r\nif n&1:\r\n\tx=\"\"\r\n\tfor i in range(0,n-2,2):\r\n\t\tif i==n-3:\r\n\t\t\tx+=s[i:]\r\n\t\telse:\r\n\t\t\tx+=s[i:i+2]\r\n\t\t\tx+=\"-\"\r\nelse:\r\n\tx=\"\"\r\n\tfor i in range(0,n,2):\r\n\t\tx+=s[i:i+2]\r\n\t\tif i!=n-2:\t\r\n\t\t\tx+=\"-\"\r\nprint(x)", "nn = input()\r\nword= input()\r\nn= len(word)\r\nodd = True if n % 2 == 0 else False\r\nfor i , o in enumerate(word):\r\n if odd :\r\n if (i>0 and i%2==0):\r\n print(\"-\"+o, end=\"\")\r\n else:\r\n print(o,end=\"\")\r\n else:\r\n if(i>0 and i%2==0 and (n-i) > 2):\r\n print(\"-\"+o, end=\"\")\r\n else:\r\n print(o,end=\"\") \r\nprint(\"\");", "n=int(input())\r\nl=input()\r\nz=[]\r\nif n>2:\r\n\tif n%2==0:\r\n\t\tfor x in range(0,n,2):\r\n\t\t\tz.append(l[x:x+2])\r\n\telse:\r\n\t\tfor x in range(0,n-3,2):\r\n\t\t\tz.append(l[x:x+2])\r\n\t\tz.append(l[-3:])\r\n\tz='-'.join(z)\r\n\tprint(z)\r\nelse:\r\n\tprint(l)", "notused, number = input(), input()\nif len(number) < 4:\n\tprint(number)\nelse:\n\tnumber = [c for c in number]\n\tnnumber = []\n\tif len(number) % 3 == 0:\n\t\tfor i in range(len(number)//3):\n\t\t\tnnumber.append(\"\".join(number[i*3:i*3+3]))\t\n\telif len(number) % 3 == 1:\n\t\tfor i in range(len(number)//3 -1):\n\t\t\tnnumber.append(\"\".join(number[i*3:i*3+3]))\n\t\tnnumber.append(\"\".join(number[-4:-2]))\n\t\tnnumber.append(\"\".join(number[-2:]))\n\telif len(number) % 3 == 2:\n\t\tfor i in range(len(number)//3):\n\t\t\tnnumber.append(\"\".join(number[i*3:i*3+3]))\n\t\tnnumber.append(\"\".join(number[-2:]))\n\tprint(\"-\".join(nnumber))\n", "a=int(input())\r\nb=str(input())\r\nc=[]\r\nif a%2==0:\r\n z=2\r\n for i in range(len(b)):\r\n c=c+[b[i]]\r\n if len(c)==z:\r\n z=z+3\r\n c=c+[\"-\"]\r\nif a%2!=0:\r\n z=3\r\n for i in range(len(b)):\r\n c=c+[b[i]]\r\n if len(c)==z:\r\n z=z+3\r\n c=c+[\"-\"]\r\nprint(''.join(c[0:len(c)-1]))\r\n\r\n", "def funcion(n, num):\n\n\tpalabra=\"\"\n\tpal=num\n\n\tif (n==2):\n\t\treturn num\n\n\tif (n%2!=0):\n\t\tpalabra += num[0:3]\n\t\tpal=num[3:]\n\t\tif(len(pal)!=0):\n\t\t\tpalabra+=\"-\"\t\t\n \n\tfor i in range(len(pal)):\n\t if(i%2==0):\n\t\t palabra +=pal[i:i+2]\n\t else:\n\t if(i != len(pal)-1):\n\t palabra += \"-\"\n\n\treturn palabra\n\nn = int(input())\nnum = input()\n\nvalor=funcion(n,num)\n\nprint(valor)\n", "n = int(input())\r\n\r\n# arr = [int(i) for i in input().split(\" \")]\r\ns = input()\r\n\r\nif len(s)<=3:\r\n print(s)\r\n\r\nelse:\r\n i = 0\r\n while i <(n-n%2-2):\r\n print(s[i:i+2],end=\"-\")\r\n i+=2\r\n print(s[i:])\r\n \r\n " ]

[ "def prefix(s):\n p = [0]\n for i in range(1, len(s)):\n j = p[-1]\n while j > 0 and s[j] != s[i]:\n j = p[j - 1]\n if s[i] == s[j]:\n j += 1\n p.append(j)\n return p\n\n\ns = input()\nn = len(s)\nans = [0] * (n + 1)\ni = n - 1\n\nwhile i >= 0:\n p = prefix(s[i:])\n ans[i] = 2 + ans[i + 1]\n for j in range(len(p)):\n z = 1\n if (j + 1) % (j + 1 - p[j]) == 0:\n z = (j + 1) // (j + 1 - p[j])\n res = len(str(z)) + (j + 1) // z + ans[i + j + 1]\n ans[i] = min(ans[i], res)\n i -= 1\n\nprint(ans[0])\n", "def z_algo(S):\r\n N = len(S)\r\n A = [0]*N\r\n i = 1; j = 0\r\n A[0] = l = len(S)\r\n while i < l:\r\n while i+j < l and S[j] == S[i+j]:\r\n j += 1\r\n if not j:\r\n i += 1\r\n continue\r\n A[i] = j\r\n k = 1\r\n while l-i > k < j - A[k]:\r\n A[i+k] = A[k]\r\n k += 1\r\n i += k; j -= k\r\n return A\r\n\r\ndef calc(s):\r\n m=len(s)\r\n z=z_algo(s)\r\n dp=list(range(m))\r\n for i in range(1,m):\r\n if z[i]>=dp[i]:\r\n d=dp[i]\r\n if d+i<m:\r\n dp[i+d]=min(dp[i+d],dp[i])\r\n return dp\r\n \r\ns=input()+'*'\r\nn=len(s)\r\ndp=[10**9]*n\r\ndp[0]=0\r\nfor i in range(n):\r\n t=s[i:]\r\n x=calc(t)\r\n for j in range(i+1,n):\r\n m=x[j-i]\r\n dp[j]=min(dp[j],dp[i]+m+len(str((j-i)//m)))\r\n\r\nprint(dp[-1])", "s=input()\r\nn=len(s)\r\ndef f(s):\r\n n=len(s)\r\n ar=[0]*n\r\n i,j=1,0\r\n while i<n:\r\n if(s[i]==s[j]):\r\n j+=1\r\n ar[i]=j\r\n i+=1\r\n else:\r\n if(j!=0):j=ar[j-1]\r\n else:i+=1\r\n return ar\r\ndp=[n+1]*(n)+[0]\r\nfor i in range(n-1,-1,-1):\r\n ar=f(s[i:])\r\n for j in range(len(ar)):\r\n T=1\r\n k=j+1\r\n if(k%(k-ar[j])==0):T=k//(k-ar[j])\r\n dp[i]=min(dp[i],len(str(T))+k//T+dp[i+k])\r\nprint(dp[0])\r\n\r\n" ]

[ "from math import ceil\nH,M=input().split()\nh,d,c,n=input().split()\nH,M,h,d,c,n=int(H),int(M),int(h),int(d),int(c),int(n)\nif H<20:\n print(min(ceil(h/n)*c,ceil((h+d*(1200-H*60-M))/n)*0.8*c))\nelse:\n print(ceil(h/n)*0.8*c)", "# Standard Input\r\nimport sys\r\n\r\n\r\ndef main():\r\n file = sys.stdin # we can read the input from this file\r\n\r\n line1 = file.readline()\r\n line2 = file.readline() # get the two lines\r\n\r\n hour, minute = line1.split()\r\n H, D, C, N = line2.split()\r\n hour, minute = int(hour), int(minute)\r\n H, D, C, N = int(H), int(D), float(C), int(N)\r\n\r\n # If the time of wakening is after 20:00, then it would be best that Andrew leaves\r\n # home exactly when he wakes up.\r\n # But if he wakes up before 20:00, then he has to consider (and calculate in no time)\r\n # if it would be be better to go at 20:00 and get discount (while waiting will increase\r\n # the Hunger Level of cat...) or go right at the moment he wakes up!\r\n\r\n if (hour >= 20): # if it is after 20:00\r\n # Andrew must go right now!\r\n bunsRequired = roundUp(H / N)\r\n cost = bunsRequired * (0.8 * C) # discount is after 20:00 !!\r\n print(\"{:.4f}\".format(cost))\r\n\r\n else:\r\n # if he woke up before 20:00\r\n # find the minutes left for 20:00\r\n timeLeft = (20 - hour) * 60 - minute # we need to subtract minute\r\n incrementInHunger = timeLeft * D # this is the increse in the hunger.\r\n totalHungerIfWaited = H + incrementInHunger\r\n totalCostIfWaited = roundUp(totalHungerIfWaited / N) * (0.8 * C) # NOTE: cost becomes 80% after 20:00\r\n\r\n totalCostIfNotWaited = roundUp(H / N) * C\r\n minimumCost = min(totalCostIfWaited, totalCostIfNotWaited)\r\n print(\"{:.4f}\".format(minimumCost))\r\n\r\n\r\ndef roundUp(n):\r\n # return the n rounded up\r\n if n % 1 != 0:\r\n return int(n) + 1\r\n else:\r\n return int(n) # we can also return n as it is already integer\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\nhh, mm = map(float, input().split())\r\nH, D, C, N = map(float, input().split())\r\nmm += hh*60\r\n\r\nif mm >= 1200:\r\n print((math.ceil(H / N)) * C * 0.8)\r\nelse:\r\n print(min((math.ceil(H / N) * C), (math.ceil((H + D * (1200 - mm)) / N) * C * 0.8)))", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nmm += hh*60\r\n\r\nif mm >= 1200:\r\n t, c = divmod(H, N)\r\n if c:\r\n t += 1\r\n ans = t*C*0.8\r\nelse:\r\n t2_d, t2_m = divmod(H, N)\r\n if t2_m:\r\n t2_d += 1\r\n\r\n H += (1200-mm)*D\r\n t1_d, t1_m = divmod(H, N)\r\n if t1_m:\r\n t1_d += 1\r\n ans = min(t2_d*C, t1_d*C*0.8)\r\n\r\nprint(\"%3f\"%ans)\r\n", "s1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\nhh, mm = s1[0], s1[1]\r\nh, d, c, n = s2[0], s2[1], s2[2], s2[3]\r\nres = 0\r\nif hh>=20:\r\n if h%n==0:\r\n res = h/n*c*0.8\r\n else:\r\n res = (h//n+1)*c*0.8\r\n print(res)\r\nelse:\r\n x = 60-mm\r\n y = 20-hh-1\r\n res1 = h + (y*60 + x)*d\r\n if res1%n==0:\r\n res1 = res1/n*c*0.8\r\n else:\r\n res1 = (res1//n+1)*c*0.8\r\n \r\n res2 = 0\r\n if h%n==0:\r\n res2 = h/n*c\r\n else:\r\n res2 = (h//n+1)*c\r\n print(min(res1, res2))", "h, m = map(int,input().split())\r\ntime = h * 60 + m\r\ntime = 1200 - time\r\nh, d, c, n = map(float,input().split())\r\nif time <= 0:\r\n k = h / n\r\n if k % 1 != 0:\r\n k = int(k) + 1\r\n print(c*0.8 * k)\r\nelse:\r\n k = h / n\r\n if k % 1 != 0:\r\n k = int(k) + 1\r\n p1 = c * k\r\n h += d * time\r\n k = h / n\r\n if k % 1 != 0:\r\n k = int(k) + 1\r\n p2 = c * 0.8 * k\r\n print(min(p1,p2))", "\"\"\"Problem A - Feed the cat.\n\nhttp://codeforces.com/contest/955/problem/A\n\nAfter waking up at hh:mm, Andrew realised that he had forgotten to feed his\nonly cat for yet another time (guess why there's only one cat). The cat's\ncurrent hunger level is H points, moreover each minute without food increases\nhis hunger by D points.\n\nAt any time Andrew can visit the store where tasty buns are sold (you can\nassume that is doesn't take time to get to the store and back). One such bun\ncosts C roubles and decreases hunger by N points. Since the demand for bakery\ndrops heavily in the evening, there is a special 20% discount for buns starting\nfrom 20:00 (note that the cost might become rational). Of course, buns cannot\nbe sold by parts.\n\nDetermine the minimum amount of money Andrew has to spend in order to feed his\ncat. The cat is considered fed if its hunger level is less than or equal to\nzero.\n\nInput:\n\nThe first line contains two integers hh and mm (00 ≤ hh ≤ 23, 00 ≤ mm ≤ 59) —\nthe time of Andrew's awakening.\n\nThe second line contains four integers H, D, C and N (1 ≤ H ≤ 105, 1 ≤ D, C, N\n≤ 102).\n\nOutput:\n\nOutput the minimum amount of money to within three decimal digits. You answer\nis considered correct, if its absolute or relative error does not exceed 10 -\n4.\n\nFormally, let your answer be a, and the jury's answer be b. Your answer is\nconsidered correct if .\n\n\"\"\"\nimport math\nimport logging\n\nch = logging.StreamHandler()\nch.setLevel(logging.DEBUG)\n\nlogger = logging.getLogger()\nlogger.setLevel(logging.DEBUG)\nlogger.addHandler(ch)\n\n\ndef solve(hh, mm, h, d, c, n):\n if hh >= 20:\n return 0.8 * c * math.ceil(h / n)\n logger.debug('Can buy at %s:%s for %s', hh, mm, c * math.ceil(h / n))\n logger.debug('Can buy at 20:00 for %s', 0.8 * c * math.ceil((h + d * ((20 - hh) * 60 - mm)) / n))\n return min(\n c * math.ceil(h / n),\n 0.8 * c * math.ceil((h + d * ((20 - hh) * 60 - mm)) / n))\n\n\ndef main():\n hh, mm = input().strip().split()\n hh = int(hh)\n mm = int(mm) if mm != '00' else 0\n h, d, c, n = map(int, input().strip().split())\n result = solve(hh, mm, h, d, c, n)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "#JMD\r\n#Nagendra Jha-4096\r\n\r\n#a=list(map(int,sys.stdin.readline().split(' ')))\r\n#n,k,s= map(int, sys.stdin.readline().split(' '))\r\n\r\nimport sys\r\nimport math\r\n\r\n#import fractions\r\n#import numpy\r\n\r\n###Defines...###\r\nmod=1000000007\r\n\r\n###FUF's...###\r\ndef nospace(l):\r\n\tans=''.join(str(i) for i in l)\r\n\treturn ans\r\n\r\n\r\n\r\n##### Main ####\r\n\r\nax=list(map(int,sys.stdin.readline().split(' ')))\r\nhh=ax[0]\r\nmm=ax[1]\r\na=list(map(int,sys.stdin.readline().split(' ')))\r\nh=a[0]\r\nd=a[1]\r\nc=a[2]\r\nn=a[3]\r\nif(hh<20):\r\n\tm1=(math.ceil(h/n))*c\r\n\thrd=d*((20-hh)*60-mm)\r\n\tm2=((math.ceil((h+hrd)/n))*c)*0.8\r\n\tprint(min(m1,m2))\r\nelse:\r\n\tm1=(math.ceil(h/n))*c*0.8\r\n\tprint(m1)\r\n\r\n\r\n\t\r\n", "import math\r\nhh,mm = map(int, input().split())\r\nH, D, C, N = map(float, input().split())\r\nif hh < 20:\r\n kol_bulocheck_srazu = math.ceil(H / N)\r\n cena_srazu = C * kol_bulocheck_srazu\r\n rasnhh = 20 - hh\r\n if mm != 0:\r\n rasnhh -= 1\r\n mm = 60 - mm\r\n rasn = rasnhh * 60 + mm\r\n golod_dolb = D * rasn + H\r\n kol_bulocheck = math.ceil(golod_dolb / N)\r\n cena_dolb = C * 0.8 * kol_bulocheck\r\n if cena_dolb < cena_srazu:\r\n print (\"%.3f\" % cena_dolb)\r\n elif cena_dolb > cena_srazu:\r\n print (\"%.3f\" % cena_srazu)\r\n elif cena_dolb == cena_srazu:\r\n print (\"%.3f\" % cena_srazu)\r\nelif hh >= 20:\r\n kol_bulocheck = math.ceil(H / N)\r\n cena = C * 0.8 * kol_bulocheck\r\n print (\"%.3f\" % cena)", "import math\r\nfrom datetime import timedelta\r\n\r\nhh , mm = map(int,input().split())\r\nh , d , c , n = map(int, input().split() )\r\n\r\nif hh >= 20 :\r\n cost = c * math.ceil(h / n)\r\n cost -= cost * 0.2\r\nelse :\r\n cost_noDis = c * math.ceil( h/n )\r\n \r\n t1 = timedelta(hours=20, minutes=00) \r\n t2 = timedelta(hours=hh, minutes=mm)\r\n t = t1 - t2\r\n time = list(str(t).split(\":\"))\r\n #print(time)\r\n h_20 = h + ( 60 * (int(time[0])) + int(time[1]) ) * d\r\n #print(h_20)\r\n cost_dis = c * math.ceil( h_20 / n ) \r\n cost_dis = cost_dis - (cost_dis * 0.2) \r\n # print(t)\r\n # print(cost_dis)\r\n # print(cost_noDis)\r\n cost = min ( cost_dis , cost_noDis )\r\nprint(format(cost,'.4f'))\r\n", "R=lambda:map(int,input().split())\nh,m=R()\nH,D,C,N=R()\nH+=N-1\nprint(min(H//N*C,(H+max(0,1200-h*60-m)*D)//N*C*.8))\n \t \t\t \t\t\t\t \t\t \t \t\t \t", "import math\r\n\r\nhh,mm = map(int,input().split()) \r\nh,d,c,n = map(int,input().split())\r\n\r\n\r\n\r\nif hh < 20:\r\n ht = 0\r\n ht += (20 - hh - 1) * 60 \r\n ht += 60 - mm\r\n ht *= d\r\n\r\n x1 = math.ceil(h/n) * c\r\n x2 = math.ceil((h+ht)/n) * c * 0.8\r\n print(float(min(x1,x2)))\r\n\r\n\r\nelse:\r\n x = math.ceil(h/n) * c\r\n x *= 0.8\r\n print(float(x))\r\n ", "import math\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nif(hh<=20):\r\n\tif(mm==0 or hh==20):\r\n\t\tx=20-hh\r\n\t\ty=0\r\n\telse:\r\n\t\tx=19-hh\r\n\t\ty=60-mm\r\n\tm=x*60+y\r\n\tl=(math.ceil(h/n))\r\n\ttc1=c*l\r\n\th=h+d*m\r\n\tl1=(math.ceil(h/n))\r\n\ttc2=(c-0.2*c)*l1\r\n\tprint(min(tc1,tc2))\r\nif(hh>20):\r\n\tl1=(math.ceil(h/n))\r\n\ttc2=(c-0.2*c)*l1\r\n\tprint(tc2)", "import math as ma\r\nH=list(map(int, input ().split()))\r\na=list(map(int, input ().split()))\r\nif H[0]>=20:\r\n ans=ma.ceil(a[0]/a[3])\r\n ans=ans*a[2]\r\n ans=ans*0.8\r\n print(ans)\r\nelse:\r\n t=(20-H[0])*60-H[1]\r\n hn=a[0]+a[1]*t\r\n ans1=ma.ceil(hn/a[3])\r\n ans1=ans1*a[2]\r\n ans1=ans1*0.8\r\n ans=ma.ceil(a[0]/a[3])\r\n ans=ans*a[2]\r\n print(min(ans,ans1))", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nif hh >= 20:\r\n C = 0.8 * C\r\n cost = C * ((H + N - 1) // N)\r\n print('{:.4f}'.format(cost))\r\nelse:\r\n dh = 20 - hh - 1\r\n dm = 60 - mm\r\n t = dh * 60 + dm\r\n cost1 = C * ((H + N - 1) // N)\r\n cost2 = 0.8 * C * ((H + t * D + N - 1) // N)\r\n m = min(cost1, cost2)\r\n print('{:.4f}'.format(m))\r\n", "hh, mm = map(int, input().split())\r\nH, D, cost, nutr = map(int, input().split())\r\n \r\nhh = 60 * hh + mm\r\nif hh >= 1200:\r\n print('{:.4f}'.format((H + nutr - 1) // nutr * cost * 0.8))\r\nelse:\r\n print('{:.4f}'.format(min((H + nutr - 1) // nutr * cost, (H + (1200 - hh) * D + nutr - 1) // nutr * cost * 0.8)))", "import math\r\nhh, mm = map(int, input().split())\r\nH,D,C,N = map(int,input().split())\r\nnow = 0.0000\r\nlater = 0.0000\r\ntime = 0\r\nnow = math.ceil(H/N)*C\r\nif hh<20:\r\n time = ((20-hh)*60)-mm\r\nlater = (math.ceil((H+(D*time))/N)*C)\r\nlater*=0.8\r\nprint(min(round(now,4),round(later,4)))", "h,m = map(int, input().split())\r\nk,d,c,n =map(int, input().split())\r\nfrom math import ceil\r\nif h >= 20:\r\n print(ceil(k/n)*(c*0.8))\r\nelse:\r\n a1 = ceil(k/n)*c\r\n r = 60*(20-h) - m\r\n a2 = (ceil((k+r*d)/n))*(c*0.8)\r\n print(min(a1,a2))", "import math\r\nhh,mm = map(int, input().split())\r\nh,d,c,n = map(int, input().split())\r\nif hh>=20:\r\n immediateBuy = ((c-c*(0.2))*math.ceil(h/n))\r\n print(immediateBuy)\r\nelse:\r\n immediateBuy = c*(math.ceil(h/n))\r\n minutes = (20-hh)*60 - mm\r\n H = h+(minutes*d)\r\n afterdiscount = ((c-c*(0.2))*math.ceil(H/n))\r\n if immediateBuy>afterdiscount:\r\n print(afterdiscount)\r\n else:\r\n print(immediateBuy)", "t,m = map(int,input().split())\r\nh,d,c,n = map(int,input().split())\r\ntotal1=(t*60)+m\r\nb=(h//n)\r\nif h%n>0:\r\n b+=1\r\nb*=c\r\n\r\nif t<20:\r\n t1=(20-t)-1\r\n m=60-m\r\n total=((t1*60)+(m))*d\r\n l=h+total\r\n o=l//n\r\n if l%n>0:\r\n o+=1\r\n p=o*c\r\n p*=0.8\r\nelse:\r\n p=b-(b*0.2)\r\nprint(min(p,b)) ", "hh,mm=map(int,input().split())\nh,d,c,n=map(int,input().split())\nif hh>=20:\n print((h+n-1)//n*(0.8*c))\n quit()\nmm1=1200-hh*60-mm\nprint(min((h+n-1)//n*c,(h+mm1*d+n-1)//n*(c*0.8)))", "def f(a,b):\n if a % b == 0:\n return a // b\n else:\n return a // b + 1\n\nhh,mm = map(int,input().split())\nh,d,c,n = map(int,input().split())\nt = hh * 60 + mm\nif t >= 20 * 60:\n print(c * f(h,n) * 0.8)\nelse:\n print(min(c * f(h,n),c * 0.8 * f((20 * 60 - t) * d + h,n) ))", "time = [int(i) for i in input().split()]\r\nhh, mm = time[0], time[1]\r\ns = [int(i) for i in input().split()]\r\nh, d, c, n = s[0], s[1], s[2], s[3]\r\nmm += hh * 60\r\ntime = 1200\r\n#with sale\r\nif time - mm <= 0:\r\n h_res = h\r\nelse:\r\n h_res = h + d * (time - mm)\r\nc_sale = 0.8 * c\r\nif h_res / n == h_res // n:\r\n count = h_res // n\r\nelse:\r\n count = h_res // n + 1\r\nresult1 = count * c_sale\r\n#without sale\r\nif h / n == h // n:\r\n count = h // n\r\nelse:\r\n count = h // n + 1\r\nresult2 = count * c\r\nprint(min(result1, result2))", "hr, m = [int(x) for x in input().strip().split(\" \")]\nh, d, c, n = [int(x) for x in input().strip().split(\" \")]\n\nbuns = h//n\nif h % n > 0:\n buns += 1\n\nrightAway = buns * c\nlater = rightAway\n\nif hr >= 20 and hr <= 23:\n rightAway -= (rightAway * .2)\nelse:\n dMin = 60 - m\n dHr = 20 - (hr + 1)\n dMin += 60 * dHr\n h += d * dMin\n buns = h // n\n if h%n > 0:\n buns += 1\n later = (buns * c) - ((buns*c) * .2)\nprint(min(rightAway, later))", "def solve(hh, mm, H, D, C, N):\r\n l1 = C * int(H/N + (1 if H % N else 0))\r\n if hh < 20:\r\n H += D * (60*(20-hh)-mm)\r\n l2 = 4*C/5 * int(H/N + (1 if H % N else 0))\r\n \r\n return min(l1, l2)\r\n\r\nhh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n\r\nprint('%.4f' % solve(hh, mm, H, D, C, N))", "import math\r\nh,m=map(int,input().split())\r\nH,D,C,N=map(int,input().split())\r\nif h>=20:\r\n print(C*0.8*math.ceil(H/N))\r\nelse:\r\n k=(20-h-1)*60+60-m\r\n print(min(C*math.ceil(H/N),C*0.8*math.ceil((H+D*k)/N)))\r\n", "s = input().split(\" \")\ntime2 = 60 * 20\ntime1 = (int(s[0]) * 60) + int(s[1])\nif int(s[0]) >= 20:\n\ttime1 = time2\nh, d, c, n = map(int, input().split())\ncost1 = h // n\nif h % n != 0:\n\tcost1 += 1\nhunger = h\t\ncost1 *= c\ncost2 = 0\ny = time1\nwhile y != time2:\n\thunger += d\n\ty += 1\ncost2 = hunger // n\nif hunger % n != 0:\n\tcost2 += 1\nhunger = h\t\ncost2 *= (c * 0.8)\ny = time1\ncost3 = 0\nwhile y != time2:\n\tcost3 += c\n\thunger += (d - n)\n\ty += 1\ncount = hunger // n\nif hunger % n != 0:\n\tcount += 1\nhunger = h\t\ncost3 += (c * count * 0.8)\nprint(min(cost1, cost2, cost3))\n\n\n\n\n\n\n", "r = lambda: map(int, input().split())\nh, m = r()\nH, D, C, N = r()\nH += N - 1\nprint( min( H // N * C, (H + max(0, 1200 - h * 60 - m) * D) // N * C * .8))\n", "import math\r\n\r\ndef main():\r\n h,m = map(int,input().split())\r\n H,d,c,n = map(int,input().split())\r\n x = math.ceil(H/n)\r\n cost = x*c\r\n diff = 0\r\n if h < 20:\r\n diff += 60*(20-h)\r\n diff -= m\r\n else:\r\n diff = 0\r\n\r\n #print(diff,cost)\r\n H += diff*d\r\n x = math.ceil(H/n)\r\n\r\n cost = min(cost,x*0.8*c)\r\n print(cost)\r\n\r\n\r\nmain()\r\n", "import math\nh, m = map(int,input().split())\nH,D,C,N = map(int,input().split())\nmn = (20-h)*60-m\nif mn < 0: mn = 0\na1 = C*math.ceil(H/N)\na2 = C*0.8*math.ceil((H+mn*D)/N)\nprint(min(a1,a2))\n", "R=lambda:map(int,input().split())\r\nh,m=R()\r\nH,D,C,N=R()\r\nH+=N-1\r\nprint(min(H//N*C,(H+max(0,1200-h*60-m)*D)//N*C*.8))", "import math\r\nfirst = input().split(\" \")\r\nhh = int(first[0])\r\nmm = int(first[1])\r\nt = hh * 60 + mm\r\ndisc = 20 * 60\r\n\r\nsecond = input().split(\" \")\r\nh = int(second[0])\r\nd = int(second[1])\r\nc = int(second[2])\r\nn = int(second[3])\r\n\r\nif(t > disc):\r\n print(0.8 * math.ceil(h/float(n)) * c)\r\nelse:\r\n wait = 0.8 * math.ceil((h + d * (disc-t))/float(n))\r\n imme = math.ceil(h/float(n))\r\n print(min(c * imme, c * wait))\r\n \r\n", "import math\r\np=input().rstrip().split(' ')\r\nq=input().rstrip().split(' ')\r\nH=int(q[0])\r\nD=int(q[1])\r\nC=int(q[2])\r\nN=int(q[3])\r\nl=[]\r\nif int(p[0])<20:\r\n Y=math.ceil(H/N)\r\n l.append(Y*C)\r\n V=((20-int(p[0]))-1)*60;\r\n B=60-int(p[1])\r\n V+=B;\r\n H=H+(V*D)\r\n Y=math.ceil(H/N)\r\n M=((Y*C)*20)/100;\r\n l.append((Y*C)-M)\r\n print(min(l))\r\nelse:\r\n Y=math.ceil(H/N)\r\n M=((Y*C)*20)/100;\r\n l.append((Y*C)-M)\r\n print(min(l))\r\n", "import math\r\nimport sys\r\nhh, mm = [int(x) for x in input().split()]\r\nh,d,c,n = [int(x) for x in input().split()]\r\ndift = 20*60-(hh*60+mm)\r\nz=math.ceil((dift*d+h)/n)*c*0.8\r\ns=math.ceil((h)/n)*c\r\nif hh>=20:\r\n print((math.ceil(h/n)*c*0.8))\r\n sys.exit()\r\nprint(min(s,z))\r\n", "h, m = map(int, input().split())\r\nx, d, c, n = map(int, input().split())\r\nif h >= 20:\r\n print(((x + n - 1) // n) * (c * 0.8))\r\nelse:\r\n ans = min(((x + ((20 - h) * 60 - m) * d + n - 1) // n) * (c * 0.8), ((x + n - 1) // n) * c)\r\n print('%.7f' % ans)", "def solve():\r\n hh, mm = map(int, input().split())\r\n H, D, C, N = map(int, input().split())\r\n\r\n hh = hh * 60 + mm\r\n if hh >= 20 * 60 + 0:\r\n c = ((H + N - 1) // N * C * 0.8)\r\n print('{:.4f}'.format(c))\r\n else:\r\n a = (H + N - 1) // N * C\r\n b = (H + (1200 - hh) * D + N - 1) // N * C * 0.8\r\n print('{:.4f}'.format(min(a, b)))\r\n\r\n\r\nsolve()\r\n", "hh, mm = map(int, input().split())\r\nh, d, c, n = map(int, input().split())\r\nx = (h + n - 1) // n * c\r\ny = (h + d * max(0, 20 * 60 - (hh * 60 + mm)) + n - 1) // n * c * 0.8\r\nprint(min(x, y))", "from math import *\r\nchour,cmin = map(int,input().strip().split())\r\n\r\nh,d,c,n = map(int,input().strip().split())\r\n\r\nprice1 = 100000000\r\nprice2 = 100000000\r\nif chour < 20:\r\n t1 = chour+1\r\n t2 = (20 - t1)*60\r\n diff = t2 + (60 - cmin)\r\n bunneed = h + (diff * d)\r\n price1 = (ceil(bunneed/n) * c) - (ceil(bunneed/n) * c * .20)\r\n\r\n bunneed = ceil(h/n)\r\n price2 = ((bunneed)*c )\r\n if price1 < price2:\r\n price1 = \"{0:.6f}\".format(price1)\r\n print(price1)\r\n else:\r\n price2 = \"{0:.6f}\".format(price2)\r\n print(price2)\r\n\r\nelse:\r\n bunneed = ceil(h/n)\r\n price2 = (bunneed)*c - (bunneed*c*.20)\r\n price2 = \"{0:.6f}\".format(price2)\r\n print(price2)\r\n\r\n", "\nfrom math import ceil\nimport datetime\n\ntime = [int(i) for i in input().split()]\nh,d,c,n = [int(i) for i in input().split()]\n\ndef subtract(time):\n minutesTwenty = 20*60\n minutes = time[0]*60+time[1]\n return minutesTwenty-minutes\n\ndef cost(h,c,n):\n return ceil(h/n)*c\n\ndef moneyAfter(time,h,d,c,n):\n if subtract(time)<0:\n newh = h\n else:\n newh = subtract(time)*d+h\n\n return (cost(newh,c,n))-(cost(newh,c,n))*0.2\n\ndef moneyBefore(time,h,d,c,n):\n if subtract(time)<0:\n return 999999999999999999999999999999999999999\n return (cost(h,c,n))\n\n\nif moneyBefore(time,h,d,c,n)>moneyAfter(time,h,d,c,n):\n print(moneyAfter(time,h,d,c,n))\nelse:\n print(moneyBefore(time,h,d,c,n))\n", "from math import ceil\n\nhrs, mn = map(int, input().split())\np_time = hrs * 60 + mn\nh, d, c, n = map(float, input().split())\n\nif p_time >= 1200:\n print(ceil(h / n) * 0.80 * c)\nelse:\n cost1 = ceil(h / n) * c\n m_min = 1200 - p_time\n h += d * (m_min)\n cost2 = ceil(h / n) * 0.80 * c\n print(min(cost1, cost2))\n", "from math import ceil\r\nh, m = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n# H - текущий голод, на D единиц увел. голода кота\r\n# C - стоимость одной булочки, утоляет на N единиц голода\r\nif h>=20:\r\n print(0.8*C*ceil(H / N))\r\nelse:\r\n minutes = 20*60 - h*60 - m\r\n no_wait = C*ceil(H / N)\r\n with_wait = 0.8*C*ceil((H + D * minutes) / N)\r\n print(min(with_wait, no_wait))", "from math import ceil\r\nh, m = map(int, input().split())\r\nH, d, c, n = map(float, input().split())\r\nif h >= 20:\r\n print(round(ceil(H / n) * c * 0.8, 3))\r\nelse:\r\n print(round(min(ceil(H / n) * c, ceil(((20 * 60 - h * 60 - m) * d + H) / n) * c * 0.8), 3))\r\n", "import sys\r\nimport math\r\n\r\ndef get_int():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef get_string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\n \r\nFILE=False\r\nif FILE:\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\nhours,minutes=get_string().split()\r\nhours=int(hours)\r\nminutes=int(minutes)\r\nh,d,c,n=get_string().split()\r\nh=int(h)\r\nd=int(d)\r\nc=int(c)\r\nn=int(n)\r\nwhile(h>0): #cat not fed\r\n if hours>=20: #discount existing\r\n num=math.ceil(h/n) #number of buns\r\n cost=num*c*0.8 #cost with discount\r\n sys.stdout.write(str(cost))\r\n sys.exit()\r\n else:\r\n #buy stuff immediately\r\n num=math.ceil(h/n)\r\n cost_one=num*c\r\n #wait for the discount\r\n wait_minutes=60-minutes+(20-hours-1)*60\r\n h=h+wait_minutes*d\r\n num=math.ceil(h/n)\r\n cost_two=num*c*0.8\r\n cost=min(cost_one,cost_two)\r\n sys.stdout.write(str(cost))\r\n sys.exit()\r\n \r\n \r\n \r\n \r\n \r\n \r\n#for item in answer:\r\n#\tsys.stdout.write(item)\r\n#\tsys.stdout.write('\\n')", "import sys\r\nhh, mm = map(int, input().split())\r\nH, D, C, N = map(float, input().split())\r\nmm += hh*60\r\nsale = 20*60\r\n\r\nif mm >= sale:\r\n C *= 0.8\r\n tmp = H/N\r\n if tmp != int(tmp):\r\n tmp = int(tmp)+1\r\n atTheMoment = tmp*C\r\n print(atTheMoment)\r\n sys.exit()\r\n\r\ntmp = H/N\r\nif tmp != int(tmp):\r\n tmp = int(tmp)+1\r\natTheMoment = tmp*C\r\n\r\nH += (sale - mm)*D\r\n\r\ntmp = H/N\r\nif tmp != int(tmp):\r\n tmp = int(tmp)+1\r\nafterSale = tmp*(C*0.8)\r\n\r\n\r\nprint(atTheMoment) if atTheMoment < afterSale else print(afterSale)\r\n", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nif hh >= 20:\r\n print((H + N - 1) // N * 0.8 * C)\r\nelse:\r\n v1 = (H + N - 1) // N * C\r\n d = (20 - hh - 1) * 60 + 60 - mm\r\n v2 = (H + d * D + N - 1) // N * 0.8 * C\r\n print(min(v1, v2))", "tim = [int(x) for x in input().split()]\n\nhh = tim[0]\nmm = tim[1]\n\nn = [int(x) for x in input().split()]\n\nH = n[0]\nD = n[1]\nC = n[2]\nN = n[3]\n\n\n# print(hh,\":\", mm)\n# print(H, D, C, N)\ntime = hh * 60 + mm\ndisTime = 20 * 60\n\nh0 = H\nbuns0 = 0\nif time > disTime:\n while h0 > 0:\n buns0 += 1\n h0 -= N\n value0 = round(((C * buns0) * .8), 4)\n print(value0)\n exit()\n\nelif time < disTime:\n catHunger = H + (D * (disTime - time))\n h1 = catHunger\n # print(\"h1 = \", h1)\n buns1 = 0\n while h1 > 0:\n buns1 += 1\n h1 -= N\n\n # print(\"BUNS\", buns1)\n value1 = round(((C * buns1) * .8), 4)\n\n h2 = H\n buns2 = 0\n while h2 > 0:\n buns2 += 1\n h2 -= N\n\n value2 = round((C * buns2), 4)\n\nprint(min(value1, value2))\n", "hh, mm = [int(v) for v in input().split()]\r\nH, D, C, N = [int(v) for v in input().split()]\r\n\r\ndef dvru(a, b):\r\n return (a + b - 1) // b\r\n\r\nif hh >= 20:\r\n print(dvru(H, N) * (C * 0.8))\r\nelse:\r\n c1 = dvru(H, N) * C\r\n t = (20 - hh - 1) * 60 + (60 - mm)\r\n c2 = dvru(H + t * D, N) * (C * 0.8)\r\n print(min(c1, c2))\r\n", "from math import ceil\r\nh, m = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nif h >= 20:\r\n print(ceil(H / N) * C * 0.8)\r\nelse:\r\n h = 20 - (h + 1)\r\n m = 60 - m + h * 60\r\n print(min(round(ceil(H / N) * C, 4), round(ceil((H + m * D) / N) * C * 0.8, 4)))", "R=lambda:map(int,input().split())\nh,m=R()\nH,D,C,N=R()\nH+=N-1\nprint(min(H//N*C,(H+max(0,(20-h)*60-m)*D)//N*C*.8))", "l,k=list(map(int,input().split()))\r\nh,d,c,n=list(map(int,input().split()))\r\nif l<20:\r\n na=(20-l)*60\r\n la=na-k\r\n man=la*d\r\n sa=man+h\r\n ta=sa//n\r\n if sa/n==ta:\r\n ga=c*ta\r\n else:\r\n ga=c*(ta+1)\r\nelif l>=20:\r\n ta=h//n\r\n if h/n==ta:\r\n ga=c*ta\r\n else:\r\n ga=c*(ta+1)\r\nlop=h//n\r\nif lop==h/n:\r\n kj=c*(lop)\r\nelse:\r\n kj=c*(lop+1)\r\nprint(min(kj,(80/100)*ga))", "import math\r\narr=list(map(str,input().strip().split(' ')))\r\nn=int(arr[0])\r\nt=int(arr[1])\r\n\r\nh,d,c,nn= (map(int,input().strip().split(' ')))\r\nif(n>=20):\r\n price=.8*c*math.ceil(h*1.0/nn*1.0)\r\n print(price)\r\nelse:\r\n hunger = (20*60-n*60-t)*d+h\r\n # print(hunger,(20*60-n*60-t)*d,h,n)\r\n price=min(.8*c*math.ceil(hunger*1.0/nn*1.0),math.ceil(h*1.0/nn*1.0)*c)\r\n print(price)\r\n", "hh, mm = map(int, input().split())\r\nh, d, c, n = map(int, input().split())\r\nt = hh * 60 + mm - 20 * 60\r\ntm = h / n\r\nif h / n != h // n:\r\n tm += 1\r\n tm = int(tm)\r\ntm1 = (abs(t) * d + h) / n\r\nif tm1 != int(tm1):\r\n tm1 += 1\r\n tm1 = int(tm1)\r\nif t >= 0:\r\n print(tm * c * 0.8)\r\nelse:\r\n print(min(tm * c, tm1 * c * 0.8))", "x,y = map(int,input().split())\r\nh,d,c,n = map(int,input().split())\r\nt= 60*(19-x)+60-y\r\nimport math\r\na = ((h+(t*d))/n)\r\nw= h/n\r\nl = math.ceil(a)\r\nu = math.ceil(w)\r\nif x<20:\r\n c1 = (l*c)*0.8\r\n c2 = (u)*c\r\nelse:\r\n c1 = (u * c) * 0.8\r\n c2 = u * c\r\nz =(min(c1,c2))\r\np = format(z,\".4f\")\r\nprint(p)", "from math import ceil\r\nh, m = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nif h >= 20:\r\n print(0.8 * C * ceil(H / N))\r\nelse:\r\n minutes = 20 * 60 - h * 60 - m\r\n no_wait = C * ceil(H / N)\r\n with_wait = 0.8 * C * ceil((H + D * minutes) / N)\r\n print(min(with_wait, no_wait))\r\n", "hh, mm = map(int, input().split())\nh, d, c, n = map(int, input().split())\n\n\nans = 1e10\nfor m in range(hh * 60 + mm, 1440):\n if 1200 <= m:\n k = 0.8\n else:\n k = 1.0\n tmp = (h + (m - hh * 60 - mm) * d + n - 1) // n * c * k\n ans = min(ans, tmp)\nprint(ans)\n", "import math\r\n\r\n\r\ndef minutes_until_20_oclock(hour, minute):\r\n \"\"\"\r\n :param hour: hour of current time\r\n :param minute: minute of current time\r\n :return: number of minutes till 20 o'clock\r\n \"\"\"\r\n total_minutes = 0\r\n\r\n if minute != 0:\r\n total_minutes += (60 - minute)\r\n hour = (hour + 1) % 24\r\n\r\n hours_remaining_to_20 = 20 - hour if hour < 20 else 24 - (hour - 20)\r\n total_minutes += hours_remaining_to_20 * 60\r\n\r\n return total_minutes\r\n\r\n\r\nhour, minute = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n\r\ndiscount_if_spend_now = 0.8 if 20 <= hour < 24 else 1\r\nspent_money_now = math.ceil(H / N) * C * discount_if_spend_now\r\nspent_money_8_oclock = math.ceil((minutes_until_20_oclock(hour, minute) * D + H) / N) * C * 0.8\r\n\r\nanswer = min(spent_money_now, spent_money_8_oclock)\r\n\r\nprint(\"%.4f\" % answer)\r\n\r\n\r\n", "import math\r\nh, m = [int(x) for x in input().split()]\r\nH, D, C, N = [int(x) for x in input().split()]\r\nstart = math.ceil(H/N)*C\r\nif h>=20:\r\n stop = math.ceil(H/N)*C*0.8\r\nelse:\r\n stop = math.ceil((H+(20*60 - (h*60+m))*D)/N)*C*0.8\r\nprint(min(start, stop))", "import math\r\n\r\nhh,mm=map(int,input().split())\r\n\r\nh,d,c,n=map(int,input().split())\r\nif hh<20:\r\n if mm!=0:\r\n mm=60-mm\r\n hh+=1\r\n mm = (mm + (20 - hh) * 60) * d\r\nelse: mm=0\r\n\r\n#print(mm)\r\na=math.ceil(h/n)*c\r\n#print(a)\r\nb=(math.ceil((h+mm)/n)*c)\r\nb-=b*0.2\r\nif a<b: print(\"%.4f\"%a)\r\nelse: print(\"%.4f\"%b)", "from math import *\r\nhh,mm=map(int,input().split())\r\nmm+=hh*60\r\nhunger,inc,cost,dec=map(int,input().split())\r\nif mm>=1200:\r\n print(ceil(hunger/dec)*cost*0.8)\r\nelse:\r\n a,b=ceil((hunger+(1200-mm)*inc)/dec)*cost*0.8,ceil(hunger/dec)*cost\r\n print(min(a,b))", "hh, mm = map(int, input().split())\r\nH,D,C,N = map(int, input().split())\r\n\r\ndef ceildiv(a, b):\r\n return -(-a // b)\r\n \r\nleft = max(20*60 - hh*60-mm,0)\r\nB = ceildiv(H + D*left,N)*C*0.8\r\nC = ceildiv(H,N)*C*1.0\r\nprint(min(B,C))", "import math\r\n\r\ntime = input()\r\ntime = list(map(int, time.split()))\r\nhh, mm = time[0], time[1]\r\npar = input()\r\npar = list(map(int, par.split()))\r\nH, D, C, N = par[0], par[1], par[2], par[3]\r\n\r\nif hh >= 20 and hh < 24:\r\n res = math.ceil(H / N) * C * 0.8\r\nelse:\r\n res1 = math.ceil(H / N) * C\r\n wait = (19 - hh) * 60 + (60 - mm)\r\n res2 = math.ceil((H + wait * D) / N) * C * 0.8\r\n res = min(res1, res2)\r\nprint(res)", "from math import ceil\r\nh,m = map(int,input().split())\r\nif h>= 20:\r\n a = list(map(int,input().split()))\r\n a[2] *= 0.8\r\n print(ceil(a[0]/a[3])*a[2])\r\n \r\nelse:\r\n a = list(map(int,input().split()))\r\n x = 1200 - (60*h + m)\r\n y = ceil(a[0]/a[3])*a[2]\r\n a[0] += (x*a[1])\r\n a[2] *= 0.8\r\n z = ceil(a[0]/a[3])*a[2]\r\n if y < z :\r\n z = y\r\n \r\n print('%.4f'%z)\r\n \r\n ", "import math\n\n\ndef sol(hh, mm, H, D, C, N):\n current = hh * 60 + mm\n discount_time = 20 * 60\n if discount_time <= current < 24 * 60:\n return math.ceil(H / N) * 0.8 * C\n\n time_remaining = (discount_time - current) % (24 * 60)\n return min(math.ceil(H / N) * C, math.ceil((H + D * time_remaining) / N) * 0.8 * C)\n\n\nhh, mm = list(map(int, input().split()))\nH, D, C, N = list(map(int, input().split()))\nprint(sol(hh, mm, H, D, C, N))\n", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\ntime = hh * 60 + mm\r\nif time >= 20 * 60:\r\n print((H + N - 1) // N * C * 0.8)\r\nelse:\r\n print(min((H + N - 1) // N * C, (N - 1 + (20 * 60 - time) * D + H) // N * C * 0.8))", "R = lambda: map(int, input().split())\r\nh, m = R()\r\nl, d, c, n = R()\r\nprint(min(((l+n-1)//n)*c, (((l+n-1+max(0, d*((20-h)*60-m)))//n)*c*.8)))\r\n", "h,m = map(int,input().split())\r\nh1,d,c,n = map(int,input().split())\r\nif(h>=20):\r\n if(h1%n==0):\r\n k = h1//n\r\n else:\r\n k = h1//n+1\r\n print(k*c-0.20000*(k*c))\r\nelse:\r\n if(h1%n==0):\r\n k = h1//n\r\n else:\r\n k = h1//n+1\r\n l = k*c\r\n p = 60-m\r\n s = 19-h\r\n tot = 60*s+p\r\n h1 = h1+d*tot\r\n if(h1%n==0):\r\n k = h1//n\r\n else:\r\n k = h1//n+1\r\n z = k*c-0.20000*(k*c)\r\n print('{:.5f}'.format(min(z,l)))\r\n", "import os\r\n\r\nimport math\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\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 s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n h, m = invr()\r\n H, D, C, N = invr()\r\n curr_time = h * 60 + m\r\n curr_cost = math.ceil(H / N) * C\r\n later_cost = curr_cost\r\n if curr_time <= 1200:\r\n H += (1200 - curr_time) * D\r\n later_cost = math.ceil(H / N) * C\r\n later_cost *= 0.8\r\n else:\r\n curr_cost *= 0.8\r\n later_cost = curr_cost\r\n print(min(curr_cost, later_cost))\r\n", "hh, mm = map(int,input().split())\r\nh,d,c,n = map(int,input().split())\r\nif hh>=20:\r\n print((0.8*c)*abs(-h//n))\r\nelse:\r\n go_now_cost = c*abs(-h//n)\r\n wait_time = (20-hh)*60 - mm\r\n new_h = h + (wait_time * d)\r\n go_20_cost = ((0.8*c)*abs(-new_h//n))\r\n print(min(go_now_cost,go_20_cost))", "hh, mm = input().split(' ')\r\nH, D, C, N = map(int, input().split())\r\n\r\nhh = int(hh); mm = int(mm)\r\n\r\ndef calcMins():\r\n h = 20 - hh; m = 60 - mm;\r\n minsToEven = 0\r\n if m > 0:\r\n minsToEven = ((h-1)*60)+m;\r\n else:\r\n minsToEven = h*60;\r\n return minsToEven;\r\n\r\ndef ordinaryCalc():\r\n buns = 0\r\n if (H % N) != 0:\r\n buns = ((H // N) + 1)\r\n else:\r\n buns = (H // N)\r\n return buns;\r\n\r\ndef toEveningCalc(minsToEven):\r\n buns = 0\r\n if (((minsToEven * D) + H)) % N != 0:\r\n buns = ((((minsToEven * D) + H) // N) + 1)\r\n else:\r\n buns = (((minsToEven * D) + H) // N)\r\n return buns;\r\n\r\nif hh >= 20 and (hh <= 23 and mm <= 59):\r\n buns = ordinaryCalc()\r\n calc = buns * C\r\n ans = calc - ((calc * 20)/100)\r\n print('%.3f'% ans)\r\nelse:\r\n minsToEven = calcMins()\r\n calc1 = toEveningCalc(minsToEven) * C\r\n ans1 = calc1 - ((calc1 * 20)/100)\r\n ans2 = ordinaryCalc() * C\r\n print('%.3f' % min(ans1,ans2))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "r=lambda:map(int,input().split())\r\nh,m=r()\r\ny,d,c,n=r()\r\ny+=n-1\r\nprint(min(y//n*c,(y+max(0,1200-h*60-m)*d)//n*c*.8))", "from math import ceil\ndef compute_minutes(start_hh,start_mm):\n end_hh = 20\n end_mm = 0\n is_future = False\n if start_hh > end_hh or (start_hh == end_hh and start_mm > end_mm):\n is_future = True\n\n if start_mm:\n end_hh -= 1\n end_mm +=60\n sub_m = end_mm - start_mm\n sub_h = abs(end_hh - start_hh)\n if is_future:\n return (sub_h+24)*60+sub_m, is_future\n return [sub_h*60+sub_m, is_future]\n\ndef compute_hanger_now(is_future,h,c,n):\n number = ceil(h/n)\n if is_future:\n return number*c - number*c*20/100\n return number*c\ndef compute_hanger_then(m,h,d,c,n):\n if m:\n h += d*m\n number = ceil(h/n)\n return number*c - number*c*20/100\n\ndef solve(hh,mm,h,d,c,n):\n minutes,is_future = compute_minutes(hh,mm)\n hanger_now = compute_hanger_now(is_future,h,c,n)\n hanger_then = compute_hanger_then(minutes,h,d,c,n)\n if is_future:\n round(hanger_now,4)\n return round(min(hanger_now,hanger_then),4)\ndef main():\n # n = int(input())\n a = list(map(int, input().split(\" \")))\n b = list(map(int, input().split(\" \")))\n print(solve(*a,*b))\n\nmain()", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(hh, mm, H, D, C, N):\r\n T = 60*int(hh)+int(mm)\r\n T1 = T \r\n T2 = 20*60\r\n answer = float('inf')\r\n for T3 in [T1, T2]:\r\n if T3 >= 20*60:\r\n C3 = 0.8*C \r\n else:\r\n C3 = C \r\n if T3 >= T:\r\n H3 = (T3-T)*D+H \r\n if H3 % N==0:\r\n Need = H3//N\r\n else:\r\n Need = H3//N+1 \r\n entry = Need*C3 \r\n answer = min(answer, entry)\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nhh, mm = input().decode().strip().split()\r\nH, D, C, N = [int(x) for x in input().split()]\r\nprocess(hh, mm, H, D, C, N)", "h,m = map(int,input().split())\r\nhu,d,c,n = map(int,input().split())\r\nif h >= 20:\r\n if hu % n != 0:\r\n hu = hu + n-hu%n\r\n print((hu*4*c)/(5*n))\r\nelse:\r\n lhu = hu\r\n p = float('inf')\r\n if hu % n != 0:\r\n hu = hu + n-hu%n\r\n p = min(p,hu*c/n)\r\n #print(p)\r\n hu = lhu+((19-h)*60+(60-m))*d\r\n if hu % n != 0:\r\n hu = hu + n-hu%n\r\n p = min(p,(hu*c*4)/(5*n))\r\n print(p)\r\n", "hh, mm = map(int, input().split())\r\nh, d, c, n = map(int, input().split())\r\n\r\nif hh < 20:\r\n s1 = ((h - 1) // n + 1) * c\r\n s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8\r\n ans = min(s1, s2)\r\nelse:\r\n ans = ((h - 1) // n + 1) * c * 0.8\r\nprint(ans)\r\n ", "hh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nhh=hh*60+mm\r\nmm=max(20*60,hh)\r\nprint(min(c*((h+n-1)//n),c*0.8*(((mm-hh)*d+h+n-1)//n)))\r\n", "import os, sys\r\nfrom math import ceil\r\nceil1 = lambda a, b: (a + b - 1) // b\r\n\r\nhh,mm = list(map(int,input().split()))\r\nh,d,c,n = list(map(int,input().split()))\r\ncur_tim = hh*60+mm\r\ndiff = 0 if 20*60<=cur_tim else (20*60-cur_tim)%1440\r\nprint(f'{min(ceil1(h + diff * d, n) * .8 * c, c * ceil1(h, n)):.3f}')", "stroka1=input()\r\nstroka2=input()\r\ncount=0\r\nhours=int(stroka1[0]+stroka1[1])\r\nminuts=int(stroka1[3]+stroka1[4])\r\nH=stroka2[0]\r\nD=''\r\nC=''\r\nN=''\r\nfor i in range(1,len(stroka2)):\r\n if stroka2[i]==' ':\r\n count+=1\r\n elif count==0:\r\n H+=stroka2[i]\r\n elif count==1:\r\n D+=stroka2[i]\r\n elif count==2:\r\n C+=stroka2[i]\r\n else:\r\n N+=stroka2[i]\r\nH=int(H)\r\nD=int(D)\r\nC=float(C)\r\nN=int(N)\r\nanswer=0\r\nif hours>=20:\r\n while H>0:\r\n answer+=C*0.8\r\n H-=N\r\nelse:\r\n minuts=(20-hours)*60-minuts\r\n answer1=0\r\n answer2=0\r\n H1=H\r\n while H1>0:\r\n answer1+=C\r\n H1-=N\r\n H+=D*minuts\r\n while H>0:\r\n answer2+=C*0.8\r\n H-=N\r\n if answer1>answer2:\r\n answer=answer2\r\n else:\r\n answer=answer1\r\nprint(answer)\r\n \r\n", "import math\n\ndef main():\n hh,mm = [int(x) for x in input().split()]\n t = hh*60+mm\n H,D,C,N = [int(x) for x in input().split()]\n if t>20*60:\n print(math.ceil(H/N)*C*0.8)\n else:\n c1 = math.ceil(H/N)*C\n dt = 20*60-t\n c2 = math.ceil((H+D*dt)/N) * C * 0.8\n print(min(c1,c2))\n\nif __name__ == \"__main__\":\n main()\n", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nif hh>=20:\r\n ans=(1+(H-1)//N)*0.8*C\r\nelse:\r\n ans=min((1+(H-1)//N)*C, (1+(((20-hh)*60-mm)*D+H-1)//N)*0.8*C)\r\nprint(ans)", "import math\n\n[hh, mm] = [int(x) for x in input().split()]\n[cur_hunger, hunger_increase, cost_per_bun, hunger_decrese] =\\\n [int(x) for x in input().split()]\n\ntime_to_discount = 0 if hh >= 20 else (20 - hh) * 60 - mm\ndiscounted_price = cost_per_bun * 0.8\n\ncost_now = cost_per_bun * math.ceil(cur_hunger / hunger_decrese)\ncost_after_discount = discounted_price * math.ceil((cur_hunger + time_to_discount * hunger_increase) / hunger_decrese)\nprint(\"%.4f\" % min(cost_now, cost_after_discount))\n\n \t \t\t \t \t\t\t\t \t\t \t\t \t \t\t \t", "I = lambda: map(int, input().split())\r\n\r\nhh, mm = I()\r\nH, D, C, N = I()\r\n\r\nprint(min((H+N-1)//N * C, (H+D*max(0,1200-60*hh-mm)+N-1)//N * 0.8*C))", "time = input()\ntimeSplit = time.split(sep = \" \")\nhh = int(timeSplit[0])\nmm = int(timeSplit[1])\n\nvalues = input()\nvaluesSplit = values.split(sep = \" \")\nHN = int(valuesSplit[0])\nHD = int(valuesSplit[0])\nD = int(valuesSplit[1])\nC = int(valuesSplit[2])\nN = int(valuesSplit[3])\n\nspentN = 0\nspentD = 0\n\n#Total spent without discount\nwhile HN > 0:\n spentN += C\n HN -= N\n\n#Total spent with discount\nwhile(hh < 20):\n mm += 1\n HD += D\n if(mm >= 60):\n hh += 1\n mm = 0\n\nwhile(HD > 0):\n spentD += C*0.8\n HD -= N\n\nif(spentN >= spentD):\n print(\"{:.4f}\".format(spentD))\nelse:\n print(\"{:.4f}\".format(spentN))\n\n\t \t\t \t \t \t\t \t\t \t \t\t \t", "from sys import stdin,stdout\r\nimport math\r\n\r\nhours,minutes,hunger,hunger_rate,bun_cost,bun_value = [int(x) for x in stdin.read().split()]\r\n\r\ndef answer(hours,minutes,hunger,hunger_rate,bun_cost,bun_value):\r\n\tm = hhmm_to_m(hours,minutes)\r\n\tminutes_until_8pm = difference(m,20*60)\r\n\tdef priceNow():\r\n\t\treturn buns_required(hunger,bun_value)*bun_cost\r\n\tdef priceLater():\r\n\t\tbc = .8*bun_cost\r\n\t\treturn buns_required((minutes_until_8pm)*(hunger_rate)+hunger,bun_value)*bc\r\n\tif (minutes_until_8pm > 0):\r\n\t\treturn min(priceNow(), priceLater())\r\n\telse:\r\n\t\treturn priceNow()*.8\r\n\r\ndef hhmm_to_m(hh,mm):\r\n\treturn (hh*60 + mm)\r\n\r\ndef difference(startminutes,endminutes):\r\n\treturn endminutes-startminutes\r\n\r\ndef buns_required(hunger,bun_value):\r\n\treturn math.ceil(1.0*hunger/bun_value)\r\n\t\r\ndef formatted_answer(answer_value):\r\n\treturn '{:.4f}'.format(answer_value)\r\n\t\r\nprint(formatted_answer(answer(hours,minutes,hunger,hunger_rate,bun_cost,bun_value)))", "hours, minutes = map(int, input().split())\nh, d, c, n = map(int, input().split())\n\nif 20 <= hours <= 23:\n need_to_buy = h // n\n if need_to_buy * n >= h:\n cost = 0.8 * need_to_buy * c\n print(cost)\n else:\n cost = 0.8 * need_to_buy * c + 0.8 * c\n print(cost)\nelse:\n\n buy_as_soon_as_possible = h // n\n buy_as_soon_as_possible_cost = 0\n if buy_as_soon_as_possible * n >= h:\n buy_as_soon_as_possible_cost = buy_as_soon_as_possible * c\n else:\n buy_as_soon_as_possible_cost = buy_as_soon_as_possible * c + c\n\n diff = 20*60 - (60 * hours + minutes)\n new_hungry = h + diff * d\n buy_awaiting = new_hungry // n\n buy_awaiting_cost = 0\n if buy_awaiting * n >= new_hungry:\n buy_awaiting_cost = buy_awaiting * c * 0.8\n else:\n buy_awaiting_cost = buy_awaiting * c * 0.8 + c * 0.8\n\n print(min(buy_as_soon_as_possible_cost, buy_awaiting_cost))", "from math import ceil\n\nhours, minutes = map(int, input().split(' '))\nH, D, C, N = map(int, input().split(' '))\n\nsale_start = 20 * 60\nsale_end = 23 * 60 + 59\ntime = hours * 60 + minutes\n\nif sale_start <= time <= sale_end:\n print(ceil(H/N)*C*0.8)\nelse:\n go_price = ceil(H/N)*C\n wait_price = ceil((H + D * (sale_start - time)) / N) * C * 0.8\n print(min(go_price, wait_price))", "hh, mm = map(int, input().split())\nH, D, C, N = map(int, input().split())\nvecher = 20 * 60\nif hh * 60 + mm >= vecher:\n cbul = H // N + 1 if H % N != 0 else H // N\n print(cbul * C * 0.8)\nelse:\n slep = vecher - (hh * 60 + mm)\n H2 = H + slep * D\n cbul2 = H2 // N + 1 if H2 % N != 0 else H2 // N\n p2 = cbul2 * C * 0.8\n cbul = H // N + 1 if H % N != 0 else H // N\n p = cbul * C\n print(min(p, p2))", "hh, mm = map(int, input().split())\r\nH,D,C,N=map(int, input().split())\r\n\r\n\r\nif hh<20:\r\n x=H//N\r\n if H%N==0:\r\n prix=x*C\r\n else:\r\n prix=(x+1)*C\r\n H+=(20*60-hh*60-mm)*D\r\n x=H//N\r\n if H%N==0:\r\n prix_=x*C*0.8\r\n else:\r\n prix_=(x+1)*C*0.8\r\n if prix_<prix:prix=prix_\r\n \r\nelse:\r\n x=H//N\r\n if H%N==0:\r\n prix=x*C*0.8\r\n else:\r\n prix=(x+1)*C*0.8\r\nprint(prix)", "import math\r\nhh,mm = [int(x) for x in input().split()]\r\nh,d,c,n = [int(x) for x in input().split()]\r\nif hh>=20:\r\n print(0.8*c*math.ceil(h/n))\r\nelse:\r\n print(min(0.8*c*math.ceil(((((20-hh)*60-mm)*d)+h)/n),c*math.ceil(h/n)))", "from math import *\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\n\r\nmm+=hh*60\r\nif mm<1200:\r\n val1=ceil((h+(1200-mm)*d)/n)*c*0.8\r\n val2=ceil(h/n)*c\r\n print('{:.4f}'.format(min(val1,val2)))\r\nelse:\r\n cost1=ceil(h/n)*c*0.8\r\n print('{:.4f}'.format(cost1))", "hh, mm = map(int, input().split())\nh, d, c, n = map(int, input().split())\n\nif hh >= 20:\n print(c * 0.8 * ((h + n - 1) // n))\nelse:\n t = (20 - 1 - hh) * 60 + 60 - mm\n H = h + t * d\n print(min(c * ((h + n - 1) // n), c * 0.8 * ((H + n - 1) // n)))\n", "import math\n\nif __name__ == '__main__':\n\thh, mm = map( int, input().split() )\n\tH, D, C, N = map( int, input().split() )\n\n\th = (20-hh-1)*60\n\tm = 60-mm\n\tt = h + m if h >= 0 else 0\n\n\tca = math.ceil(H/N)*C\n\tc8 = math.ceil((H+t*D)/N)*C*0.8\n\n\tif ca < c8:\n\t\tprint('{:.4f}'.format(ca))\n\telse:\n\t\tprint('{:.4f}'.format(c8))\n\n", "import math\nr, m = map(int, input().split())\nh, d, c, n = map(int, input().split())\nif r >= 20:\n print(math.ceil(h/n)*c*0.8)\nelse :\n print(min(math.ceil(((20*60 - r*60 - m)*d + h)/n)*c*0.8, math.ceil(h/n)*c))\n", "import math\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nk=math.ceil(h/n)\r\nif(hh>=20) :\r\n print(k*0.8*c)\r\nelse:\r\n ans=k*c\r\n di=20-hh\r\n di*=60\r\n di-=mm\r\n h+=(d*di)\r\n ans=min(ans,math.ceil(h/n)*0.8*c)\r\n print(ans)\r\n\r\n\r\n\r\n", "import math\r\n\r\nhh, mm = map(int , input().split())\r\nH , D , C, N = map(int, input().split())\r\n\r\ntime = hh * 60 + mm\r\n\r\np = time * D\r\n \r\ncost = C * math.ceil(H/N) \r\n\r\nans = 0\r\n\r\nif(hh < 20):\r\n remT = 20 * 60 - time\r\n newH = H + remT * D \r\n nCost = C * math.ceil(newH / N) * 0.8\r\n ans = min(nCost,cost)\r\nelse :\r\n ans = cost * 0.8\r\nprint(ans) ", "import math\r\nh,m=map(int,input().split())\r\nh1,d,c,n=map(int,input().split())\r\nmins=0\r\nif h<20:\r\n\tmins=(19-h)*60+(60-m)\t\r\nnewh=h1+mins*d\r\ncost=math.ceil(h1/n)\r\nnewcost=math.ceil(newh/n)\r\ncost=cost*c\r\nnewcost*=(c-(.2)*c)\r\nprint(min(cost,newcost))", "import math\r\nhh,mm= map(int,input().split())\r\nH,D,C,N=map(int,input().split())\r\nif(hh<20):\r\n i = (math.ceil(((((20-hh-1)*60+(60-mm))*D)+H)/N))*C*0.8\r\n j = (math.ceil(H/N))*C \r\n if(i>j):\r\n print(\"%.4f\" % j)\r\n else:\r\n print(\"%.4f\" % i)\r\nelse:\r\n k = (math.ceil(H/N))*C*0.8\r\n print(\"%.4f\" % k) ", "import math as m\nhh, mm = map(int, input().split())\nH, D, C, N = map(int, input().split())\nif hh >= 20:\n at_current = float(0.8*C * m.ceil(H / N))\n res = at_current\nelse:\n minutes = (20 - hh)*60 + 00 - mm\n at_current = float(C * m.ceil(H / N))\n at_20 = float(m.ceil((H+D*minutes)/N)*(C*0.8))\n res = min(at_current, at_20)\nprint(\"{0:.4f}\".format(res))", "from datetime import timedelta as TD\nimport math\n\ndef discount(h, c):\n if 20 <= h:\n return c * 0.8\n return c\n\nh, m = map(int, input().split(' '))\nH, D, C, N = map(int, input().split(' '))\n\nnow = discount(h, C) * math.ceil(H / N)\nlater = now\nif h < 20:\n sec_until_8 = TD(hours=20) - TD(hours=h, minutes=m)\n hunger = H + D * math.ceil(sec_until_8.seconds / 60)\n later = discount(20, C) * math.ceil(hunger / N)\n\nprint('{:.4f}'.format(min(now, later)))\n\n", "import math\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\np=60-mm\r\nt=abs(20-(hh+1))\r\nz=0\r\nif(hh>=20):\r\n print((math.ceil(h/n)*c)*0.8)\r\n z=1\r\nelse:\r\n t=(t*60)+p\r\n\r\nif(z==0):\r\n pr=math.ceil(h/n)*c\r\n h=h+t*d\r\n pre=math.ceil(h/n)*c*0.8\r\n print(min(pr,pre))", "hh, mm = map(int,input().split())\r\nH, D, C, N = map(int,input().split())\r\nx = (H + N - 1) // N * C\r\ny = 0\r\nif hh < 20:\r\n y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8\r\nelse:\r\n y = (H + N - 1) // N * C * 0.8\r\nprint(min(x,y))\r\n \r\n \r\n", "rd = lambda: map(int, input().split())\nh, m = rd()\nt = h * 60 + m\nh, d, c, n = rd()\nprint(min((h + n - 1) // n * c, (max(0, 1200 - t) * d + h + n - 1) // n * c * .8))\n", "def solution():\r\n hh,mm = map(int,input().split())\r\n H,D,cost,nutr = map(int,input().split())\r\n hh = hh * 60 + mm\r\n if hh >= 1200:\r\n print('{:.6f}'.format((H + nutr - 1) // nutr * cost * 0.8))\r\n else:\r\n print('{:.6f}'.format(min((H + nutr - 1) // nutr * cost, (H + (1200 - hh) * D + nutr - 1) // nutr * cost * 0.8)))\r\nsolution()", "def small(a,b):\r\n return a if a<b else b\r\nimport math\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nif(hh>=20):\r\n print(4*c/5*(math.ceil(h/n)))\r\nelse:\r\n min=60*20-(60*hh+mm)\r\n l=int(h/n) if h%n==0 else int(h/n)+1\r\n r=int((h+min*d)/n) if (h+min*d)%n==0 else int((h+min*d)/n)+1\r\n print(small(c*l,4*c/5*r))", "import sys, copy\r\n\r\ndef convert(h, m):\r\n return 60 * h + m\r\n\r\nhh, mm = map(int, sys.stdin.readline().split())\r\nh, d, c, n = map(int, sys.stdin.readline().split())\r\nnow = convert(hh, mm)\r\ndiff = convert(24, 00) - now\r\nans = 9876543210\r\nfor i in range(diff):\r\n temp_cat = i * d + h\r\n temp_time = now + i\r\n if temp_time >= convert(20, 00):\r\n cost = (temp_cat // n) * (c * 0.8) if temp_cat % n == 0 else ((temp_cat // n) + 1) * (c * 0.8)\r\n else:\r\n cost = (temp_cat // n) * c if temp_cat % n == 0 else ((temp_cat // n) + 1) * c\r\n ans = min(ans, cost)\r\nprint('%f' % ans)\r\n", "th,tm = input().split(\" \")\nh,d,c,n = input().split(\" \")\nth = int(th)\ntm = int(tm)\nh = int(h)\nd = int(d)\nc = int(c)\nn = int(n)\n\nif th < 20:\n toh = 20 - th - 1\n tom = 60 - tm\n tth = d * ((toh*60)+tom)\n \n ht = h + tth\n\n if ht % n == 0:\n htn = ht / n\n else:\n htn = ( ht // n ) + 1\n\n if h % n == 0:\n httn = h / n\n else:\n httn = (h // n) + 1\n cot = c * htn * .8000000000\n \n if cot < c * httn:\n print(\"{0:.4f}\".format(cot))\n else:\n print(\"{0:.4f}\".format(c * httn))\nelif th >= 20:\n if h % n == 0:\n httn = h / n\n else:\n httn = (h // n) + 1\n print(\"{0:.4f}\".format(c * httn * .800000000))\n\n \n\n", "hh, mm = map(int, input().split())\nh, d, c, n = map(int, input().split())\n\nif hh*60+mm >= 20*60:\n ans = ((h+n-1)//n)*(c*0.8)\nelse:\n t = 20*60-(hh*60+mm)\n ans = min(((h+n-1)//n)*c, ((h+d*t+n-1)//n)*(c*0.8))\nprint(ans)\n", "hh, mm = map(int, input().split())\r\n\r\nh, d, c, n = map(int, input().split())\r\n\r\nif hh >= 20:\r\n\tc *= 0.8\r\n\tcost1 = cost2 = (h + n - 1) // n * c\r\nelse:\r\n\tcost1 = (h + n - 1) // n * c\r\n\th += (20 * 60 - hh * 60 - mm) * d\r\n\tc *= 0.8\r\n\tcost2 = (h + n - 1) // n * c\r\n\r\nprint('{:.10f}'.format(min(cost1, cost2)))\r\n", "import math\r\n\r\nhh, mm = input().split()\r\nhh, mm = int(hh), int(mm)\r\n\r\nh, d, c, n = input().split()\r\nh, d, c, n = int(h), int(d), int(c), int(n)\r\n\r\nextra_hunger = max(0, 1200 - hh*60 - mm) * d\r\n\r\nprice_wait = math.ceil((h + extra_hunger) / n) * c * 8 / 10\r\nprice_immediate = math.ceil(h / n) * c\r\n\r\nprint(min(price_wait, price_immediate))", "n,m=map(int,input().split())\r\na,b,c,d=map(int,input().split())\r\nif n>=20 :\r\n p=0\r\nelse :\r\n p=(19-n)*60+60-m\r\nk=a//d\r\nif a%d!=0 :\r\n k+=1\r\nk1=(a+p*b)//d\r\nif (a+p*b)%d!=0 :\r\n k1+=1\r\nprint(min(k*c,k1*0.8*c))\r\n \r\n", "from math import ceil\r\n\r\nh, m = list(map(int, input().split()))\r\nX, Answer = list(map(int, input().split())), 0\r\nDiff = max((20 * 60) - (h * 60 + m), 0)\r\nAfter = ceil((X[0] + Diff * X[1]) / X[-1]) * (X[-2] - X[-2] * .2)\r\nprint(min(After, ceil(X[0] / X[-1]) * X[-2]) if Diff > 0 else After)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnourd\r\n# Caption: Breaking news: Arpa is going to be here.\r\n# CodeNumber: 709\r\n", "hour, minut = map(int, input().split())\r\nh, d, c, n = map(float, input().split())\r\ntime = hour * 60 + minut\r\nind = 0\r\nans = 100000000000000000000000000000000000000000000000000000\r\nwhile time < 24 * 60:\r\n hungr = h + ind * d\r\n if time >= 20 * 60:\r\n price = c * 0.8\r\n if hungr % n == 0:\r\n a = (hungr // n) * price\r\n else:\r\n a = (hungr // n + 1) * price\r\n else:\r\n price = c * 1\r\n if hungr % n == 0:\r\n a = (hungr // n) * price\r\n else:\r\n a = (hungr // n + 1) * price\r\n if a < ans:\r\n ans = a\r\n time += 1\r\n ind += 1\r\nprint(ans)", "import math as ma\r\nfrom sys import exit\r\ndef li():\r\n\treturn list(map(int,input().split()))\r\ndef num():\r\n\treturn map(int,input().split())\r\ndef nu():\r\n\treturn int(input())\r\nhh,mm=num()\r\nh,d,c,n=num()\r\nx=c-.20*c\r\nif(hh<20):\r\n\tv1=ma.ceil(h/n)*c\r\n\thh1=20*60-hh*60-mm\r\n\thh1=h+d*hh1\r\n\tv2=ma.ceil(hh1/n)*x\r\n\tmin=min(v1,v2)\r\n\tprint(min)\r\nelse:\r\n\tv1 = ma.ceil(h / n) * x\r\n\tprint(v1)", "# IAWT\r\nh, m = list(map(int, input().split()))\r\nH, D, C, N = list(map(int, input().split()))\r\n\r\npsd = h * 60 + m\r\nif psd >= 20 * 60:\r\n if H % N == 0: needed = H // N\r\n else: needed = H // N + 1\r\n print(needed * C * .8)\r\nelse:\r\n if H % N == 0: a = H // N * C\r\n else: a = (H // N + 1) * C\r\n x = ((20 * 60 - psd) * D + H)\r\n if x % N == 0: b = x // N * C * .8\r\n else: b = (x // N + 1) * C * .8\r\n print(min(a, b))\r\n\r\n", "import math\nhh,mm=list(map(int,input().split()))\nh,d,c,n=list(map(int,input().split()))\n\ndc=c-0.2*c\nans=0\n\nif(20<=hh and hh<=23):\n\tans=dc*math.ceil(h/n)\nelse:\n\tans1=c*math.ceil(h/n)\n\n\tans2=dc*math.ceil( ( (h + d * ( (20-hh) * 60 - mm ) ) / n) )\n\tans=min(ans1,ans2)\n\nprint (ans)", "import math\n\nhh, mm = [int(x) for x in input().split()]\nH, D, C, N = [int(x) for x in input().split()]\n\nM = 1000000000\ncost1, cost2, cost3 = M, M, M\n\nnbuns = math.ceil(H/N)\ncost1 = nbuns*C\n\ndisc_time = 20*60\nclose_time = 23*60 + 59\nwoke_time = hh*60 + mm\n\nif woke_time < disc_time:\n wait_time = disc_time - woke_time\n HH = H + D*wait_time\n nbuns = math.ceil(HH/N)\n cost2 = nbuns*C*0.8\n\nelif (disc_time <= woke_time) and (woke_time <= close_time):\n nbuns = math.ceil(H/N)\n cost3 = nbuns*C*0.8\n\ncost = min(cost1,cost2,cost3)\nprint('{:.4f}'.format(cost))\n", "h, m = map(int, input().split())\r\na, d, cost, val = map(int, input().split())\r\nx = 20 * 60\r\ntim = h*60 + m\r\nans = (a+val-1)//val * cost\r\nfor i in range(123456):\r\n rem = a - (i*val) + max((x-tim),0)*d\r\n if rem > 0:\r\n ans = min(ans, i*cost + (rem+val-1)//val * 0.8 * cost)\r\n else:\r\n ans = min(ans, i*cost)\r\nprint(\"%.10f\" % ans)", "import math\r\n\r\nhh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n\r\ntime = hh*60 + mm\r\n\r\nif time <= 1200:\r\n\ttime = 1200 - time\r\nelse:\r\n\ttime = 0\r\n\r\nprint(\r\n\tround(\r\n\t\tmin(C*0.8*math.ceil((H+(time*D))/N), C*math.ceil(H/N))\r\n\t\t, 4)\r\n\t)\r\n", "hh,mm = map(int, input().split())\r\nH,D,c,n = map(int, input().split())\r\n \r\nhh = 60*hh + mm\r\n\r\nif hh>=1200:\r\n print('{:.4f}'.format((H+n-1) // n*c*0.8))\r\nelse:\r\n print('{:.4f}'.format(min((H+n-1)//n*c, (H + (1200-hh) * D+n-1) // n*c*0.8)))", "hh, mm = map(int, input().split())\r\nh, d, c, n = map(int, input().split())\r\n\r\n\r\ndef calSum(h,n,c):\r\n to_buy = h//n\r\n if h%n!=0:\r\n to_buy += 1\r\n return to_buy * c\r\n\r\nans_0 = calSum(h,n,c)\r\n# print(ans_0)\r\n\r\ntime_left = 0\r\nif(hh < 20):\r\n time_left = (20 - hh) * 60 - mm\r\nelse:\r\n time_left = 0\r\n\r\nh = h + time_left * d\r\nans_8 = calSum(h,n,c) * 0.8\r\n# print(ans_8)\r\nprint(min(ans_0,ans_8))\r\n\r\n", "import math\r\nhr,m=[int(x) for x in input().split()]\r\nh,d,c,n=[int(x) for x in input().split()]\r\ntotalmin=(hr*60)+m\r\nif(totalmin>=1200):\r\n print((0.8*c)*math.ceil(h/n))\r\n exit()\r\nmina1=c*math.ceil(h/n)\r\nleftmin=1200-totalmin\r\nh+=(leftmin*d)\r\nmina2=(0.8*c)*math.ceil(h/n)\r\nprint(min(mina1,mina2))\r\n", "from math import ceil\r\n\r\nhh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n\r\ntime_now = 60 * hh + mm\r\ntime_sale = 60 * 20\r\n\r\nd_time = time_sale - time_now\r\nc = 0.8 * C\r\n\r\nif d_time <= 0:\r\n print('{:.4f}'.format(ceil(H / N) * c))\r\n\r\nelse:\r\n print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))\r\n", "hh, mm = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\n\r\n\r\ndef buns(h, n):\r\n ans = h // n\r\n #print(f\"fun {h}, {n}, {ans}\")\r\n if h % n != 0:\r\n ans += 1\r\n return ans\r\n\r\nif hh >= 20:\r\n print(0.8 * C * buns(H, N))\r\n exit()\r\n\r\nt = 20 * 60 - hh * 60 - mm\r\n#print('time is', t)\r\nb1 = buns(H, N)\r\nb2 = buns(H + t * D, N)\r\n\r\nc1 = float(C)\r\nc2 = 0.8 * C\r\n#print(b1, b2, c1, c2)\r\nprint(min(b1*c1, b2* c2))\r\n", "h,m=map(int,input().split())\r\nH,D,C,N=map(int,input().split())\r\nrem_m=0\r\nif H%N!=0:\r\n totCost1=(int(H/N)+1)*C\r\nelse:\r\n totCost1=int(H/N)*C\r\nif h<20:\r\n if m>0:\r\n rem_m=(60-m)+((20-(h+1))*60)\r\n else:\r\n rem_m=((20-h)*60)\r\nH+=(D*rem_m)\r\nif H%N!=0:\r\n totCost2=(int(H/N)+1)*(C*0.8)\r\nelse:\r\n totCost2=int(H/N)*(C*0.8)\r\nif totCost1<totCost2:\r\n print (\"%.4f\" %totCost1)\r\nelse:\r\n print (\"%.4f\" %totCost2)", "import math\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nx=60-mm\r\ny=60*(19-hh)\r\np=math.ceil(h/n)\r\nif hh>=20:\r\n\tprint(\"{0:0.4f}\".format(p*c*0.8))\r\nelse:\r\n\tb=h+d*(x+y)\r\n\tbc=math.ceil(b/n)\r\n\tprint(\"{0:0.4f}\".format(min(p*c,0.8*bc*c)))\r\n", "hh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nt=hh*60+mm\r\nt0=1200\r\nif t>=t0:\r\n if h%n==0:k=h//n\r\n else:k=h//n+1\r\n print(0.8*k*c)\r\nelse:\r\n t1=t0-t\r\n if (h+d*t1)%n==0:k=(h+d*t1)//n\r\n else:k=(h+d*t1)//n+1\r\n if h%n==0:j=h//n\r\n else:j=h//n+1\r\n print(min(0.8*k*c,j*c))", "import math\n\nto_min = lambda h, m: h * 60 + m\n\nhh, mm = map(int, input().split())\nh, d, c, n = map(int, input().split())\n\nt = to_min(hh, mm)\ndt = to_min(20, 0)\n\nif t < dt:\n dh = ((dt - t) * d) + h\n dp = math.ceil(dh/n)\n p = math.ceil(h/n)\n print(min(0.8*dp*c, p*c))\nelse:\n print(0.8*c*math.ceil(h/n))\n", "from __future__ import print_function,division\n\nfrom math import ceil\nimport sys\nif sys.version_info < (3, 0):\n input = raw_input\n range = xrange\n\nho,mi = map(int,input().split())\n\nh,d,c,n = map(int,input().split())\n\ntogo = (20-ho)*60 - mi\n\nhungernow = h\nhungerthen = h + togo*d\n\nif togo>0:\n print('%.20f'%min(ceil(hungerthen/n)*(c*0.8), ceil(hungernow/n)*c))\nelse:\n print('%.20f'%(ceil(hungernow/n)*(c*0.8)))\n", "import getpass\r\nimport sys\r\nimport math\r\nfrom decimal import Decimal\r\nimport decimal\r\n\r\nfiles = True\r\ndebug = False\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n debug = True\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\nelif files:\r\n # fname = \"gift\"\r\n # sys.stdin = open(\"%s.in\" % fname)\r\n # sys.stdout = open('%s.out' % fname, 'w')\r\n pass\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef range_sum(a, b):\r\n ass = (((b - a + 1) // 2) * (a + b))\r\n if (a - b) % 2 == 0:\r\n ass += (b - a + 2) // 2\r\n return ass\r\n\r\n\r\ndef comba(n, x):\r\n return (math.factorial(n) // math.factorial(n - x)) // math.factorial(x)\r\n\r\n\r\nh, m = ria()\r\ntime = h * 60 + m\r\nofferTime = max(20 * 60 - time, 0)\r\n\r\nh, d, c, n = ria()\r\nmini = math.ceil(h / n) * c\r\n\r\nh+=offerTime*d\r\n\r\nmini = min(math.ceil(h / n) * c*0.8,mini)\r\nprint(mini)\r\n", "hh,mm = map(int,input().split())\r\n\r\nh,d,c,n = map(int,input().split())\r\n\r\nif(hh>=20):\r\n print(((h+n-1)//n)*c*0.8)\r\nelse:\r\n cur = ((h+n-1)//n)*c\r\n \r\n tr = (((19-hh)*60) +(60-mm))\r\n new = ((h+n-1+tr*d)//n)*c*0.8\r\n #print(new)\r\n print(\"%0.4f\" %min(cur,new))", "from math import ceil\r\nhh,mm = map(int,input().split())\r\nh,d,c,n= map(int,input().split())\r\n\r\nif hh<20:\r\n\tdelta_time = ((20-hh-1)*60)+(60-mm)\r\n\thunger = h + delta_time*d\r\n\tans = ((ceil(hunger/n)*c)*80)/100\r\n\tans1 = (ceil(h/n)*c)\r\n\tprint( min(ans,ans1) )\r\nelse:\r\n\tans = ((ceil(h/n)*c)*80)/100\r\n\tprint(ans)", "hh, mm = [int(x) for x in input().split()]\nH, D, C, N = [int(x) for x in input().split()]\n\nres = (H + N - 1) // N * (C if hh < 20 else C * 0.8)\nif hh < 20:\n minutes = (20 - hh) * 60 - mm\n x = H + minutes * D\n res = min(res, (x + N - 1) // N * (C * 0.8))\nprint(\"{:.8f}\".format(float(res)))\n", "from math import ceil\r\nhh,mm=map(int,input().split())\r\nh,d,c,n=map(int,input().split())\r\nmins=0\r\nif hh<20:\r\n mins=(60*(19-hh)+(60-mm))\r\nnew_h=h+mins*d\r\nprint(min((ceil(h/n))*c,ceil(new_h/n)*c*0.8))", "def div(a, b):\n return a // b + int(a % b != 0)\n\nhh, mm = map(int, input().split())\nh, d, c, n = map(int, input().split())\nwait = 0\nif hh < 20:\n wait = 60 * (20 - hh - 1) + 60 - mm\nprint(0.2 * min(div(h, n) * c * 5, div(wait * d + h, n) * c * 4))\n", "# A. Feed the cat\r\nimport math\r\nhh,mm = map(int,input().split())\r\nh,d,c,n = map(int,input().split())\r\nt=60*hh+mm\r\nx1=math.ceil(h/n)*c\r\nx2=math.ceil((h+d*max(1200-t,0))/n)*c*0.8\r\nprint(format(min(x1,x2),\"0.3f\"))", "from math import ceil\r\nhh,mm = map(int,input().split())\r\nh,d,c,n = map(int,input().split())\r\nif(hh>=20):\r\n amount = ceil(h/n)*c\r\n ans= amount-(amount*20/100)\r\n print(ans)\r\nelse:\r\n amount1 = ceil(h / n) * c\r\n h = (((60-mm)+(20-hh-1)*60)*d)+h\r\n amount2 = ceil(h / n) * c\r\n ans = amount2 - (amount2 * 20 / 100)\r\n if(amount1>ans):\r\n print(ans)\r\n else:\r\n print(amount1)", "hh, mm=[int(x) for x in input().split()]\nH, D, C, N=[int(x) for x in input().split()]\nmref=20*60\nmnow=hh*60+mm\nif(mnow >= mref):\n num=int(H/N)\n if(H%N!=0):\n num+=1\n print(num*0.8*C)\nelse:\n hun=H+D*(mref-mnow)\n num=int(hun/N)\n if(hun%N!=0):\n num+=1\n # print(num*0.8*C)\n m1=num*0.8*C\n hun=H\n num=int(hun/N)\n if(hun%N!=0):\n num+=1\n m2=num*C\n print(\"%.4f\"%min(m1, m2))\n\n", "hh, mm = map (int, input ().split ())\r\nH, D, C, N = map (int, input ().split ())\r\nans = (H + N - 1) // N * C\r\nif hh >= 20 : ans *= 0.8\r\nelse : ans = min (ans, (H + ((20 - hh - 1) * 60 + (60 - mm)) * D + N - 1) // N * C * 0.8)\r\nprint (ans)\r\n", "def main():\n h, m = map(int, input().split())\n H, D, C, N = map(int, input().split())\n x = (H + N - 1) // N\n y = (H + D * max((20 - h) * 60 - m, 0) + N - 1) // N\n print(\"%.4f\" % (min(x, y * 0.8) * C))\n\n\nif __name__ == \"__main__\":\n main()\n", "from math import ceil\r\nh,m = map(int,input().split())\r\nH,D,C,N = map(int,input().split())\r\n\r\ndiff = max(0,20*60 - (h*60+m))\r\n\r\nans = min( ceil(H/N)*C, ceil((H+diff*D)/N)*0.8*C )\r\n\r\nprint(ans)\r\n", "import math\r\n\r\nhh, mm = map(int, input().split())\r\nh, d, c, n = map(int, input().split())\r\n\r\nif hh >= 20:\r\n num = math.ceil(h/n)\r\n print(num * c * 0.8)\r\nelse:\r\n num1 = math.ceil(h/n)\r\n cost1 = num1 * c\r\n h1 = ((19 - hh) * 60 + (60 - mm))*d\r\n num2 = math.ceil((h+h1) / n)\r\n cost2 = num2 * c * 0.8\r\n print(min([cost1, cost2]))\r\n\r\n", "h,m=map(int,input().split())\r\nH,D,C,N=map(int,input().split())\r\nop1=0\r\nop2=0;\r\nans=H//N;\r\nif (H%N>0):\r\n ans+=1\r\nop1=ans*C\r\nif(h<20):\r\n mins=60*(20-h-1)\r\n mins+=60-m\r\n H+=D*mins\r\nans=H//N;\r\nif (H%N>0):\r\n ans+=1\r\nop2=ans*C*0.8\r\n \r\nprint(min(op1,op2))", "a,b=map(int,input().split())\r\nt=a*60+b\r\na,b,c,d=map(int,input().split())\r\nmx=1000000000000000000\r\nfor i in range(t,1440):\r\n x=a+(b*(i-t))\r\n if x%d>0.5: x=x//d+1\r\n else: x=x//d\r\n x=x*c\r\n if i>=1200:\r\n x=x*0.8\r\n if x<mx: mx=x\r\nprint(mx)", "x,y=input().split()\r\nh,d,c,n=input().split()\r\nx,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)\r\nif x<=19 and y<=59:\r\n z=20*60-60*x-y\r\n if h%n==0:\r\n a=h/n\r\n else : \r\n a=int(h/n)+1\r\n if (h+d*z)%n==0:\r\n b=(h+d*z)/n\r\n else:\r\n b=int((h+d*z)/n)+1\r\n q=a*c\r\n w=b*c*0.8\r\n if q<w:\r\n print(q)\r\n else :\r\n print(w)\r\nelse :\r\n if h%n==0:\r\n a=h/n\r\n else : \r\n a=int(h/n)+1\r\n print(a*c*0.8) \r\n ", "import math\r\nhh,mm = list(map(int,input().split()))\r\nh,d,c,n = list(map(int,input().split()))\r\nif hh>=20:\r\n print((c*0.8)*(math.ceil(h/n)))\r\nelse:\r\n p = (c*0.8)*(math.ceil(((20*60-hh*60-mm)*d+h)/n))\r\n q = (c)*(math.ceil(h/n))\r\n print(min(p,q))\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nl = n * m\r\nd = {76:0, 82:1, 85:2, 68:3}\r\ndp0 = [[] for _ in range(l)]\r\nfor i in range(n):\r\n si = s[i]\r\n x = [n * m]\r\n for j in range(m):\r\n if si[j] ^ 46:\r\n x.append(i * m + j)\r\n x.append(n * m)\r\n for j in range(1, len(x) - 1):\r\n u = x[j]\r\n dp0[u].append(x[j - 1])\r\n dp0[u].append(x[j + 1])\r\nfor j in range(m):\r\n x = [n * m]\r\n for i in range(n):\r\n if s[i][j] ^ 46:\r\n x.append(i * m + j)\r\n x.append(n * m)\r\n for i in range(1, len(x) - 1):\r\n u = x[i]\r\n dp0[u].append(x[i - 1])\r\n dp0[u].append(x[i + 1])\r\ndp = [[0] * 4 for _ in range(l + 1)]\r\nma, cnt = 0, 0\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if not si[j] ^ 46:\r\n continue\r\n for k in range(l):\r\n dp0k = dp0[k]\r\n if not dp0k:\r\n continue\r\n dpk = dp[k]\r\n for u in range(4):\r\n dpk[u] = dp0k[u]\r\n now = i * m + j\r\n c = 0\r\n while now ^ l:\r\n dpn = dp[now]\r\n for k in range(4):\r\n dp[dpn[k]][k ^ 1] = dpn[k ^ 1]\r\n now = dpn[d[s[now // m][now % m]]]\r\n c += 1\r\n if ma < c:\r\n ma = c\r\n cnt = 0\r\n if ma == c:\r\n cnt += 1\r\nprint(ma, cnt)" ]

[ "alphabet=[0]*27\r\n# print(alphabet)\r\na=int(input())\r\nc=input()\r\n# print(a)\r\nd=False\r\nseta=set()\r\nsetalfabet=set()\r\nfor i in range(len(c)):\r\n b=int(ord(c[i])-ord('a'))\r\n alphabet[b]+=1\r\n setalfabet.add(c[i])\r\nvalue=0\r\nlista=[]\r\nfor i in range(27):\r\n if alphabet[i]%a!=0:\r\n d=True\r\n break\r\n if(alphabet[i]!=0):\r\n\r\n alphabet[i]=int(alphabet[i]/a)\r\n\r\n\r\n\r\n\r\n\r\n# Convert the set to a string without commas and brackets\r\nset_string =''.join(map(str,setalfabet))\r\n# print(set_string)\r\nsetlist = list(seta)\r\n# print(setlist)\r\nif d :\r\n print(-1)\r\n\r\n\r\n\r\nelse:\r\n\r\n stringa=\"\"\r\n\r\n for i in setalfabet:\r\n for j in range(alphabet[int(ord(i)-ord('a'))]):\r\n stringa+=i\r\n\r\n mainstring=\"\"\r\n\r\n for i in range(a):\r\n mainstring+=stringa\r\n\r\n print(mainstring)\r\n\r\n", "n = int(input())\ns = sorted(input())\nt = s[::n]*n\nprint(\"\".join(t) if sorted(t) == s else -1)\n", "d = {}\r\nk = int(input())\r\ns = input()\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\nflag= 1\r\na = \"\"\r\nfor key,value in d.items():\r\n if value%k != 0:\r\n flag = 0\r\n break\r\n else:\r\n a += key*(value//k)\r\nif flag:\r\n print(a*k)\r\nelse:\r\n print(-1)\r\n", "def rearrange(k, s):\r\n n = len(s)\r\n #frequency of character \r\n char_count = [0] * 26\r\n for char in s:\r\n char_count[ord(char) - ord('a')] += 1\r\n for i in range(26):\r\n if char_count[i] % k != 0:\r\n return -1\r\n result = ''\r\n for i in range(26):\r\n result += chr(ord('a') + i) * (char_count[i] // k)\r\n result *= k\r\n return result\r\n#input\r\nk = int(input())\r\ns = input().strip()\r\n\r\nresult = rearrange(k, s)\r\nprint(result)\r\n", "from math import *\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n s = input()\r\n letters = {}\r\n for i in s:\r\n if i not in letters.keys():\r\n letters[i] = 1\r\n else:\r\n letters[i] += 1\r\n F = list(letters.items())\r\n for i in range(len(F)):\r\n if F[i][1] % k != 0:\r\n print(-1)\r\n return\r\n else:\r\n F[i] = (F[i][0], F[i][1]//k)\r\n z = \"\"\r\n for i in range(len(F)):\r\n z += (F[i][0] * F[i][1])\r\n print(z * k)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "'''\n R E X\n\n Date - 20th May 2021\n\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport sys\nimport re\nimport math\nfrom collections import Counter\nMOD = 1000000007\ninp = lambda :map(int,input().split(' '))\nninp = lambda :int(input())\n# sys.stdin=open(\"input.txt\",\"r\")\nn=ninp()\ns=sorted(input())\nres = s[::n]*n;\nprint([-1,''.join(res)][sorted(res)==s])\n\n\n\n\n\n\n\n", "from collections import Counter\r\nk = int(input())\r\nstring = input()\r\ncounts = Counter(string)\r\ndone = False\r\nres = ''\r\nfor char in counts:\r\n if counts[char]%k:\r\n print(-1)\r\n done = True\r\n break\r\n res += char*(counts[char]//k)\r\nif not done: print(res*k)", "\r\ndef make(k, s):\r\n d={}\r\n \r\n for i in s:\r\n d[i] = d.get(i, 0)+1\r\n st=\"\"\r\n # print(d)\r\n # go len of s times\r\n for y in range(len(s)):\r\n # print(\"1-\",i)\r\n \r\n #iterate over the dict values\r\n for i,v in d.items():\r\n if v%k !=0:\r\n return -1\r\n # print(\"bf---------\", i,v)\r\n #iterate k times & add once to the string/ so we get ethe first one\r\n for j in range(k): \r\n if v>=-1: \r\n d[i] -= 1\r\n # print(\"st==\",st)\r\n if v>0: st+=i\r\n # print(\"af\", i,d[i])\r\n return st *k\r\na= int(input())\r\nk = str(input()) \r\nprint(make(a, k))", "k=int(input())\r\ns=input()\r\ndic={}\r\nfor i in s:\r\n if i in dic.keys():\r\n dic[i]=dic[i]+1\r\n else:\r\n dic[i]=1\r\nkeys=list(dic.keys())\r\nvalues=list(dic.values())\r\ncount=0\r\nfor i in dic.values():\r\n if i%k!=0:\r\n count=count+1\r\n print(-1)\r\n break\r\nif count==0:\r\n s=\"\"\r\n for i in keys:\r\n s+=i*(dic[i]//k)\r\n print(s*k)", "k = int(input().strip())\nS = input()\nd = {}\nfor s in S:\n\ttry:\n\t\td[s] += 1\n\texcept:\n\t\td[s] = 1\n\ndone = False\n\nfor x, y in d.items():\n\tif y % k != 0:\n\t\tprint(-1)\n\t\tdone = True\n\t\tbreak\n\no = ''\nif not done:\n\n\tfor x, y in d.items():\n\t\to += str(x)*(y//k)\n\tprint(o*k)\n \t \t\t\t \t \t \t\t \t\t \t\t\t \t\t\t", "k = int(input())\r\nstr = sorted(input())\r\n\r\nx = str[::k] * k \r\nif sorted(x) == str:\r\n print(\"\".join(x))\r\nelse:\r\n print(-1)\r\n", "k = int(input())\r\ns = input()\r\nh = {}\r\nfor c in s:\r\n if c in h:\r\n h[c] += 1\r\n else:\r\n h[c] = 1\r\ncheck = 0\r\nfor i in h.keys():\r\n if h[i] % k == 0:\r\n h[i] = h[i]//k\r\n else:\r\n check = -1\r\n break\r\nif check == -1:\r\n print(-1)\r\nelse:\r\n s = \"\"\r\n for i in h.keys():\r\n s += i*h[i]\r\n print ( s*k )", "import sys\r\nfrom sys import stdin ,stdout\r\nk = int(stdin.readline())\r\ns = input()\r\ns1 = set(s)\r\nres = ''\r\nfor i in s1:\r\n a =s.count(i)\r\n if a%k== 0:\r\n c = True\r\n res += i*(a//k)\r\n else:\r\n c = False\r\n break\r\nif c:\r\n print(res*k)\r\nelse:\r\n print('-1')\r\n", "k=int(input())\r\ns=input()\r\nfreq={}\r\nfor i in s:\r\n if i in freq:\r\n freq[i]+=1\r\n else:\r\n freq[i]=1\r\nans=''\r\nflag=True\r\nfor i in freq:\r\n if freq[i]//k!=freq[i]/k:\r\n flag=False\r\n break\r\n else:\r\n ans+=i*(freq[i]//k)\r\nif flag==False:\r\n print(-1)\r\nelse:\r\n print(ans*k)", "k=int(input())\r\ns=input()\r\nd={}\r\nfor x in s:\r\n if x in d:\r\n d[x]+=1 \r\n else:\r\n d[x]=1\r\nf=\"\"\r\no=0\r\nfor x in d:\r\n z=(d[x])%k\r\n if(z!=0):\r\n o=1\r\n break \r\n else:\r\n f=f+x*(d[x]//k) \r\nif(o==1):\r\n print(-1)\r\nelse:\r\n print(f*k)\r\n \r\n ", "k=int(input())\r\ns=input()\r\nstr=set(s)\r\nnewstr=\"\"\r\nList=list(s)\r\nd={}\r\nfor x in str:\r\n d[x]=List.count(x)\r\nflag=0\r\nfor y in d:\r\n if(d[y]%k!=0):\r\n print(-1)\r\n flag=-1\r\n break\r\nif(flag!=-1):\r\n for z in d:\r\n newstr=newstr+z*int(d[z]/k)\r\n finalstr=k*newstr\r\n print(finalstr)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Dec 30 16:17:42 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nk = int(input())\r\nx = input()\r\ns=[]\r\nfor i in x:\r\n s.append(i)\r\ns = sorted(s)\r\n\r\nif len(s)>1:\r\n a = s[0]\r\n j=1\r\n val = [a]\r\n dif = []\r\n for i in range(1,len(s)):\r\n if s[i]!=a:\r\n dif.append(j)\r\n j=1\r\n a= s[i]\r\n val.append(a)\r\n else:\r\n j+=1\r\n x=0\r\n dif.append(j)\r\n for i in range(len(dif)):\r\n if dif[i]%k!=0:\r\n x=-1\r\n print(x)\r\n break\r\n if x==0:\r\n s1=''\r\n for i in range(len(dif)):\r\n s1+=f'{(dif[i]//k)*val[i]}'\r\n print(k*s1)\r\nelse:\r\n if k==1:\r\n print(s[0])\r\n else:\r\n print(-1)\r\n \r\n \r\n ", "num=int(input())\r\n \r\nstring=input()\r\n \r\nhash_table={}\r\nfor i in range(26):\r\n hash_table[chr(i+97)]=0\r\n \r\nfor i in string:\r\n hash_table[i]+=1\r\n \r\nflag=False\r\nfor i in range(26):\r\n if hash_table[chr(i+97)]%num!=0:\r\n print(-1)\r\n flag=True \r\n break\r\n \r\nif not flag:\r\n for i in range(num):\r\n for j in range(26):\r\n if hash_table[chr(j+97)]!=0:\r\n print((hash_table[chr(j+97)]//num)*chr(j+97),end='')\r\n", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tk = int(input())\r\n\t\ts = input()\r\n\t\td = dict()\r\n\t\tflag = True\r\n\t\tresult = \"\"\r\n\r\n\t\tfor char in s:\r\n\t\t\tif d.get(char) == None:\r\n\t\t\t\td[char] = 1\r\n\t\t\telse:\r\n\t\t\t\td[char] += 1\r\n\r\n\t\tfor count in d.values():\r\n\t\t\tif count % k != 0:\r\n\t\t\t\tflag = False\r\n\t\t\t\tbreak\r\n\r\n\t\tif not flag:\r\n\t\t\tresult = \"-1\"\r\n\t\telse:\r\n\t\t\tfor char, count in d.items():\r\n\t\t\t\tfor i in range(count//k):\r\n\t\t\t\t\tresult += char\r\n\t\t\tresult *= k\r\n\r\n\t\tprint(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n = int(input())\r\nstring = input()\r\nuniques = list(set(string))\r\noutput = []\r\nck = True\r\nfor char in uniques:\r\n cnt = string.count(char)\r\n if cnt%n != 0:\r\n ck = False\r\n break\r\n else:\r\n listt = [char]*(cnt//n)\r\n output.extend(listt)\r\n\r\nif ck:\r\n print(''.join(output * n))\r\nelse:\r\n print(-1)", "\"\"\"\r\nAlready submitted, providing documentation\r\nLogic:\r\n1. take frequency histogram\r\n2. check if all elements' count in the histogram is divisible by k\r\n3. If no , -1 else proceed\r\n4. take st, add frequency/k for each element to the string to find basic string\r\n5. multiply that by k to get final answer\r\n\"\"\"\r\n\r\n\r\nk = int(input())\r\nstring = input()\r\nd = {}\r\nfor i in string:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\ncase = True\r\nfor i in d:\r\n if d[i] / k != d[i] // k:\r\n case = False\r\n\r\nif case:\r\n st = \"\"\r\n for i in d:\r\n st += i * (d[i] // k)\r\n print(st * k)\r\nelse:\r\n print(-1)\r\n", "from collections import Counter\r\nk=int(input())\r\ns=input()\r\nflag=1\r\nf=\"\"\r\ndi=Counter(s)\r\nfor i in di:\r\n if(int(di[i])%k!=0):\r\n print(-1)\r\n flag=0\r\n break\r\n else:\r\n f+=(i*int(di[i]/k))\r\nif flag==1:\r\n print(f*k)\r\n ", "n=int(input())\r\ns=input()\r\nl=[i for i in s]\r\nl.sort()\r\nk=0\r\np=[]\r\nwhile k<len(s):\r\n m=l.count(l[k])\r\n if m%n!=0:\r\n print(-1)\r\n break\r\n p.append([l[k],m//n])\r\n k+=m\r\nelse:\r\n jeez=\"\"\r\n for i in p:\r\n jeez+=i[0]*i[1]\r\n print(jeez*n)", "k = int(input())\r\ns = sorted(input())\r\nns = ''.join(s[::k]*k)\r\nprint((-1,ns)[s == sorted(ns)])", "k = int(input())\r\ncnt = [0] * 26\r\ns = input()\r\nfor x in s:\r\n cnt[ord(x) - ord('a')] += 1\r\nok = True\r\nans = [] \r\nfor i, x in enumerate(cnt):\r\n ok &= x % k == 0\r\n ans.append(chr(i + ord('a')) * (x // k))\r\nif not ok:\r\n print(-1)\r\n quit()\r\nprint(''.join(ans) * k)", "k=int(input())\r\ns=input()\r\nt=\"\"\r\nfor i in set(s):\r\n if s.count(i)%k==0:\r\n t+=i*(s.count(i)//k)\r\n else:\r\n print(-1)\r\n exit()\r\nprint(t*k)", "n= int(input())\r\nl= input()\r\ndict= {}\r\nstr_= \"\"\r\n\r\nfor i in l:\r\n if l.count(i)%n!= 0:\r\n str_= -1\r\n break\r\n elif i not in dict:\r\n dict[i]= l.count(i)\r\n\r\nif str_== -1:\r\n pass\r\nelse:\r\n for k, v in dict.items():\r\n str_+= k*(v//n)\r\n\r\nprint(str_*n if str_!= -1 else -1)", "from collections import Counter\r\nk = int(input())\r\nstring = input()\r\nc = Counter(string)\r\ns = set(string)\r\n# print(c)\r\nans = ''\r\ntemp = ''\r\nfor val in s:\r\n if c[val] % k != 0:\r\n print(-1)\r\n exit()\r\n for j in range(c[val]//k):\r\n temp += val\r\nfor i in range(k):\r\n ans += temp\r\nprint(ans) \r\n# s = s + c[0]\r\n", "n = int(input())\r\nq = {}\r\ns = input()\r\n\r\nfor c in s:\r\n if c not in q:\r\n q[c] = 1\r\n else:\r\n q[c] += 1\r\n\r\nx = \"\"\r\nfor c in q:\r\n if q[c] % n != 0:\r\n print(\"-1\")\r\n quit()\r\n else:\r\n x = x + c * (q[c] // n)\r\nprint(x * n) ", "k = int(input())\r\nchars = [0 for i in range(26)]\r\nfor c in input():\r\n chars[ord(c)-97]+=1\r\n\r\npossible = True\r\nfor c in chars:\r\n if c%k:\r\n possible = False\r\n\r\nif possible:\r\n ans = \"\"\r\n for i in range(26):\r\n ans += chr(i+97)*(chars[i]//k)\r\n ans *= k\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "leng=int(input())\r\nlst=input()\r\nnew_l=len(lst)\r\nq=0\r\nbs=\"\".join(sorted(lst))\r\nfor i in range(len(bs)):\r\n if(i%leng==0):\r\n x=bs[i]\r\n if(bs[i]==x):\r\n q+=1\r\nif(new_l==q and q%leng==0):\r\n for i in range(0,leng):\r\n for j in range(0,len(bs),leng):\r\n print(bs[j],end=\"\")\r\nelse:\r\n print(-1)", "from collections import defaultdict\r\nn = int(input())\r\na = input()\r\n\r\nd = defaultdict(int)\r\nfor c in a:\r\n d[c] = d[c] + 1 \r\n\r\nfor key in d:\r\n if d[key] % n != 0:\r\n print(-1)\r\n exit(0)\r\ns = ''\r\nfor key in d:\r\n s = s + key * (d[key]//n)\r\ns = s*n \r\nprint(s)\r\n", "k = int(input())\nstr = input()\na = \"abcdefghijklmnopqrstuvwxyz\"\nb = []\nf = 1\nfor i in range(0, 26):\n b.append(str.count(a[i]))\n if b[i] % k != 0:\n f = 0\n break\nif f == 1 and len(str) % k == 0:\n for j in range(0, k):\n for i in range(0, 26):\n print(a[i] * (int(b[i] / k)),end='')\nelse:\n print(\"-1\",end='')\n\t \t\t\t \t\t\t\t\t \t \t\t \t \t \t", "from collections import Counter\r\nk = int(input())\r\nstring = input()\r\n\r\nletters = Counter(string)\r\nans = [\"\" for x in range(k)]\r\n\r\nright = True\r\n\r\nfor x in letters:\r\n if letters[x]%k != 0:\r\n right = False\r\n break\r\n mul = letters[x]//k\r\n for i in range(k):\r\n ans[i] += x * mul\r\n\r\nif not right:\r\n print(-1)\r\nelse:\r\n print(\"\".join(ans))", "S = sorted\r\ni = int(input())\r\ns = S(input())\r\nx = s[::i]*i\r\nprint([-1, \"\".join(x)][S(x) == s])\r\n", "def rearrange(m, string):\r\n length = len(string)\r\n char_count = [0] * 26\r\n for char in string:\r\n char_count[ord(char) - ord('a')] += 1\r\n for i in range(26):\r\n if char_count[i] % m != 0:\r\n return -1\r\n r = ''\r\n for i in range(26):\r\n r += chr(ord('a') + i) * (char_count[i] // m)\r\n r *= m\r\n return r\r\nm = int(input())\r\nstring = input().strip()\r\n \r\nr = rearrange(m, string)\r\nprint(r)", "n=int(input())\r\nstring=input()\r\nk=int(n)\r\nstring=sorted(string)\r\n# print(string)\r\nans=string[::k]*k\r\n# print(ans)\r\nif sorted(ans)==string:\r\n\tprint(\"\".join(ans))\r\nelse:\r\n\tprint(-1)", "k = int(input())\r\ns = input()\r\ndic = {}\r\nfor i in s:\r\n dic[i] = dic.get(i, 0) + 1\r\nns = \"\"\r\nflag = 0\r\nfor i in dic:\r\n if dic[i] % k:\r\n flag = 1\r\n break\r\n ns += i * (dic[i] // k)\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(ns * k)", "from collections import Counter\r\n\r\n\r\ndef solve(k, s):\r\n c = Counter(s)\r\n a = ''\r\n for [key, value] in c.items():\r\n if value % k: return -1\r\n a += key * (value // k)\r\n return a * k\r\n\r\n\r\nprint(solve(int(input()), input()))\r\n", "k = int(input(\"\"))\r\nstr = input(\"\")\r\n\r\n\r\ndef khstring(str, k):\r\n count = [0]*26\r\n for i in range(len(str)):\r\n count[ord(str[i])-ord(\"a\")] += 1\r\n for i in range(len(str)):\r\n if(count[ord(str[i])-ord(\"a\")] % k != 0):\r\n return -1\r\n break\r\n # print(count)\r\n lst = []\r\n for i in range(len(count)):\r\n if(count[i] != 0):\r\n lst.append([i, count[i]/k])\r\n # print(lst)\r\n basic = \"\"\r\n for i in range(len(lst)):\r\n basic += chr(ord(\"a\")+lst[i][0])*int(lst[i][1])\r\n\r\n return (basic*k)\r\n\r\n\r\nprint(khstring(str, k))\r\n", "n = int(input())\r\n\r\nd_c = {}\r\ns = input()\r\n\r\nfor c in s:\r\n if c not in d_c:\r\n d_c[c] = 1\r\n else:\r\n d_c[c] += 1\r\n\r\n\r\nans = \"\"\r\nfor c in d_c:\r\n if d_c[c] % n != 0:\r\n print(\"-1\")\r\n quit()\r\n else:\r\n ans = ans + c * (d_c[c] // n)\r\n \r\nprint(ans * n) ", "import sys\r\nk = int(input())\r\ns = input()\r\n\r\ncount = {}\r\nfor i in s:\r\n if i in count:\r\n count[i] += 1\r\n else:\r\n count[i] = 1\r\n\r\nbuild = \"\"\r\nfor letter in count:\r\n if count[letter] % k != 0:\r\n print(-1)\r\n sys.exit()\r\n else:\r\n build += letter*(int(count[letter] / k))\r\n\r\nprint(build*k)\r\n", "k = int(input())\r\n\r\nstring = [i for i in input()]\r\n\r\nelements = set(string)\r\n\r\nflag = False\r\noutput = ''\r\n\r\nfor i in elements:\r\n if string.count(i) % k != 0:\r\n flag = False\r\n break\r\n else:\r\n flag = True\r\n output += i*(int(string.count(i)/k))\r\n\r\nif flag:\r\n while k > 0:\r\n print(output, end = '')\r\n k -= 1\r\n\r\nelse:\r\n print(-1)\r\n", "k = int(input())\r\ns = input()\r\nchar = {}\r\nmas = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in char.keys():\r\n char[s[i]] = 1\r\n else:\r\n char[s[i]] += 1\r\n\r\nfor values in char.values():\r\n mas.append(values)\r\n\r\ndef do_k_string(char):\r\n s_copy = \"\"\r\n\r\n while True:\r\n for i in char:\r\n j = 0\r\n kratnost = char[i]//k\r\n\r\n if char[i] % k == 0:\r\n for q in range(kratnost):\r\n s_copy += i\r\n mas[j] -= 1\r\n else:\r\n return -1\r\n\r\n j += 1\r\n\r\n if sum(mas) == 0:\r\n return s_copy\r\n \r\nprint(do_k_string(char))", "\r\n\r\n\r\nn=int(input())\r\ns=sorted(input())\r\nt=s[::n]*n\r\nprint(\"\".join(t) if sorted(t)==s else -1)", "k=int(input())\r\ns=input()\r\n\r\ndef solve(s, k):\r\n dic = {}\r\n for c in s:\r\n dic[c] = dic.get(c, 0) + 1\r\n \r\n exist = True\r\n for c in dic:\r\n if (dic[c]%k!=0):\r\n exist = False\r\n break\r\n \r\n if (not exist):\r\n print(-1)\r\n return\r\n \r\n temp = ''\r\n for c in dic:\r\n temp += c*(dic[c]//k)\r\n \r\n print(temp*k)\r\n \r\n\r\nsolve(s, k)", "k = int(input())\r\ns = input()\r\ns_copy = sorted(s)\r\nS_list = ['' for i in range(k)]\r\n\r\nfor i in range(k):\r\n for j in range(i, len(s), k):\r\n S_list[i] += s_copy[j]\r\n\r\ncheck_equal = S_list[0]\r\nfor _ in S_list:\r\n if check_equal != _:\r\n print(-1)\r\n quit()\r\n\r\nprint(''.join(S_list))\r\n", "k = int(input())\r\ns = input()\r\nif k == 1:\r\n print(s)\r\nelse:\r\n letters = list(set(s))\r\n result = \"\"\r\n for letter in letters:\r\n t = s.count(letter)\r\n if t % k == 0:\r\n result += letter * (t // k)\r\n else:\r\n result = \"-1\"\r\n break\r\n if result != \"-1\":\r\n result = result * k\r\n print(result)", "k=int(input())\r\ns=input()\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 ke,v in d.items():\r\n if v%k!=0:\r\n print(-1)\r\n break\r\nelse:\r\n s=\"\"\r\n for ke,v in d.items():\r\n x=v//k\r\n s+=ke*x\r\n print(s*(k))", "##solution for a2oj_50\r\nk=int(input())\r\ns=input()\r\n##i will count\r\ncount={}\r\nfor i in s :\r\n if(i in count):\r\n count[i]+=1\r\n else :\r\n local={i:1}\r\n count.update(local)\r\n\r\n## now construcuting the string\r\nflag=1\r\nresult=\"\"\r\nfor item in count :\r\n if count[item]%k ==0 :\r\n num=int(count[item]/k)\r\n str=\"\".join(item for i in range(num))\r\n result=result+str\r\n else : \r\n flag=0\r\n\r\nif flag==0 :\r\n print (-1)\r\nelse : \r\n final=\"\".join(result for i in range(k))\r\n print(final)\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nk=int(input())\r\ns=input().rstrip()\r\nd=Counter(s)\r\nf=0\r\nt=''\r\nfor x in d:\r\n if d[x]%k!=0:\r\n f=1\r\n break\r\n else:\r\n t+=(x*(d[x]//k))\r\nif f==1:print(-1)\r\nelse:\r\n if len(s)%k!=0:\r\n print(-1)\r\n else:\r\n print(t*(len(s)//len(t)))", "k=int(input())\r\ns=input()\r\n\r\nif k==1 :\r\n print(s)\r\nelse :\r\n ch=[0]*26\r\n for i in s :\r\n ch[ord(i)-97]+=1\r\n flag=True\r\n for i in ch :\r\n if i%k!=0 :\r\n flag=False\r\n break\r\n if flag==False :\r\n print(-1)\r\n else :\r\n l=\"\"\r\n i=0\r\n while i<len(ch) :\r\n if ch[i]!=0 :\r\n p=(ch[i]//k)*chr(i+97)\r\n l+=p\r\n i+=1\r\n l=k*l\r\n print(l)", "from collections import Counter\r\nn=int(input())\r\ns=input()\r\ncount=0\r\ncount_dict=dict(Counter(s))\r\nfor i in count_dict.values():\r\n if i%n==0:\r\n count+=1\r\nif count!=len(count_dict):\r\n print(-1)\r\nelse:\r\n ans=''\r\n for i in count_dict:\r\n ans+=i*(count_dict[i]//n)\r\n print(ans*n)", "k = int(input())\ns = input()\n\ndef solver(k, s):\n d = {}\n for c in s:\n if c not in d:\n d[c] = 1\n else:\n d[c] += 1\n res = \"\"\n for key, val in d.items():\n if val % k != 0:\n return \"-1\"\n res += key * int(val / k);\n return res * k;\nprint(solver(k, s))", "from collections import Counter\r\n\r\nk = int(input())\r\ncount = Counter(input())\r\nres = []\r\nfor key in count:\r\n if count[key] % k == 0:\r\n res.append(key * (count[key] // k))\r\n else:\r\n print(-1)\r\n exit()\r\nres = res*k\r\nprint(\"\".join(res))\r\n", "'''input\r\n3\r\naaaaaaaaaaaaaaa\r\n'''\r\ndef impossible():\r\n\tprint(-1)\r\n\texit(0)\r\n\r\nk = int(input().strip())\r\ns = input().strip()\r\nn = len(s)\r\nd = dict()\r\nfor c in s:\r\n\tif c in d:\r\n\t\td[c] += 1\r\n\telse:\r\n\t\td[c] = 1\r\n\r\nfor a,b in d.items():\r\n\tif b%k!=0:\r\n\t\timpossible()\r\n\r\nnew_str = \"\"\r\nfor a,b in d.items():\r\n\tnew_str += a * int(b/k)\r\nprint(new_str * k)", "n = int(input())\ns = input()\ns = list(s)\n\nif n == 1:\n print(''.join(s))\n\nelse:\n hash_map = {}\n flag = True\n count = 0\n result = ''\n\n for x in s:\n if x not in hash_map:\n hash_map[x] = 1\n else:\n hash_map[x] += 1\n\n for k, v in hash_map.items():\n if v % n:\n flag = False\n break\n else:\n hash_map[k] = hash_map[k] // n\n\n if not flag:\n print(-1)\n else:\n for i in range(n):\n for j in hash_map:\n result += hash_map[j] * j\n\n print(result)\n", "from collections import Counter\r\nk=int(input())\r\ns=input()\r\nflg=1\r\nres = []\r\ncnt = Counter(s)\r\nfor (a,b) in cnt.items():\r\n if b%k!=0:\r\n flg=0\r\n break\r\n else:\r\n res.append(a*(b//k))\r\nif flg:\r\n print(''.join(res)*k)\r\nelse:\r\n print(-1)\r\n \r\n", "def main():\n \n balik = -1\n z = int(input())\n kata = input()\n \n\n if len(kata)%z != 0:\n return balik\n\n\n kata = list(kata)\n huruf = set(kata)\n output = ''\n\n\n for i in huruf:\n \n hitung = kata.count(i)\n \n if hitung%z != 0:\n return balik\n \n output += i*int(hitung/z)\n \n\n balik = output*z\n return balik\n\nif __name__ == \"__main__\":\n print(main())", "noOfWords=int(input())\r\ns=input()\r\ncnt=[0 for _ in range(26)]\r\nfor ch in s:\r\n\tcnt[ord(ch)-97]+=1\r\nans=True\r\nword=[]\r\nfor i in range(26):\r\n\tif not cnt[i]:\r\n\t\tcontinue\r\n\tif cnt[i]%noOfWords:\r\n\t\tans=False\r\n\t\tbreak\r\n\tword.append(chr(i+97)*(cnt[i]//noOfWords))\r\nif ans:\r\n\tprint(\"\".join(word)*noOfWords)\r\nelse:\r\n\tprint(\"-1\")", "k = int(input())\r\nstring = input()\r\n\r\ndictk = {}\r\n\r\n\r\n\r\nfor i in string:\r\n if i in dictk.keys():\r\n dictk[i]+=1\r\n else:\r\n dictk[i]=1\r\n\r\nfor i in dictk.values():\r\n if i %k !=0:\r\n possible = False\r\n break\r\n else :\r\n possible = True\r\n\r\nkstring = ''\r\nrepeat = []\r\nif possible:\r\n for i in dictk.values():\r\n repeat.append(int(i/k))\r\n for i,j in enumerate(dictk.keys()):\r\n kstring += j*repeat[i]\r\n print(kstring*k)\r\n\r\nelse :\r\n print(-1)", "from collections import Counter\r\nk=int(input())\r\ns=input()\r\nl1=list(Counter(s).keys())\r\nl2=list(Counter(s).values())\r\n \r\nif all([i%k==0 for i in l2]):\r\n\ts2=\"\"\r\n\tfor i in range(len(l1)):\r\n\t\ts2+=l1[i]*(l2[i]//k)\r\n\ts2=s2*k\r\n\tprint(s2)\r\nelse:\r\n\tprint(-1)", "i = int(input())\r\nl =sorted(input())\r\nt = l[::i]*i\r\nif sorted(t) == l:\r\n print(''.join(t))\r\nelse:\r\n print(-1)", "num = int(input())\r\nword = input()\r\n\r\nsymbols_count = {i: word.count(i) for i in set(word)}\r\n\r\nout = ''\r\nfor i in symbols_count:\r\n if symbols_count[i] % num == 0:\r\n out += i * (symbols_count[i] // num)\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(out * num)\r\n", "\r\nk=int(input())\r\nstring=input()\r\nmp={}\r\nfor i in string:\r\n mp[i]=mp.get(i,0)+1\r\nres=[]\r\nflag=True\r\nfor key,value in mp.items():\r\n if value%k==0:\r\n x=[key]*(value//k)\r\n else:\r\n flag=False\r\n break\r\n res.extend(x)\r\nnew=[]\r\nif not flag:\r\n print(\"-1\")\r\nelse:\r\n new.extend(res*k)\r\n print(''.join(new))", "from collections import Counter\r\ndef solve():\r\n n = int(input())\r\n s = input()\r\n d = Counter(s)\r\n for ele in d.values():\r\n if ele%n:\r\n return -1\r\n for k in d.keys():\r\n d[k] //= n\r\n ans = \"\"\r\n for k, v in d.items():\r\n ans += (k*v)\r\n return n*ans\r\n\r\nprint(solve())", "\r\nfrom collections import Counter\r\n\r\n\r\nk = int(input())\r\ns = input()\r\nc = Counter(s)\r\nans = []\r\nfor ke,v in c.items():\r\n if v % k != 0:\r\n print(-1)\r\n exit(0)\r\n ans.append(ke*(v//k))\r\n\r\nprint(\"\".join(ans) * k)", "k = int(input())\r\ntext = list(input())\r\nalpha = sorted(set(text))\r\nfor i in range(len(alpha)):\r\n if text.count(alpha[i]) % k == 0 and i != len(alpha)-1:\r\n pass\r\n elif text.count(alpha[i]) % k == 0 and i == len(alpha)-1:\r\n mono = ''\r\n for j in range(len(alpha)):\r\n mono += alpha[j]*(text.count(alpha[j])//k)\r\n print(mono*k)\r\n else:\r\n print(-1)\r\n break\r\n", "k=int(input())\r\ns=sorted(input())\r\nt=s[::k]*k\r\nprint(\"\".join(t) if sorted(t)==s else -1)\r\n \r\n", "import sys\r\n\r\n\r\nk = int(input())\r\ns = input()\r\n\r\ndic = {i:0 for i in list(set(list(s)))}\r\n\r\nfor i in range(len(s)):\r\n dic[s[i]]+=1\r\n\r\nans = \"\"\r\nfor key,val in dic.items():\r\n if val%k!=0:\r\n break\r\n else:\r\n ans+=key*(val//k)\r\nans=ans*k\r\nif len(ans)==len(s):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ns = input()\r\n\r\nd = {}\r\nres = ''\r\n\r\nfor c in s:\r\n if c in d:\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\n\r\nb = True\r\n\r\nfor k in d:\r\n if d[k] % n != 0:\r\n b = False\r\n break\r\n res += k * (d[k] // n)\r\n\r\nprint(res * n if b else -1)", "k = int(input())\r\ns = input()\r\n\r\nls = sorted(list(s))\r\nls.append('\\n')\r\nans = ''\r\n\r\nk_string = True\r\ncount = 1\r\n\r\nfor idx in range(1, len(ls)):\r\n if ls[idx] == ls[idx - 1]:\r\n count += 1\r\n else:\r\n if count % k == 0:\r\n ans += ls[idx - 1] * (count // k)\r\n else:\r\n k_string = False\r\n break\r\n count = 1\r\n\r\nif k_string:\r\n print(ans * k)\r\nelse:\r\n print(-1)", "k = int(input())\r\ns = str(input())\r\nres = \"\"\r\nif k ==1:\r\n print(s)\r\nelse:\r\n flg = True\r\n ss = list(sorted(set(s)))\r\n s = list(s)\r\n for i in ss:\r\n if s.count(i)%k!=0:\r\n flg = False\r\n print(-1)\r\n break\r\n elif (s.count(i)%k)==0:\r\n res+=(i*(s.count(i)//k))\r\n if flg!=False:\r\n print(res*k)\r\n", "k= int(input())\r\ns=input()\r\nl=list(set(s))\r\ncount=[s.count(x) for x in l]\r\nindex=[x//k if x%k==0 else -1 for x in count]\r\nres=''\r\n\r\nif -1 in index:\r\n res=-1\r\nelse:\r\n for x in range(len(l)):\r\n res+=l[x]*index[x]\r\n res*=k\r\nprint(res)", "from collections import Counter\r\nk,d = int(input()),Counter(input())\r\ns = \"\"\r\nfor x,v in d.items():\r\n if v%k != 0:\r\n print(-1)\r\n quit()\r\n s+=x*(v//k)\r\nprint(s*k)", "from collections import Counter\r\n\r\n\r\na = int(input())\r\ns = input()\r\nc = Counter(s)\r\ncheck = 1\r\nfor x in c:\r\n if c[x]%a != 0:\r\n check = 0; break\r\nans = \"\"\r\np = ''\r\nfor x in c:\r\n p += x*(c[x]//a)\r\na = p*a\r\nprint(a if check else -1)", "def k_string(k, s):\r\n # Step 1: Count characters\r\n char_count = {}\r\n for char in s:\r\n char_count[char] = char_count.get(char, 0) + 1\r\n \r\n # Step 2: Check validity\r\n for count in char_count.values():\r\n if count % k != 0:\r\n return \"-1\" # Impossible to form a k-string\r\n \r\n # Step 3: Construct k-string\r\n sub_string = \"\"\r\n for char, count in char_count.items():\r\n sub_string += char * (count // k)\r\n \r\n return sub_string * k\r\n\r\n# Taking inputs\r\nk = int(input())\r\ns = input().strip()\r\n\r\n# Outputting the result\r\nprint(k_string(k, s))\r\n", "from collections import Counter\r\n\r\nk = int(input())\r\ns = input()\r\ncnt = dict(Counter(s))\r\nall_val = list(cnt.values())\r\n\r\nflag = 0\r\ncurr_val = []\r\nfor i in all_val:\r\n if i%k != 0:\r\n flag = 1\r\n break\r\n else:\r\n curr_val.append(i//k)\r\n\r\nif flag == 1:\r\n print (-1)\r\nelse:\r\n s = \"\"\r\n for i,j in zip(cnt, curr_val):\r\n s += i * j\r\n print (s*k)", "k = int(input())\r\ns = input()\r\n\r\nletters = {}\r\n\r\nfor i in s:\r\n if i in letters.keys():\r\n letters[i] += 1\r\n else:\r\n letters[i] = 1\r\n\r\nresult = ''\r\nok = True\r\n\r\nfor i in letters.values():\r\n if i % k != 0:\r\n result = -1\r\n ok = False\r\n break\r\n\r\n\r\nif ok:\r\n for i in letters:\r\n result += i * (letters[i] // k)\r\n result *= k\r\n\r\n\r\nprint(result)", "from collections import Counter\r\ndef reorder_string(s,k):\r\n counts=Counter(s)\r\n for count in counts.values():\r\n if count%k!=0:\r\n return \"-1\"\r\n result=\"\"\r\n for letter,count in counts.items():\r\n result+=letter*(count//k)\r\n result*=k\r\n return result\r\nk= int(input())\r\ns=input().strip()\r\nprint(reorder_string(s,k))", "k = int(input())\r\ns = input()\r\n\r\ncount = {}\r\n\r\nfor c in s:\r\n count[c]=count.get(c,0)+1\r\n\r\n\r\nfor key,value in count.items():\r\n if value<k or value%k!=0:\r\n print(-1)\r\n quit()\r\n\r\n\r\nres = ''\r\nfor key,value in count.items():\r\n res+=(key*(value//k))\r\n\r\nprint(res*k)\r\n", "k = int(input())\r\ns = sorted(input())\r\nans = s[::k]*k\r\nprint(\"\".join(ans) if sorted(ans)==s else -1)", "from collections import Counter\r\nimport sys\r\n\r\nk = int(input())\r\nstring = input()\r\ncount = Counter(string)\r\npart = \"\"\r\nfor char, val in count.items():\r\n if val % k != 0:\r\n print(-1)\r\n sys.exit(0)\r\n else:\r\n part += char * (val // k)\r\nprint(part * k)\r\n", "a=int(input())\r\nb=input()\r\nc=[0]*26\r\nl=''\r\np=0\r\nfor i in range(len(b)):\r\n k=ord(b[i])-ord('a')\r\n c[k]+=1\r\nfor i in range(len(c)):\r\n if c[i]%a!=0:\r\n p=1\r\n break\r\n else:\r\n l+=chr(ord('a')+i)*(c[i]//a)\r\nif p==1:\r\n print(-1)\r\nelse:\r\n print(l*a)\r\n ", "k=int(input())\r\ns=sorted(input())\r\nans=s[::k]*k\r\n\r\nprint([-1,\"\".join(ans)][sorted(ans)==s])", "from collections import Counter\n\nk = int(input())\ncounts = Counter(input())\n\nvalid = True\ns = []\nfor c in counts:\n if counts[c] % k:\n valid = False\n break\n s.append(c * (counts[c] // k))\n\nif valid:\n print(''.join(s) * k)\nelse:\n print(-1)\n", "def khatarnak():\r\n\r\n k = int(input())\r\n s = input()\r\n\r\n uniq_ele = {}\r\n for ele in s:\r\n if ele not in uniq_ele:\r\n uniq_ele[ele] = 1\r\n else:\r\n uniq_ele[ele] += 1\r\n\r\n\r\n value = [uniq_ele[val] for val in uniq_ele]\r\n dish_keys = [v for v in uniq_ele]\r\n\r\n for values in range(len(value)):\r\n if value[values]%k != 0:\r\n print(-1)\r\n return\r\n else:\r\n value[values] = value[values]//k \r\n\r\n ans = \"\"\r\n for kites in range(len(value)):\r\n ans += (dish_keys[kites]*value[kites])\r\n\r\n print(ans*k)\r\n return\r\n\r\n\r\nkhatarnak()", "from collections import Counter \r\ndef arrange_k_string(word, k):\r\n freq = Counter(word).items()\r\n \r\n for (key, value) in freq : \r\n if value % k != 0 :\r\n return -1 \r\n \r\n res = \"\"\r\n for (ch, val) in freq :\r\n res += (ch*(val//k))\r\n \r\n word_len = len(word)\r\n res_len = len(res)\r\n return res * (word_len // res_len)\r\n\r\n\r\nk = int(input())\r\nword = input().strip()\r\n\r\nprint(arrange_k_string(word, k))", "\nk=int(input())\ns=input()\ns1=\"\"\ns2=\"\"\ndict={}\nflag=1\nfor i in range(len(s)):\n\tif s[i] in dict.keys():\n\t\tdict[s[i]]+=1\n\telse:\n\t\tdict[s[i]]=1\nfor c in dict.values():\n\tp=c%k\n\tif p!=0:\n\t\tflag=0\nif flag==0:\n\tprint(-1)\nelse:\n\tfor c, d in dict.items():\n\t\tfor i in range(d//k):\n\t\t\ts1+=c\n\tfor i in range(k):\n\t\ts2+=s1\nprint(s2)\n\n\n\n\n\n", "k = int(input())\r\ns = input()\r\nletters = set(s)\r\nletterToNum = {}\r\n\r\nnoError = True\r\n\r\nfor letter in letters:\r\n if s.count(letter) % k != 0:\r\n print(-1)\r\n noError = False\r\n break\r\n letterToNum[letter] = int(s.count(letter)/k)\r\n\r\nif noError:\r\n res = \"\"\r\n for letter in letters:\r\n res += letter*letterToNum[letter]\r\n print(res*k)", "def check(li, k):\r\n for i in range(26):\r\n if li[i] % k != 0:\r\n return False\r\n return True\r\n\r\nk = int(input())\r\nstring = input()\r\n\r\nli = [0] * 26\r\n\r\nfor ch in string:\r\n ascii = ord(ch)\r\n li[ascii - 97] += 1\r\n\r\nif not check(li, k): print(-1)\r\nelse:\r\n unit = \"\"\r\n for i in range(26):\r\n unit += chr(i + 97) * (li[i] // k)\r\n print(unit * k)", "n=int(input())\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i in d:\r\n d[i]=d[i]+1\r\n else:\r\n d[i]=1\r\nif any(i%n!=0 for i in d.values()):\r\n print(-1)\r\n exit()\r\na=''\r\nfor i in d:\r\n a+=i*(d[i]//n)\r\nprint(a*n)", "k = int(input())\nchar_dict = {}\ns = input()\nexist = True\nfor element in s:\n if element not in char_dict:\n char_dict[element] = 0\n char_dict[element] += 1\nfor i in char_dict:\n if char_dict[i] % k != 0:\n exist = False\n break\nif (not exist):\n print(-1)\nelse:\n output_string = \"\"\n for key in char_dict:\n output_string += key*(char_dict[key]//k)\n output_string *= k\n print(output_string)", "n = int(input())\ns = input()\n\nd = {}\n\nfor c in s:\n if c in d:\n d[c] += 1\n else:\n d[c] = 1\nresult = ''\nfor k, v in d.items():\n if v%n != 0:\n print(-1)\n break\n result += k*(v//n)\n\nelse:\n print(result*n)\n", "k=int(input())\r\ns=input()\r\nalphabets=['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\nalphacount=list(map(lambda i: s.count(i),alphabets))\r\nremalpha=list(map(lambda i: i%k,alphacount))\r\nif remalpha!=[0]*26:\r\n print(-1)\r\nelse:\r\n substringlist=list(map(lambda x,y: x*(y//k),alphabets,alphacount))\r\n substring=''.join(substringlist)\r\n multplier=len(s)//len(substring)\r\n ans=substring*multplier\r\n print(ans)", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nk=int(input())\r\ns=input()\r\nans=True\r\npre=[0]*27\r\nfor i in s:\r\n pre[ord(i)-96]+=1\r\nres=''\r\nfor i in range(1,27):\r\n if pre[i]%k!=0:\r\n ans=False\r\n break\r\n else:\r\n res+=(chr(96+i)*(pre[i]//k))\r\nif ans:\r\n print(res*k)\r\nelse:\r\n print(-1)", "k = int(input())\r\n\r\ns = input()\r\n\r\nif(len(s)%k != 0):\r\n\tprint(-1)\r\nelse:\r\n\tc = [0 for i in range(26)]\r\n\tfor i in range(len(s)):\r\n\t\tc[ord(s[i])-ord('a')] += 1\r\n\tflag = 0\r\n\tfor i in range(26):\r\n\t\tif(c[i]%k != 0):\r\n\t\t\tflag = 1\r\n\r\n\tif(flag == 1):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tt = ''\r\n\t\tfor i in range(k):\r\n\t\t\tfor j in range(26):\r\n\t\t\t\tif(c[j]>0):\r\n\t\t\t\t\tchar = chr(j+97)*(c[j]//k)\r\n\t\t\t\t\tt += char\r\n\t\tprint(t)", "def k_string(k,s):\r\n char_freq = [0]*26\r\n for i in s:char_freq[ord(i)-97]+=1;\r\n solution,i = [\"\"]*len(s),0\r\n for l in range(len(char_freq)):\r\n if char_freq[l]%k != 0:return -1\r\n else:\r\n freq = char_freq[l]//k\r\n while freq != 0:\r\n solution[i]=chr(l+97);i+=1;freq-=1\r\n\r\n return (\"\".join(solution))*k\r\n\r\nk = int(input())\r\ns = input()\r\nprint(k_string(k,s))\r\n", "import collections\r\n\r\nk = int(input())\r\ndata = list(input())\r\ncdata = dict(collections.Counter(data))\r\nflag = True\r\n\r\nfor i in cdata.values():\r\n if i % k != 0:\r\n flag = False\r\n break\r\n\r\nif not flag:\r\n print(-1)\r\nelse:\r\n ans = ''\r\n for i in cdata.keys():\r\n ans += i * (cdata[i] // k)\r\n print(ans * k)", "from collections import Counter\r\n\r\nk = int(input())\r\ns = input()\r\n\r\nif len(s) % k !=0:\r\n print(-1)\r\n exit(0)\r\n\r\nls = Counter(s)\r\n\r\nif all(ls[l] % k == 0 for l in ls):\r\n sp = ''.join([l*(ls[l]//k) for l in ls])\r\n print(sp*k)\r\nelse:\r\n print(-1)\r\n", "#building block-aabcd,k=3--->\n# cout frequency for each character\nk = int(input())\nf=True\ns = input()\nans = ''\nalph=26\ns_ = [0] * 26\nfor i in range(len(s)):\n s_[ord(s[i])-ord('a')]+= 1\nfor i in range(alph):\n if s_[i] % k!=0:\n f=False\n break\n ans += chr(i+ord('a'))*(s_[i]//k)\n\nif f:\n for i in range(k):\n print(ans,end=\"\")\nelse:print(-1)\n\t \t \t \t \t \t \t\t\t \t \t\t\t", "def solve():\r\n n = int(input())\r\n a = input()\r\n f = dict()\r\n for i in a:\r\n try:\r\n f[i] += 1\r\n except KeyError:\r\n f[i] = 1\r\n ans = ''\r\n for i,j in f.items():\r\n if j % n:\r\n return -1\r\n ans += i * (j//n)\r\n return ans * n\r\nprint(solve())", "n = int(input())\r\ns = sorted(input())\r\nst = s[::n]*n\r\nif sorted(st)==s:\r\n print(\"\".join(st))\r\nelse:\r\n print(-1)", "\r\nk = int(input())\r\ncounts = {}\r\nfor e in input():\r\n counts[e] = counts.get(e , 0) + 1\r\n\r\nisRight = True\r\ns = \"\"\r\n\r\nfor key in counts:\r\n if counts[key] % k != 0:\r\n isRight = False\r\n break\r\n else:\r\n s += key * (counts[key] // k)\r\n\r\nif isRight:\r\n print(s * k)\r\nelse:\r\n print(-1)", "def is_k_string(s, k):\r\n # Count the frequency of each letter\r\n freq = {}\r\n for ch in s:\r\n freq[ch] = freq.get(ch, 0) + 1\r\n\r\n # Check if all letter frequencies are divisible by k\r\n for f in freq.values():\r\n if f % k != 0:\r\n return False\r\n\r\n return True\r\n\r\ndef rearrange_k_string(s, k):\r\n if not is_k_string(s, k):\r\n print(\"-1\")\r\n return\r\n\r\n freq = {}\r\n for ch in s:\r\n freq[ch] = freq.get(ch, 0) + 1\r\n\r\n result = \"\"\r\n for ch in sorted(freq.keys()):\r\n result += ch * (freq[ch] // k)\r\n\r\n print(result * k)\r\n\r\n# Read input\r\nk = int(input())\r\ns = input()\r\n\r\n# Call the function\r\nrearrange_k_string(s, k)\r\n", "def k_string(k, string):\r\n alphabet = {}\r\n for value in string:\r\n if value not in alphabet:\r\n alphabet[value] = 1\r\n else:\r\n alphabet[value] += 1\r\n \r\n key = list(alphabet.keys())\r\n val = list(alphabet.values())\r\n \r\n for i in val:\r\n if i % k != 0:\r\n return -1\r\n \r\n final = []\r\n output = \"\"\r\n for i in val:\r\n final.append(int(i/k))\r\n for j in range(len(key)):\r\n output = output + (key[j] * final[j])\r\n \r\n return (output * k)\r\n\r\nk = int(input())\r\nstring = input()\r\nsorted(string)\r\nout = k_string(k, string)\r\nprint(out)", "n=int(input())\r\na=sorted(input())\r\nx=a[::n]*n\r\nprint(''.join(x) if sorted(x)==a else -1)\r\n", "from collections import defaultdict\nn = int(input())\n\nl = list(input())\n\nd = defaultdict(int)\n\n\nfor i in l:\n d[i] +=1\ns = '' \nfor k,v in d.items():\n if v%n != 0:\n print(-1)\n exit()\n else:\n s += k * (v//n)\n\nprint(s*n)\n", "from collections import Counter\nimport re\n\ndef main():\n k = int(input())\n freqs = Counter(input())\n string = ''\n for char, freq in freqs.items():\n if freq%k != 0:\n print(-1)\n break\n string += f'{char}'*(freq//k)\n else:\n print(string*k)\n\n\nmain()\n", "from sys import stdin\r\n\r\ndef solve():\r\n k = int(input())\r\n s = input()\r\n count = {}\r\n for letter in s:\r\n count[letter] = count.get(letter, 0) + 1\r\n for elem in count.values():\r\n if elem % k != 0:\r\n return -1\r\n\r\n ans = \"\"\r\n for letter, counter in count.items():\r\n ans += letter * (counter // k)\r\n\r\n return ans * k\r\n \r\n\r\ndef main():\r\n print(solve())\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import Counter\n\nk, s = int(input()), Counter(input())\nif any(v % k != 0 for v in s.values()):\n res = -1\nelse:\n res = []\n for c, v in s.items():\n res += c * (v // k)\n res *= k\n res = \"\".join(res)\nprint(res)\n", "k=int(input())\r\ns=input()\r\ndic={}\r\nfor i in s:\r\n if i in dic:\r\n dic[i]=dic[i]+1\r\n else:\r\n dic[i]=1\r\nx=0\r\nres=''\r\nfor i in dic:\r\n if dic[i]%k==0:\r\n x=1\r\n res=res+(i*(dic[i]//k))\r\n else:\r\n x=0\r\n break\r\nif x==0:\r\n print(-1)\r\nelse:\r\n print(res*k)\r\n\r\n\r\n# for i in range(0,t):\r\n# n=int(input())\r\n# lis=list(map(int,input().split()))\r\n# lis.sort()\r\n# print(lis[n]-lis[n-1])\r\n", "from typing import Counter\r\nk=int(input())\r\ns=input()\r\nc=Counter(s)\r\na=\"\"\r\np=True\r\nfor j,i in c.items():\r\n if i%k!=0:\r\n print(-1)\r\n p=False\r\n break\r\n else:\r\n a+=(j)*(i//k)\r\nif p:\r\n print(a*k)", "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 k = int(input())\n s = input()\n s_dict = {}\n for i in range(len(s)):\n if s[i] in s_dict:\n s_dict[s[i]] += 1\n else:\n s_dict[s[i]] = 1\n for key in s_dict:\n if s_dict[key] % k != 0:\n print(-1)\n return\n res = \"\"\n for key in s_dict:\n res += key * (s_dict[key] // k)\n print(res * k)\n\n\nif __name__ == \"__main__\":\n main()\n", "k = int(input())\r\nst = list(input().strip())\r\ndictcount = {}\r\nif len(st)%k == 0:\r\n\tfor i in st:\r\n\t\tif i in dictcount:\r\n\t\t\tdictcount[i] += 1\r\n\t\telse:\r\n\t\t\tdictcount[i] = 1\r\n\tactive = True\r\n\tfor i in dictcount.values():\r\n\t\tif i%k != 0:\r\n\t\t\tactive = False\r\n\t\t\tbreak\r\n\tif active:\r\n\t\tstf = \"\"\r\n\t\tfor i in dictcount:\r\n\t\t\tstf += i*(dictcount[i]//k)\r\n\t\tprint(stf*k)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tprint(-1)\r\n", "a=int(input())\r\n\r\nb=input()\r\n\r\nc=set(b)\r\nd=0\r\ny=''\r\n\r\nif a==1:\r\n print(b)\r\nelse:\r\n for i in c:\r\n x= b.count(i)\r\n if (x%a)==0:\r\n y+=(x//a)*i\r\n continue\r\n else:\r\n print(-1)\r\n d+=1\r\n break\r\n if d==0:\r\n print(y*a)\r\n \r\n\r\n", "def main():\r\n k = int(input())\r\n s = input()\r\n char_count = {}\r\n for char in s:\r\n char_count[char] = char_count.get(char, 0) + 1\r\n for count in char_count.values():\r\n if count % k != 0:\r\n print(-1)\r\n return\r\n result = \"\".join(char * (count // k) for char, count in char_count.items())\r\n print(result * k)\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690287347.0698795", "n = int(input())\r\nstring = input()\r\nfreq = {}\r\nflag = 1\r\ns = \"\"\r\nans = \"\"\r\nfor i in string:\r\n if i in freq:\r\n freq[i] += 1\r\n else:\r\n freq[i] = 1\r\nfor i in freq.values():\r\n if i%n:\r\n flag = 0\r\nif(flag):\r\n for i in freq.keys():\r\n for j in range(freq[i]//n):\r\n s += i\r\n for i in range(n):\r\n ans += s\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", " # ⠀⠀⠀⠀⠀⠀⠀⠀⣠⠞⠁⠀⠀⠀⠀⠀⢠⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⢳⣤⣤⣀⣀⠀⠀\r\n # ⣶⣶⣶⣶⣾⠟⣩⠟⠁⠀⠀⢀⠎⠀⠀⡰⠋⠀⠀⠀⠀⡴⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣄⠙⠿⣷\r\n # ⣿⣿⣿⠏⢉⡾⠃⠀⠀⠀⢀⠆⠀⠀⠰⠁⠀⠀⠀⠀⡜⠁⠀⠀⠀⣰⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣧⠀⢸\r\n # ⣿⣿⠉⣰⡟⠁⠀⠀⠀⢠⠎⠀⠀⠀⠀⠀⠀⠀⠀⢰⠁⠀⠀⡰⢱⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠈⢿⣧⠀\r\n # ⣿⠉⢰⡟⠀⠀⠀⠀⢀⠏⠀⠀⠀⠀⠀⠀⠀⠀⣰⡏⠀⠀⢠⢇⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢣⠀⠀⠀⠀⠀⠀⠀⠈⢿⣧\r\n # ⡿⢠⣿⠁⠀⠀⠀⠀⡼⠀⠀⡆⠀⠀⠀⠀⠀⡼⡣⡇⠀⠀⠘⢸⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠈⢿ coder name:LUCIFER\r\n # ⡇⡞⠙⠀⠀⠀⠀⣸⠁⠀⢸⠀⠀⠀⠀⠀⣼⡟⠁⡇⠀⠀⠀⡇⠀⠀⠀⠀⢠⣿⠀⠀⠀⠀⠀⡆⠀⠀⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀⠈ LANGUAGE: Python\r\n # ⣿⠁⠀⠀⠀⠀⠀⡇⠀⠀⣸⠀⠀⠀⠀⢀⣻⠀⠀⢸⡀⠀⠀⢳⡀⠀⠀⠀⣞⢸⣆⠀⠀⠀⢸⡀⠀⢰⠀⠀⠀⢳⠀⠀⠀⠀⠁⠀⠀⠀\r\n # ⠇⠀⠀⠀⠀⠀⢸⠀⡀⠀⡟⣆⠀⠀⠀⢸⠧⠴⠆⠀⠳⡀⠀⠀⠳⡀⠀⢸⢻⠲⠼⢆⠀⠀⠀⣇⠀⢸⣆⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⣼⣴⡿⣔⣇⠉⠓⠦⣄⣸⠀⠀⠀⠀⠀⠻⠶⣄⣀⠙⠦⣸⡆⠀⠀⠀⠓⢤⡀⠸⡷⣄⢻⢦⡀⠀⢷⠀⠀⠀⡆⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⣿⠛⠀⠈⠉⠀⠀⠀⠀⠈⠁⠀⠀⠀⠀⠀⠀⠐⠨⠍⠉⠉⠛⠀⠀⠀⠀⠀⠉⠙⠚⠬⠟⠃⠻⡦⣼⠀⠀⣆⡇⠀⠀⠀\r\n # ⠀⡀⢰⠀⠀⢠⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⡆⢀⢿⠁⠀⠀⠀\r\n # ⠀⠸⡄⣧⠀⢸⣃⣤⣖⣻⣿⣿⠿⣿⣿⣟⣓⣲⣭⣑⠀⠀⠀⠀⠀⠀⠀⠀⢈⡥⣶⣺⣿⣿⣿⣿⣷⠲⠦⣄⡀⠀⠀⡇⢸⡼⠀⠀⠀⠀\r\n # ⠀⠀⢱⡘⡆⢸⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠀⠈⠉⠉⠉⠉⠉⠓⠛⠓⠲⣧⡇⠃⠀⠀⠀⠀\r\n # ⠀⠀⠀⢳⡸⡄⡇⢠⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡿⢠⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⢳⡹⣇⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⢃⡇⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠱⣽⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⡜⠀⠀⠀⢀⠀⠀\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 math import log, ceil\r\nn = int(input());s = input()\r\ns = sorted(s)\r\nx = []\r\ni = 0\r\nwhile i < len(s):\r\n x.append(s[i]);i += n\r\nx = x*n\r\nif sorted(x)==s:\r\n print(\"\".join(x))\r\nelse:\r\n print(-1)\r\n\r\n", "def testcase():\n k = int(input().strip())\n a = input().strip()\n d = {chr(v): 0 for v in range(97, 123)}\n for x in a:\n d[x] += 1\n\n flag, n = True, 0\n for x in d.keys():\n if not d[x] % k == 0:\n flag = False\n n = max(n, d[x])\n\n if not flag:\n print('-1')\n else:\n for _ in range(k):\n for x in d.keys():\n for _ in range(d[x]//k):\n print(x, end=\"\")\n\n\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "def k_string():\r\n k = int(input())\r\n word = input()\r\n\r\n wordCount = {}\r\n for w in word:\r\n wordCount[w] = wordCount.get(w, 0) + 1\r\n \r\n res = ''\r\n for key, value in wordCount.items():\r\n if value % k:\r\n return -1\r\n \r\n res += key*(value//k)\r\n \r\n return res*k\r\n\r\nprint(k_string())", "c=0\r\nn=int(input())\r\na=input()\r\na_len=len(a)\r\nsorted_a=\"\".join(sorted(a))\r\nfor i in range(len(sorted_a)):\r\n if(i%n==0):\r\n s=sorted_a[i]\r\n if(sorted_a[i]==s):\r\n c+=1\r\nif(a_len==c and c%n==0):\r\n for i in range(0,n):\r\n for j in range(0,len(sorted_a),n):\r\n print(sorted_a[j],end=\"\")\r\nelse:\r\n print(-1)", "k = int(input())\r\nletters = {}\r\nflag = True\r\nstring = input()\r\nfor i in range(len(string)):\r\n try:\r\n letters[string[i]] += 1\r\n except:\r\n letters[string[i]] = 1\r\nfor letter in letters:\r\n if letters[letter] % k != 0:\r\n print(-1)\r\n flag = False\r\n break\r\nif flag:\r\n for _ in range(k):\r\n for letter in letters:\r\n print(letter*(letters[letter] // k), end='')\r\n print()", "# https://codeforces.com/problemset/problem/219/A\n\nfrom collections import defaultdict\n\ndef handle():\n k = int(input())\n letter_frequency = defaultdict(int)\n word = input()\n word_length = len(word)\n\n for char in word:\n letter_frequency[char] += 1\n\n result = \"\"\n\n for char in letter_frequency:\n if letter_frequency[char] % k != 0:\n return \"-1\"\n else:\n result += char * (letter_frequency[char] // k)\n return result * k\n\nprint(handle())", "n=int(input())\r\ns=sorted(input())\r\nx=s[::n]*n\r\nprint([-1,\"\".join(x)][sorted(x) == s])", "n = int(input())\r\ns = input()\r\nm = {}\r\nfor i in s:\r\n if i not in m:\r\n m[i] = 1\r\n else:\r\n m[i] += 1\r\n\r\nans = \"\"\r\nflag = True\r\nfor k, v in m.items():\r\n if v % n == 0:\r\n ans += int(v / n) * k\r\n else:\r\n print(-1)\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(n * ans)\r\n", "from collections import Counter\r\nn=int(input())\r\nm=input()\r\nc=Counter(m)\r\nd=[]\r\nfor ke,v in c.items():\r\n if v % n != 0:\r\n print(-1)\r\n exit(0)\r\n d.append(ke*(v//n))\r\n \r\nprint(\"\".join(d) * n)", "n=int(input())\r\nt=input()\r\na=[i for i in t]\r\nb=list(set(a))\r\nl=len(b)\r\ns=\"\"\r\nf=True\r\nfor i in range(l):\r\n if a.count(b[i])%n!=0:\r\n f=False\r\n break\r\n r=a.count(b[i])/n\r\n s=s+b[i]*int(r) \r\nif f==False:\r\n print(-1)\r\nelse:\r\n s=s*n\r\n print(s)\r\n \r\n ", "k=int(input())\r\ns=input()\r\nl=[]\r\nl1=0\r\nd={}\r\nfor z in s:\r\n if z not in d.keys():\r\n l.append(z)\r\n l1+=1\r\n d[z]=1\r\n else :\r\n d[z]+=1\r\ncnt=0\r\nfor y in l:\r\n if d[y]%k==0:\r\n cnt+=1\r\nif cnt!=l1:\r\n print(-1)\r\nelse :\r\n s=\"\"\r\n for y in l:\r\n x=d[y]//k\r\n s+=(y*x)\r\n print(s*k)", "from collections import Counter\n\n# Read input\nk = int(input())\ns = input().strip()\n\n# Check if it is possible to form a k-string\nn = len(s)\nif n % k != 0:\n print(\"-1\")\nelse:\n freq = Counter(s)\n for c in freq:\n if freq[c] % k != 0:\n print(\"-1\")\n break\n else:\n # Generate the repeated substring\n substr = ''\n for c in freq:\n substr += c * (freq[c] // k)\n \n # Print the solution\n print(substr * k)\n\t\t\t\t \t\t\t\t \t\t\t \t \t \t \t\t\t\t \t \t", "k = int(input())\r\ns = list(input())\r\ns.sort()\r\nar = s[::k]*k\r\nif sorted(ar) == s:\r\n print(\"\".join(ar))\r\nelse:\r\n print(-1)", "k = int(input())\ns = input()\n\ndata = {}\nfor char in s:\n data[char] = s.count(char)\n\ndef check_data(data):\n for elem in data:\n if data[elem] % k != 0:\n return False\n \n return True\n\ndef assemble_data(data, k):\n result = ''\n\n for key in data:\n value = data[key]\n result += key * (value // k)\n \n return result\n\n\nif check_data(data):\n result = ''\n result += assemble_data(data, k) * k\n print(result)\nelse:\n print(-1)", "c=[0]*26\r\na=int(input())\r\nb=input()\r\nl=''\r\nfor i in range(len(b)):\r\n c[ord(b[i])-ord('a')]+=1\r\nfor i in range(26):\r\n if c[i]%a==0:\r\n l+=chr(ord('a')+i)*(c[i]//a)\r\n else:\r\n l='-1'\r\n break\r\nif l=='-1':\r\n print(-1)\r\nelse:\r\n print(l*a)", "k = int(input())\r\ns = input()\r\ntable = dict()\r\nfor i in s:\r\n if i not in table:\r\n table[i] = 1\r\n else:\r\n table[i]+=1\r\nst = \"\"\r\ncond = True\r\nfor key in table:\r\n if table[key]%k != 0:\r\n cond = False\r\n break\r\n st+= key*int(table[key]/k)\r\nif cond:\r\n print(st*k)\r\nelse:\r\n print(-1)\r\n ", "\r\nk = int(input())\r\ns = str(input())\r\nmap = set()\r\nf = True\r\nfor i in range(len(s)):\r\n if s[i] not in map:\r\n if s.count(s[i]) % k != 0:\r\n f = False\r\n break\r\n else:\r\n map.add(s[i])\r\nif not f:\r\n print(-1)\r\nelse:\r\n to = ''\r\n map = set()\r\n for i in range(len(s)):\r\n if s[i] not in map:\r\n t = s.count(s[i])\r\n a = s[i]*(t // k)\r\n to += a\r\n map.add(s[i])\r\n print(to*(k))\r\n \r\n ", "n = int(input())\r\ns = input()\r\ndic = dict()\r\nfor i in s:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\nans = ''\r\nflag = 1\r\nfor i in dic:\r\n a = dic[i] % n\r\n if a == 0:\r\n ans += i * (dic[i] // n)\r\n else:\r\n flag = 0\r\n break\r\nif flag:\r\n print(ans * n)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=input()\r\nans=list()\r\nd= {}\r\nf=1\r\nif len(s)%n != 0:\r\n print(-1)\r\nelse:\r\n for i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n for j in d:\r\n x=d[j]/n\r\n if d[j]%n==0 and x>1:\r\n for z in range(int(x)):\r\n ans.append(j)\r\n else:\r\n ans.append(j)\r\n if d[j]%n!=0:\r\n print(-1)\r\n f=0\r\n break\r\n if f==1:\r\n print(\"\".join(ans*n))", "k = int(input())\r\ns = input()\r\nfreq = {}\r\nfor char in s:\r\n if char in freq:\r\n freq[char] += 1\r\n else:\r\n freq[char] = 1\r\nresult = \"\"\r\nfor key in freq:\r\n if freq[key] % k != 0:\r\n print(-1)\r\n exit()\r\n else:\r\n result += key * (freq[key] // k)\r\nprint(result * k)", "def func():\n from collections import Counter\n k = int(input())\n inp = input()\n c = Counter(inp)\n s = \"\"\n for char, x in c.most_common():\n if x < k or x % k != 0:\n return -1\n s += char * (x // k)\n return s * k\n\nprint(func())", "def checker(s , k):\r\n res = \"\"\r\n count = {}\r\n for c in s:\r\n count[c] = count.get(c, 0) + 1\r\n for key in count.keys():\r\n if count[key] % k != 0:\r\n return -1\r\n res += count[key] // k * key\r\n res = res * k\r\n return res\r\n\r\n\r\n\r\nk = int(input())\r\ns = input()\r\nprint(checker(s,k))\r\n", "def k_String():\r\n def convert(string):\r\n list1 = []\r\n list1[:0] = string\r\n return list1\r\n\r\n number_k = int(input())\r\n strInput = input()\r\n string_list = convert(strInput)\r\n string_list.sort()\r\n unique_letters = list(set(string_list))\r\n\r\n possible = True\r\n count_of_letters = {}\r\n for i in unique_letters:\r\n count = string_list.count(i)\r\n count_of_letters[i] = count\r\n\r\n if count % number_k != 0:\r\n possible = False\r\n break\r\n\r\n if not possible:\r\n print(-1)\r\n else:\r\n output_string = ''\r\n for i in unique_letters:\r\n output_string = output_string + (i*(count_of_letters[i]//number_k))\r\n output_string = output_string*number_k\r\n print(output_string)\r\n\r\nk_String()", "k = int(input())\r\nline = input()\r\nunique_letter = list(set(line))\r\nletters_dict = {}\r\ni = 0\r\nwhile i < len(unique_letter):\r\n\tletter_count = line.count(unique_letter[i])\r\n\tif letter_count < k or letter_count%k != 0:\r\n\t\tprint(-1)\r\n\t\tbreak\r\n\telse:\r\n\t\tkey = unique_letter[i]\r\n\t\tvalue = letter_count//k\r\n\t\tletters_dict[key] = value\r\n\ti += 1\r\nelse:\r\n\tuns_text = ''\r\n\tfor letter in letters_dict.keys():\r\n\t\tuns_text += letter*letters_dict[letter]\r\n\tprint(uns_text*k)", "k = int(input())\r\n\r\ns = input()\r\n\r\nl = [0] * 26\r\n\r\nfor x in s:\r\n l[ord(x)-97] += 1\r\n\r\nans = ''\r\nw = True\r\nfor x in range(26):\r\n if l[x]%k == 0:\r\n ans += chr(x+97)*(l[x]//k)\r\n else:\r\n w = False\r\n break\r\nif w:\r\n print(ans*k)\r\nelse:\r\n print(-1)", "n = int(input())\r\nseries = sorted(input())\r\nanswer = series[::n]*n\r\nprint(''.join(answer) if sorted(answer) == series else '-1')\r\n", "n=int(input())\r\ns=sorted(input())\r\nx=s[::n]*n\r\nif sorted(x)==s:\r\n print(\"\".join(x))\r\nelse:print(-1)\r\n", "n=int(input())\r\na=sorted(input())\r\n\r\nx=a[::n]*n\r\n\r\nprint([-1,\"\".join(x)][sorted(x) == a])", "from collections import Counter\n\nk = int(input())\ns = input()\nd = Counter(s)\n\nresult = ''\nflag = True\nfor i in d:\n if d[i] % k:\n flag = False\n break\n else:\n d[i] //= k\n\nif not flag:\n print(\"-1\")\nelse:\n for i in range(k):\n for j in d:\n result += j * d[j]\n\n print(result)\n", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nk = int(input().strip())\r\ns = input().strip()\r\nfreq = {}\r\n\r\nfor i in s:\r\n freq[i] = freq.get(i, 0) + 1\r\n\r\nresult = []\r\nans = True\r\nfor i in freq:\r\n if freq[i] % k != 0:\r\n ans = False\r\n break\r\n else:\r\n chars = [i for x in range(freq[i]//k)]\r\n result.extend(chars)\r\n\r\nif not ans:\r\n print(\"-1\")\r\nelse:\r\n subStr = \"\".join(result)\r\n print(\"\".join([subStr for i in range(k)]))", "n = int(input())\r\na = input()\r\nans = ''\r\n\r\nfor i in set(a):\r\n if a.count(i) % n != 0:\r\n ans = '-1'\r\n print(ans)\r\n break\r\n\r\nif ans != '-1':\r\n for j in range(n):\r\n for i in set(a):\r\n ans += i * (a.count(i) // n)\r\n print(ans)", "k = int(input())\r\ntext = input()\r\nlength = len(text)\r\ntextSet = set(text)\r\n\r\nif length // k != length / k : exit(print(-1)) \r\n\r\ndictLetter = {}\r\n\r\ncount = length // k \r\n\r\nfor letter in textSet :\r\n if letter in dictLetter : continue\r\n letterCount = text.count(letter)\r\n if letterCount / k != letterCount // k : exit(print(-1))\r\n else : \r\n if letter not in dictLetter :\r\n dictLetter[letter] = letterCount // k\r\n \r\n\r\nword = \"\"\r\nfor key , value in dictLetter.items() :\r\n word += key * value\r\n \r\n\r\nfor _ in range(k) : print(word,end=\"\")", "n=int(input())\r\na=input()\r\nif len(a)%n!=0:\r\n print(-1)\r\nelse:\r\n b=set(a)\r\n l1=[]\r\n f=True\r\n for k in b :\r\n c=a.count(k)\r\n if c%n!=0:\r\n print(-1)\r\n f=False\r\n break\r\n else:\r\n l1.append(c//n)\r\n\r\n if f==True:\r\n i=0\r\n g=\"\"\r\n for k in b:\r\n g=g+k*l1[i]\r\n i=i+1\r\n print(g*n)", "n = int(input())\r\ns = input()\r\n\r\n\r\ndef solve(s, k):\r\n count = []\r\n letters = []\r\n word = \"\"\r\n for i in set(s):\r\n count.append(s.count(i))\r\n letters.append(i)\r\n\r\n for i in count:\r\n if i % k != 0:\r\n return \"-1\"\r\n for h, v in zip(letters, count):\r\n word += h * (v // k)\r\n\r\n return word*k\r\n\r\n\r\n\r\nprint(solve(s, n))\r\n", "k = int(input())\r\ns = input()\r\n\r\nchar_count = {}\r\nfor c in s:\r\n char_count[c] = char_count.get(c, 0) + 1\r\n\r\nsegment = []\r\nres = \"\"\r\nfor key,value in char_count.items():\r\n if value % k != 0:\r\n res = \"-1\"\r\n break\r\n segment.append(key*(value//k))\r\n\r\nprint(\"-1\" if res == \"-1\" else \"\".join(segment * k))", "k = int(input())\ns = input()\ncount_dict = {}\nfor char in s:\n\tcount_dict[char] = count_dict.get(char, 0) + 1\nfor v in count_dict.values():\n\tif(v % k != 0):\n\t\tprint(\"-1\")\n\t\texit()\noutput_str_copy = \"\"\nfor key, value in count_dict.items():\n\toutput_str_copy += key * (value // k)\nprint(output_str_copy*k)", "k=int(input())\r\na=input()\r\ncount=0\r\n\r\norder_a=\"\".join(sorted(a))\r\nfor v in range(len(order_a)):\r\n if(v%k==0):\r\n s=order_a[v]\r\n if(order_a[v]==s):\r\n count+=1\r\nif(len(a)==count and count%k==0):\r\n for v in range(0,k):\r\n for w in range(0,len(order_a),k):\r\n print(order_a[w],end=\"\")\r\nelse:\r\n print(-1)", "k = int(input())\r\ns = list(input())\r\ns.sort()\r\nc = 1\r\nf = 0\r\nans = ''\r\nd = {}\r\nfor i in range(len(s)):\r\n if s[i] in d:\r\n d[s[i]] += 1\r\n else:\r\n d[s[i]] = 1\r\n\r\nfor elem in d:\r\n if d[elem] % k != 0:\r\n print(-1)\r\n f = 1\r\n break\r\n else:\r\n ans += elem * (d[elem] // k)\r\n\r\nif f == 0:\r\n print(ans * k)\r\n", "n = int(input())\r\ns = sorted(input())\r\nk_String = s[::n] * n\r\nif sorted(k_String) == s:\r\n print(\"\".join(k_String))\r\nelse:\r\n print(-1)\r\n", "a = int(input())\r\nb = input()\r\nc = set(b)\r\nd = ''\r\nfor i in c:\r\n\tif b.count(i) % a != 0:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nelse:\r\n\tfor g in c:\r\n\t\td += g *(b.count(g) // a)\r\n\tprint(d * a)", "n = int(input())\r\ns = sorted(input())\r\n\r\nx = s[::n]*n\r\nif sorted(x) == s:\r\n print(''.join(x))\r\nelse:\r\n print('-1')\r\n", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :A. k-String\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\nn=int(input())\r\ns=input()\r\na=sorted(s)\r\nb=a[::n]*n\r\nprint([-1,\"\".join(b)][sorted(b)==a])", "k=int(input())\r\ns=sorted(input())\r\nx=s[::k]*k\r\nprint(\"\".join(x) if sorted(x)==s else -1)", "import sys \r\ninput = sys.stdin.readline \r\nfrom collections import Counter\r\ndef instr():\r\n return input()[:-1]\r\nk = int(input())\r\ns = instr()\r\nlength = len(s)\r\nc = Counter(s)\r\nx = []\r\nstrin = \"\"\r\nfor key, value in c.items() : \r\n if value%k != 0 :\r\n print(-1)\r\n break\r\n else : \r\n x.append(value // k )\r\nelse : \r\n for i, j in enumerate(c.keys()):\r\n strin += j*x[i]\r\n print(strin*k)\r\n", "import collections\r\nfrom math import log2, log10, ceil\r\n\r\ndef pow2(n):\r\n t = 0\r\n while not(n&1):\r\n n = n//2\r\n t += 1\r\n return t\r\n\r\ndef solve():\r\n k = int(input())\r\n s = input()\r\n ans = \"\"\r\n\r\n s = \"\".join(sorted(s))\r\n count = 0\r\n for i in range(0, len(s)):\r\n if s[i]!=s[i-1]:\r\n if count%k!=0:\r\n print(-1)\r\n return\r\n for x in range(0, count//k):\r\n ans += s[i-1]\r\n count = 1\r\n else:\r\n count += 1\r\n\r\n if count%k!=0:\r\n print(-1)\r\n return\r\n \r\n for x in range(0, count//k):\r\n ans += s[len(s)-1]\r\n \r\n for i in range(0, k):\r\n print(ans, end = \"\")\r\n print()\r\ndef main():\r\n t = 1\r\n while t:\r\n t -= 1\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import Counter\r\n\r\n\r\nn = int(input())\r\ns = Counter(input()[:-1])\r\nfor i in s.values():\r\n if i % n != 0:\r\n print(-1)\r\n break\r\nelse:\r\n d = ''\r\n for i in s:\r\n d += i*(s[i]//n)\r\n print(d*n)", "k = int(input())\r\na = input()\r\nb = {}\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n b[a[i]]+=1\r\n else:\r\n b[a[i]] = 1\r\n\r\ns = \"\"\r\nf = True\r\nfor i,j in b.items():\r\n if j%k == 0:\r\n s+=i*(j//k)\r\n else:\r\n f = False\r\n break\r\nprint(s*k if f else -1)", "k = int(input())\r\ns = input()\r\nn = len(s)\r\nif(n%k == 0):\r\n mp = dict()\r\n for i in s:\r\n if(i not in mp):\r\n mp[i] = 0\r\n mp[i]+=1\r\n flag = 0\r\n res = \"\"\r\n for i in mp:\r\n if(mp[i]%k != 0):\r\n print(-1)\r\n flag = 1\r\n break\r\n else:\r\n res+= \"\".join([i]*(mp[i]//k))\r\n if(flag == 0):\r\n ls = [res]*k\r\n res = \"\".join(ls)\r\n print(res)\r\nelse:\r\n print(-1)\r\n ", "from collections import Counter\r\ndef reorder_string(s, k):\r\n counts = Counter(s)\r\n\r\n for count in counts.values():\r\n if count % k != 0:\r\n return \"-1\" \r\n\r\n result = \"\"\r\n for letter, count in counts.items():\r\n result += letter * (count // k)\r\n result *= k\r\n return result\r\nk = int(input())\r\ns = input().strip()\r\nprint(reorder_string(s, k))\r\n\r\n", "k = int(input())\r\ns = input()\r\ndic = {}\r\nfor i in s:\r\n if i not in dic: dic[i] = 1\r\n else: dic[i] += 1\r\n \r\ntemp = set(dic.values())\r\nt = 1\r\nfor i in temp: \r\n if i % k != 0: t = 0; break\r\n\r\n \r\nif t:\r\n ans = ''\r\n for i in dic: ans += i * (dic[i] // k)\r\n print(ans * k)\r\n \r\nelse: print(-1)\r\n", "#https://codeforces.com/problemset/problem/219/A\nfrom sys import stdin,stdout\n\n#\tuse this function just like you would use 'input()'\n#\t(for Fast Input)\ndef fin():\n\ts=stdin.readline()\n\treturn s[0:len(s)-1]\n\n#\tuse this function just like you would use 'print()'\n#\t(for Fast Output)\ndef fout(x=\"\",end=\"\\n\"):\n\tstdout.write(str(x)+str(end))\n\nk=int(fin())\ns=fin()\nfreq=[0 for x in range(26)]\nfor ch in s:\n\tfreq[ord(ch)-97]+=1\nisPossible=True\nfor x in freq:\n\tif x%k!=0:\n\t\tisPossible=False\n\t\tbreak\nif not isPossible:\n\tfout(-1)\nelse:\n\tans=\"\"\n\tidx=0\n\tfor x in freq:\n\t\tfor i in range(x//k):\n\t\t\tans=ans+chr(idx+97)\n\t\tidx+=1\n\tres=\"\"\n\tfor i in range(k):\n\t\tres+=ans\n\tfout(res)\n", "k=int(input())\r\ns=input()\r\nd={}\r\nans=\"\"\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n d[i]=0\r\nfor i in s:\r\n d[i]+=1\r\nfor i in d:\r\n if d[i]%k!=0:\r\n print(-1)\r\n break\r\nelse:\r\n for i in d:\r\n if d[i]:\r\n ans+=i*(d[i]//k)\r\n for i in range(k):\r\n print(ans,end=\"\")\r\n", "def fascist(s):\r\n f=\"\"\r\n for i in range(len(s)):\r\n if(s[i] not in f):\r\n f+=s[i]\r\n return f\r\nn=int(input())\r\ns=input()\r\nf=fascist(s)\r\nr=\"\"\r\ni=0\r\nfor i in range(len(f)):\r\n if((s.count(f[i])%n==0)):\r\n r+=(int(s.count(f[i])/n)*f[i])\r\n else:\r\n i=-1\r\n break\r\nif(i==-1):\r\n print(-1)\r\nelse:\r\n print(n*r)", "import sys\r\nk = int(input())\r\ns = input()\r\na = []\r\nc = []\r\nb = ''\r\nfor i in s:\r\n if i not in a:\r\n a.append(i)\r\n \r\nfor i in a:\r\n c.append(s.count(i))\r\n \t\r\nfor i in c:\r\n if (i%k != 0):\r\n print(-1)\r\n sys.exit()\r\n \r\nfor i in range(len(a)):\r\n b = b+a[i]*(c[i]//k)\r\n \r\nb = b+b*(k-1)\r\nprint(b)\r\n \r\n \r\n", "t=int(input())\r\na=input()\r\nd={}\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nc=0\r\nfor i in d:\r\n if d[i]%t==0:\r\n c+=1\r\nif c!=len(d):\r\n print(-1)\r\nelse:\r\n k=\"\"\r\n for i in d:\r\n k=k+i*(d[i]//t)\r\n print(k*t)\r\n", "n = int(input())\r\ns = input()\r\nans = \"\"\r\nhelp_dict ={}\r\ncond = True \r\nfor ele in s : \r\n if ele not in help_dict: \r\n help_dict[ele]=1\r\n else: \r\n help_dict[ele]+=1 \r\n\r\nfor key,val in help_dict.items(): \r\n \r\n if val%n==0: \r\n ans += (val//n)*key\r\n else: \r\n cond = False\r\n break \r\nif cond : \r\n print(ans*n)\r\nelse: \r\n print(\"-1\")", "res = dict()\r\nmarker = True\r\nk = int(input())\r\nfor i in input():\r\n res[i] = res.get(i, 0) + 1\r\ns = ''\r\nfor key in res.keys():\r\n if res[key]%k == 0:\r\n res[key] = int(res[key]/k)\r\n else:\r\n marker = False\r\n print(-1)\r\n break\r\nif marker:\r\n for i in range(k):\r\n for key, value in res.items():\r\n s += key * value\r\n print(s)", "def main():\r\n k=int(input())\r\n s=list(input())\r\n set_s = list(set(s)) ;set_s.sort()\r\n nums=[]; x=[]\r\n for each in set_s:\r\n i =s.count(each)\r\n if i%k!=0:\r\n return -1\r\n else:\r\n nums.append(i//k)\r\n for i in range(len(nums)):\r\n for j in range(nums[i]):\r\n x.append(set_s[i])\r\n x= x*k\r\n return ''.join(x)\r\n \r\nprint(main())", "\r\nk=int(input())\r\ns=input()\r\n\r\narr=[0 for i in range(26)]\r\n\r\nfor i in range(len(s)):\r\n arr[ord(s[i])-ord('a')]+=1\r\n\r\na=0\r\nfor i in range(26):\r\n if arr[i]%k!=0:\r\n a=1\r\n break\r\n\r\n\r\nif a==1:\r\n print(-1)\r\nelse:\r\n ans=[\"\" for i in range(k)]\r\n\r\n for i in range(26):\r\n x=arr[i]//k\r\n for j in range(k):\r\n ans[j]+=x*(chr(i+97))\r\n\r\n print(''.join(ele for ele in ans))\r\n\r\n", "n = int(input())\r\ns = input()\r\na = {}\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] % n != 0:\r\n print(-1)\r\n exit()\r\nans = ''\r\nfor i in a:\r\n ans += i*(a[i]//n)\r\nans *= n\r\nprint(ans)\r\n", "def is_k_string_possible(s, k):\r\n # Count the frequency of each character in the string\r\n char_count = [0] * 26 # Assuming only lowercase English letters\r\n\r\n for char in s:\r\n char_count[ord(char) - ord('a')] += 1\r\n\r\n # Check if it's possible to create a k-string\r\n for i in range(26):\r\n if char_count[i] % k != 0:\r\n return False\r\n\r\n return True\r\n\r\ndef reorder_to_k_string(s, k):\r\n if not is_k_string_possible(s, k):\r\n print(-1)\r\n return\r\n\r\n char_count = [0] * 26\r\n\r\n # Reorder the string\r\n result = []\r\n for char in s:\r\n char_count[ord(char) - ord('a')] += 1\r\n\r\n for i in range(26):\r\n result.append(chr(ord('a') + i) * (char_count[i] // k))\r\n\r\n print(\"\".join(result * k))\r\n\r\n# Input\r\nk = int(input())\r\ns = input()\r\n\r\n# Reorder the string and print the result\r\nreorder_to_k_string(s, k)\r\n", "from collections import Counter\r\n\r\ndef func(k,s):\r\n n = len(s)\r\n \r\n if n==1:\r\n return s\r\n \r\n elif n%k!=0:\r\n return -1\r\n \r\n d = Counter(s)\r\n \r\n res = []\r\n \r\n for key in d:\r\n if d[key]%k!=0:\r\n return -1\r\n break\r\n \r\n for i in range(d[key]//k):\r\n res.append(key)\r\n \r\n return ''.join(i for i in res*(n//(len(res))))\r\n \r\n \r\nk=int(input())\r\ns=input()\r\n\r\nprint(func(k,s))", "k = int(input())\r\nletters = input()\r\n\r\nfrom collections import defaultdict\r\nletter_count = defaultdict(int)\r\n\r\nfor c in letters:\r\n if c in letter_count.keys():\r\n letter_count[c] += 1\r\n else:\r\n letter_count[c] = 1\r\n\r\ncounts = defaultdict(int)\r\nunit = ''\r\nfor key, value in letter_count.items():\r\n if value % k != 0:\r\n print(-1)\r\n break\r\n else:\r\n counts[key] = int(value / k)\r\nif value % k == 0:\r\n for keys, values in counts.items():\r\n unit += keys * values\r\n print(unit * k)\r\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\ncntr = Counter(s)\r\n\r\nif any(cntr[key]%n for key in cntr):\r\n print(-1)\r\nelse:\r\n print((\"\".join(key*(cntr[key]//n) for key in cntr))*n)", "from collections import *\r\n\r\nn = int(input())\r\ns = input()\r\nm = Counter(s)\r\nfor i in m:\r\n if m[i] % n != 0:\r\n print(-1)\r\n break\r\nelse:\r\n ans = ''\r\n for i in m:\r\n ans += (i * (m[i]//n))\r\n print(ans*n)", "k = int(input())\r\ns = input()\r\nd = {}\r\nflag = 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 i in d:\r\n if d[i]%k != 0:\r\n flag = 1\r\n break\r\n else:\r\n d[i] //= k\r\n\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n ans = ''\r\n for i in d:\r\n ans += d[i]*i\r\n ans = ans*k\r\n print(ans)\r\n \r\n", "k=int(input())\r\ns=input()\r\n\r\nnew_s=''\r\nflag=True\r\nfrom collections import Counter\r\n\r\nx=Counter(s)\r\n\r\nfor key,val in x.items():\r\n if val%k !=0:\r\n print(-1)\r\n flag=False\r\n break\r\n else:\r\n new_s=new_s+key*(val//k)\r\n\r\nif flag==True:\r\n print(new_s*k)\r\n", "def solve(s,k):\n cnt = {}\n for c in s:\n if c in cnt:\n cnt[c] += 1\n else:\n cnt[c] = 1\n for c in cnt:\n if cnt[c]%k !=0:\n return \"-1\"\n ret = \"\"\n for c in cnt:\n ret += c*(cnt[c]//k)\n return ret*k\n\nk=int(input())\ns=input()\nprint (solve(s,k))\n", "from collections import Counter\r\n\r\nk = int(input())\r\ns = input()\r\ncnt = [list(elem) for elem in Counter(s).most_common()]\r\nflag = False\r\n\r\nfor i in cnt :\r\n if i[1]%k != 0: \r\n flag = True\r\n break\r\n else: i[1] //= k\r\n \r\nif flag: print(-1) \r\nelse:\r\n arr = ''.join([(i[0]*i[1]) for i in cnt])\r\n print(arr*k)", "from collections import Counter\r\n\r\nk=int(input())\r\ns=input()\r\nd=Counter(s)\r\ncheck=0\r\nfor i in d:\r\n if d[i]%k!=0:\r\n check+=1\r\n print(-1)\r\n break\r\n else:\r\n d[i]=d[i]//k\r\n\r\nif check==0:\r\n ans=\"\"\r\n for i in d:\r\n ans+=i*d[i]\r\n print(ans*k)", "def k_string():\r\n k = int(input())\r\n message = list(input())\r\n letter_counter = [[], []]\r\n for symbol in message:\r\n if symbol in letter_counter[0]:\r\n letter_counter[1][letter_counter[0].index(symbol)] += 1\r\n else:\r\n letter_counter[0].append(symbol)\r\n letter_counter[1].append(1)\r\n possible = True\r\n for number in letter_counter[1]:\r\n if (number / k) % 1 != 0:\r\n possible = False\r\n if possible is True:\r\n for i in range(len(letter_counter[1])):\r\n letter_counter[1][i] = letter_counter[1][i] // k\r\n output_multiple = []\r\n for letter_position in range(len(letter_counter[1])):\r\n for symbol in range(letter_counter[1][letter_position]):\r\n output_multiple.append(letter_counter[0][letter_position])\r\n print(\"\".join(output_multiple) * k)\r\n else:\r\n print(\"-1\")\r\n\r\n\r\nk_string()", "def main():\r\n n=int(input())\r\n s=sorted(input())\r\n k=s[::n]*n\r\n if sorted(k)==s:\r\n print(''.join(k))\r\n else:\r\n print(-1)\r\n \r\nmain()", "k=int(input())\r\ns=input()\r\nnewstr=\"\"\r\nd={}\r\nfor x in s:\r\n if x in d:\r\n d[x]+=1 \r\n else:\r\n d[x]=1\r\nflag=0\r\nfor y in d:\r\n if(d[y]%k!=0):\r\n print(-1)\r\n flag=-1\r\n break\r\nif(flag!=-1):\r\n for z in d:\r\n newstr=newstr+z*int(d[z]/k)\r\n print(k*newstr)", "n=int(input())\r\ns=input()\r\nd={}\r\nflag=0\r\nfor i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nans=\"\"\r\nfor i in d:\r\n if d[i]%n!=0:\r\n flag=1\r\n break\r\n else:\r\n for x in range(d[i]//n):\r\n ans+=i\r\nif flag==1:\r\n print(-1)\r\nelse:\r\n res=\"\"\r\n for i in range(n):\r\n res=res+ans\r\n print(res)", "n = int(input())\r\n\r\ns = input()\r\nd = dict()\r\nfor x in s:\r\n if x not in d:\r\n d[x] = 1\r\n else:\r\n d[x] += 1\r\nif(any(x%n!=0 for x in d.values())):\r\n print(-1)\r\nelse:\r\n for k,v in d.items():\r\n d[k] //= n\r\n s1 = ''\r\n for k,v in d.items():\r\n s1 += k*v\r\n print(s1*n)", "import os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom collections import deque, Counter,defaultdict as dft\r\nfrom heapq import heappop ,heappush\r\nfrom math import log,sqrt,factorial,cos,tan,sin,radians,log2,ceil,floor,gcd\r\nfrom bisect import bisect,bisect_left,bisect_right\r\nfrom decimal import *\r\nimport sys,threading\r\nfrom itertools import permutations, combinations\r\nfrom copy import deepcopy\r\ninput = sys.stdin.readline\r\n\r\ndef modI(a, m):\r\n\r\n m0=m\r\n y=0\r\n x=1;\r\n if(m==1): return 0;\r\n while(a>1):\r\n \r\n q=a//m;\r\n t=m;\r\n m=a%m;\r\n a=t;\r\n t=y;\r\n y=x-q*y;\r\n x=t;\r\n \r\n if(x<0):x+=m0;\r\n return x;\r\n\r\n\r\nii = lambda: int(input())\r\nsi = lambda: input().rstrip()\r\nmp = lambda: map(int, input().split())\r\nms= lambda: map(str,input().strip().split(\" \"))\r\nml = lambda: list(mp())\r\nmf = lambda: map(float, input().split())\r\n\r\n\r\nalphs = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n\r\n# stuff you should look for\r\n\t# int overflow, array bounds\r\n\t# special cases (n=1?)\r\n\t# do smth instead of nothing and stay organized\r\n\t# WRITE STUFF DOWN\r\n\t# DON'T GET STUCK ON ONE APPROACH\r\n\r\n#\r\n\r\ndef solve():\r\n \r\n n=ii()\r\n s=input()\r\n dct=Counter(s)\r\n ls=[]\r\n for c in dct:\r\n if dct[c]%n!=0:\r\n print(-1)\r\n return\r\n ls.append(c* (dct[c]//n))\r\n res=\"\".join(ls)\r\n res=res*n\r\n print(res)\r\n \r\n\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=gcd):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n \r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n \r\n return self._func(res_left, res_right)\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\n\r\n# endregion\r\n\r\n \r\nif __name__ == \"__main__\":\r\n tc=1\r\n #tc = ii()\r\n for i in range(tc):\r\n \tsolve()", "n=int(input())\r\nq=sorted(input())\r\nx=q[::n]*n\r\nprint([-1,\"\".join(x)] [sorted(x) == q])\r\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nl = len(s)\r\ns = sorted(s)\r\ncnt = ''\r\nc=0\r\nfor i in range(l):\r\n if(i%n==0):\r\n cnt=s[i]\r\n if(s[i]==cnt):\r\n c+=1\r\nif(l==c and c%n==0):\r\n for i in range(n):\r\n for j in range(0,l,n):\r\n print(s[j],end=\"\")\r\nelse:\r\n print(-1)", "# 219A - k-String\r\n\r\nn, s, x, k = int(input()), input(), {}, None\r\nfor i in s:\r\n if i not in x:\r\n y = s.count(i)\r\n if y % n == 0:\r\n x[i] = y\r\n else:\r\n k = False\r\n break\r\nif k == False:\r\n print(-1)\r\nelse:\r\n y = \"\"\r\n for i in x:\r\n y += i*(x[i]//n)\r\n print(y*n)\r\n", "S1 = 'abcdefghijklmnopqrstuvwxyz'\r\narr=[0]*26\r\nk=int(input())\r\nx=input().strip()\r\nif len(x)%k!=0:\r\n print(-1)\r\n exit()\r\nflag=True \r\nfor i in range(len(x)):\r\n arr[ord(x[i])-97]=arr[ord(x[i])-97]+1\r\nans = ''\r\nfor i in range(26):\r\n if arr[i]%k!=0:\r\n flag = False\r\n break\r\n ans += (arr[i]//k)*S1[i]\r\nprint(ans*k if flag else -1) \r\n\r\n \r\n ", "k=int(input())\r\ns=input()\r\nif k==1:print(s)\r\nelse:\r\n sets=set(s)\r\n dic={}\r\n for i in sets:dic[i]=s.count(i)\r\n for i in dic:\r\n if dic[i]%k:\r\n print(-1)\r\n break\r\n else:dic[i]=dic[i]//k\r\n else:\r\n for i in range(k):\r\n for j in dic:\r\n print(j*dic[j],end='')\r\n", "n=int(input())\r\na=sorted(input())\r\nx=a[::n]*n\r\nif sorted(x)==a:\r\n print(''.join(x))\r\nelse:print(-1) ", "k = int(input())\r\ns = input()\r\nset = set()\r\nlist = []\r\nb = 0\r\nfor i in s:\r\n set.add(i)\r\nfor j in set:\r\n a = s.count(j)\r\n if a%k==0:\r\n list.append(int(a/k)*j)\r\n else:\r\n b = 1\r\n print(-1)\r\n break\r\nn = ''.join([str(elem) for elem in list])\r\nans = k*n\r\nif b==0:\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n l=int(input().strip())\r\n s=input().strip()\r\n counter=[0]*26\r\n for c in s:\r\n counter[ord(c)-97]+=1\r\n ans=\"\"\r\n i=0\r\n temp=l\r\n while i<len(counter):\r\n if counter[i]!=0:\r\n if counter[i]%temp!=0:\r\n print(-1)\r\n return\r\n ans+=chr(i+97)*(counter[i]//temp)\r\n i+=1\r\n print(ans*temp)\r\n return\r\n\r\nif __name__ == '__main__':\r\n main()", "k = int(input())\r\nobj = {}\r\ns = input()\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in obj:\r\n obj[s[i]] = 1\r\n else:\r\n obj[s[i]] +=1\r\n\r\nfor i in obj:\r\n if obj[i]%k !=0:\r\n print(-1)\r\n exit()\r\nans = '' \r\nfor i in obj:\r\n ans += i*(obj[i]//k)\r\n\r\nans *= k\r\nprint(ans) ", "x = int(input())\r\nstring = sorted(input())\r\ncount=0\r\nfor i in range(len(string)):\r\n if i%x==0:\r\n ch=string[i]\r\n if string[i]==ch:\r\n count+=1\r\nif count==len(string) and count%x==0:\r\n for i in range(x):\r\n for j in range(0,len(string),x):\r\n print(string[j],end='')\r\nelse:\r\n print(-1)", "k = int(input())\ns = input()\ns = sorted(s)\nn = len(s)\ns1 = \"\"\nflag = True\n\nif n%k:\n print(-1)\nelse:\n for i in range(0,n,k):\n # print(\"\".join(s[i:i+k]))\n # print(s[i]*k)\n if \"\".join(s[i:i+k]) == s[i]*k:\n s1+=s[i]\n else:\n flag = False\n print(-1)\n break\n if flag:\n print(s1*k)\n", "import sys\r\ns=int(sys.stdin.readline().strip())\r\nt=sys.stdin.readline().strip();y=sorted(t)\r\nk=\"\"\r\nfor i in range(0,len(y), s):\r\n k += y[i]\r\nprint(k*s if sorted(k*s) == y else -1)", "from collections import Counter\r\n\r\nk = int(input())\r\nstr = input()\r\n\r\ncounter = Counter(str)\r\nprinted = False\r\nword = \"\"\r\n\r\nfor ele in counter:\r\n if counter[ele] % k != 0:\r\n print(-1)\r\n printed = True\r\n break\r\n else:\r\n word += ele * (counter[ele]//k)\r\n\r\nif not printed:\r\n print(word*k)\r\n", "def funct(k, s):\r\n n = len(s)\r\n arr = [0] * 26\r\n for char in s:\r\n arr[ord(char) - ord('a')] += 1\r\n for i in range(26):\r\n if arr[i] % k != 0:\r\n return -1\r\n result = ''\r\n for i in range(26):\r\n result += chr(ord('a') + i) * (arr[i] // k)\r\n result =result* k\r\n return result\r\nk = int(input())\r\ns = input().strip()\r\n \r\nresult = funct(k, s)\r\nprint(result)", "unit = int(input())\nstr = sorted(input())\nprint(\"\".join(str[::unit]*unit) if sorted(str[::unit]*unit) == str else -1)\n\t \t\t\t \t\t \t \t \t \t\t\t \t\t\t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\ncnt = [0] * 26\r\ns = list(input().rstrip())\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nok = 1\r\nfor i in cnt:\r\n if i % k:\r\n ok = 0\r\n break\r\nif not ok:\r\n ans = -1\r\nelse:\r\n x = []\r\n for i in range(26):\r\n x.append(chr(i + 97) * (cnt[i] // k))\r\n ans = \"\".join(x) * k\r\nprint(ans)", "def solve(k, s):\r\n from collections import Counter\r\n d = Counter(s) \r\n for i in d:\r\n if d[i]%k:\r\n return -1\r\n ans = \"\"\r\n for i in d:\r\n ans+=i*(d[i]//k)\r\n ans = ans*k\r\n return ans\r\n\r\nk = int(input())\r\ns = input()\r\nprint(solve(k, s))\r\n ", "k = int(input())\r\ns = input()\r\nvals = {}\r\na=\"\"\r\nfor i in s:\r\n vals[i] = vals.get(i,0)+1\r\nfor i in vals:\r\n if vals[i]%k != 0:\r\n print(-1)\r\n break\r\n else:\r\n a+= i*(vals[i]//k)\r\nelse:\r\n print(a*k)", "from collections import Counter\r\nk=int(input())\r\ns=input()\r\nc=Counter(s)\r\n\r\nf=0\r\nst=set(c.keys())\r\nfor i in c.values():\r\n if i%k!=0:\r\n print(-1)\r\n f=1\r\n break\r\n \r\ns=\"\"\r\nif(f==0):\r\n for key,val in c.items():\r\n s+=key*(val//k)\r\n print(s*k)", "k = int(input())\ns = input()\nl = []\nd = {}\n\nfor i in s:\n if i in l:\n d[i] += 1\n else:\n l.append(i)\n d[i] = 1\n\nfor i in l:\n if(d[i]%k != 0):\n print(-1)\n break\nelse:\n s2 = \"\"\n for i in l:\n s2 += i*(d[i]//k)\n print(s2*k)", "n = int(input())\r\ns = input()\r\n\r\nmp = {c: 0 for c in s}\r\n\r\nfor c in s:\r\n mp[c] += 1\r\n\r\nret = ''\r\nfor c, v in mp.items():\r\n if v % n:\r\n print(-1)\r\n exit(0)\r\n else:\r\n ret += (c * (v // n))\r\nfor _ in range(n):\r\n\r\n print(ret, end='')\r\nprint()", "# https://codeforces.com/problemset/problem/219/A\r\nfrom collections import defaultdict\r\ndef k_string(k, s):\r\n \"\"\"\r\n 2\r\n aazz\r\n {\r\n a: 2\r\n z: 2\r\n }\r\n ____\r\n 2\r\n aazz\r\n {\r\n a: 2\r\n z: 2\r\n }\r\n\r\n \"\"\"\r\n mp = defaultdict()\r\n # count chars\r\n for char in s:\r\n if char in mp:\r\n curr_count = mp.get(char)\r\n mp.update({char: curr_count + 1})\r\n else:\r\n mp.update({char: 1})\r\n\r\n kstr = \"\"\r\n for key in mp:\r\n count = mp.get(key)\r\n if count%k != 0:\r\n return -1\r\n kstr += key * (count//k)\r\n\r\n return kstr * k\r\n\r\nif __name__ == \"__main__\":\r\n k = int(input())\r\n s = str(input())\r\n print(k_string(k, s))", "n=int(input())\r\na=input()\r\nal=len(a)\r\nk=0\r\nb=\"\".join(sorted(a))\r\nfor i in range(len(b)):\r\n if(i%n==0):\r\n s=b[i]\r\n if(b[i]==s):\r\n k+=1\r\nif(al==k and k%n==0):\r\n for i in range(0,n):\r\n for j in range(0,len(b),n):\r\n print(b[j],end=\"\")\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=input()\r\nr=''.join(sorted(s))\r\nx=(r[::n])*n\r\nr1=''.join(sorted(x))\r\nif(r==r1):\r\n print(x)\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nstring = input()\r\n\r\nfreq =dict()\r\n\r\nfor i in string:\r\n if i in freq:\r\n freq[i]+=1\r\n else:\r\n freq[i]=1\r\n\r\nflag = 0\r\nres = \"\"\r\nfor i in freq:\r\n if freq[i]%n == 0:\r\n pass\r\n else:\r\n flag=1\r\n break\r\n\r\nif flag==1:\r\n print(\"-1\")\r\nelse:\r\n for i in freq:\r\n res+=i*(freq[i]//n)\r\n\r\nprint(res*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, s):\r\n res = [[] for _ in range(N)]\r\n counts = Counter(s)\r\n\r\n for ch, v in counts.items():\r\n if v % N != 0:\r\n return -1\r\n\r\n for i in range(N):\r\n res[i].append(ch*(v//N))\r\n\r\n return \"\".join(\"\".join(str) for str in res)\r\n\r\n\r\nN = read_int()\r\ns = read()\r\n\r\nprint(solve(N, s))\r\n", "k = int(input())\r\nn = input()\r\nl = list(n)\r\nl1 = sorted(l)\r\nl2 = []\r\ni = 0\r\nflag=0\r\nwhile(i<len(l1)):\r\n f = 0\r\n for j in range(i , len(l1)):\r\n if(l1[i]==l1[j]):\r\n f = f+1\r\n if(f%k==0):\r\n l2.append(l1[i]*(f//k))\r\n i = i+f\r\n elif(f%k != 0):\r\n flag=1\r\n break\r\ns = ''.join(l2)\r\nif(flag==1):\r\n print(\"-1\")\r\nelse:\r\n print(s*k)\r\n", "k=int(input())\r\ns=input()\r\nlst=[0]*26\r\nfor i in s:\r\n lst[ord(i)-97]+=1\r\ncheck=1\r\nfor i in lst:\r\n if i%k!=0:\r\n check=0\r\n break\r\nif check==0:\r\n print(-1)\r\nelse:\r\n res=''\r\n for i in range(26):\r\n if lst[i]!=0:\r\n res+=(lst[i]//k)*chr(i+97)\r\n print(res*k)", "def solve(k, string):\r\n hashmap = {}\r\n n = len(string)\r\n for i in range(n):\r\n if string[i] not in hashmap.keys():\r\n hashmap[string[i]] = 1\r\n else:\r\n hashmap[string[i]] += 1\r\n count_map = {}\r\n for key in hashmap.keys():\r\n if hashmap[key] % k != 0:\r\n return -1\r\n count_map[key] = hashmap[key] // k\r\n result = \"\"\r\n for key in count_map.keys():\r\n result += key * count_map[key]\r\n result = result * k\r\n return result\r\n\r\ndef main():\r\n k = int(input())\r\n string = input().strip()\r\n print(solve(k, string))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict\r\n\r\nk = int(input())\r\ns = input()\r\nd = defaultdict(int)\r\n\r\nfor char in s:\r\n d[char] +=1\r\n\r\nflag = True\r\nfor v in d.values():\r\n if v%k != 0:\r\n print(-1)\r\n flag = False\r\n break\r\nif flag:\r\n ans = \"\"\r\n for char, v in d.items():\r\n ans += char*(v//k)\r\n \r\n print(ans*k)", "def ans():\r\n a=int(input())\r\n s=input()\r\n l=[]\r\n for i in s:\r\n l.append(i)\r\n b=set(l)\r\n c=0\r\n for i in b:\r\n if(l.count(i)%a!=0):\r\n c=1\r\n print(\"-1\")\r\n break\r\n d=\"\"\r\n if(c==0):\r\n for i in b:\r\n d=d+i*(l.count(i)//a)\r\n print(d*a)\r\nans()", "k=int(input())\r\ns=input()\r\nhmap={}\r\ncount=0\r\nfor item in s:\r\n hmap[item]=1+hmap.get(item,0)\r\nfor key,values in hmap.items():\r\n if values%k!=0 or values<k:\r\n count+=1\r\n print(-1)\r\n break\r\nif count==0:\r\n ans=\"\"\r\n for key,value in hmap.items():\r\n ans+=(key*(value//k))\r\n print(ans*k) \r\n\r\n\r\n \r\n\r\n", "'''input\n3\nabbabbabb\n\n\n'''\n\nk = int(input())\ns = str(input())\n\nuniq = list(set(s))\n\nknts = []\nfor it in uniq:\n\tknts.append(s.count(it))\n\nres = ''\nexists = True\nfor i in range(len(knts)):\n\tif knts[i]%k == 0:\n\t\tres += int(knts[i]/k) * uniq[i] \n\telse:\n\t\texists = False\n\t\tbreak \n\nif exists:\n\tprint(res*k)\nelse:\n\tprint(-1)", "from collections import Counter\r\ndef solve():\r\n K = int(input())\r\n org = input()\r\n data = Counter(org)\r\n array = []\r\n \r\n for key in data.keys():\r\n if data[key] % K != 0:\r\n return -1\r\n else:\r\n array.append(key*(data[key]//K))\r\n \r\n array.sort()\r\n output = \"\"\r\n for i in range(len(array)):\r\n output += array[i]\r\n \r\n output = output*K\r\n return output \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(solve())\r\n remained_test_cases -= 1", "import sys, threading\r\nimport math\r\nfrom math import log2,floor\r\nimport heapq\r\nfrom collections import defaultdict,deque\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nk =inp()\r\ns = insr()\r\ndicit = defaultdict(int)\r\n\r\nfor i in range(len(s)):\r\n dicit[s[i]] += 1\r\nans = \"\"\r\nfor key in dicit:\r\n x = dicit[key]\r\n if x % k != 0:\r\n print(-1)\r\n exit()\r\n x = dicit[key] // k\r\n ans += ((key) * x)\r\nfinal = \"\"\r\nfor i in range(k):\r\n final += ans\r\nprint(final)\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# lst = inlt()\r\n# lst.append(float(\"inf\"))\r\n# l = 0\r\n# ans = 0\r\n# for i in range(1,len(lst)):\r\n# if lst[i] <= lst[i-1]:\r\n# l = i\r\n# else:\r\n# ans = max(ans,(i-l)+1)\r\n# # ans= max(ans,(len(lst)) - l)\r\n# print(ans - 1)\r\n\r\n# def main(): \r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "import collections\r\n\r\nk = int(input())\r\ns = input()\r\n\r\ncounter = collections.Counter(s)\r\nnew_counter = collections.Counter()\r\nwrong = False\r\nfor c, i in counter.items():\r\n if i % k:\r\n wrong = True\r\n break\r\n else:\r\n new_counter[c] = i // k\r\n \r\nif wrong:\r\n print(-1)\r\nelse:\r\n print(\"\".join([c*i for c, i in new_counter.most_common()]) * k)", "n=int(input())\r\nA=list(input())\r\nD={}\r\nfor j in A:\r\n if j in D:\r\n D[j]+=1\r\n else:\r\n D[j]=1\r\nflag=True\r\nAns=''\r\nfor key,values in D.items():\r\n if values%n!=0:\r\n flag=False\r\n print(-1)\r\n break \r\n else:\r\n Ans+=key*(values//n)\r\nif flag==True:\r\n print(Ans*n)", "from collections import Counter\nk = int(input())\ns = str(input())\ndict = Counter(s)\nans = ''\nfor i in dict.keys():\n if dict[i]%k == 0:\n ans += i*(dict[i]//k)\n else :\n ans = -1\n break\nif ans == -1:\n print(ans)\nelse :\n print(ans*k)", "k = int(input())\r\ns = input()\r\n\r\nfreq = dict()\r\nfor i in s:\r\n if i in freq.keys():\r\n freq[i] += 1\r\n else:\r\n freq[i] = 1\r\nnews = \"\"\r\nflag = 1\r\nfor key,value in freq.items():\r\n if value%k != 0:\r\n flag = 0\r\n break\r\n else:\r\n n = value//k\r\n news += (key*n)\r\nif(flag):\r\n news *= k\r\n print(news)\r\nelse:\r\n print(-1)\r\n ", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nd = Counter(s) \r\nll = ''\r\nfor i in d:\r\n if d[i]%n==0:\r\n ll+=i*(d[i]//n)\r\n else:\r\n print(-1)\r\n break \r\nelse:\r\n print(ll*n)", "k = int(input())\r\ns = input()\r\ndef okay(s,k):\r\n d = {}\r\n li = []\r\n for i in s:\r\n d[i] = d.get(i,0)+1\r\n for i,v in d.items():\r\n if v%k!=0:\r\n return -1\r\n else:\r\n vv = v//k\r\n z = i*vv\r\n li.append(z)\r\n s = \"\".join(li)\r\n return s\r\nl = okay(s,k)\r\nif l!=-1:\r\n print(l*k)\r\nelse:\r\n print(-1)", "def sol(n,s):\r\n k = len(s)\r\n if k%n == 0:\r\n arr = [0]*256 \r\n for i in s:\r\n if arr[ord(i)] == 0:\r\n arr[ord(i)] = 1 \r\n else:\r\n arr[ord(i)]+=1 \r\n arr1 = []\r\n for i in range(len(arr)):\r\n if arr[i]!=0:\r\n arr1.append([chr(i),arr[i]])\r\n \r\n for i in range(len(arr1)):\r\n if arr1[i][1]%n != 0:\r\n return -1 \r\n else:\r\n res = ''\r\n for i in range(len(arr1)):\r\n k = int(arr1[i][1]/n) \r\n res+=(k*arr1[i][0])\r\n t = len(res)\r\n \r\n h = int(len(s)/t)\r\n return(h*res)\r\n \r\n else:\r\n return -1\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nans = sol(n,s)\r\nprint(ans)", "from collections import Counter\r\nk = int(input()) \r\ns = input() \r\ncnt = Counter(s) \r\nans = None\r\nS = ''\r\nfor i in cnt : \r\n if cnt[i]%k : ans = -1 ; break \r\n S += i*(cnt[i]//k)\r\nif ans == -1: print(-1)\r\nelse : print(S*k)", "k = int(input())\r\n\r\ns = input()\r\na = sorted(s)\r\n\r\nx = a[::k]*k\r\n\r\nprint([-1,\"\".join(x)][sorted(x) == a])", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\nimport math\r\ndef mp(): return map(int, sys.stdin.readline().split())\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 k = ri()\r\n s = rs()\r\n ans = \"\"\r\n chars = set()\r\n for i in s:\r\n chars.add(i)\r\n \r\n for i in chars:\r\n p = s.count(i)\r\n if p%k != 0:\r\n wi(-1)\r\n return\r\n ans += i * (p//k)\r\n \r\n ws(ans*k)\r\n\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "from collections import Counter\r\nn,s=int(input()),Counter(input())\r\nd={x:s[x]%n for x in s}\r\nif all(x==0 for x in d.values()):\r\n a=''\r\n for x in s:a+=x*(s[x]//n)\r\n print(a*n)\r\nelse:print(-1)", "from collections import defaultdict\r\nk=int(input())\r\ns=input()\r\nx=list(set(list(s)))\r\nc=0\r\nhash=defaultdict(lambda:0)\r\n\r\nfor i in s:\r\n if hash[ord(i)-97]==0:\r\n c+=1\r\n hash[ord(i)-97]+=1\r\n\r\nz=\"\"\r\nflag=True\r\nfor i in list(hash.values()):\r\n if i%k!=0:\r\n flag=False\r\n break\r\n\r\nif flag:\r\n for i in list(hash.keys()):\r\n z+=chr(i+97)*(hash[i]//k)\r\n print(z*k)\r\nelse:\r\n print(-1)\r\n\r\n\r\n# # print(len(s),len(x))\r\n# if len(x)==k:\r\n# summ=[]\r\n# for i in x:\r\n# summ.append(s.count(i))\r\n# if len(set(summ))==1:\r\n# print(''.join(x)*(len(s)//len(x)))\r\n# else:\r\n# print(-1)\r\n# else:\r\n# print(-1)", "n=int(input())\r\na=list(input())\r\nb=[]\r\nfor i in set(a):\r\n k=a.count(i)\r\n if k%n!=0:\r\n print(-1)\r\n exit(0)\r\n b.append(i*(k//n))\r\nprint((''.join(b))*n)", "n=int(input())\r\ns=input()\r\nl=[]\r\nl1=[]\r\nc=0\r\ns1=''\r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\n#print(l)\r\nfor i in l:\r\n l1.append(s.count(i))\r\n#print(l1)\r\nfor i in l1:\r\n if (i%n)!= 0:\r\n print('-1')\r\n c=c+1\r\n break\r\nif c==0:\r\n for i in range (len(l)):\r\n s1=s1+(l[i]*(int(l1[i]/n)))\r\n\r\nprint(s1*n)\r\n\r\n\r\n", "n = int(input())\r\n\r\ndic = {}\r\ns = input()\r\nfor c in s:\r\n dic[c] = dic.get(c, 0) + 1\r\n\r\nflag = True\r\nfor key in dic:\r\n if dic[key] % n != 0:\r\n flag = False\r\n break\r\n else:\r\n dic[key] = dic[key] // n\r\n\r\nif not flag:\r\n print(-1)\r\nelse:\r\n s = \"\"\r\n for key in dic:\r\n s += (key * dic[key])\r\n for _ in range(n):\r\n print(s, end=\"\")\r\n print()", "from collections import *\r\nk=int(input())\r\ns=input()\r\nd=Counter(s)\r\nans=''\r\nfor i in d:\r\n if(d[i]%k):\r\n ans=-1\r\n break\r\n else:\r\n d[i]//=k\r\nif(ans==-1):\r\n print(-1)\r\nelse:\r\n for i in range(k):\r\n for j in d:\r\n ans+=j*d[j]\r\n print(ans)", "k=int(input())\ns=list(input())\nd={}\nfor i in s:\n if i not in d:\n d[i]=1\n else:\n d[i]+=1\n\nkey=list(d.keys())\nval=list(d.values())\n\nc=0\nfor i in val:\n if i%k==0:\n continue\n else:\n c=-1\n print(c)\n break\n\nl=[]\ns=\"\"\nif c!=-1:\n for i in val:\n l.append(int(i/k))\n # print(l)\n for j in range(len(key)):\n s=s+(key[j]*l[j])\n\n print(s*k)\n", "k = int(input())\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\nres = \"\"\r\nflag = 0\r\nfor i in dic:\r\n if dic[i]%k == 0:\r\n pass\r\n else:\r\n flag = 1\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n for i in dic:\r\n res+=i*(dic[i]//k)\r\nprint(res*k)\r\n\r\n", "k = int(input())\r\ns=input()\r\n\r\nb = list(set(s))\r\nf=1\r\na=[]\r\nfor j in range(len(b)):\r\n if(s.count(b[j])%k!=0):\r\n f=0\r\n print(-1)\r\n break\r\n a.append(s.count(b[j])//k)\r\n\r\nif(f==1):\r\n e=''\r\n for j in range(len(a)):\r\n c=a[j]\r\n while(c!=0):\r\n e+=b[j]\r\n c-=1\r\n g=''\r\n for j in range(k):\r\n g+=e\r\n print(g)\r\n", "n = int(input())\r\ns = sorted(input())\r\na = s[::n]*n\r\nprint([\"-1\",\"\".join(a)][sorted(a)==s])", "k = int(input())\ns = input().strip()\n\nn = len(s)\nif n % k != 0:\n print(\"-1\")\n exit()\n\ncnt = [0] * 26\nfor c in s:\n cnt[ord(c) - ord('a')] += 1\nfor freq in cnt:\n if freq % k != 0:\n print(\"-1\")\n exit()\n\nans = ''.join(chr(i + ord('a')) * (cnt[i] // k) for i in range(26))\nprint(ans * k)\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nc = Counter(s)\r\nc_most = c.most_common()\r\nfor i in range(len(c_most)):\r\n if c_most[i][1] % n != 0:\r\n print(-1)\r\n exit()\r\nans = [tup[0] * (tup[1]//n) for tup in c_most]\r\nres = \"\"\r\nfor i in ans:\r\n res += i\r\nprint(res*n)", "mIn=int(input())\r\ns=list(input())\r\nk=list(set(s))\r\nl=[]\r\ncount=0\r\nfor i in k:\r\n l.append(s.count(i)//mIn if (s.count(i)//mIn==s.count(i)/mIn) else 0)\r\n count+=1\r\nif l.count(0)>0:\r\n print(-1)\r\nelse:\r\n str1=''\r\n i=0\r\n for i in range(count):\r\n str1+=k[i]*l[i]\r\n print(str1*mIn)", "n=int(input())\nword=input()\nk=[]\nfor x in range (len(word)):\n a=word[x]\n c=word.count(a)\n if c%n!=0:\n print(-1)\n exit()\n if a not in k:\n for i in range(int(c/n)):\n k.append(a)\n\nstring=\"\".join(k)\nprint(string*n)\n", "from collections import defaultdict\r\nd = defaultdict(int)\r\ndef func():\r\n k = int(input())\r\n s = input()\r\n\r\n for i in s:\r\n d[i] += 1\r\n \r\n ans = []\r\n letters = d.keys()\r\n for i in letters:\r\n if d[i] % k != 0:\r\n return -1\r\n\r\n while len(ans) < len(s):\r\n for i in letters:\r\n how_many = d[i] // k\r\n for _ in range(how_many):\r\n ans.append(i)\r\n return \"\".join(ans)\r\n\r\nprint(func())\r\n", "from collections import Counter\r\n\r\nk = int(input())\r\ns = input()\r\n \r\ncount = Counter(s)\r\n \r\ndef solve(k,count):\r\n for key,value in count.items():\r\n if value<k or value%k!=0:\r\n return -1\r\n \r\n res = \"\"\r\n for key,value in count.items():\r\n res+=(key*(value//k))\r\n \r\n return res*k\r\n \r\nans = solve(k,count)\r\nprint(ans)", "k=int(input())\r\ns=str(input())\r\nl=[0]*26\r\nfor i in range(len(s)):\r\n l[ord(s[i])-97]+=1\r\nflag=0\r\nans=\"\"\r\nfor j in range(26):\r\n if(l[j]%k!=0):\r\n flag=1\r\n break\r\n elif(l[j]!=0):\r\n ans+=chr(j+97)*int((l[j]/k))\r\nif(flag):\r\n print(-1)\r\nelse:\r\n print(ans*k)", "n=int(input())\r\ns=list(input())\r\nm=list(set(s))\r\np=\"\"\r\nflag=0\r\nfor i in m:\r\n a=s.count(i)\r\n \r\n if n==1:\r\n p=\"\".join(s)\r\n break\r\n if a%n!=0:\r\n flag=1\r\n break\r\n else:\r\n k=int(a//n)\r\n p=p+i*k\r\nif flag!=1:\r\n \r\n p=p*n\r\n print(p)\r\nelse:\r\n print('-1')", "n=int(input())\r\na=sorted(input())\r\nx=a[::n]*n\r\nprint([-1,\"\".join(x)][sorted(x) == a])", "\r\nk=int(input())\r\ns=input()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=[]\r\nf=1\r\n\r\nfor i in range(26):\r\n b.append(s.count(a[i]))\r\n if b[i]%k!=0:\r\n f=0\r\n break\r\nif f==1 and len(s)%k==0:\r\n for j in range(k):\r\n for i in range(26):\r\n print(a[i]*int(b[i]/k),end='')\r\n\r\n\r\nelse:\r\n print(-1)", "from collections import Counter as cnt\r\nn,s=int(input()),input()\r\nif n==1: print(s)\r\nelse:\r\n c,f,a,b,k=cnt(s),0,[],[],\"\"\r\n for i in c:\r\n if c[i]%n==0:\r\n a.append(i)\r\n b.append(c[i]//n)\r\n else:\r\n f=1\r\n break\r\n if f: print(\"-1\")\r\n else: \r\n for i in range(len(a)):\r\n k+=a[i]*b[i]\r\n print(n*k)", "#ivnik jasnah\r\nk = int(input())\r\ns = sorted(str(input()))\r\nstring_k = s[::k] * k\r\nprint(-1 if sorted(string_k) != s else \"\".join(string_k))", "n=int(input())\r\ns=input()\r\n\r\nd={}\r\nfor x in s:\r\n if x in d:\r\n d[x]=d[x]+1\r\n else:\r\n d[x]=1\r\nc=0\r\nfor x in d:\r\n if((d[x]%n)!=0):\r\n c=1\r\n print(\"-1\")\r\n break\r\nbig=[]\r\nif(c==0):\r\n for x in d:\r\n tem=d[x]/n\r\n for i in range(int(tem)):\r\n big.append(x)\r\n\r\ns=\"\"\r\nfor x in big:\r\n s=s+x\r\ny=s\r\nfor i in range(n-1):\r\n s=s+y\r\nprint(s)\r\n", "def main():\n n = int(input())\n a = input()\n s = ''\n d = {}\n for x in a:\n d[x] = a.count(x)\n for x in d.values():\n if x % n != 0:\n print(-1)\n return\n\n for x in d.keys():\n temp = x * (d[x]//n)\n s = f'{s}{temp}'\n print(s*n)\n\n\n\nt = 1\n# t = int(input())\nwhile t:\n main()\n t-=1", "x=int(input())\r\nstr= input()\r\ndic={}\r\nfor i in str:\r\n if i in dic.keys():\r\n dic.update({i:dic.get(i)+1})\r\n else:\r\n dic.update({i:1})\r\na=0\r\nu=\"\"\r\nfor i in dic.values():\r\n if (i/x).is_integer():\r\n a+=1\r\n continue\r\n else:\r\n print(-1)\r\n break\r\n\r\nif a==len(dic.values()):\r\n for i in dic.keys():\r\n u+= int(int(dic.get(i))/x)*i\r\nprint(x*u)", "k = int(input())\r\ns = input()\r\n\r\nnums = set(s)\r\n\r\nw = True\r\n\r\nfor i in nums:\r\n if s.count(i) % k != 0:\r\n w = False\r\n break\r\n \r\n\r\nif w:\r\n b = \"\"\r\n for a in nums:\r\n b += a * (s.count(a) // k)\r\n \r\n print(b * k)\r\nelse:\r\n print(-1)", "k=int(input())\r\ns=sorted(input())\r\nans=s[::k]*k\r\n\r\nx = \"\".join(ans)\r\nif sorted(x)==s:\r\n print(x)\r\nelse:\r\n print(-1)", "import collections\r\n\r\nv=int(input())\r\ns=input()\r\nd=collections.Counter(s)\r\nfor k in d.keys():\r\n if d[k]%v!=0:\r\n print(-1)\r\n exit()\r\ns=''\r\nfor k in d.keys():\r\n s+=k*(d[k]//v)\r\nprint(s*v)", "k=int(input())\r\na=input()\r\nc=set(a)\r\nd=len(c)\r\ne=[]\r\nfor i in c:\r\n if a.count(i)%k!=0:\r\n print('-1')\r\n exit()\r\n else:\r\n e.append([i,int(a.count(i)/k)])\r\nfor l in range(k):\r\n for j in e:\r\n print(j[0]*j[1],end='')\r\nprint()", "n,s = int(input()),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\nres=''\r\nflag=1\r\nfor i in d:\r\n if d[i]%n!=0:\r\n flag=0\r\n break\r\n else:\r\n res+=i*(d[i]//n)\r\nif flag:\r\n print(res*n)\r\nelse:\r\n print(-1)\r\n", "k = int(input())\r\ns = input()\r\ns1 = ''\r\nfor i in set(s):\r\n s1 += i * (s.count(i) // k)\r\nprint(s1 * k if len(s) == len(s1) * k else -1)", "k = int(input())\ns = input()\nhist = {}\nfor char in s:\n\thist[char] = hist.get(char, 0) + 1\nflg = False\nfor char in hist:\n\tif hist[char]%k!=0:\n\t\tflg = True\n\t\tprint(-1)\n\t\tbreak\nif not flg:\n\top = \"\"\n\tfor char in hist:\n\t\top += char*(hist[char]//k)\n\tprint(op*k)\n", "n=int(input())\r\nl=list(input())\r\ns=set(l)\r\n\r\nflag=0\r\n\r\nfor i in s:\r\n op=l.count(i)\r\n if op<n:\r\n flag=1\r\n else:\r\n \r\n if op>n:\r\n if op%n!=0:\r\n flag=1\r\n \r\nif flag==1:\r\n print(-1)\r\nelse:\r\n \r\n res=\"\"\r\n for i in range(n):\r\n for j in s:\r\n res+=j*(l.count(j)//n)\r\n \r\n print(res)", "\nn=int(input())\nx=str(input())\npor=set(x)\ns=0\ng=\"\"\nfor i in por:\n if x.count(i)%n!=0:\n s=1\n print(\"-1\")\n break\n else:\n g+=x.count(i)//n*i\n\nif s == 0:\n print(g*n)\n\t \t\t \t\t \t \t\t \t\t \t\t\t \t \t\t \t\t\t", "k = int(input())\r\nvisited = {}\r\nword = input()\r\n\r\nfor c in word:\r\n if not c in visited:\r\n visited[c] = 0\r\n visited[c] += 1\r\n\r\nresult = []\r\n\r\nfor c in visited:\r\n if visited[c] % k == 0:\r\n result.append(c * (visited[c] // k))\r\n else:\r\n print(-1)\r\n exit(0)\r\nprint(''.join(result) * k)\r\n", "from collections import Counter\r\n\r\ndef rearrange_to_k_string(k, s):\r\n n = len(s)\r\n freq = Counter(s)\r\n \r\n for char in freq:\r\n if freq[char] % k != 0:\r\n return \"-1\"\r\n \r\n result = \"\"\r\n for _ in range(k):\r\n for char in freq:\r\n result += char * (freq[char] // k)\r\n \r\n return result\r\n\r\ndef main():\r\n k = int(input()) # Number of concatenated copies (k-string)\r\n s = input() # Input string\r\n \r\n result = rearrange_to_k_string(k, s)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\ns=str(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\na=True\r\nfor i in d:\r\n if d[i]%n!=0:\r\n a=False\r\n break\r\nif a==True:\r\n ans=\"\"\r\n for i in d:\r\n ans+=i*(int(d[i]/n))\r\n print(ans*n)\r\nelse:\r\n print(\"-1\")", "k = int(input())\r\ns = [n for n in input()]\r\nu_s = []\r\nfor l in s:\r\n if l not in u_s:\r\n u_s.append(l)\r\nis_possible = True\r\nanswer = ''\r\nfor l in u_s:\r\n if s.count(l) % k == 0:\r\n answer += l * int(s.count(l) / k)\r\n else:\r\n is_possible = False\r\n break\r\nif is_possible:\r\n print(answer * k)\r\nelse:\r\n print(-1)", "k = int(input())\r\ns = list(input())\r\nres = []\r\nfor c in set(s):\r\n cnt = s.count(c)\r\n if cnt % k != 0:\r\n print(-1)\r\n exit()\r\n res.append(c*(cnt//k))\r\nres = \"\".join(res)\r\nprint(res*k)", "k = int(input())\r\ns = input()\r\nans = ''\r\n*st, = set(s)\r\nfor i in st:\r\n cnt = s.count(i)\r\n if cnt % k:\r\n print(-1)\r\n exit(0)\r\n ans += cnt // k * i\r\nprint(ans * k)\r\n", "from collections import Counter\r\nk = int(input())\r\ns = input()\r\nb = Counter(s)\r\nx = list(b.values())\r\ny = list(b.keys())\r\nz = 0\r\nfor i in range(len(x)):\r\n if x[i]%k!=0:\r\n z = 1\r\n\r\nif z==0:\r\n s2 = \"\"\r\n for i in range(len(y)):\r\n s2 += y[i]*(x[i]//k)\r\n print(s2*k)\r\nelse:\r\n print(-1)\r\n", "k=int(input())\r\ns=input()\r\nd=dict()\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\nans=\"\"\r\nfor i in d.keys():\r\n\tif(d[i]%k!=0):\r\n\t\tans=-1\r\n\t\tbreak\r\nif(ans==-1):\r\n\tprint(-1)\r\nelse:\r\n\tl=\"\"\r\n\tfor i in d.keys():\r\n\t\tl+=i*(d[i]//k)\r\n\tprint(l*(len(s)//len(l)))", "k = int(input())\r\nword = [*input()]\r\nflag = 0\r\nletters = list(set(word))\r\nnumbers = []\r\nfor i in range(len(letters)):\r\n if word.count(letters[i]) % k != 0:\r\n flag = 1\r\n else:\r\n numbers.append(word.count(letters[i]) // k)\r\n\r\n\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n copy = []\r\n for t in range(len(letters)):\r\n for l in range(numbers[t]):\r\n copy.append(letters[t])\r\n q = \"\".join(copy)\r\n last = []\r\n for z in range(k):\r\n last.append(q)\r\n print(\"\".join(last))\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nk=int(input())\r\ns=input()\r\nans=''\r\nfor i in set(s):\r\n ans+=i*(s.count(i)//k)\r\n\r\nif len(ans*k)==len(s):\r\n print(ans*k)\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#carpe diem \r\n#carpe diem", "no = int(input())\r\nn1 = (input())\r\ndp = {}\r\nfor i in n1:\r\n if i not in dp:\r\n dp[i] = 1\r\n else:\r\n dp[i] += 1\r\n\r\nset1 = list(set(n1))\r\nflag = 0\r\nfor i in set1:\r\n if dp[i] % no != 0:\r\n flag+=1\r\n break\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n str1 = \"\"\r\n for i in range(no):\r\n for j in dp:\r\n str1 += j*int((dp[j]/no))\r\n print(str1)", "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\nfrom types import GeneratorType\n\nsys.setrecursionlimit(11 ** 5)\n\ndef bootstrap(f, stttt=[]):\n def wrappedfunc(*args, **kwargs):\n if stttt:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stttt.append(to)\n to = next(to)\n else:\n stttt.pop()\n if not stttt:\n break\n to = stttt[-1].send(to)\n return to\n\n return wrappedfunc\n \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 = mid + 1\n #print(\"ret\")\n return low \n# aa = []\n\n# for i in range(200):\n# for j in range(160):\n# for k in range(120):\n# aa.append((i * 6) + (j * 8) + (k * 10))\n\n# #aa.sort()\n# aa = set(aa)\n# for i in range(6,10000,2):\n# if i not in aa:\n# print(\"HAHA\",i)\n\ncc = 0\n\nfor test in range(1):\n def solve():\n n = intinput()\n s = strinput()\n ss = Counter(s)\n for i in ss:\n if ss[i] % n != 0:\n return -1\n s1 = []\n for i in ss:\n for j in range(ss[i]//n):\n s1.append( i )\n #print(s1)\n s1 = \"\".join(s1)\n\n return s1 * n \n print(solve())\n \n\n\n \n\n\n \n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n s = input()\r\n n = len(s)\r\n if n % k != 0:\r\n return -1\r\n else:\r\n for i in s:\r\n if s.count(i) % k != 0:\r\n return -1\r\n\r\n temp = ''\r\n for i in set([i for i in s]):\r\n temp += (i * (s.count(i) // k))\r\n return temp * k\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "k = int(input())\r\ns = input()\r\nresult = \"\"\r\nbetuk = [0]*26\r\nfor letter in s:\r\n betuk[ord(letter)-97] += 1\r\nfor i in range(26):\r\n\tif betuk[i] % k != 0:\r\n\t\tresult = \"-1\"\r\n\t\tbreak\r\n\telse: \r\n\t\tresult += chr(i+97)*(betuk[i] // k)\r\nif result == \"-1\":\r\n\tprint(result)\r\nelse:\r\n\tprint(result*k)", "k = int(input())\r\nst = input()\r\ndic = {}\r\nfor i in st:\r\n if(i in dic):\r\n dic[i] = dic[i] +1\r\n else :\r\n dic[i] = 1\r\n# print(dic)\r\ne= 0\r\nfor i in dic:\r\n if dic[i]%k !=0:\r\n e=e+1\r\nif e:\r\n print(-1)\r\nelse :\r\n ans = ''\r\n for i in dic:\r\n ans = ans+ i*(dic[i]//k)\r\n temp = ans\r\n for i in range(k-1):\r\n ans = ans + temp\r\n print(ans)", "k = int(input())\r\ns = input()\r\nif len(s) % k != 0:\r\n print(-1)\r\nelse:\r\n d = {}\r\n for i in s:\r\n d[i] = d.get(i, 0) + 1\r\n string = \"\"\r\n score = 0\r\n for m in list(d.values()):\r\n if m % k != 0:\r\n score = -1\r\n break\r\n if score == 0:\r\n for l in range(k):\r\n for j in d:\r\n string += j*(d[j]//k)\r\n print(string)\r\n else:\r\n print(-1)", "from collections import Counter\r\n\r\ndef kString(k, s):\r\n d = Counter(s)\r\n result = \"\".join([c * (d[c] // k) for c in d])\r\n if len(result) * k != len(s):\r\n return -1\r\n return result * k\r\n \r\nk = int(input())\r\ns = input()\r\nprint(kString(k, s))", "k = int(input())\r\ns=sorted(input())\r\nl = list(set(s))\r\nx=s[::k]*k\r\ncount = 0\r\nfor i in l:\r\n if s.count(i)%k != 0:\r\n count -= 1\r\n break\r\nif count == -1:\r\n print(-1)\r\nelse:\r\n s1 = \"\".join(x)\r\n print(s1)", "from collections import Counter\ndef solve():\n k=int(input())\n s=list(input())\n c=Counter(s)\n ans=''\n for key,v in c.items():\n if v%k:\n return -1\n ans+=(key)*(v//k)\n return ans*k\nprint(solve())", "k=int(input())\r\ns=input()\r\nfor i in set(s):\r\n if s.count(i)%k!=0:\r\n print(-1)\r\n exit()\r\nfor i in range(k):\r\n for j in set(s):\r\n print(j*(s.count(j)//k), end=\"\")", "n=int(input())\r\ns=input()\r\nl=list(s)\r\nl.sort()\r\nm=l[::n]*n\r\nif(sorted(m)==l):\r\n print(''.join(m))\r\nelse:\r\n print(-1)", "n=int(input())\r\nd={}\r\na=list(input())\r\nfor x in a:\r\n if x in d:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\nflg=0\r\nfor v in d.values():\r\n if v%n!=0:\r\n print(-1)\r\n flg=1\r\n break\r\ns=\"\"\r\nif flg==0:\r\n for i in range(n):\r\n for k,v in d.items():\r\n s=s+(k*(v//n))\r\n v=v-v//n\r\nprint(s)\r\n", "n = int(input())\r\nl = list(str(input()))\r\no = []\r\ns = set(l)\r\nflag = False\r\ns = list(s)\r\nfor i in range(len(s)):\r\n o.append(l.count(s[i]))\r\nfor i in range(len(o)):\r\n if o[i] % n != 0:\r\n flag = True\r\nif flag:\r\n print(-1)\r\nelse:\r\n string = ''\r\n for i in range(len(s)):\r\n string += s[i] * (o[i] // n)\r\n print(string*n)\r\n", "from collections import Counter\r\nk = int(input())\r\ns = input()\r\nc = Counter(list(s))\r\nif any(v % k != 0 for v in c.values()):\r\n print(-1)\r\nelse:\r\n res = \"\".join(ck * (cv // k) for ck, cv in c.items())\r\n print(res * k)", "from collections import Counter\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = Counter(input())\r\n\r\n for i in s:\r\n if s[i] % n != 0:\r\n print(-1)\r\n return\r\n answ = []\r\n for i in s:\r\n answ.append(i*(s[i]//n))\r\n answ *= n\r\n print(\"\".join(answ))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nx = {}\r\ns = input()\r\nfor c in s:\r\n if c not in x:\r\n x[c] = 1\r\n else:\r\n x[c] += 1\r\ng = \"\"\r\nfor c in x:\r\n if x[c] % n != 0:\r\n print(\"-1\")\r\n quit()\r\n else:\r\n g = g + c * (x[c] // n)\r\nprint(g * n) ", "import sys\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n# sys.stderr = open(\"error.txt\", \"w\")\n\n\n'''\nbaabbbeeee\ni=0 b\ni =1 a\n\n'''\nk = int(input())\ns= input()\n\narr = {}\n\nfor i in s :\n\tif i in arr :\n\t\tarr[i]+=1\n\telse:\n\t\tarr[i]=1\n\nf = True\nfor i in arr:\n\tif arr[i] % k != 0 :\n\t\tf = False\n\telse :\n\t\tarr[i] = arr[i]/k\n\nif f == False :\n\tprint(-1)\nelse :\n\tres = \"\"\n\tg = \"\"\n\tfor i in arr :\n\t\tfor j in range(int(arr[i])) :\n\t\t\tres = res + i \n\tfor i in range(k):\n\t\tg += res\n\tprint(g)\n\n\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n\n\n\n\n\n\t\n", "k = int(input())\r\ns = input()\r\nd = dict()\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\nflag = False\r\nfor i in d.values():\r\n if i%k!=0:\r\n flag = True\r\n break\r\nif flag:\r\n print(-1)\r\nelse:\r\n i=0\r\n while i<len(s):\r\n for f in d.keys():\r\n x = d[f]//k\r\n for j in range(x):\r\n print(f,end='')\r\n i=i+1\r\n \r\n ", "from collections import Counter\r\ndef main():\r\n\r\n k = int(input())\r\n s = input()\r\n x = Counter(s)\r\n flag = True\r\n r = ''\r\n for i in x.keys():\r\n \r\n if x[i] % k != 0:\r\n print(-1)\r\n flag = False\r\n break\r\n else:\r\n r += i * (x[i]//k)\r\n\r\n if flag != False:\r\n print(r*k)\r\nmain()\r\n\r\n \r\n", "k=int(input())\r\ns=input()\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\nkeys=list(d.keys())\r\nvalues=list(d.values())\r\nflag=0\r\nfor i in d.values():\r\n if i%k!=0:\r\n flag=1\r\n break\r\nif flag==0:\r\n uni_s=\"\"\r\n for i in range(len(d)):\r\n occurence = values[i]//k\r\n uni_s+=keys[i]*occurence\r\n print(uni_s*k)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = input()\r\nr = \"\"\r\nd = {}\r\nflag = True\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:\r\n if d[i]%n != 0:\r\n flag = False\r\n break\r\n else:\r\n r += i*(d[i]//n)\r\nif flag:\r\n print(r*n)\r\nelse:\r\n print(\"-1\")", "from collections import defaultdict, deque\r\nimport math as mt\r\n\r\n\r\ndef solve():\r\n\tk=int(input())\r\n\ts=input()\r\n\r\n\tcnt=defaultdict(int)\r\n\tfor i in s:\r\n\t\tcnt[i]+=1\r\n\r\n\tans=\"\"\r\n\tfor key in cnt:\r\n\t\tif(cnt[key]%k!=0):\r\n\t\t\treturn print(\"-1\")\r\n\t\telse:\r\n\t\t\tans+=(key)*(cnt[key]//k)\r\n\r\n\treturn print(ans*k)\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\t# for i in range(1,16):\r\n\tsolve()\r\n", "n = int(input())\r\ns = sorted(input())\r\nk = s[::n]*n\r\nif sorted(k) == s:\r\n print(''.join(k))\r\nelse:\r\n print(-1)", "from collections import Counter\r\n\r\ndef rearrange_string(s, m):\r\n char_count = Counter(s)\r\n unique_chars = sorted(char_count.keys())\r\n for char in unique_chars:\r\n if char_count[char] % m != 0:\r\n return \"-1\"\r\n result = \"\"\r\n for char in unique_chars:\r\n count = char_count[char] // m\r\n result += char * count\r\n\r\n return result * m\r\n\r\n\r\nM = int(input())\r\ns = input()\r\nresult = rearrange_string(s, M)\r\nprint(result)", "k = int(input())\r\ns = input()\r\nn = len(s)\r\nct = {}\r\nst = set()\r\n\r\nfor i in range(n):\r\n ct[s[i]] = 0\r\nfor i in range(n):\r\n ct[s[i]] +=1\r\n st.add(s[i]) \r\npos = True\r\nfor i in ct.keys():\r\n if ct[i]%k !=0:\r\n pos = 0\r\n\r\nif n==k:\r\n if len(st) == 1:\r\n print(s)\r\n else:\r\n print(-1)\r\nelif n==1:\r\n s = sorted(s)\r\n s = ''.join(s)\r\n print(s)\r\n\r\nelif not pos or n%k :\r\n print(-1)\r\nelse:\r\n si = \"\"\r\n st = sorted(st)\r\n for i in st:\r\n si+=i*(ct[i]//k)\r\n print(si*k)\r\n", "from hashlib import new\r\n\r\n\r\nk = int(input())\r\nthe_string = input()\r\n\r\nd= {}\r\n\r\nfor i in the_string:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n\r\nflag = 1\r\nnew_string = \"\"\r\nfor i in d:\r\n if d[i]%k != 0:\r\n print(-1)\r\n flag = 0\r\n break\r\n else:\r\n new_string += i * (d[i]//k)\r\n\r\nif flag:\r\n print(new_string * k)\r\n\r\n", "from collections import Counter\r\nk = int(input())\r\ns = input()\r\nc = list(Counter(s).values())\r\nv = list(Counter(s).keys())\r\nfor i in range(len(c)):\r\n if c[i] % k != 0:\r\n print(-1)\r\n break\r\nelse:\r\n ans = ''\r\n for i in range(len(v)):\r\n ans += v[i] * (c[i] // k)\r\n print(ans * k)\r\n", "'''A string is called a k-string if it can be represented as k concatenated copies of some string. For example, the string \"aabaabaabaab\" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.\r\n\r\nYou are given a string s, consisting of lowercase English letters and a positive integer k. Your task is to reorder the letters in the string s in such a way that the resulting string is a k-string.\r\n\r\nInput\r\nThe first input line contains integer k (1 ≤ k ≤ 1000). The second line contains s, all characters in s are lowercase English letters. The string length s satisfies the inequality 1 ≤ |s| ≤ 1000, where |s| is the length of string s.\r\n\r\nOutput\r\nRearrange the letters in string s in such a way that the result is a k-string. Print the result on a single output line. If there are multiple solutions, print any of them.\r\n\r\nIf the solution doesn't exist, print \"-1\" (without quotes).'''\r\n\r\nk = int(input())\r\ns = input()\r\n\r\nl = [0]*26\r\nfor i in s:\r\n v = ord(i)-97\r\n l[v] = l[v]+1\r\n\r\nres = \"\"\r\nfor i in range(26):\r\n if not l[i]%k==0:\r\n print(\"-1\")\r\n exit()\r\n else:\r\n res = res+chr(97+i)*(l[i]//k)\r\nres = res*k\r\nprint(res)", "from collections import Counter\n\n# aabccc aabccc\n\ndef solutin(k, s):\n for i in s:\n if s.count(i) % k != 0 :\n return -1\n\n c = Counter(s)\n\n res = ''\n for i in c.keys(): # {'a': 5}\n res+= i *(c[i]//k)\n return res*k\n\n\nk = int(input())\ns = input()\n\nprint(solutin(k, s))", "k = int(input())\r\na = input()\r\nuse = [0] * 26\r\nfor i in range(len(a)):\r\n use[ord(a[i]) - ord('a')] += 1\r\nans = ''\r\nfor i in range(len(use)):\r\n if use[i] % k != 0:\r\n print(-1)\r\n quit()\r\n ans = ans + chr(ord('a') + i) * (use[i] // k)\r\nprint(ans * k)\r\n", "k=int(input())\r\na=input()\r\nif len(a)%k!=0:\r\n print(-1)\r\nelse:\r\n a1=list(set(list(a)))\r\n for x in range(len(a1)):\r\n if a.count(a1[x])%k!=0:\r\n print(-1)\r\n exit()\r\n ans=''\r\n for x in range(len(a1)):\r\n ans+=(a.count(a1[x])//k)*a1[x]\r\n print(ans*k)\r\n", "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 k = int(input())\r\n s = input()\r\n al = \"qwertyuiopadsfghjklzxcvbnm\"\r\n ar = [0]*26\r\n for i in s:\r\n ar[al.find(i)] += 1\r\n if max([i % k for i in ar]) != 0:\r\n print(-1)\r\n break\r\n ans = \"\"\r\n for i in range(26):\r\n ans += al[i] * (ar[i]//k) \r\n print(ans * k)\r\nmain()\r\n", "k = int(input())\r\ns = input()\r\nl = len(s)\r\ns = sorted(s)\r\n\r\ncount = 0\r\nfor i in range(l):\r\n if i % k == 0:\r\n ch = s[i]\r\n if s[i] == ch:\r\n count += 1\r\n\r\nif l == count and count % k == 0:\r\n for i in range(k):\r\n for j in range(0, l, k):\r\n print(s[j+i], end='')\r\nelse:\r\n print(\"-1\")", "k = int(input())\ns = input()\nl = list(s)\nst = set(l)\nsl = []\nfor j in st:\n sl.append(j)\nfor i in range(len(sl)):\n if l.count(sl[i])%k != 0:\n print(-1)\n quit()\nans = ''\n\nfor m in range(len(sl)):\n x = l.count(sl[m])\n x = x/k\n ans += sl[m]*int(x)\n\nans = ans*k\nprint(ans)\n\n\n\n\n\n\n", "import collections\r\nk=int(input())\r\ns=list(input())\r\nd=collections.Counter(s)\r\nc=1\r\nl=[]\r\nfor i in d:\r\n if(d[i]%k!=0):\r\n c=0\r\n break\r\n else:\r\n l.append(i*(d[i]//k))\r\nif(c==1):\r\n print(''.join(l)*k)\r\nelse:\r\n print(-1)", "k = int(input())\r\ninp = list(input())\r\nans = ''\r\nletters = {}\r\nfor let in inp:\r\n if let in letters:\r\n letters[let] += 1\r\n else :\r\n letters[let] = 1\r\nfor let in letters:\r\n if letters[let]%k!=0:\r\n ans = -1\r\n break\r\n else:\r\n ans += let*(letters[let]//k)\r\nprint(ans*k if ans!=-1 else ans )", "def check(lst):\r\n s=''\r\n for i in lst:\r\n if i%w==0: \r\n s=s+'1'\r\n else:\r\n s=s+'0'\r\n x=s.find('0')\r\n if x== -1:\r\n ans=1\r\n else:\r\n ans=-1\r\n return ans\r\n\r\nw=int(input())\r\ns=input()\r\nif len(s)<w:\r\n print(-1)\r\n\r\nelse:\r\n a=97\r\n lst=[]\r\n while a<=122:\r\n count=0\r\n for i in s:\r\n if i==chr(a):\r\n count=count+1\r\n a+=1\r\n lst.append(count)\r\n\r\n\r\n x=check(lst)\r\n if x==-1:\r\n print(-1)\r\n elif x==1:\r\n lst1=[] #no. of chars in 1 substring\r\n for i in lst:\r\n count_of_chars=int(i/w)\r\n lst1.append(count_of_chars)\r\n\r\n\r\n \r\n r=97\r\n string=''\r\n for j in lst1:\r\n string=string+chr(r)*j\r\n r+=1\r\n print((string)*w)", "k = int(input())\r\ns = input()\r\nd = {}\r\nfor x in s:\r\n d[x] = d.get(x,0)+1\r\nposs = True\r\nss = \"\"\r\nfor key,value in d.items():\r\n if value%k!=0:\r\n poss = False\r\n break\r\n ss+=key*(value//k)\r\nif poss:\r\n print(ss*k)\r\nelse:\r\n print(-1)", "def string():\r\n n = int(input())\r\n s = input()\r\n \r\n if len(s) % n != 0:\r\n return -1\r\n \r\n lst = set([x for x in s])\r\n tmp = \"\"\r\n \r\n for i in lst:\r\n count = s.count(i)\r\n if count % n != 0:\r\n return -1\r\n \r\n tmp += i * (count // n)\r\n \r\n return tmp * n\r\n\r\nprint(string())", "k = int(input())\r\ns = input()\r\nflag = True\r\nfor letter in s:\r\n if s.count(letter) % k != 0:\r\n print(-1)\r\n flag = False\r\n break\r\nif flag:\r\n uniq = \"\".join(list(set(s)))\r\n res = \"\"\r\n for letter in uniq:\r\n res += letter * (s.count(letter) // k)\r\n print(res * k)", "from collections import defaultdict\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nd = defaultdict(int)\nk = get(int)\nfor s in get(str):\n d[s] += 1\ns = ''\nfor c, v in d.items():\n if v % k:\n print(-1)\n break\n s += v // k * c\nelse:\n print(s * k)\n" ]

[ "def main():\r\n def find_root(g):\r\n if list_4[g] != g:\r\n list_4[g] = find_root(list_4[g])\r\n return list_4[g]\r\n\r\n def depth_first_search(g):\r\n if free[g]:\r\n free[g], a, pv = False, list_1[g], list_2[g]\r\n for i, p in enumerate(list_2):\r\n if prime_flags[a + list_1[i]] and pv != i and (p == -1 or depth_first_search(p)):\r\n list_2[i] = g\r\n return True\r\n return False\r\n\r\n n = int(input())\r\n list_1 = list(map(int, input().split()))\r\n list_2 = [-1] * n\r\n\r\n\r\n prime_flags = [False, True] * 10001\r\n for i in range(3, 140, 2):\r\n if prime_flags[i]:\r\n j, k = i * 2, i * i\r\n le = (20001 - k) // j + 1\r\n prime_flags[k::j] = [False] * le\r\n\r\n for i in range(n):\r\n free = [True] * n\r\n if not depth_first_search(i):\r\n print('Impossible')\r\n return\r\n\r\n list_4 = list(range(n))\r\n for i, p in enumerate(list_2):\r\n i, p = find_root(i), find_root(p)\r\n list_4[p] = i\r\n\r\n num_components = sum(find_root(i) == i for i in range(n))\r\n print(num_components)\r\n\r\n for i in range(n):\r\n if find_root(i) == i:\r\n row = [sum(find_root(j) == i for j in range(n)), i + 1]\r\n j = list_2[i]\r\n while j != i:\r\n row.append(j + 1)\r\n j = list_2[j]\r\n print(*row)\r\nmain()\r\n" ]

[ "def lucky(x):\r\n return str(x).count('4') + str(x).count('7') == len(str(x))\r\n\r\ndef quantity_luckynum(n):\r\n s = str(n)\r\n if s[0] < '4':\r\n return 0\r\n if s[0] == '4':\r\n return quantity_luckynum(s[1:])\r\n if s[0] < '7':\r\n return 2 ** (len(s) - 1)\r\n if s[0] == '7':\r\n return 2 ** (len(s) - 1) + quantity_luckynum(s[1:])\r\n return 2 ** len(s)\r\n\r\ndef permutation_el(X, k):\r\n if k == 0:\r\n return X\r\n for i in range(len(X)):\r\n if k >= factorials[len(X) - i - 1]:\r\n h = k // factorials[len(X) - i - 1]\r\n r = k % factorials[len(X) - i - 1]\r\n remaining_el = X[i + 1:]\r\n remaining_el.remove(X[i + h])\r\n remaining_el = [X[i]] + remaining_el\r\n return permutation_el(X[:i] + [X[i + h]] + remaining_el, r)\r\n\r\nn, k = map(int, input().split())\r\n\r\nfactorials = [1]\r\np = 1\r\ni = 1\r\n\r\nwhile p <= 10**15:\r\n p *= i\r\n factorials.append(p)\r\n i += 1\r\n\r\nif n <= 14:\r\n if k > factorials[n]:\r\n print(-1)\r\n else:\r\n L = permutation_el(list(range(1, n + 1)), k - 1)\r\n x = sum(1 for i in range(n) if lucky(i + 1) and lucky(L[i]))\r\n print(x)\r\nelse:\r\n L = permutation_el(list(range(n - 14, n + 1)), k - 1)\r\n ss = str(n - 15)\r\n x = sum(2 ** i for i in range(1, len(ss))) + quantity_luckynum(ss)\r\n x += sum(1 for i in range(n - 14, n + 1) if lucky(L[i - n + 14]) and lucky(i))\r\n print(x)", "n, k = map(int, input().split())\r\nimport math\r\n\r\n\r\ndef gen(n, k, array):\r\n if k == 0:\r\n return array\r\n else:\r\n R = k // math.factorial(n - 1)\r\n d = array[R]\r\n array = [array[i] for i in range(n) if i != R]\r\n return [d] + gen(n - 1, k % (math.factorial(n - 1)), array)\r\n\r\n\r\ndef check(r):\r\n if r == 0:\r\n return True\r\n if r % 10 in (4, 7):\r\n return check(r // 10)\r\n return False\r\n\r\n\r\ndef answer(r):\r\n ssz = len(str(r))\r\n fsr = 0\r\n for sz in range(1, ssz + 1):\r\n for i in range(1 << (sz)):\r\n fr = 0\r\n for j in range(sz):\r\n if (i & (1 << j)):\r\n fr += (10 ** j) * 7\r\n else:\r\n fr += (10 ** j) * 4\r\n fsr += (fr <= r)\r\n return fsr\r\n\r\n\r\n\r\n\r\nif (n <= 13):\r\n if (k > math.factorial(n)):\r\n print(-1)\r\n else:\r\n k -= 1\r\n r = gen(n, k, [i + 1 for i in range(n)])\r\n ans = 0\r\n for z in range(n):\r\n if (check(z + 1) and check(r[z])):\r\n ans += 1\r\n print(ans)\r\nelse:\r\n k -= 1\r\n r = gen(13, k, [i for i in range(n - 12, n + 1)])\r\n ans = 0\r\n for z in range(n - 12, n + 1):\r\n if (check(z) and check(r[z - (n - 12)])):\r\n ans += 1\r\n print(ans + answer(n - 13))\r\n", "def lucky(x):\r\n s=str(x)\r\n return s.count('4')+s.count('7')==len(s)\r\n \r\ndef Gen_lucky(n):\r\n if(len(n)==1):\r\n if(n<\"4\"):\r\n return 0\r\n if(n<\"7\"):\r\n return 1\r\n return 2\r\n s=str(n)\r\n if(s[0]<'4'):\r\n return 0\r\n if(s[0]=='4'):\r\n return Gen_lucky(s[1:])\r\n if(s[0]<'7'):\r\n return 2**(len(s)-1)\r\n if(s[0]=='7'):\r\n return 2**(len(s)-1)+Gen_lucky(s[1:])\r\n else:\r\n return 2**len(s)\r\n \r\n \r\ndef Form(X,k):\r\n if(k==0):\r\n return X\r\n for i in range(len(X)):\r\n if(k>=F[len(X)-i-1]):\r\n h=k//F[len(X)-i-1]\r\n r=k%F[len(X)-i-1]\r\n G=list(X[i+1:])\r\n G.remove(X[i+h])\r\n G=[X[i]]+G\r\n return Form(X[:i]+[X[i+h]]+G,r)\r\n \r\np=1\r\n \r\nF=[1]\r\ni=1\r\nwhile(p<=10**15):\r\n p*=i\r\n F.append(p)\r\n i+=1\r\n \r\nn,k=map(int,input().split())\r\n \r\n \r\n \r\nif(n<=14):\r\n if(k>F[n]):\r\n print(-1)\r\n else:\r\n L=Form(list(range(1,n+1)),k-1)\r\n x=0\r\n for i in range(n):\r\n if(lucky(i+1) and lucky(L[i])):\r\n x+=1\r\n print(x)\r\nelse:\r\n L=Form(list(range(n-14,n+1)),k-1)\r\n ss=str(n-15)\r\n x=0\r\n for i in range(1,len(ss)):\r\n x+=2**i\r\n x+=Gen_lucky(ss)\r\n for i in range(n-14,n+1):\r\n if(lucky(L[i-n+14]) and lucky(i)):\r\n x+=1\r\n print(x)", "def C(a,b):\r\n if a>b:return 0\r\n return 1+C(a*10+4,b)+C(a*10+7,b)\r\ndef chk(a):\r\n return a==0 or (a%10==4 or a%10==7)and chk(a//10)\r\nP,G=print,range;n,k=map(int,input().split());k-=1\r\nf=[1]+[0]*13;u=[0]*14;z=C(0,n)-1\r\nfor i in G(1,14):f[i]=f[i-1]*i\r\nif n<=13 and f[n]<=k:exit(P(-1))\r\nfor i in G(13,-1,-1):\r\n cnt=k//f[i];c=-1\r\n while cnt>=0:c+=1;cnt-=not u[c]\r\n u[c]=1;t=c-13+n\r\n if t>0 and chk(n-i):z+=chk(t)-1\r\n k%=f[i]\r\nP(z)", "from math import factorial\r\n \r\n \r\nn,k = map(int,input().split())\r\nv = []\r\ndef rec(a):\r\n if a > n: return\r\n if a: v.append(a)\r\n rec(10*a+4)\r\n rec(10*a+7)\r\nrec(0)\r\nv.sort()\r\n \r\nk -= 1\r\nif n <= 13 and factorial(n) <= k:\r\n exit(print(-1))\r\nd = min(13,n)\r\nperm = []\r\ncode = [0 for i in range(d)]\r\nnums = [n-i for i in range(d)][::-1]\r\n \r\nfor i in range(d-1,-1,-1):\r\n code[i] = k//factorial(i)\r\n k %= factorial(i)\r\n perm.append(nums[code[i]])\r\n del nums[code[i]]\r\n \r\nans = 0\r\nfor x in v:\r\n if x in perm:\r\n ans += (perm.index(x)+n-d+1 in v)\r\n else:\r\n ans += 1\r\nprint(ans)" ]

[ "s = input()\r\n\r\ndef chk(s):\r\n for i in range(len(s)):\r\n if s[i] != s[len(s) - i - 1]:\r\n return False\r\n return True\r\n\r\nfor i in range(len(s) + 1):\r\n for j in range(26):\r\n ns = s[:i] + chr(ord('a') + j) + s[i:]\r\n if chk(ns):\r\n print(ns)\r\n exit(0)\r\nprint('NA')\r\n", "def isPal(s):\r\n return s == s[::-1]\r\n\r\ndef allway(s):\r\n flag = 0\r\n for i in range(len(s) + 1):\r\n for j in alf:\r\n new = s[:i] + j + s[i:]\r\n if isPal(new):\r\n flag = 1\r\n return new\r\n if flag == 0:\r\n return 'NA'\r\n\r\nalf = 'abcdefghijklmnopqrstuvwxyz'\r\ns = input()\r\nprint(allway(s))\r\n", "s = input()\r\nfor j in range(len(s)+1):\r\n\tfor i in range(26):\r\n\t\tt = s[:j]+chr(i+ord('a'))+s[j:]\r\n\t\tif(t == t[::-1]):\r\n\t\t\tprint(t)\r\n\t\t\texit(0)\r\nprint(\"NA\")", "import sys\r\n\r\ns = input()\r\nlist_s = list(s)\r\nif s + s[0] == s[0] + s[::-1]:\r\n print(s + s[0])\r\n sys.exit()\r\nelse:\r\n for y in range(len(s)):\r\n letter = s[y]\r\n for x in range(len(s)):\r\n polindrom = list_s[:x] + [letter, ] + list_s[x:]\r\n # print(''.join(polindrom))\r\n if polindrom == polindrom[::-1]:\r\n print(''.join(polindrom))\r\n sys.exit()\r\nprint('NA')\r\n", "s,x=list(input()),0\r\na=s[:]\r\nfor i in range(len(s)):\r\n if s[i]!=s[len(s)-1-i]:\r\n x=1\r\n a.insert(i,s[len(s)-1-i])\r\n s.insert(len(s)-i,s[i])\r\n break\r\nif(x):\r\n x=0\r\n for i in range(len(s)):\r\n if s[i]!=s[len(s)-i-1]:\r\n x=1\r\n break\r\n if(x):\r\n x=0\r\n for i in range(len(a)):\r\n if a[i]!=a[len(a)-i-1]:\r\n x=1\r\n break\r\n if(x):print(\"NA\")\r\n else:print(\"\".join(a))\r\n else:print(\"\".join(s))\r\nelse:\r\n s.insert(int(len(s)/2),s[int(len(s)/2)])\r\n print(\"\".join(s))", "s = input()\r\nalp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nfor i in range(len(s) + 1):\r\n for j in alp:\r\n ns = s[0:i] + j + s[i::]\r\n if ns == ns[::-1]:\r\n print(ns)\r\n exit(0)\r\nprint(\"NA\")# 1690818865.2631605", "def ptest(l):\r\n m = l[:]\r\n m.reverse()\r\n if m == l:\r\n return True\r\n return False\r\n\r\n\r\na = input()\r\na = list(a)\r\nlett = set(a)\r\ndone = False\r\nfor x in range(len(a)+1):\r\n b = a[:]\r\n for t in lett:\r\n c = b[:x] + [t] + b[x:]\r\n c.reverse()\r\n if ptest(c):\r\n done = True\r\n print(''.join(c))\r\n break\r\n if done:\r\n break\r\nif not(done):\r\n print(\"NA\")\r\n", "from string import ascii_lowercase\n\ns = input()\nn = len(s)\n\nfor i in range(n + 1):\n for char in ascii_lowercase:\n new_s = s[:i] + char + s[i:]\n if new_s == new_s[::-1]:\n print(new_s)\n exit()\n\n\nprint(\"NA\")", "a = input()\r\n\r\ndef isPalindrome(word):\r\n if(len(word) % 2 == 0):\r\n mid = int(len(word) / 2)\r\n #print(word[:mid], word[mid:][::-1])\r\n return (word[:mid] == word[mid:][::-1])\r\n else:\r\n mid = int(len(word) / 2)\r\n #print(word[:mid], word[(mid + 1):][::-1])\r\n return (word[:mid] == word[(mid + 1):][::-1])\r\n\r\nok = 0\r\nfor k in range(len(a) + 1):\r\n for i in range(26):\r\n word = a[:k] + chr(ord('a') + i) + a[k:]\r\n #print(word)\r\n if(isPalindrome(word)):\r\n ok = 1\r\n print(word)\r\n break\r\n if(ok):\r\n break\r\nif(not ok):\r\n print(\"NA\")\r\n", "from string import ascii_lowercase\n\n\ndef is_palindrome(string):\n return string == string[::-1]\n\n\ndef insert(string):\n as_list = list(string)\n for c in ascii_lowercase:\n for i in range(0, len(string)):\n as_list.insert(i, c)\n if is_palindrome(''.join(as_list)):\n return ''.join(as_list)\n as_list.pop(i)\n if is_palindrome(string + c):\n return string + c\n return 'NA'\n\n\ns = input()\nresult = insert(s)\nif result == 'NA':\n print('NA')\nelse:\n print(result)\n", "def ispal(x):\r\n if len(x) == 1:\r\n return True\r\n if len(x) == 2:\r\n return x[0] == x[1]\r\n if x[0] != x[-1]:\r\n return False\r\n return ispal(x[1:len(x)-1])\r\n\r\nct = 0\r\na = input()\r\n\r\nl = len(a)\r\n\r\n\r\nx = ''\r\ny = ''\r\nfor i in range(l//2):\r\n if a[i] != a[-(i+1)]:\r\n x = a[:i] + a[-(i+1)] + a[i:]\r\n y = a[:(l-i)] + a[i] + a[(l-i):]\r\n break\r\nif x == '' and y == '':\r\n if l % 2 == 1:\r\n print(a[:l // 2] + a[l//2]*2+a[l//2+1:])\r\n quit()\r\n else:\r\n print(a[:l // 2] + 'y' +a[l//2:])\r\n quit()\r\n \r\nif ispal(x):\r\n print(x)\r\n quit()\r\nif ispal(y):\r\n print(y)\r\n quit()\r\nelse:\r\n print(\"NA\")\r\n", "def is_palindrome(s):\n return s == s[::-1]\n\ns = input()\nletters = set(s)\nfound = False\nfor letter in letters:\n for i in range(len(s)+1):\n temp = s[:i] + letter + s[i:]\n if is_palindrome(temp):\n print(temp)\n found = True\n break\n if found:\n break\nif not found:\n print('NA')\n", "import sys\ns = input().strip()\n\ndef isPalin(n):\n if n[::-1] == n:\n return True\n return False\n\nfor i in range(len(s)+1):\n for j in \"abcdefghijklmnopqrstuvwxyz\":\n if isPalin(s[:i] + j + s[i:]):\n print(s[:i] + j + s[i:])\n sys.exit(0)\n\nprint(\"NA\")\n", "#!/usr/bin/env python3\n\n# ------------------------------------\n# problems/python/kitayuta/Kitayuta.py\n# Copyright (C) 2015\n# Glenn P. Downing\n# ------------------------------------\n\n\"\"\"\nA. Mr. Kitayuta's Gift\nhttp://codeforces.com/problemset/problem/505/A/\n\nSat, 5 Sep 2015\nPython 3.4: 61 ms, 0 KB\n\"\"\"\n\nfrom string import ascii_lowercase\nfrom sys import stdin\n\ndef is_palindrome(s) :\n return s == s[::-1]\n\nfor s in stdin :\n s = s[:-1]\n r = range(len(s) + 1)\n b = False\n for i in r :\n for c in ascii_lowercase :\n t = s[:i] + c + s[i:]\n if is_palindrome(t) :\n print(''.join(t))\n b = True\n break\n if b :\n break\n else :\n print(\"NA\")\n", "from math import ceil, floor\r\n\r\ns = input()\r\nl = len(s)\r\nh1, h2 = ceil(l / 2), floor(l / 2)\r\n\r\nif s[:h1] == ''.join(list(reversed(s[h2:]))):\r\n print(s[:h1] + s[h2] + s[h1:])\r\nelse:\r\n s1, s2 = list(s), list(s)\r\n for i in range(h1):\r\n if s[i] != s[-(i + 1)]:\r\n s1.insert(l - i, s[i])\r\n s2.insert(i, s[-(i + 1)])\r\n break\r\n\r\n l = len(s1)\r\n h1, h2 = ceil(l / 2), floor(l / 2)\r\n if s1[:h1] == list(reversed(s1[h2:])):\r\n print(''.join(s1))\r\n elif s2[:h1] == list(reversed(s2[h2:])):\r\n print(''.join(s2))\r\n else:\r\n print('NA')\r\n", "s = input()\r\n\r\nfor c in s:\r\n for i in range(len(s)+1):\r\n f = s[:i] + c + s[i:]\r\n if f == f[::-1]:\r\n print(f)\r\n exit()\r\nprint('NA')\r\n", "import sys\ndef checkRest(word):\n\tleft = 0;\n\tright = len(word) - 1\n\twhile(left <= right):\n\t\tif(word[left] != word[right]):\n\t\t\treturn False\n\t\tleft+=1\n\t\tright-=1\n\treturn True\n\ndef palen(line):\n\t\n\tleft = 0\n\tright = len(line)-1\n\twhile(left < right):\n\t\tif(line[left] != line[right]):\n\t\t\t\n\n\t\t\tworda = line[:right+1] +line[left] + line[right+1:]\n\t\t\twordb = line[:left] + line[right] + line[left:]\n\t\t\tif(checkRest(worda)):\n\t\t\t\tprint(worda)\n\t\t\t\treturn\n\t\t\telif(checkRest(wordb)):\n\t\t\t\tprint(wordb)\n\t\t\t\treturn\n\t\t\telse:\n\t\t\t\tprint(\"NA\")\n\t\t\t\treturn\n\t\tleft+=1\n\t\tright-=1\n\t\t\t\t\n\tprint(line[:right]+line[right]+line[right:])\n\treturn\n\ndef main():\n\tpalen(input())\n\nmain()\t", "def palindrom(s):\r\n n = len(s)\r\n for num in range(n):\r\n if s[num] != s[n - num - 1]:\r\n return 0\r\n return 1\r\ns = input()\r\nn = len(s)\r\nwords = \"abcdefghjklmnpoqrstvwxyziuy\"\r\nyes = 0\r\ns1 = \"\"\r\nfor i in range(n+1):\r\n for j in words:\r\n if palindrom(s[:i]+j+s[i:]) == 1:\r\n s1 = s[:i]+j+s[i:]\r\n yes = 1\r\n break\r\n if yes == 1:\r\n break\r\nif s1 == \"\":\r\n print(\"NA\")\r\nelse:\r\n print(s1)\r\n", "import sys\r\ndef is_p(s):\r\n return s==s[::-1]\r\ns=input()\r\nfor i in range(len(s)+1):\r\n for c in 'abcdefghijklmnopqrstuvwxyz':\r\n t=s[:i]+c+s[i:]\r\n print(t,file=sys.stderr)\r\n if is_p(s[:i]+c+s[i:]):\r\n print(s[:i]+c+s[i:])\r\n exit(0)\r\nprint(\"NA\")", "s=input()\r\nn=len(s)\r\n \r\n# revive\r\ncon=0\r\nfor x in range(n+1):\r\n for y in range(97,97+26):\r\n k=s[:x]+chr(y)+s[x:]\r\n if k==k[::-1]:\r\n print(k)\r\n con=1\r\n break\r\n if con:break\r\nelse:print('NA')\r\n", "def f(s):\n at = -1\n for i, v in enumerate(s):\n if v == '@':\n at = i\n continue\n if v != s[-i - 1] and s[-i - 1] != '@':\n return False\n s[at] = s[-at - 1]\n return ''.join(s)\n\ns = list(input())\nfor i in range(len(s) + 1):\n s.insert(i, '@')\n a = f(s)\n if a:\n print(a)\n break\n del s[i]\nelse:\n print('NA')\n", "s=input()\n\nif s == s[::-1]:\n print(s[:len(s)//2] + s[len(s)//2] + s[len(s)//2:])\nelse:\n for i in range(len(s)//2):\n if s[i] != s[len(s) - 1 - i]:\n first = s[:i] + s[len(s) - 1 -i] + s[i:]\n second = s[:len(s) - i] + s[i] + s[len(s) -i:]\n if first == first[::-1]:\n print(first)\n elif second == second[::-1]:\n print(second)\n else:\n print(\"NA\")\n break\n\n", "from collections import deque\r\nimport math\r\ns=str(input())\r\nn=len(s)\r\nd,d2=deque(),deque()\r\nans,skip=0,0\r\nfor i in range(len(s)):\r\n d.append(s[i])\r\n d2.appendleft(s[i])\r\nif \"\".join(d)==\"\".join(d2):\r\n d.insert(math.ceil(n/2),s[math.ceil(n/2)-1])\r\n print(\"\".join(d))\r\n skip=1\r\nfor i in range(len(s)):\r\n del d[i]\r\n del d2[n-1-i]\r\n s1=\"\".join(d)\r\n s2=\"\".join(d2)\r\n if s1==s2:\r\n d.insert(i,s[i])\r\n if i>=n//2:\r\n d.insert(n-i-1,s[i])\r\n else:\r\n d.insert(n-i,s[i])\r\n ans=1\r\n break\r\n else:\r\n d.insert(i, s[i])\r\n d2.insert(len(s)-1-i,s[i])\r\ns3=\"\".join(d)\r\nif ans==0 and skip==0:\r\n print(\"NA\")\r\nelif skip==0:\r\n print(s3)", "import fileinput\n\ndef checkPalindrome(s):\n left = 0\n right = len(s)-1\n while left < right:\n if s[left] != s[right]:\n return False\n left += 1\n right -= 1\n return True\n\ndef tryToMake(possibleInsertions, line):\n for c in possibleInsertions:\n for i in range(len(line)+1):\n newString = line[:i] + c + line[i:]\n if checkPalindrome(newString):\n return(newString)\n return(\"NA\")\n\n\nfor line in fileinput.input():\n line = line.rstrip()\n charCount = {}\n for c in line:\n if c not in charCount:\n charCount[c] = 0\n charCount[c] += 1\n possibleInsertions = []\n for c in charCount:\n possibleInsertions.append(c)\n print(tryToMake(possibleInsertions, line))\n", "def palindrome(s):\r\n n=len(s)\r\n for i in range(n//2):\r\n if s[i]!=s[n-1-i]:\r\n return False\r\n return True\r\ns=input()\r\nn=len(s)\r\nfor i in range(n+1):\r\n for j in range(26):\r\n c=chr(ord('a')+j)\r\n tmp=''\r\n if i>0:\r\n tmp=s[0:i]\r\n tmp+=str(c)\r\n if i<=n-1:\r\n tmp+=s[i:]\r\n if palindrome(tmp):\r\n print(tmp)\r\n exit()\r\nprint('NA')", "import string\r\ns = input()\r\nres = ''\r\nfor letter in string.ascii_lowercase:\r\n for i in range(len(s) + 1):\r\n ss = s[:i] + letter + s[i:]\r\n if ss == ss[::-1]:\r\n res = ss\r\n break\r\nprint(res if res else \"NA\")", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\ndef isPalindrome(x, n):\r\n left, right = 0, n-1\r\n while left < right:\r\n if x[left] != x[right]:\r\n return False\r\n left += 1\r\n right -= 1\r\n return True\r\n\r\ns = list(input().strip())\r\nalphabets = [chr(97+i) for i in range(26)]\r\nn = len(s)\r\n\r\nans = False\r\npalindrome = ''\r\nfor i in range(0,n+1):\r\n for alpha in alphabets:\r\n newArray = [s[j] for j in range(0,i)]\r\n newArray.append(alpha)\r\n newArray.extend([s[j] for j in range(i,n)])\r\n if isPalindrome(newArray, n+1):\r\n ans = True\r\n palindrome = \"\".join(newArray)\r\n break\r\n\r\nif ans:\r\n print(palindrome)\r\nelse:\r\n print(\"NA\")\r\n \r\n \r\n\r\n", "s=input()\r\ni=0\r\ndef checkpa(st):\r\n if st==st[::-1]:\r\n return 1\r\n else:\r\n return 0\r\nwhile i<=len(s)-1 and s[i]==s[len(s)-1-i]:\r\n i+=1\r\nif i==len(s):\r\n if len(s)%2==0:\r\n print(s[:len(s)//2]+'a'+s[len(s)//2:])\r\n else:\r\n print(s[:len(s)//2]+s[len(s)//2]*2+s[len(s)//2+1:])\r\nelif i==0:\r\n s1=s[len(s)-1]+s\r\n s2=s+s[0]\r\n if checkpa(s1)==1:\r\n print(s1)\r\n elif checkpa(s2)==1:\r\n print(s2)\r\n else:\r\n print(\"NA\")\r\nelse:\r\n s1=s[:i]+s[len(s)-1-i]+s[i:]\r\n s2=s[:len(s)-i]+s[i]+s[len(s)-i:]\r\n if checkpa(s1)==1:\r\n print(s1)\r\n elif checkpa(s2)==1:\r\n print(s2)\r\n else:\r\n print(\"NA\")\r\n\r\n \r\n", "\r\ns = [x for x in input()]\r\nfor i in range(len(s)+1):\r\n\tfor j in range(ord('a'),ord('z')+1):\r\n\t\tt = s[:]\r\n\t\tt.insert(i,chr(j))\r\n\t\tl,k = 0,len(t)-1\r\n\t\twhile(l<k):\r\n\t\t\tif t[l]==t[k]:\r\n\t\t\t\tl += 1\r\n\t\t\t\tk -= 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(''.join(t))\r\n\t\t\texit(0)\r\nprint('NA')\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ndef isPalindrome(a):\n\treturn a==a[::-1]\nx=RS()[0]\nfor i in range(len(x)+1):\n\ta,b= x[:i], x[i:]\n\tfor c in ascii_lowercase:\n\t\tif(isPalindrome(a+c+b)):\n\t\t\tprint(a+c+b)\n\t\t\texit(0)\nprint(\"NA\")\n", "import sys\ndef is_p(s):\n return s==s[::-1]\ns=input()\nfor i in range(len(s)+1):\n for c in 'abcdefghijklmnopqrstuvwxyz':\n t=s[:i]+c+s[i:]\n print(t,file=sys.stderr)\n if is_p(s[:i]+c+s[i:]):\n print(s[:i]+c+s[i:])\n exit(0)\nprint(\"NA\")\n", "def palindrome(s):\r\n if list(s) == list(reversed(list(s))):\r\n return 1\r\n return 0\r\n\r\ns = input()\r\ndone = 0\r\nfor i in range(0,len(s)+1):\r\n for j in range(97,123):\r\n l = s[:i]+chr(j)+s[i:]\r\n if palindrome(l) == 1 and done == 0:\r\n print(l)\r\n done = 1\r\nif done == 0:\r\n print(\"NA\")\r\n", "s=input()\r\nn=len(s)\r\nfor i in range(n+1):\r\n for j in range(26):\r\n c=chr(ord('a')+j)\r\n tmp=''\r\n if i>0:\r\n tmp=s[0:i]\r\n tmp+=str(c)\r\n if i<=n-1:\r\n tmp+=s[i:]\r\n if tmp==tmp[::-1]:\r\n print(tmp)\r\n exit(0)\r\nprint('NA')", "string = list(input())\n\nfor i in range(len(string)):\n cur = ord('a')\n for let in range(26):\n ins = chr(cur+let)\n string.insert(i, ins)\n if string == string[::-1]:\n print(''.join(string))\n exit()\n del string[i]\nelse:\n for let in range(26):\n ins = chr(cur+let)\n string.append(ins)\n if string == string[::-1]:\n print(''.join(string))\n exit()\n del string[len(string) - 1]\n print('NA')\n", "def ispalindrome(t,k):\r\n global i\r\n for i in range(k//2):\r\n if t[i]!=t[-1-i]:\r\n return False\r\n return True\r\ns = list(input())\r\nl = len(s)\r\nx = l//2\r\nif ispalindrome(s,l):\r\n s.insert(x,s[x])\r\n print(''.join(s))\r\nelse:\r\n first = s.copy()\r\n second = s.copy()\r\n first.insert(i,s[-1-i])\r\n second.insert(-1-i,s[i])\r\n second[-1-i],second[-2-i] = second[-2-i],second[-1-i]\r\n if ispalindrome(first,l+1):\r\n print(''.join(first))\r\n elif ispalindrome(second,l+1):\r\n print(''.join(second))\r\n else:\r\n print('NA')\r\n \r\n", "def return_palindrome(s: str, c: str, i: int):\n new_s = s[:i] + c + s[i:]\n if new_s == new_s[::-1]:\n return new_s\n else:\n return \"NA\"\n\n\ns = input()\nfound = False\n\nfor i in range(len(s) + 1):\n if found:\n break\n for c in \"abcdefghijklmnopqrstuvwxyz\":\n if found:\n break\n palindrome = return_palindrome(s, c, i)\n if palindrome != \"NA\":\n print(palindrome)\n found = True\n\nif not found:\n print(\"NA\")\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 22/05/2023 21:37:16 Hanoi, Vietnam\r\n# **/\r\n\r\ns = [c for c in input()]\r\n\r\nfor i in range(len(s) + 1):\r\n for c in \"abcdefghiklmnopqrstuvwxyz\":\r\n t = s[:i] + [c] + s[i:]\r\n if t == t[::-1]:\r\n exit(print(''.join(t)))\r\n\r\nprint(\"NA\")", "import string\ndef jud(l=[]):\n\tn=len(l)\n\t#print(n)\n\tfor i in range(n):\n\t\tif l[i] != l[n-i-1]:\n\t\t\treturn False\n\treturn True\n\ns = input(\"\")\nn = len(s)\narr=list(s)\n\nflag = False\nfor i in range(n+1):\n\tif flag:\n\t\tbreak\n\tfor c in string.ascii_lowercase:\n\t\tif flag:\n\t\t\tbreak\n\t\tarr.insert(i, c)\n\t\tif jud(arr):\n\t\t\tprint(''.join(arr))\n\t\t\tflag = True\n\t\tarr.pop(i)\nif not flag:\n\tprint('NA')\n", "s = input()\r\nn = len(s)\r\nf = False\r\nfor i in range(len(s)//2):\r\n if s[i] != s[n-1-i]:\r\n o = s[:n-i] + s[i] + s[n-i:]\r\n p = s[:i] + s[n-i-1] + s[i:]\r\n f = True\r\n\r\n if o==o[::-1]:\r\n print(o)\r\n elif p==p[::-1]:\r\n print(p)\r\n else:\r\n print(\"NA\")\r\n break\r\n\r\n\r\nif not f:\r\n if n%2==0:\r\n print(s[:n//2] + 'y' + s[n//2:])\r\n else:\r\n x = s[n//2]\r\n print(s[:n//2] + x + s[n//2:])\r\n", "#!/usr/bin/python3\n#-*- coding: utf-8 -*-\n\ndef ispal(s):\n for i in range(len(s)):\n if s[i] != s[len(s) - i - 1]:\n return False\n return True\n\ns = input()\nfor i in range(len(s) + 1):\n if i <= len(s) // 2:\n t = s[:i] + s[len(s) - 1 - i] + s[i:]\n else:\n t = s[:i] + s[len(s) - i] + s[i:]\n if ispal(t):\n print(t)\n import sys\n sys.exit()\nprint('NA')\n", "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\ndef insert(s, i, c):\r\n if i == 0:\r\n return c + s\r\n elif i == len(s):\r\n return s + c\r\n else:\r\n return s[:i] + c + s[i:]\r\n\r\ndef solve():\r\n s = input()\r\n n = len(s)\r\n for i in range(n + 1):\r\n for c in \"qwertyuiopasdfghjklzxcvbnm\":\r\n t = insert(s, i, c)\r\n if t == t[::-1]:\r\n print (t)\r\n return\r\n print (\"NA\")\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", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#for tt in range(INT()):\r\n\r\ndef check(s):\r\n if s == s[::-1]:\r\n return True\r\n return False\r\n\r\ns = STR()\r\nans = 1\r\ni = 0\r\nwhile i < len(s):\r\n j = 0\r\n x = s[i]\r\n while j <= len(s):\r\n s.insert(j,x)\r\n if check(s):\r\n ans = ''.join(s)\r\n\r\n s.pop(j)\r\n j+=1\r\n if ans != 1 :\r\n break\r\n i+=1\r\n\r\nif ans != 1 :\r\n print(ans)\r\nelse:\r\n print('NA')\r\n\r\n", "s=input()\r\nn=len(s)\r\nfor i in range(n+1):\r\n for j in range(26):\r\n c=chr(ord('a')+j)\r\n t=s[:i]+c+s[i:]\r\n if t==t[::-1]:\r\n print(t)\r\n exit(0)\r\nprint('NA')\r\n", "import math\r\nfor m in range(1,2 ):\r\n s = input()\r\n s=list(s)\r\n # print(s)\r\n # n, x= list(map(int, input().split()))\r\n # a = list(map(int, input().split()))\r\n half = len(s)//2\r\n full = len(s)\r\n arr=[]\r\n DONE=False\r\n string=\"\"\r\n \r\n \r\n def check() :\r\n full = len(s) \r\n half = len(s)//2\r\n global DONE, string\r\n if full%2==0:\r\n #print(s[0:half],s[half:full])\r\n reverse=list(s[half:full])\r\n reverse.reverse()\r\n # print(reverse)\r\n reverse= \"\".join(reverse)\r\n \r\n if \"\".join(s[0:half]) == reverse:\r\n string=\"\".join(s)\r\n # print(string)\r\n DONE=True\r\n return \r\n elif full%2!=0:\r\n #print(s[0:half],s[half:full], s)\r\n reverse=list(s[half+1:full])\r\n reverse.reverse()\r\n \r\n reverse= \"\".join(reverse)\r\n # print(reverse== \"\".join(s[0:half])) \r\n if \"\".join(s[0:half] )== reverse:\r\n \r\n #tring =\"\"\r\n string=\"\".join(s)\r\n #print(string, \"ccccccccc\")\r\n #global DONE\r\n DONE=True\r\n return\r\n for i in range(full):\r\n for j in range(full):\r\n if j==full-1:\r\n s.insert(full,s[i])\r\n check()\r\n # print(\"\".join(s))\r\n s.pop(full)\r\n #print(s, \"after\", i, j)\r\n if DONE==True:\r\n #rint(string)\r\n break\r\n continue \r\n s.insert(j,s[i])\r\n check()\r\n #print(\"\".join(s))\r\n # print(s, \"after\", i, j) \r\n s.pop(j)\r\n if DONE==True:\r\n # print(string)\r\n break\r\n \r\n #print(s, \"after\", i, j)\r\n if DONE==False:\r\n print(\"NA\") \r\n else:\r\n print(string)", "from sys import stdin,stdout\r\n# from collections import deque,Counter,defaultdict\r\n# from itertools import permutations,combinations,combinations_with_replacement\r\n# from operator import itemgetter\r\n# import heapq\r\n# from functools import reduce\r\ndef ii():return int(stdin.readline())\r\ndef mi():return map(int,stdin.readline().split())\r\ndef li():return list(mi())\r\ndef si():return stdin.readline()\r\n\r\ndef ispal(s):\r\n n = len(s)//2\r\n if s[:n] == s[-n:][::-1]:\r\n return True\r\n else:\r\n return False\r\n \r\ns1 = input()\r\nfor i in range(len(s1)+1):\r\n for j in range(ord('a'),ord('z')+1):\r\n s2 = s1[:i] + chr(j) + s1[i:]\r\n # print(s2)\r\n if ispal(s2):\r\n print(s2)\r\n exit(0)\r\nprint('NA')\r\n", "s = input()\nn = len(s)\ndef symi(i,k):\n if min(k, n-k-1) < min(i, n-i-1):\n return n-k-1\n elif min(k,n-k-1) > min(i,n-i-1) and i > n//2:\n return n-k\n elif min(k, n-k-1) > min(i, n-i-1):\n return n-k-2\n else:\n return k\ndef ispal(s,i):\n b = True\n for k in range(n):\n if s[symi(i,k)] != s[k]:\n b = False\n return b\ndef res(s):\n for i in range(n):\n if ispal(s,i):\n if i > n//2:\n sp = s[:i+1] + s[n-i-1] + s[i+1:]\n else:\n sp = s[:i] + s[n-i-1] + s[i:]\n return sp\n return \"NA\"\n\nprint(res(s))\n", "def isPalindrome(s):\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] != s[len(s)-1-i]:\r\n\t\t\treturn False\r\n\treturn True\r\ndef solve(s):\r\n\tif len(s) == 1: s = s+s\r\n\telif len(s) == 2: s = s+s[0]\r\n\telse:\r\n\t\tinseriu = False\r\n\t\tfor i in range(0, len(s) // 2):\r\n\t\t\tif s[i] != s[len(s)-1-i]:\r\n\t\t\t\tinseriu = True\r\n\t\t\t\ts = s[:i] + s[len(s)-1-i] + s[i:]\r\n\t\t\t\tbreak\r\n\t\tif not inseriu:\r\n\t\t\ts = s[:len(s)//2] + s[len(s)//2] + s[len(s)//2:]\r\n\tif isPalindrome(s):\r\n\t\treturn s\r\n\treturn False\r\n\r\ns = input()\r\na = solve(s)\r\nif a:\r\n\tprint(a)\r\nelse:\r\n\ts = s[::-1]\r\n\ta = solve(s)\r\n\tif a:\r\n\t\tprint(a)\r\n\telse:\r\n\t\tprint('NA')\r\n", "import string\r\n\r\ndef func(s):\r\n abc = string.ascii_lowercase\r\n len1 = len(s)\r\n for i in range(len1 + 1):\r\n av = ((len1 + 1) // 2)\r\n for j in range(26):\r\n s1 = s[:i] + abc[j] + s[i:]\r\n if ((len1 + 1) % 2 == 0):\r\n # print(s1)\r\n # print(s1[:av], ''.join(reversed(s1[av:])))\r\n if s1[:av] == ''.join(reversed(s1[av:])):\r\n return s1\r\n else:\r\n # print(s1)\r\n # print(s1[:av], ''.join(reversed(s1[av + 1:])))\r\n if s1[:av] == ''.join(reversed(s1[av + 1:])):\r\n return s1\r\n return \"NA\"\r\n\r\n\r\nprint(func(input()))", "import math\r\nimport string\r\ndef is_palindrome(l, i, j):\r\n if i >= j:\r\n return True\r\n elif l[i] != l[j]:\r\n return False\r\n return is_palindrome(l, i + 1, j - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n s = list(input())\r\n is_palindrome_found = False\r\n for i in range(len(s)):\r\n target = s[i]\r\n for j in range(len(s) + 1):\r\n new_s = s[0:j] + [target] + s[j:len(s)]\r\n if is_palindrome(new_s, 0, len(new_s) - 1):\r\n is_palindrome_found = True\r\n print(\"\".join(new_s))\r\n break\r\n if is_palindrome_found:\r\n break\r\n if not is_palindrome_found:\r\n print(\"NA\")\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\n\r\n\r\n\r\ndef getPalindrom(s):\r\n a = ord('a')\r\n for i in range(len(s)+1):\r\n for char in range(26):\r\n new_s = s[:i]+chr(a+char)+s[i:]\r\n #print(new_s)\r\n left = new_s[:len(new_s)//2]\r\n right = new_s[len(new_s)//2+len(new_s)%2:][::-1]\r\n #print(left,right)\r\n if left==right:\r\n return new_s\r\n #print(new_s)\r\n \r\n \r\n return 'NA'\r\n \r\ndef doTest():\r\n assert getPalindrom('revive')=='reviver'\r\n #assert getPalindrom('ee')=='eae'\r\n assert getPalindrom('kitayuta')=='NA'\r\n \r\n#doTest()\r\n#print(getPalindrom('ee'))\r\n \r\n \r\nprint(getPalindrom(s))", "def solve(w):\r\n if w == \"\".join(reversed(w)):\r\n return w[:len(w)//2] + w[len(w)//2] + w[len(w)//2:]\r\n\r\n for v in (w, \"\".join(reversed(w))):\r\n i, j, c = 0, len(w)-1, -1\r\n\r\n while i < j:\r\n if v[i] != v[j]:\r\n if c != -1:\r\n i, j, c = -1, -1, -1\r\n break\r\n else:\r\n c = j\r\n i += 1\r\n else:\r\n i += 1\r\n j -= 1\r\n\r\n if c != -1:\r\n return v[:c+1] + v[len(v)-1-c] + v[c+1:]\r\n\r\n return \"NA\"\r\n\r\nprint(solve(input()))\r\n", "def pal(s):\n\tl = 0\n\tr = len(s) - 1\n\twhile l < r:\n\t\tif s[l] != s[r]:\n\t\t\treturn False\n\t\tl += 1\n\t\tr -= 1\n\treturn True\n\n\ns = input()\n\nl = 0\nr = len(s) - 1\nf = True\nwhile l < r:\n\tif s[l] != s[r]:\n\t\ts1 = s[:l] + s[r] + s[l:]\n\t\ts2 = s[:r + 1] + s[l] + s[r + 1:]\n\t\tf = False\n\t\tbreak\n\tl += 1\n\tr -= 1\n\nif f:\n\tp = len(s) // 2\n\ts1 = s[:p] + s[p] + s[p:]\n\ts2 = s1\n\nif pal(s1):\n\tprint(s1)\nelif pal(s2):\n\tprint(s2)\nelse:\n\tprint('NA')", "s=input ()\r\nn=len (s)\r\nfor i in range (0,n+1):\r\n for j in range (0,26):\r\n t=s[0:i]+chr (ord ('a')+j)+s [i:n]\r\n if t==t [::-1]:\r\n print (t)\r\n exit ()\r\nprint (\"NA\")", "s=input()\r\nfor i in range(len(s)+1):\r\n for j in \"abcdefghijklmnopqrstuvwxyz\":\r\n t=s[:i]+j+s[i:]\r\n if t==t[::-1]:\r\n print(t)\r\n exit()\r\nprint(\"NA\")", "s = list(input())\r\nse = set(s)\r\nans = False\r\n\r\nfor i in range(11):\r\n for j in se:\r\n st = s.copy()\r\n st.insert(i, j)\r\n if st == st[::-1]:\r\n ans = True\r\n break\r\n if ans:\r\n break\r\n\r\nif ans:\r\n print(\"\".join(st))\r\nelse:\r\n print(\"NA\")\r\n", "from sys import stdin, stdout\nfrom itertools import permutations as perms\n\ndef is_palindrome(line):\n\tfor i in range(0, len(line)):\n\t\tif line[i]!=line[len(line)-i-1]:\n\t\t\treturn False\n\treturn True\n\ndef main():\n\tline=stdin.readline().rstrip()\n\tfor i in range(0, len(line)+1):\n\t\tfor each in map(chr, range(ord('a'), ord('z')+1)):\n\t\t\tmy_str=line[0:i]+each+line[i:]\n\t\t\tif is_palindrome(my_str):\n\t\t\t\tprint(my_str)\n\t\t\t\treturn\n\tprint('NA')\n\nif __name__=='__main__':\n\tmain()", "\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n#inp = open(\"lepus.in\", \"r\"); input = inp.readline; out = open(\"lepus.out\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n \r\n \r\ndef solution():\r\n s = list(input())\r\n n = len(s)\r\n ans = []\r\n for i in range(n):\r\n ans.append(s[:i]+[s[-i-1]]+s[i:])\r\n ans.append(s[:i+1]+[s[-i-1]]+s[i+1:])\r\n \r\n for i in range(len(ans)):\r\n for j in range(len(ans[i])//2+1):\r\n if ans[i][j] != ans[i][-j-1]: break\r\n else:\r\n print(\"\".join(ans[i]))\r\n break\r\n else: print(\"NA\")\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()", "s = input()\nn = len(s)\nfor i in range(n+1):\n for j in range(26):\n x = s[0:i]+chr(j+97)+s[i:n]\n if x == x[::-1]:\n print(x)\n exit()\nprint(\"NA\")\n", "s = input()\nl = len(s)\nfor i in range(l + 1):\n cur = s[:i] + s[l - i - 1 + (i > l // 2)] + s[i:]\n if all(cur[i] == cur[l - i] for i in range((l + 1) // 2)):\n print(cur), exit()\nprint('NA')\n", "s = input()\r\nn = len(s)\r\nok = False\r\n\r\nfor i in range(len(s)+1):\r\n for j in range(97, 123):\r\n q = s[:i] + chr(j) + s[i:]\r\n if q == q[::-1]:\r\n ok = True\r\n print(q)\r\n break\r\n \r\n if ok:\r\n break\r\n \r\nif not ok:\r\n print(\"NA\")", "letters = list(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\ndef insertLetter(letter, word, pos):\r\n return word[:pos] + letter + word[pos:]\r\n\r\n\r\ndef isPalidrome(word):\r\n length = len(word)\r\n if (length % 2) == 0:\r\n firstHalf = word[:int(length/2)]\r\n secondHalf = word[length:int(length/2) - 1:-1]\r\n if firstHalf == secondHalf:\r\n return True\r\n else:\r\n return False\r\n else:\r\n firstHalf = word[:int(length/2)]\r\n secondHalf = word[length:int(length/2):-1]\r\n if firstHalf == secondHalf:\r\n return True\r\n else:\r\n return False\r\n \r\n \r\n\r\ndef findPalidrome(word):\r\n for i in range(len(word) + 1):\r\n for letter in letters:\r\n newWord = insertLetter(letter, word, i)\r\n if (isPalidrome(newWord)):\r\n return newWord\r\n return \"NA\"\r\n\r\n\r\n\r\nword = input()\r\nprint(findPalidrome(word))", "def is_palindrome(s):\n return str(s) == str(s)[::-1]\n\n\ndef convert_palindrome(s):\n if s[0] == s[-1]:\n sub_palindrome = convert_palindrome(s[1:-1])\n if sub_palindrome is None:\n return None\n else:\n return s[0] + sub_palindrome + s[-1]\n else:\n if is_palindrome(s + s[0]):\n return s + s[0]\n elif is_palindrome(s[-1] + s):\n return s[-1] + s\n else:\n return None\n\n\ndef main():\n s = input()\n\n length = len(s)\n\n if is_palindrome(s):\n if length % 2 == 0:\n mid = length // 2\n print(s[:mid] + 'a' + s[mid:])\n else:\n mid = (length - 1) // 2\n print(s[:mid] + s[mid] + s[mid:])\n else:\n new_palindrome = convert_palindrome(s)\n if new_palindrome is None:\n print('NA')\n else:\n print(new_palindrome)\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nn = len(s)\r\n\r\nfor i in range(n + 1):\r\n new_s = s[:i] + s[-i-(i<=n//2)] + s[i:]\r\n if new_s == new_s[::-1]:\r\n print(new_s)\r\n break\r\nelse:\r\n print('NA')", "s = input()\n\n\ndef isPalindrome(l):\n if len(l) == 0 or len(l) == 1:\n return True\n if l[0] != l[-1]:\n return False\n else:\n return isPalindrome(l[1:len(l) - 1])\n\n\nfor i in range(len(s) + 1):\n for j in range(26):\n x = s[0:i] + str(chr(97 + j)) + s[i:]\n if isPalindrome(x):\n print(x)\n quit()\n\nprint('NA')\n", "s=input()\r\nn=len(s)\r\nf=0\r\nfor i in range(n+1):\r\n for j in range(26):\r\n l=s[:i]+chr(97+j)+s[i:]\r\n if(l==l[::-1]):\r\n f=1\r\n print(l)\r\n break\r\n if(f==1):\r\n break\r\nif f==0:\r\n print(\"NA\")\r\n", "s = input()\nn = len(s)\nfor _ in range(n+1):\n s1 = s[:_]+'!'+s[_:]\n s2 = s1[::-1]\n a = '?'\n for i in range(n+1):\n if s1[i]=='!' and s2[i]!='!':\n if a=='?':\n a = s2[i]\n else:\n if s2[i]==a:\n print(s[:_]+a+s[_:])\n exit(0)\n else:\n print('NA')\n exit(0)\n elif s1[i]!='!' and s2[i]=='!':\n if a=='?':\n a = s1[i]\n else:\n if s1[i]==a:\n print(s[:_]+a+s[_:])\n exit(0)\n else:\n print('NA')\n exit(0)\n elif s1[i]==s2[i]=='!':\n print(s[:_]+'a'+s[_:])\n exit(0)\n else:\n if s1[i]!=s2[i]:\n break\nprint('NA')", "def solve(s):\r\n for i in range(len(s)+1):\r\n for j in range(26):\r\n sn = s[:i] + chr(j+97) + s[i:]\r\n if(len(sn)&1 == 0):\r\n if(sn[:len(sn)//2] == sn[len(sn)//2:][::-1]):\r\n return sn\r\n else:\r\n if(sn[:len(sn)//2] == sn[1+len(sn)//2:][::-1]):\r\n return sn\r\n\r\n return (\"NA\")\r\n\r\ns = input()\r\nprint(solve(s))\r\n\r\n\r\n", "#input\r\ns=str(input())\r\n\r\n#variables\r\ndef ispalindrome(s):\r\n\tif s==s[::-1]:\r\n\t\treturn True\r\n\treturn False\r\n\r\n#main\r\nfor i in range(len(s)+1):\r\n\tif i<len(s)/2:\r\n\t\tt=s[:i]+s[len(s)-i-1]+s[i:]\r\n\telse:\r\n\t\tt=s[:i]+s[len(s)-i]+s[i:]\r\n\tif ispalindrome(t):\r\n\t\tprint(t)\r\n\t\tquit()\r\n\r\n#output\r\nprint('NA')", "s=input()\r\nfor i in range(len(s)+1):\r\n\tfor j in range(97,123):\r\n\t\tq=s[:i]+chr(j)+s[i:]\r\n\t\tif q==q[::-1]:\r\n\t\t\tprint(q)\r\n\t\t\texit()\r\nprint(\"NA\")", "from string import ascii_lowercase\r\n\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n for i in range(n + 1):\r\n for c in ascii_lowercase:\r\n t = s\r\n t = t[:i] + c + t[i:]\r\n if t == t[::-1]:\r\n print(t)\r\n return\r\n print(\"NA\")\r\n\r\n\r\nmain()\r\n", "s=input()\r\nfor i in range (26):\r\n for j in range (len(s)+1):\r\n s1=s[:j]+chr(ord('a')+i)+s[j:]\r\n if s1[::-1]==s1:\r\n print (s1)\r\n exit()\r\nprint('NA')\r\n", "s = input()\r\n\r\nfor i in range(26):\r\n a = chr(ord('a') + i)\r\n for j in range(len(s)):\r\n temp = s[:j] + a + s[j:]\r\n if temp == temp[::-1]:\r\n print(temp)\r\n exit(0)\r\n temp = s + a\r\n if temp == temp[::-1]:\r\n print(temp)\r\n exit(0)\r\nprint(\"NA\")", "s=input()\r\na='NA'\r\nfor c in s:\r\n for q in range(len(s)+1):\r\n n=s[:q]+c+s[q:]\r\n e=list(n)\r\n e.reverse()\r\n if list(n)==e:\r\n a=n\r\nprint(a)\r\n \r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n s = input().strip()\r\n n = len(s)\r\n\r\n if s == s[::-1]:\r\n if n % 2 == 0:\r\n print(s[:n // 2] + \"a\" + s[n // 2:])\r\n else:\r\n print(s[:n // 2] + s[n // 2] + s[n // 2:])\r\n\r\n l, r = 0, n-1\r\n ans1, ans2 = \"\", \"\"\r\n while l <= r:\r\n if s[l] != s[r]:\r\n if ans1 != \"\":\r\n break\r\n ans1 = s[:l] + s[r] + s[l:]\r\n ans2 = s[:r+1] + s[l] + s[r+1:]\r\n l += 1\r\n r -= 1\r\n\r\n if ans1 != \"\":\r\n if ans1 == ans1[::-1]:\r\n print(ans1)\r\n elif ans2 == ans2[::-1]:\r\n print(ans2)\r\n else:\r\n print(\"NA\")\r\n\r\n", "s=str(input())\r\nw='abcdefghijklmnopqrstuvwxyz'\r\n\r\nfor i in range(len(s)+1):\r\n for j in w:\r\n t=s[:i]+j+s[i:]\r\n if(t==t[::-1]):\r\n print(t)\r\n exit()\r\n\r\nprint('NA')", "n=str(input())\r\nt=1\r\nm=\"\"\r\nfor i in range (0,len(n)//2):\r\n if n[i]!=n[len(n)-1-i]:\r\n t=0\r\n p=i\r\n break\r\n m=m+n[i]\r\nif t==1:\r\n m=m+n[len(n)//2]\r\n for i in range(len(n)//2,len(n)):\r\n m=m+n[i]\r\n print(m)\r\nelse:\r\n t2=1\r\n m1=m+n[len(n)-1-p]\r\n for i in range(p, len(n)//2):\r\n if n[i]!=n[len(n)-2-i]:\r\n t2=0\r\n break\r\n m1=m1+n[i]\r\n if t2==1:\r\n for i in range (len(n)//2,len(n)):\r\n m1=m1+n[i]\r\n print(m1)\r\n else:\r\n t3=1\r\n m2=m+n[p]\r\n for i in range(p+1,len(n)//2+1):\r\n if n[i]!=n[len(n)-i]:\r\n print(\"NA\")\r\n t3=0\r\n break\r\n m2=m2+n[i]\r\n if t3==1:\r\n for i in range(len(n)//2+1,len(n)-p):\r\n m2=m2+n[i]\r\n m2=m2+n[p]\r\n for i in range(len(n)-p,len(n)):\r\n m2=m2+n[i]\r\n print(m2)", "s=input()\r\nn=len(s)\r\nfor i in range(n+1):\r\n for j in range(26):\r\n k=s[0:i]+chr(j+97)+s[i:n]\r\n if k==k[::-1]:\r\n print(k)\r\n exit(0)\r\nprint('NA')\r\n", "def isPalindrome(g):\r\n flag = 0\r\n [p,q] = [0,len(g)-1]\r\n while p<q:\r\n if g[p] != g[q]:\r\n flag = 1\r\n break\r\n p+=1\r\n q-=1\r\n if flag == 1:\r\n return 0\r\n else:\r\n return 1\r\n\r\n\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n gets = lambda :[str(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [g]=gets()\r\n h = list(set(list(g)))\r\n for i in range(len(g)+1):\r\n for j in h:\r\n if isPalindrome(g[0:i] + j + g[i:]):\r\n print(g[0:i] + j + g[i:])\r\n return\r\n print(\"NA\")\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n\r\n", "from string import ascii_lowercase\ndef check(s):\n\treturn s == s[::-1]\n\ns = input()\nfor i in range(len(s) + 1):\n\tfor c in ascii_lowercase:\n\t\tif check(s[:i] + c + s[i:]):\n\t\t\tprint(s[:i] + c + s[i:])\n\t\t\texit()\nprint('NA')\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Checks whether a string is a palindrome or not\r\ndef is_palindrome(s):\r\n L = 0\r\n R = len(s) - 1\r\n while L < R:\r\n if s[L] != s[R]:\r\n return False\r\n L += 1\r\n R -= 1\r\n return True\r\n\r\ns = input()\r\nl= len(s)\r\nL = 0\r\nR = l-1\r\ninsert = False #Is it possible to do without an insert?\r\n\r\nwhile L < R:\r\n if s[L] == s[R]:\r\n L += 1\r\n R -= 1\r\n else:\r\n insert = True\r\n break\r\n\r\n#Can be done without an insert -> just insert in the middle\r\nif not insert:\r\n mid = l//2\r\n ans = s[0:mid+1] + s[mid] + s[mid+1:l]\r\n print(ans)\r\n#Cannot be done without an insert\r\n#-> exists not equal symmetric pair\r\n#-> must insert one of them\r\nelse:\r\n copy_L_char = s[0:R+1] + s[L] + s[R+1:l] #Copy L char to the right\r\n copy_R_char = s[0:L] + s[R] + s[L:l] #Copy R char to the left\r\n if is_palindrome(copy_L_char):\r\n print(copy_L_char)\r\n elif is_palindrome(copy_R_char):\r\n print(copy_R_char)\r\n else:\r\n print('NA')\r\n", "# A. Mr. Kitayuta's Gift\n\nabc = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef is_palindrome(s):\n if s == s[::-1]:\n return True\n else:\n return False\n\n\ns = input()\nfor i in range(len(s)+1):\n for t in abc:\n s2 = s[:i] + t + s[i:]\n if is_palindrome(s2):\n print(s2)\n exit(0)\n\n\nprint(\"NA\")\n", "\"\"\"\r\nAuthor : co_devil Chirag Garg\r\nInstitute : JIIT\r\n\"\"\"\r\nfrom math import *\r\nfrom sys import stdin, stdout\r\nimport itertools\r\nimport os\r\nimport sys\r\nimport threading\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import *\r\n# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd\r\n# from bisect import bisect_left,bisect_right\r\n# from decimal import *,threading\r\nfrom fractions import Fraction\r\nmod = int(pow(10, 9)+7)\r\n\r\n\r\ndef ii(): return int(input())\r\n\r\n\r\ndef si(): return str(input())\r\n\r\n\r\ndef mi(): return map(int, input().split())\r\n\r\n\r\ndef li(): return list(mi())\r\n\r\n\r\ndef fii(): return int(stdin.readline())\r\n\r\n\r\ndef fsi(): return str(stdin.readline())\r\n\r\n\r\ndef fmi(): return map(int, stdin.readline().split())\r\n\r\n\r\ndef fli(): return list(fmi())\r\n\r\n\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,\r\n 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24,\r\n 'z': 25}\r\n\r\n\r\ndef getKey(item): return item[0]\r\n\r\n\r\ndef sort2(l): return sorted(l, key=getKey)\r\n\r\n\r\ndef d2(n, m, num): return [[num for x in range(m)] for y in range(n)]\r\n\r\n\r\ndef isPowerOfTwo(x): return (x and (not (x & (x - 1))))\r\n\r\n\r\ndef decimalToBinary(n): return bin(n).replace(\"0b\", \"\")\r\n\r\n\r\ndef ntl(n): return [int(i) for i in str(n)]\r\n\r\n\r\ndef powerMod(x, y, p):\r\n res = 1\r\n x %= p\r\n while y > 0:\r\n if y & 1:\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n return res\r\n\r\n\r\ngraph = defaultdict(list)\r\nvisited = [0] * 1000000\r\ncol = [-1] * 1000000\r\n\r\n\r\ndef bfs(d, v):\r\n q = []\r\n q.append(v)\r\n visited[v] = 1\r\n while len(q) != 0:\r\n x = q[0]\r\n q.pop(0)\r\n for i in d[x]:\r\n if visited[i] != 1:\r\n visited[i] = 1\r\n q.append(i)\r\n print(x)\r\n\r\n\r\ndef make_graph(e):\r\n d = {}\r\n for i in range(e):\r\n x, y = mi()\r\n if x not in d:\r\n d[x] = [y]\r\n else:\r\n d[x].append(y)\r\n if y not in d:\r\n d[y] = [x]\r\n else:\r\n d[y].append(x)\r\n return d\r\n\r\n\r\ndef gr2(n):\r\n d = defaultdict(list)\r\n for i in range(n):\r\n x, y = mi()\r\n d[x].append(y)\r\n return d\r\n\r\n\r\ndef connected_components(graph):\r\n seen = set()\r\n\r\n def dfs(v):\r\n vs = set([v])\r\n component = []\r\n while vs:\r\n v = vs.pop()\r\n seen.add(v)\r\n vs |= set(graph[v]) - seen\r\n component.append(v)\r\n return component\r\n\r\n ans = []\r\n for v in graph:\r\n if v not in seen:\r\n d = dfs(v)\r\n ans.append(d)\r\n return ans\r\n\r\n\r\ndef primeFactors(n):\r\n s = set()\r\n while n % 2 == 0:\r\n s.add(2)\r\n n = n // 2\r\n for i in range(3, int(sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n s.add(i)\r\n n = n // i\r\n if n > 2:\r\n s.add(n)\r\n return s\r\n\r\n\r\ndef find_all(a_str, sub):\r\n start = 0\r\n while True:\r\n start = a_str.find(sub, start)\r\n if start == -1:\r\n return\r\n yield start\r\n start += len(sub)\r\n\r\n\r\ndef SieveOfEratosthenes(n, isPrime):\r\n isPrime[0] = isPrime[1] = False\r\n for i in range(2, n):\r\n isPrime[i] = True\r\n p = 2\r\n while (p * p <= n):\r\n if (isPrime[p] == True):\r\n i = p * p\r\n while (i <= n):\r\n isPrime[i] = False\r\n i += p\r\n p += 1\r\n return isPrime\r\n\r\n\r\ndef dijkstra(edges, f, t):\r\n g = defaultdict(list)\r\n for l, r, c in edges:\r\n g[l].append((c, r))\r\n\r\n q, seen, mins = [(0, f, ())], set(), {f: 0}\r\n while q:\r\n (cost, v1, path) = heappop(q)\r\n if v1 not in seen:\r\n seen.add(v1)\r\n path = (v1, path)\r\n if v1 == t:\r\n return (cost, path)\r\n\r\n for c, v2 in g.get(v1, ()):\r\n if v2 in seen:\r\n continue\r\n prev = mins.get(v2, None)\r\n next = cost + c\r\n if prev is None or next < prev:\r\n mins[v2] = next\r\n heappush(q, (next, v2, path))\r\n return float(\"inf\")\r\n\r\n\r\ndef binsearch(a, l, r, x):\r\n while l <= r:\r\n mid = l + (r-1)//2\r\n print(mid)\r\n if a[mid]:\r\n return mid\r\n elif a[mid] > x:\r\n l = mid-1\r\n else:\r\n r = mid+1\r\n return -1\r\n\r\n\r\nf = 0\r\ns = list(si())\r\nx = tuple(s)\r\nout = []\r\nfor i in range(len(s)+1):\r\n for j in range(97, 97+26):\r\n s = list(x)\r\n s.insert(i, chr(j))\r\n out.append(''.join(s))\r\nfor i in out:\r\n if i == i[::-1]:\r\n print(i)\r\n f = 1\r\n break\r\nif f == 0:\r\n print(\"NA\")\r\n", "s = input()\r\nl = len(s)\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(a)):\r\n\tfor j in range(l+1):\r\n\t\tx = s[:j]+a[i]+s[j:]\r\n\t\tif x == x[::-1]:\r\n\t\t\tprint(x)\r\n\t\t\texit()\r\nelse:\r\n\tprint(\"NA\")", "def ch(a):\r\n a=list(a)#\r\n i=0\r\n while i<len(a)//2+1:\r\n if a[i]!=a[len(a)-i-1]:\r\n return 0\r\n i+=1\r\n return 1\r\na=list(input())\r\ni=0\r\nd=1\r\nwhile i<len(a):\r\n c=a[i]\r\n j=0\r\n while j<=len(a):\r\n a.insert(j,c)\r\n if ch(a):\r\n d=''.join(a)\r\n a.pop(j)\r\n j+=1\r\n if d!=1:\r\n break\r\n i+=1\r\nif d!=1:\r\n print(d)\r\nelse:\r\n print('NA')\r\n", "s = input()\ndef check(a):\n\tn = len(a)\n\tfor i in range(n//2):\n\t\tif(a[i]!=a[n-i-1]):\n\t\t\treturn False\n\treturn True\nimport sys\nfor i in range(26):\n\tx = chr(ord('a')+i)\n\tfor i in range(len(s)+1):\n\t\tif(check(s[:i]+x+s[i:])):\n\t\t\tprint(s[:i]+x+s[i:])\n\t\t\tsys.exit(0)\nprint('NA')", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#for tt in range(INT()):\r\n\r\ndef check(s):\r\n if s == s[::-1]:\r\n return True\r\n return False\r\n\r\ns = STR()\r\nans = ''\r\nflag = False\r\nst_letters = set(s)\r\n\r\nfor i in range(11):\r\n for j in st_letters:\r\n z = s.copy()\r\n z.insert(i , j)\r\n if check(z):\r\n flag = True\r\n ans = ''.join(z)\r\n break\r\n\r\nif flag:\r\n print(ans)\r\nelse:\r\n print('NA')\r\n\r\n", "# -*- coding: utf-8 -*-\nimport sys\nimport string\na = input()\nlens = len(a)\nflag = 0\nlis = list()\nfor i in range(0,lens):\n lis.append(a[i])\nfor i in range(0,lens+1):\n for word in string.ascii_lowercase:\n s = lis[:]\n s.insert(i,word)\n q = ''\n q = ''.join(s)\n p = q[::-1]\n if p == q:\n flag = 1\n print(p)\n break\n if flag==1:\n break\nif flag==0:\n print(\"NA\\n\")\n\n\n \t \t \t\t \t\t\t\t\t \t\t \t \t \t\t\t \t", "def palindrome(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\ns=input()\r\ni,j=0,len(s)-1\r\nz=0\r\nn=len(s)\r\nwhile i < j:\r\n # print(i,j)\r\n if s[i]!=s[j]:\r\n if palindrome(s[i+1:j+1]):\r\n s=s[:j+1]+s[i]+s[j+1:]\r\n z=-1\r\n elif palindrome(s[i:j]):\r\n s=s[:i]+s[j]+s[i:]\r\n z=-1\r\n else:\r\n z=2\r\n break\r\n i+=1\r\n j-=1\r\n\r\n# print(z)\r\nif z==0:\r\n if n%2==0:\r\n print(s[:n//2]+\"x\"+s[n//2:])\r\n else:\r\n print(s[:n//2]+s[n//2]+s[n//2:])\r\nelif z==2:\r\n print(\"NA\")\r\nelse:\r\n print(s)", "s = input()\r\nfor i in range(26):\r\n for j in range(len(s) + 1) :\r\n ans = s[: j] + chr(97 + i) + s[j:]\r\n if ans == ans[::-1] :\r\n print(ans)\r\n exit()\r\nprint('NA')", "alphabet = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\ns = input()\r\na = len(s)\r\ncondition = False\r\nfor x in range(a + 1):\r\n for y in alphabet:\r\n temp = s[:x] + y + s[x:]\r\n if temp[::-1] == temp:\r\n condition = True\r\n print(temp)\r\n break\r\n if condition:\r\n break\r\nelse:\r\n print(\"NA\")", "def makePalindrome(st):\n if not st or not st.isalpha() or not st.islower():\n return \"NA\"\n chars = \"abcdefghijklmnopqrstuvwxyz\"\n for letter in chars:\n for pos in range(0, len(st) + 1):\n tmp = st[:pos] + letter + st[pos:]\n if isPalindrome(tmp):\n return tmp\n return \"NA\"\n\ndef isPalindrome(st):\n i, j = 0, len(st) - 1\n while i < j:\n if st[i] != st[j]:\n return False\n i += 1\n j -= 1\n return True\n\nst = input()\nprint(makePalindrome(st))", "#!/usr/bin/env python3\n\nfrom string import ascii_lowercase\nimport sys\n\n\ndef is_palindrome(x):\n return x == x[::-1]\n\n\ns = [c for c in input()]\n\nfor c in ascii_lowercase:\n for i in range(len(s) + 1):\n new_s = s[:i] + [c] + s[i:]\n if is_palindrome(new_s):\n print(\"\".join(new_s))\n sys.exit(0)\nprint(\"NA\")\n", "def main():\r\n s = input()\r\n for i in range(len(s)+1):\r\n for sym in range(ord('a'),ord('z')+1):\r\n sym = chr(sym)\r\n st = s[:i] + sym + s[i:]\r\n #print(st)\r\n if st == st[::-1]:\r\n print(st)\r\n return\r\n print('NA')\r\n\r\nmain()\r\n", "from string import ascii_lowercase\r\ns = list(input())\r\n\r\nfor i in range(len(s)+1):\r\n for char in ascii_lowercase :\r\n res = s[:i] +list(char)+ s[i:]\r\n \r\n if res == res[::-1] :\r\n print(\"\".join(res))\r\n quit()\r\nelse:\r\n print(\"NA\")", "s = input()\r\ndef check(a):\r\n\tn = len(a)\r\n\tfor i in range(n//2):\r\n\t\tif(a[i]!=a[n-i-1]):\r\n\t\t\treturn False\r\n\treturn True\r\nimport sys\r\nfor i in range(26):\r\n\tx = chr(ord('a')+i)\r\n\tfor i in range(len(s)+1):\r\n\t\tif(check(s[:i]+x+s[i:])):\r\n\t\t\tprint(s[:i]+x+s[i:])\r\n\t\t\tsys.exit(0)\r\nprint('NA')", "a=input()\r\nfor i in range(26):\r\n for j in range(len(a)+1):\r\n b=a[:j]+chr(97+i)+a[j:]\r\n if b==b[::-1]:print(b);exit()\r\nprint('NA')", "def ispal(s):\n\ti = 0\n\tj = len(s) - 1\n\twhile i < j:\n\t\tif s[i] != s[j]:\n\t\t\treturn False\n\t\ti += 1\n\t\tj -= 1\n\treturn True\n\nalpha = 'abcdefghijklmnopqrstuvwxyz'\nfound = 0\ns = input()\nfor i in range(0,len(s)+1):\n\tfor j in range(len(alpha)):\n\t\ttemp = s[:i] + alpha[j] + s[i:]\n\t\tif ispal(temp):\n\t\t\tfound = 1\n\t\t\tprint(temp)\n\t\t\tbreak\n\tif found: \n\t\tbreak\nif not found:\n\tprint(\"NA\")", "s = list(input())\r\nn = len(s)\r\ncandidates = [s + ['.']]\r\nres = 'NA'\r\n\r\nfor i in range(n):\r\n candidates.append(s[:i] + ['.'] + s[i:])\r\n\r\nfor s in candidates:\r\n legal = True\r\n for i in range((n + 1) // 2):\r\n if s[i] == s[-i-1] or s[i] == '.' or s[-i-1] == '.':\r\n continue\r\n legal = False\r\n if legal:\r\n res = s\r\n\r\nif res != 'NA':\r\n for i in range((n + 1) // 2):\r\n if res[i] == '.':\r\n res[i] = res[-i-1]\r\n elif res[-i-1] == '.':\r\n res[-i-1] = res[i]\r\n res = [s if s != '.' else 'a' for s in res]\r\n res = ''.join(res)\r\n\r\nprint(res)", "exec(\r\n\"\"\"\r\nimport string\r\ntemp = {0}\r\nfor i in range(len({0})+1):\r\n for char in string.ascii_lowercase:\r\n temp.insert(i,char)\r\n if temp == temp[::-1]:\r\n print(\"\".join(temp))\r\n quit()\r\n del temp[i]\r\nprint(\"NA\")\r\n\"\"\".format(list(input()))\r\n)", "def main():\n l = list(input())\n l.append(None)\n for i in range(len(l) - 1, -1, -1):\n for c in 'abcdefghijklmnopqrstuvwxyz':\n l[i] = c\n if l == l[::-1]:\n print(''.join(l))\n return\n l[i] = l[i - 1]\n print('NA')\n\n\nif __name__ == '__main__':\n main()", "st1 = input()\r\na = len(st1)+1\r\nfor i in range(26):\r\n for j in range(a):\r\n st2 = st1[:j] + chr(i+97) + st1[j:]\r\n if(st2==st2[::-1]):\r\n print(st2)\r\n exit()\r\nprint(\"NA\")", "def is_pal(s):\r\n for i in range(len(s) >> 1):\r\n if s[i] != s[len(s) - i - 1]:\r\n return False\r\n return True\r\n\r\ndef main():\r\n s = input()\r\n for offset in range(26):\r\n for i in range(len(s) + 1):\r\n s2 = s[:i] + chr(ord('a') + offset) + s[i:]\r\n if is_pal(s2):\r\n print(s2)\r\n return\r\n print(\"NA\")\r\n\r\nmain()\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nfrom string import ascii_lowercase\n\nans = None\nstring = input()\nfor ch in ascii_lowercase:\n for i in range(len(string)+1):\n s = string[:i] + ch + string[i:]\n if s == s[::-1]:\n ans = s\nif ans:\n print(ans)\nelse:\n print(\"NA\")\n\n\n\n", "# 505A\r\n\r\n__author__ = 'artyom'\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n s = list(read(0))\r\n n = len(s)\r\n m = n // 2\r\n for i in range(n + 1):\r\n p = s[:i] + [s[n - i - (i <= m)]] + s[i:n]\r\n if p == p[::-1]:\r\n return p\r\n return 'NA'\r\n\r\n\r\n# HELPERS\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return int(inputs)\r\n if mode == 3: return list(map(int, inputs.split()))\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, list): s = ''.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\n\r\nwrite(main())", "n=list(input())\n\nfor i in 'abcdefghijklmnopqrstuvwxyz':\n for j in range(0,len(n)+1):\n w=n[:]\n w.insert(j,i)\n if w==w[::-1]:\n print(''.join(w))\n \n quit()\n \nprint('NA') \n\n \n \n", "s=input()\r\ndef p(s):\r\n if s==s[::-1]:\r\n return True\r\n return False\r\nn=len(s)\r\nl=[]\r\ns1=\"ab\"\r\ns2=\"ab\"\r\nfor i in range(n//2):\r\n if s[i]==s[n-1-i]:\r\n pass\r\n else:\r\n s1=s[:i]+s[n-1-i]+s[i::]\r\n s2=s[:n-i]+s[i]+s[n-i::]\r\n break\r\nif p(s1)==True: \r\n print(s1)\r\nelif p(s2)==(True):\r\n print(s2)\r\nelif p(s)==True:\r\n print(s[:n//2]+s[n//2]+s[n//2:])\r\nelse:\r\n print(\"NA\")", "s=input()\r\nl=len(s)\r\nx=\"\"\r\nflag=0\r\nfor i in range(0,l+1):\r\n for j in range(97,123):\r\n z=s[0:i]+chr(j)+s[i:]\r\n y=z[::-1]\r\n\r\n if z==y:\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(z)\r\nelse:\r\n print(\"NA\")\r\n", "\r\nst = list(input())\r\n\r\n\r\nfor i in range(len(st) + 1):\r\n\tfor j in range(26):\r\n\t\tsti = st.copy()\r\n\r\n\t\tsti.insert(i, chr(97 + j))\r\n\t\r\n\t\tif sti == sti[::-1]:\r\n\t\t\tprint(''.join(sti))\r\n\t\t\texit()\r\n\r\nprint('NA')\r\n\r\n" ]